./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-90.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e7bb482b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_366ce1ea-eedd-4ea0-b61b-6e2972955b45/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_366ce1ea-eedd-4ea0-b61b-6e2972955b45/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_366ce1ea-eedd-4ea0-b61b-6e2972955b45/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_366ce1ea-eedd-4ea0-b61b-6e2972955b45/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-90.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_366ce1ea-eedd-4ea0-b61b-6e2972955b45/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_366ce1ea-eedd-4ea0-b61b-6e2972955b45/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5e76bf897418c531679e53fa28b7c04d453b1c5b37fbed71b943af641f77aed6 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:33:12,302 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:33:12,375 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_366ce1ea-eedd-4ea0-b61b-6e2972955b45/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-06 22:33:12,381 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:33:12,382 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:33:12,424 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:33:12,425 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:33:12,426 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:33:12,427 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:33:12,427 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:33:12,429 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:33:12,429 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:33:12,430 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:33:12,430 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:33:12,431 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 22:33:12,432 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:33:12,432 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:33:12,433 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:33:12,433 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:33:12,434 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 22:33:12,434 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:33:12,435 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 22:33:12,436 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:33:12,436 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 22:33:12,437 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:33:12,437 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:33:12,438 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:33:12,438 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:33:12,439 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:33:12,439 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:33:12,440 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:33:12,440 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 22:33:12,441 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:33:12,441 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:33:12,442 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:33:12,442 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 22:33:12,442 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:33:12,443 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:33:12,454 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:33:12,455 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_366ce1ea-eedd-4ea0-b61b-6e2972955b45/bin/uautomizer-verify-WvqO1wxjHP/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_366ce1ea-eedd-4ea0-b61b-6e2972955b45/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5e76bf897418c531679e53fa28b7c04d453b1c5b37fbed71b943af641f77aed6 [2023-11-06 22:33:12,736 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:33:12,801 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:33:12,804 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:33:12,806 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:33:12,818 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:33:12,820 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_366ce1ea-eedd-4ea0-b61b-6e2972955b45/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-90.i [2023-11-06 22:33:16,017 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:33:16,292 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:33:16,293 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_366ce1ea-eedd-4ea0-b61b-6e2972955b45/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-90.i [2023-11-06 22:33:16,305 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_366ce1ea-eedd-4ea0-b61b-6e2972955b45/bin/uautomizer-verify-WvqO1wxjHP/data/fcf01fe92/6f381c6bd0f54bdeb895ab80374e96f7/FLAGa0a17f0e8 [2023-11-06 22:33:16,325 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_366ce1ea-eedd-4ea0-b61b-6e2972955b45/bin/uautomizer-verify-WvqO1wxjHP/data/fcf01fe92/6f381c6bd0f54bdeb895ab80374e96f7 [2023-11-06 22:33:16,333 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:33:16,335 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:33:16,342 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:33:16,342 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:33:16,348 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:33:16,352 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:33:16" (1/1) ... [2023-11-06 22:33:16,354 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@713b7213 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:33:16, skipping insertion in model container [2023-11-06 22:33:16,354 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:33:16" (1/1) ... [2023-11-06 22:33:16,399 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:33:16,611 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_366ce1ea-eedd-4ea0-b61b-6e2972955b45/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-90.i[915,928] [2023-11-06 22:33:16,650 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:33:16,665 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:33:16,678 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_366ce1ea-eedd-4ea0-b61b-6e2972955b45/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-90.i[915,928] [2023-11-06 22:33:16,699 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:33:16,718 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:33:16,718 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:33:16 WrapperNode [2023-11-06 22:33:16,719 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:33:16,721 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:33:16,721 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:33:16,721 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:33:16,730 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:33:16" (1/1) ... [2023-11-06 22:33:16,753 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:33:16" (1/1) ... [2023-11-06 22:33:16,797 INFO L138 Inliner]: procedures = 26, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 134 [2023-11-06 22:33:16,803 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:33:16,804 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:33:16,805 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:33:16,805 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:33:16,816 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:33:16" (1/1) ... [2023-11-06 22:33:16,817 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:33:16" (1/1) ... [2023-11-06 22:33:16,820 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:33:16" (1/1) ... [2023-11-06 22:33:16,823 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:33:16" (1/1) ... [2023-11-06 22:33:16,836 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:33:16" (1/1) ... [2023-11-06 22:33:16,848 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:33:16" (1/1) ... [2023-11-06 22:33:16,853 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:33:16" (1/1) ... [2023-11-06 22:33:16,854 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:33:16" (1/1) ... [2023-11-06 22:33:16,857 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:33:16,865 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:33:16,866 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:33:16,866 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:33:16,867 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:33:16" (1/1) ... [2023-11-06 22:33:16,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:33:16,889 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_366ce1ea-eedd-4ea0-b61b-6e2972955b45/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:33:16,902 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_366ce1ea-eedd-4ea0-b61b-6e2972955b45/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:33:16,905 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_366ce1ea-eedd-4ea0-b61b-6e2972955b45/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:33:16,938 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:33:16,938 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-06 22:33:16,939 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-06 22:33:16,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 22:33:16,939 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:33:16,939 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:33:17,015 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:33:17,017 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:33:17,344 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:33:17,352 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:33:17,352 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-06 22:33:17,354 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:33:17 BoogieIcfgContainer [2023-11-06 22:33:17,354 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:33:17,389 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:33:17,389 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:33:17,393 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:33:17,393 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:33:16" (1/3) ... [2023-11-06 22:33:17,394 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ab74bd4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:33:17, skipping insertion in model container [2023-11-06 22:33:17,394 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:33:16" (2/3) ... [2023-11-06 22:33:17,394 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ab74bd4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:33:17, skipping insertion in model container [2023-11-06 22:33:17,394 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:33:17" (3/3) ... [2023-11-06 22:33:17,396 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-90.i [2023-11-06 22:33:17,417 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:33:17,439 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 22:33:17,500 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:33:17,507 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1adda21c, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:33:17,508 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-06 22:33:17,512 INFO L276 IsEmpty]: Start isEmpty. Operand has 60 states, 40 states have (on average 1.375) internal successors, (55), 41 states have internal predecessors, (55), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-11-06 22:33:17,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-11-06 22:33:17,526 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:33:17,527 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:33:17,528 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:33:17,533 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:33:17,534 INFO L85 PathProgramCache]: Analyzing trace with hash 968669158, now seen corresponding path program 1 times [2023-11-06 22:33:17,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:33:17,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124882056] [2023-11-06 22:33:17,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:33:17,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:33:17,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:33:17,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:33:17,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:33:17,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:33:17,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:33:17,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:33:17,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:33:17,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-06 22:33:17,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:33:17,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 22:33:17,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:33:17,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:33:17,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:33:17,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:33:17,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:33:17,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-06 22:33:17,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:33:17,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-06 22:33:17,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:33:17,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-06 22:33:17,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:33:17,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-06 22:33:17,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:33:17,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:33:17,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:33:17,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:33:17,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:33:17,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-06 22:33:17,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:33:17,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-06 22:33:17,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:33:17,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-06 22:33:17,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:33:17,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-06 22:33:17,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:33:17,931 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-11-06 22:33:17,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:33:17,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124882056] [2023-11-06 22:33:17,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124882056] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:33:17,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:33:17,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:33:17,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306703574] [2023-11-06 22:33:17,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:33:17,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 22:33:17,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:33:17,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 22:33:17,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:33:17,982 INFO L87 Difference]: Start difference. First operand has 60 states, 40 states have (on average 1.375) internal successors, (55), 41 states have internal predecessors, (55), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2023-11-06 22:33:18,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:33:18,032 INFO L93 Difference]: Finished difference Result 113 states and 189 transitions. [2023-11-06 22:33:18,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 22:33:18,035 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 109 [2023-11-06 22:33:18,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:33:18,048 INFO L225 Difference]: With dead ends: 113 [2023-11-06 22:33:18,048 INFO L226 Difference]: Without dead ends: 56 [2023-11-06 22:33:18,053 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:33:18,061 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:33:18,062 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:33:18,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2023-11-06 22:33:18,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2023-11-06 22:33:18,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 37 states have internal predecessors, (48), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-11-06 22:33:18,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 82 transitions. [2023-11-06 22:33:18,138 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 82 transitions. Word has length 109 [2023-11-06 22:33:18,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:33:18,138 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 82 transitions. [2023-11-06 22:33:18,139 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2023-11-06 22:33:18,139 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 82 transitions. [2023-11-06 22:33:18,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-11-06 22:33:18,145 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:33:18,146 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:33:18,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 22:33:18,147 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:33:18,147 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:33:18,148 INFO L85 PathProgramCache]: Analyzing trace with hash 535128868, now seen corresponding path program 1 times [2023-11-06 22:33:18,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:33:18,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761998397] [2023-11-06 22:33:18,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:33:18,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:33:18,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:33:18,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:33:18,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:33:18,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:33:18,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:33:18,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:33:18,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:33:18,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-06 22:33:18,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:33:18,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 22:33:18,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:33:18,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:33:18,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:33:18,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:33:18,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:33:18,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-06 22:33:18,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:33:19,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-06 22:33:19,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:33:19,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-06 22:33:19,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:33:19,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-06 22:33:19,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:33:19,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:33:19,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:33:19,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:33:19,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:33:19,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-06 22:33:19,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:33:19,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-06 22:33:19,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:33:19,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-06 22:33:19,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:33:19,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-06 22:33:19,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:33:19,085 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-11-06 22:33:19,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:33:19,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761998397] [2023-11-06 22:33:19,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761998397] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:33:19,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:33:19,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:33:19,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526294144] [2023-11-06 22:33:19,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:33:19,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:33:19,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:33:19,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:33:19,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:33:19,103 INFO L87 Difference]: Start difference. First operand 56 states and 82 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-11-06 22:33:19,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:33:19,654 INFO L93 Difference]: Finished difference Result 193 states and 286 transitions. [2023-11-06 22:33:19,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:33:19,655 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 109 [2023-11-06 22:33:19,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:33:19,664 INFO L225 Difference]: With dead ends: 193 [2023-11-06 22:33:19,664 INFO L226 Difference]: Without dead ends: 140 [2023-11-06 22:33:19,672 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:33:19,676 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 137 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 22:33:19,676 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 354 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 22:33:19,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2023-11-06 22:33:19,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 64. [2023-11-06 22:33:19,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 45 states have (on average 1.3333333333333333) internal successors, (60), 45 states have internal predecessors, (60), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-11-06 22:33:19,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 94 transitions. [2023-11-06 22:33:19,711 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 94 transitions. Word has length 109 [2023-11-06 22:33:19,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:33:19,715 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 94 transitions. [2023-11-06 22:33:19,715 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-11-06 22:33:19,715 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 94 transitions. [2023-11-06 22:33:19,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-11-06 22:33:19,729 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:33:19,729 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:33:19,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 22:33:19,729 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:33:19,730 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:33:19,730 INFO L85 PathProgramCache]: Analyzing trace with hash 822160228, now seen corresponding path program 1 times [2023-11-06 22:33:19,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:33:19,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512754494] [2023-11-06 22:33:19,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:33:19,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:33:19,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:33:19,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:33:19,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:33:19,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:33:19,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:33:19,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:33:19,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:33:19,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-06 22:33:19,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:33:19,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 22:33:19,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:33:19,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:33:19,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:33:19,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:33:19,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:33:19,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-06 22:33:19,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:33:19,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-06 22:33:19,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:33:19,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-06 22:33:19,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:33:19,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-06 22:33:19,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:33:19,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:33:19,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:33:20,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:33:20,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:33:20,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-06 22:33:20,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:33:20,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-06 22:33:20,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:33:20,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-06 22:33:20,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:33:20,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-06 22:33:20,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:33:20,031 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-11-06 22:33:20,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:33:20,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512754494] [2023-11-06 22:33:20,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512754494] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:33:20,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:33:20,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:33:20,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290962911] [2023-11-06 22:33:20,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:33:20,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:33:20,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:33:20,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:33:20,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:33:20,037 INFO L87 Difference]: Start difference. First operand 64 states and 94 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-11-06 22:33:20,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:33:20,090 INFO L93 Difference]: Finished difference Result 169 states and 248 transitions. [2023-11-06 22:33:20,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:33:20,091 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 109 [2023-11-06 22:33:20,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:33:20,093 INFO L225 Difference]: With dead ends: 169 [2023-11-06 22:33:20,093 INFO L226 Difference]: Without dead ends: 108 [2023-11-06 22:33:20,094 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:33:20,095 INFO L413 NwaCegarLoop]: 151 mSDtfsCounter, 79 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:33:20,096 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 352 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:33:20,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2023-11-06 22:33:20,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 57. [2023-11-06 22:33:20,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 38 states have (on average 1.236842105263158) internal successors, (47), 38 states have internal predecessors, (47), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-11-06 22:33:20,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 81 transitions. [2023-11-06 22:33:20,108 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 81 transitions. Word has length 109 [2023-11-06 22:33:20,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:33:20,108 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 81 transitions. [2023-11-06 22:33:20,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-11-06 22:33:20,109 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 81 transitions. [2023-11-06 22:33:20,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2023-11-06 22:33:20,111 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:33:20,111 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:33:20,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 22:33:20,112 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:33:20,112 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:33:20,112 INFO L85 PathProgramCache]: Analyzing trace with hash -252447729, now seen corresponding path program 1 times [2023-11-06 22:33:20,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:33:20,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735907981] [2023-11-06 22:33:20,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:33:20,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:33:20,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:33:20,235 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:33:20,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:33:20,430 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:33:20,431 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 22:33:20,432 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-06 22:33:20,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 22:33:20,443 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-11-06 22:33:20,448 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 22:33:20,533 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:33:20 BoogieIcfgContainer [2023-11-06 22:33:20,534 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 22:33:20,534 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 22:33:20,534 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 22:33:20,535 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 22:33:20,535 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:33:17" (3/4) ... [2023-11-06 22:33:20,537 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-06 22:33:20,538 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 22:33:20,539 INFO L158 Benchmark]: Toolchain (without parser) took 4203.98ms. Allocated memory was 180.4MB in the beginning and 218.1MB in the end (delta: 37.7MB). Free memory was 150.0MB in the beginning and 173.8MB in the end (delta: -23.8MB). Peak memory consumption was 12.3MB. Max. memory is 16.1GB. [2023-11-06 22:33:20,540 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 130.0MB. Free memory is still 103.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:33:20,540 INFO L158 Benchmark]: CACSL2BoogieTranslator took 377.83ms. Allocated memory is still 180.4MB. Free memory was 149.8MB in the beginning and 141.1MB in the end (delta: 8.7MB). Peak memory consumption was 10.8MB. Max. memory is 16.1GB. [2023-11-06 22:33:20,541 INFO L158 Benchmark]: Boogie Procedure Inliner took 82.68ms. Allocated memory is still 180.4MB. Free memory was 141.1MB in the beginning and 139.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:33:20,541 INFO L158 Benchmark]: Boogie Preprocessor took 60.03ms. Allocated memory is still 180.4MB. Free memory was 139.1MB in the beginning and 137.8MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:33:20,542 INFO L158 Benchmark]: RCFGBuilder took 489.43ms. Allocated memory is still 180.4MB. Free memory was 137.8MB in the beginning and 121.8MB in the end (delta: 16.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-06 22:33:20,542 INFO L158 Benchmark]: TraceAbstraction took 3144.94ms. Allocated memory was 180.4MB in the beginning and 218.1MB in the end (delta: 37.7MB). Free memory was 148.3MB in the beginning and 173.8MB in the end (delta: -25.6MB). Peak memory consumption was 119.2MB. Max. memory is 16.1GB. [2023-11-06 22:33:20,543 INFO L158 Benchmark]: Witness Printer took 4.37ms. Allocated memory is still 218.1MB. Free memory is still 173.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:33:20,545 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.33ms. Allocated memory is still 130.0MB. Free memory is still 103.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 377.83ms. Allocated memory is still 180.4MB. Free memory was 149.8MB in the beginning and 141.1MB in the end (delta: 8.7MB). Peak memory consumption was 10.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 82.68ms. Allocated memory is still 180.4MB. Free memory was 141.1MB in the beginning and 139.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 60.03ms. Allocated memory is still 180.4MB. Free memory was 139.1MB in the beginning and 137.8MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 489.43ms. Allocated memory is still 180.4MB. Free memory was 137.8MB in the beginning and 121.8MB in the end (delta: 16.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 3144.94ms. Allocated memory was 180.4MB in the beginning and 218.1MB in the end (delta: 37.7MB). Free memory was 148.3MB in the beginning and 173.8MB in the end (delta: -25.6MB). Peak memory consumption was 119.2MB. Max. memory is 16.1GB. * Witness Printer took 4.37ms. Allocated memory is still 218.1MB. Free memory is still 173.8MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 97. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 25; [L23] unsigned long int var_1_6 = 2; [L24] unsigned long int var_1_7 = 2762957886; [L25] unsigned long int var_1_8 = 2; [L26] unsigned long int var_1_9 = 1000000000; [L27] unsigned long int var_1_10 = 100; [L28] signed char var_1_11 = 4; [L29] signed char var_1_12 = 8; [L30] signed char var_1_13 = 10; [L31] signed char var_1_14 = 8; [L32] unsigned char var_1_15 = 1; [L33] unsigned char var_1_16 = 0; [L34] double var_1_17 = 32.4; [L35] double var_1_18 = 15.5; [L36] unsigned long int last_1_var_1_6 = 2; VAL [isInitial=0, last_1_var_1_6=2, var_1_10=100, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=2762957886, var_1_8=2, var_1_9=1000000000] [L101] isInitial = 1 [L102] FCALL initially() [L103] COND TRUE 1 [L104] CALL updateLastVariables() [L94] last_1_var_1_6 = var_1_6 VAL [isInitial=1, last_1_var_1_6=2, var_1_10=100, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=2762957886, var_1_8=2, var_1_9=1000000000] [L104] RET updateLastVariables() [L105] CALL updateVariables() [L66] var_1_7 = __VERIFIER_nondet_ulong() [L67] CALL assume_abort_if_not(var_1_7 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=100, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=4294967295, var_1_8=2, var_1_9=1000000000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_6=2, var_1_10=100, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=4294967295, var_1_8=2, var_1_9=1000000000] [L67] RET assume_abort_if_not(var_1_7 >= 2147483647) VAL [isInitial=1, last_1_var_1_6=2, var_1_10=100, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=4294967295, var_1_8=2, var_1_9=1000000000] [L68] CALL assume_abort_if_not(var_1_7 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=100, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=4294967295, var_1_8=2, var_1_9=1000000000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_6=2, var_1_10=100, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=4294967295, var_1_8=2, var_1_9=1000000000] [L68] RET assume_abort_if_not(var_1_7 <= 4294967295) VAL [isInitial=1, last_1_var_1_6=2, var_1_10=100, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=4294967295, var_1_8=2, var_1_9=1000000000] [L69] var_1_8 = __VERIFIER_nondet_ulong() [L70] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=100, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=4294967295, var_1_8=2147483647, var_1_9=1000000000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_6=2, var_1_10=100, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=4294967295, var_1_8=2147483647, var_1_9=1000000000] [L70] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_6=2, var_1_10=100, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=4294967295, var_1_8=2147483647, var_1_9=1000000000] [L71] CALL assume_abort_if_not(var_1_8 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=100, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=4294967295, var_1_8=2147483647, var_1_9=1000000000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_6=2, var_1_10=100, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=4294967295, var_1_8=2147483647, var_1_9=1000000000] [L71] RET assume_abort_if_not(var_1_8 <= 2147483647) VAL [isInitial=1, last_1_var_1_6=2, var_1_10=100, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=4294967295, var_1_8=2147483647, var_1_9=1000000000] [L72] var_1_9 = __VERIFIER_nondet_ulong() [L73] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=100, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=4294967295, var_1_8=2147483647, var_1_9=2762957887] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_6=2, var_1_10=100, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=4294967295, var_1_8=2147483647, var_1_9=2762957887] [L73] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_6=2, var_1_10=100, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=4294967295, var_1_8=2147483647, var_1_9=2762957887] [L74] CALL assume_abort_if_not(var_1_9 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=100, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=4294967295, var_1_8=2147483647, var_1_9=2762957887] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_6=2, var_1_10=100, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=4294967295, var_1_8=2147483647, var_1_9=2762957887] [L74] RET assume_abort_if_not(var_1_9 <= 4294967295) VAL [isInitial=1, last_1_var_1_6=2, var_1_10=100, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=4294967295, var_1_8=2147483647, var_1_9=2762957887] [L75] var_1_10 = __VERIFIER_nondet_ulong() [L76] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=4, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=4294967295, var_1_8=2147483647, var_1_9=2762957887] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_6=2, var_1_10=4, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=4294967295, var_1_8=2147483647, var_1_9=2762957887] [L76] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_6=2, var_1_10=4, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=4294967295, var_1_8=2147483647, var_1_9=2762957887] [L77] CALL assume_abort_if_not(var_1_10 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=4, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=4294967295, var_1_8=2147483647, var_1_9=2762957887] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_6=2, var_1_10=4, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=4294967295, var_1_8=2147483647, var_1_9=2762957887] [L77] RET assume_abort_if_not(var_1_10 <= 4294967294) VAL [isInitial=1, last_1_var_1_6=2, var_1_10=4, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=4294967295, var_1_8=2147483647, var_1_9=2762957887] [L78] var_1_12 = __VERIFIER_nondet_char() [L79] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=4, var_1_11=4, var_1_12=16, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=4294967295, var_1_8=2147483647, var_1_9=2762957887] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_6=2, var_1_10=4, var_1_11=4, var_1_12=16, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=4294967295, var_1_8=2147483647, var_1_9=2762957887] [L79] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_6=2, var_1_10=4, var_1_11=4, var_1_12=16, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=4294967295, var_1_8=2147483647, var_1_9=2762957887] [L80] CALL assume_abort_if_not(var_1_12 <= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=4, var_1_11=4, var_1_12=16, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=4294967295, var_1_8=2147483647, var_1_9=2762957887] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_6=2, var_1_10=4, var_1_11=4, var_1_12=16, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=4294967295, var_1_8=2147483647, var_1_9=2762957887] [L80] RET assume_abort_if_not(var_1_12 <= 32) VAL [isInitial=1, last_1_var_1_6=2, var_1_10=4, var_1_11=4, var_1_12=16, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=4294967295, var_1_8=2147483647, var_1_9=2762957887] [L81] var_1_13 = __VERIFIER_nondet_char() [L82] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=4, var_1_11=4, var_1_12=16, var_1_13=31, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=4294967295, var_1_8=2147483647, var_1_9=2762957887] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_6=2, var_1_10=4, var_1_11=4, var_1_12=16, var_1_13=31, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=4294967295, var_1_8=2147483647, var_1_9=2762957887] [L82] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_6=2, var_1_10=4, var_1_11=4, var_1_12=16, var_1_13=31, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=4294967295, var_1_8=2147483647, var_1_9=2762957887] [L83] CALL assume_abort_if_not(var_1_13 <= 31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=4, var_1_11=4, var_1_12=16, var_1_13=31, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=4294967295, var_1_8=2147483647, var_1_9=2762957887] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_6=2, var_1_10=4, var_1_11=4, var_1_12=16, var_1_13=31, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=4294967295, var_1_8=2147483647, var_1_9=2762957887] [L83] RET assume_abort_if_not(var_1_13 <= 31) VAL [isInitial=1, last_1_var_1_6=2, var_1_10=4, var_1_11=4, var_1_12=16, var_1_13=31, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=4294967295, var_1_8=2147483647, var_1_9=2762957887] [L84] var_1_14 = __VERIFIER_nondet_char() [L85] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=4, var_1_11=4, var_1_12=16, var_1_13=31, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=4294967295, var_1_8=2147483647, var_1_9=2762957887] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_6=2, var_1_10=4, var_1_11=4, var_1_12=16, var_1_13=31, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=4294967295, var_1_8=2147483647, var_1_9=2762957887] [L85] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_6=2, var_1_10=4, var_1_11=4, var_1_12=16, var_1_13=31, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=4294967295, var_1_8=2147483647, var_1_9=2762957887] [L86] CALL assume_abort_if_not(var_1_14 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=4, var_1_11=4, var_1_12=16, var_1_13=31, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=4294967295, var_1_8=2147483647, var_1_9=2762957887] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_6=2, var_1_10=4, var_1_11=4, var_1_12=16, var_1_13=31, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=4294967295, var_1_8=2147483647, var_1_9=2762957887] [L86] RET assume_abort_if_not(var_1_14 <= 63) VAL [isInitial=1, last_1_var_1_6=2, var_1_10=4, var_1_11=4, var_1_12=16, var_1_13=31, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=4294967295, var_1_8=2147483647, var_1_9=2762957887] [L87] var_1_16 = __VERIFIER_nondet_uchar() [L88] CALL assume_abort_if_not(var_1_16 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=4, var_1_11=4, var_1_12=16, var_1_13=31, var_1_14=5, var_1_15=1, var_1_16=1, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=4294967295, var_1_8=2147483647, var_1_9=2762957887] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_6=2, var_1_10=4, var_1_11=4, var_1_12=16, var_1_13=31, var_1_14=5, var_1_15=1, var_1_16=1, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=4294967295, var_1_8=2147483647, var_1_9=2762957887] [L88] RET assume_abort_if_not(var_1_16 >= 1) VAL [isInitial=1, last_1_var_1_6=2, var_1_10=4, var_1_11=4, var_1_12=16, var_1_13=31, var_1_14=5, var_1_15=1, var_1_16=1, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=4294967295, var_1_8=2147483647, var_1_9=2762957887] [L89] CALL assume_abort_if_not(var_1_16 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=4, var_1_11=4, var_1_12=16, var_1_13=31, var_1_14=5, var_1_15=1, var_1_16=1, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=4294967295, var_1_8=2147483647, var_1_9=2762957887] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_6=2, var_1_10=4, var_1_11=4, var_1_12=16, var_1_13=31, var_1_14=5, var_1_15=1, var_1_16=1, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=4294967295, var_1_8=2147483647, var_1_9=2762957887] [L89] RET assume_abort_if_not(var_1_16 <= 1) VAL [isInitial=1, last_1_var_1_6=2, var_1_10=4, var_1_11=4, var_1_12=16, var_1_13=31, var_1_14=5, var_1_15=1, var_1_16=1, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=4294967295, var_1_8=2147483647, var_1_9=2762957887] [L90] var_1_18 = __VERIFIER_nondet_double() [L91] CALL assume_abort_if_not((var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=4, var_1_11=4, var_1_12=16, var_1_13=31, var_1_14=5, var_1_15=1, var_1_16=1, var_1_17=162/5, var_1_18=2762957892, var_1_1=25, var_1_6=2, var_1_7=4294967295, var_1_8=2147483647, var_1_9=2762957887] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_6=2, var_1_10=4, var_1_11=4, var_1_12=16, var_1_13=31, var_1_14=5, var_1_15=1, var_1_16=1, var_1_17=162/5, var_1_18=2762957892, var_1_1=25, var_1_6=2, var_1_7=4294967295, var_1_8=2147483647, var_1_9=2762957887] [L91] RET assume_abort_if_not((var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_6=2, var_1_10=4, var_1_11=4, var_1_12=16, var_1_13=31, var_1_14=5, var_1_15=1, var_1_16=1, var_1_17=162/5, var_1_18=2762957892, var_1_1=25, var_1_6=2, var_1_7=4294967295, var_1_8=2147483647, var_1_9=2762957887] [L105] RET updateVariables() [L106] CALL step() [L40] var_1_15 = var_1_16 [L41] var_1_17 = var_1_18 VAL [isInitial=1, last_1_var_1_6=2, var_1_10=4, var_1_11=4, var_1_12=16, var_1_13=31, var_1_14=5, var_1_15=1, var_1_16=1, var_1_17=2762957892, var_1_18=2762957892, var_1_1=25, var_1_6=2, var_1_7=4294967295, var_1_8=2147483647, var_1_9=2762957887] [L42] COND TRUE \read(var_1_15) [L43] var_1_11 = (((var_1_12 + var_1_13) + var_1_14) - 50) VAL [isInitial=1, last_1_var_1_6=2, var_1_10=4, var_1_11=2, var_1_12=16, var_1_13=31, var_1_14=5, var_1_15=1, var_1_16=1, var_1_17=2762957892, var_1_18=2762957892, var_1_1=25, var_1_6=2, var_1_7=4294967295, var_1_8=2147483647, var_1_9=2762957887] [L45] COND TRUE \read(var_1_15) [L46] var_1_1 = (((((var_1_11 + var_1_11)) < (var_1_11)) ? ((var_1_11 + var_1_11)) : (var_1_11))) VAL [isInitial=1, last_1_var_1_6=2, var_1_10=4, var_1_11=2, var_1_12=16, var_1_13=31, var_1_14=5, var_1_15=1, var_1_16=1, var_1_17=2762957892, var_1_18=2762957892, var_1_1=2, var_1_6=2, var_1_7=4294967295, var_1_8=2147483647, var_1_9=2762957887] [L48] signed long int stepLocal_2 = (((var_1_11) < (var_1_11)) ? (var_1_11) : (var_1_11)); [L49] signed long int stepLocal_1 = (((var_1_11) > (var_1_11)) ? (var_1_11) : (var_1_11)); [L50] unsigned long int stepLocal_0 = var_1_7 - var_1_8; VAL [isInitial=1, last_1_var_1_6=2, stepLocal_0=2147483648, stepLocal_1=2, stepLocal_2=2, var_1_10=4, var_1_11=2, var_1_12=16, var_1_13=31, var_1_14=5, var_1_15=1, var_1_16=1, var_1_17=2762957892, var_1_18=2762957892, var_1_1=2, var_1_6=2, var_1_7=4294967295, var_1_8=2147483647, var_1_9=2762957887] [L51] COND FALSE !(last_1_var_1_6 != stepLocal_2) [L62] var_1_6 = var_1_8 VAL [isInitial=1, last_1_var_1_6=2, stepLocal_0=2147483648, stepLocal_1=2, stepLocal_2=2, var_1_10=4, var_1_11=2, var_1_12=16, var_1_13=31, var_1_14=5, var_1_15=1, var_1_16=1, var_1_17=2762957892, var_1_18=2762957892, var_1_1=2, var_1_6=2147483647, var_1_7=4294967295, var_1_8=2147483647, var_1_9=2762957887] [L106] RET step() [L107] CALL, EXPR property() [L97] EXPR (var_1_15 ? (var_1_1 == ((signed short int) (((((var_1_11 + var_1_11)) < (var_1_11)) ? ((var_1_11 + var_1_11)) : (var_1_11))))) : 1) && ((last_1_var_1_6 != ((((var_1_11) < (var_1_11)) ? (var_1_11) : (var_1_11)))) ? (((var_1_7 - var_1_8) >= var_1_9) ? ((((((var_1_11) > (var_1_11)) ? (var_1_11) : (var_1_11))) < (var_1_8 >> var_1_9)) ? (var_1_6 == ((unsigned long int) var_1_8)) : (var_1_6 == ((unsigned long int) var_1_10))) : (var_1_6 == ((unsigned long int) var_1_10))) : (var_1_6 == ((unsigned long int) var_1_8))) VAL [(var_1_15 ? (var_1_1 == ((signed short int) (((((var_1_11 + var_1_11)) < (var_1_11)) ? ((var_1_11 + var_1_11)) : (var_1_11))))) : 1) && ((last_1_var_1_6 != ((((var_1_11) < (var_1_11)) ? (var_1_11) : (var_1_11)))) ? (((var_1_7 - var_1_8) >= var_1_9) ? ((((((var_1_11) > (var_1_11)) ? (var_1_11) : (var_1_11))) < (var_1_8 >> var_1_9)) ? (var_1_6 == ((unsigned long int) var_1_8)) : (var_1_6 == ((unsigned long int) var_1_10))) : (var_1_6 == ((unsigned long int) var_1_10))) : (var_1_6 == ((unsigned long int) var_1_8)))=1, isInitial=1, last_1_var_1_6=2, var_1_10=4, var_1_11=2, var_1_12=16, var_1_13=31, var_1_14=5, var_1_15=1, var_1_16=1, var_1_17=2762957892, var_1_18=2762957892, var_1_1=2, var_1_6=2147483647, var_1_7=4294967295, var_1_8=2147483647, var_1_9=2762957887] [L97] EXPR (last_1_var_1_6 != ((((var_1_11) < (var_1_11)) ? (var_1_11) : (var_1_11)))) ? (((var_1_7 - var_1_8) >= var_1_9) ? ((((((var_1_11) > (var_1_11)) ? (var_1_11) : (var_1_11))) < (var_1_8 >> var_1_9)) ? (var_1_6 == ((unsigned long int) var_1_8)) : (var_1_6 == ((unsigned long int) var_1_10))) : (var_1_6 == ((unsigned long int) var_1_10))) : (var_1_6 == ((unsigned long int) var_1_8)) VAL [(last_1_var_1_6 != ((((var_1_11) < (var_1_11)) ? (var_1_11) : (var_1_11)))) ? (((var_1_7 - var_1_8) >= var_1_9) ? ((((((var_1_11) > (var_1_11)) ? (var_1_11) : (var_1_11))) < (var_1_8 >> var_1_9)) ? (var_1_6 == ((unsigned long int) var_1_8)) : (var_1_6 == ((unsigned long int) var_1_10))) : (var_1_6 == ((unsigned long int) var_1_10))) : (var_1_6 == ((unsigned long int) var_1_8))=1, (var_1_15 ? (var_1_1 == ((signed short int) (((((var_1_11 + var_1_11)) < (var_1_11)) ? ((var_1_11 + var_1_11)) : (var_1_11))))) : 1) && ((last_1_var_1_6 != ((((var_1_11) < (var_1_11)) ? (var_1_11) : (var_1_11)))) ? (((var_1_7 - var_1_8) >= var_1_9) ? ((((((var_1_11) > (var_1_11)) ? (var_1_11) : (var_1_11))) < (var_1_8 >> var_1_9)) ? (var_1_6 == ((unsigned long int) var_1_8)) : (var_1_6 == ((unsigned long int) var_1_10))) : (var_1_6 == ((unsigned long int) var_1_10))) : (var_1_6 == ((unsigned long int) var_1_8)))=1, isInitial=1, last_1_var_1_6=2, var_1_10=4, var_1_11=2, var_1_12=16, var_1_13=31, var_1_14=5, var_1_15=1, var_1_16=1, var_1_17=2762957892, var_1_18=2762957892, var_1_1=2, var_1_6=2147483647, var_1_7=4294967295, var_1_8=2147483647, var_1_9=2762957887] [L97] EXPR (var_1_15 ? (var_1_1 == ((signed short int) (((((var_1_11 + var_1_11)) < (var_1_11)) ? ((var_1_11 + var_1_11)) : (var_1_11))))) : 1) && ((last_1_var_1_6 != ((((var_1_11) < (var_1_11)) ? (var_1_11) : (var_1_11)))) ? (((var_1_7 - var_1_8) >= var_1_9) ? ((((((var_1_11) > (var_1_11)) ? (var_1_11) : (var_1_11))) < (var_1_8 >> var_1_9)) ? (var_1_6 == ((unsigned long int) var_1_8)) : (var_1_6 == ((unsigned long int) var_1_10))) : (var_1_6 == ((unsigned long int) var_1_10))) : (var_1_6 == ((unsigned long int) var_1_8))) VAL [(last_1_var_1_6 != ((((var_1_11) < (var_1_11)) ? (var_1_11) : (var_1_11)))) ? (((var_1_7 - var_1_8) >= var_1_9) ? ((((((var_1_11) > (var_1_11)) ? (var_1_11) : (var_1_11))) < (var_1_8 >> var_1_9)) ? (var_1_6 == ((unsigned long int) var_1_8)) : (var_1_6 == ((unsigned long int) var_1_10))) : (var_1_6 == ((unsigned long int) var_1_10))) : (var_1_6 == ((unsigned long int) var_1_8))=1, (var_1_15 ? (var_1_1 == ((signed short int) (((((var_1_11 + var_1_11)) < (var_1_11)) ? ((var_1_11 + var_1_11)) : (var_1_11))))) : 1) && ((last_1_var_1_6 != ((((var_1_11) < (var_1_11)) ? (var_1_11) : (var_1_11)))) ? (((var_1_7 - var_1_8) >= var_1_9) ? ((((((var_1_11) > (var_1_11)) ? (var_1_11) : (var_1_11))) < (var_1_8 >> var_1_9)) ? (var_1_6 == ((unsigned long int) var_1_8)) : (var_1_6 == ((unsigned long int) var_1_10))) : (var_1_6 == ((unsigned long int) var_1_10))) : (var_1_6 == ((unsigned long int) var_1_8)))=1, isInitial=1, last_1_var_1_6=2, var_1_10=4, var_1_11=2, var_1_12=16, var_1_13=31, var_1_14=5, var_1_15=1, var_1_16=1, var_1_17=2762957892, var_1_18=2762957892, var_1_1=2, var_1_6=2147483647, var_1_7=4294967295, var_1_8=2147483647, var_1_9=2762957887] [L97-L98] return ((((var_1_15 ? (var_1_1 == ((signed short int) (((((var_1_11 + var_1_11)) < (var_1_11)) ? ((var_1_11 + var_1_11)) : (var_1_11))))) : 1) && ((last_1_var_1_6 != ((((var_1_11) < (var_1_11)) ? (var_1_11) : (var_1_11)))) ? (((var_1_7 - var_1_8) >= var_1_9) ? ((((((var_1_11) > (var_1_11)) ? (var_1_11) : (var_1_11))) < (var_1_8 >> var_1_9)) ? (var_1_6 == ((unsigned long int) var_1_8)) : (var_1_6 == ((unsigned long int) var_1_10))) : (var_1_6 == ((unsigned long int) var_1_10))) : (var_1_6 == ((unsigned long int) var_1_8)))) && (var_1_15 ? (var_1_11 == ((signed char) (((var_1_12 + var_1_13) + var_1_14) - 50))) : 1)) && (var_1_15 == ((unsigned char) var_1_16))) && (var_1_17 == ((double) var_1_18)) ; [L107] RET, EXPR property() [L107] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_6=2, var_1_10=4, var_1_11=2, var_1_12=16, var_1_13=31, var_1_14=5, var_1_15=1, var_1_16=1, var_1_17=2762957892, var_1_18=2762957892, var_1_1=2, var_1_6=2147483647, var_1_7=4294967295, var_1_8=2147483647, var_1_9=2762957887] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_6=2, var_1_10=4, var_1_11=2, var_1_12=16, var_1_13=31, var_1_14=5, var_1_15=1, var_1_16=1, var_1_17=2762957892, var_1_18=2762957892, var_1_1=2, var_1_6=2147483647, var_1_7=4294967295, var_1_8=2147483647, var_1_9=2762957887] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 60 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.0s, OverallIterations: 4, TraceHistogramMax: 17, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 216 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 216 mSDsluCounter, 788 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 427 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 88 IncrementalHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 361 mSDtfsCounter, 88 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 132 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=64occurred in iteration=2, InterpolantAutomatonStates: 13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 127 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 438 NumberOfCodeBlocks, 438 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 324 ConstructedInterpolants, 0 QuantifiedInterpolants, 664 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 1632/1632 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-06 22:33:20,585 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_366ce1ea-eedd-4ea0-b61b-6e2972955b45/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_366ce1ea-eedd-4ea0-b61b-6e2972955b45/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_366ce1ea-eedd-4ea0-b61b-6e2972955b45/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_366ce1ea-eedd-4ea0-b61b-6e2972955b45/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_366ce1ea-eedd-4ea0-b61b-6e2972955b45/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-90.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_366ce1ea-eedd-4ea0-b61b-6e2972955b45/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_366ce1ea-eedd-4ea0-b61b-6e2972955b45/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5e76bf897418c531679e53fa28b7c04d453b1c5b37fbed71b943af641f77aed6 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:33:23,257 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:33:23,362 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_366ce1ea-eedd-4ea0-b61b-6e2972955b45/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-11-06 22:33:23,370 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:33:23,371 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:33:23,419 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:33:23,420 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:33:23,421 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:33:23,423 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:33:23,428 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:33:23,429 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:33:23,429 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:33:23,430 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:33:23,432 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:33:23,433 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 22:33:23,433 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:33:23,434 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:33:23,434 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:33:23,435 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 22:33:23,435 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:33:23,436 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 22:33:23,436 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 22:33:23,437 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-06 22:33:23,437 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-06 22:33:23,438 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:33:23,438 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 22:33:23,439 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:33:23,439 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:33:23,440 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:33:23,440 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:33:23,442 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:33:23,442 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:33:23,442 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:33:23,443 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 22:33:23,443 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-06 22:33:23,444 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-06 22:33:23,444 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:33:23,444 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 22:33:23,445 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:33:23,446 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:33:23,446 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-06 22:33:23,446 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:33:23,447 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_366ce1ea-eedd-4ea0-b61b-6e2972955b45/bin/uautomizer-verify-WvqO1wxjHP/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_366ce1ea-eedd-4ea0-b61b-6e2972955b45/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5e76bf897418c531679e53fa28b7c04d453b1c5b37fbed71b943af641f77aed6 [2023-11-06 22:33:23,855 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:33:23,889 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:33:23,892 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:33:23,894 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:33:23,894 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:33:23,896 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_366ce1ea-eedd-4ea0-b61b-6e2972955b45/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-90.i [2023-11-06 22:33:27,114 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:33:27,354 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:33:27,354 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_366ce1ea-eedd-4ea0-b61b-6e2972955b45/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-90.i [2023-11-06 22:33:27,364 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_366ce1ea-eedd-4ea0-b61b-6e2972955b45/bin/uautomizer-verify-WvqO1wxjHP/data/ea32c9f32/ed52a1cdd0224e60a297df242b8768a5/FLAGe2776e556 [2023-11-06 22:33:27,380 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_366ce1ea-eedd-4ea0-b61b-6e2972955b45/bin/uautomizer-verify-WvqO1wxjHP/data/ea32c9f32/ed52a1cdd0224e60a297df242b8768a5 [2023-11-06 22:33:27,392 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:33:27,395 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:33:27,398 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:33:27,400 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:33:27,406 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:33:27,407 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:33:27" (1/1) ... [2023-11-06 22:33:27,408 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2465cf47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:33:27, skipping insertion in model container [2023-11-06 22:33:27,425 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:33:27" (1/1) ... [2023-11-06 22:33:27,469 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:33:27,682 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_366ce1ea-eedd-4ea0-b61b-6e2972955b45/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-90.i[915,928] [2023-11-06 22:33:27,745 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:33:27,763 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:33:27,781 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_366ce1ea-eedd-4ea0-b61b-6e2972955b45/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-90.i[915,928] [2023-11-06 22:33:27,814 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:33:27,833 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:33:27,834 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:33:27 WrapperNode [2023-11-06 22:33:27,834 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:33:27,835 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:33:27,835 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:33:27,836 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:33:27,843 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:33:27" (1/1) ... [2023-11-06 22:33:27,856 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:33:27" (1/1) ... [2023-11-06 22:33:27,884 INFO L138 Inliner]: procedures = 27, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 110 [2023-11-06 22:33:27,884 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:33:27,885 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:33:27,885 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:33:27,886 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:33:27,896 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:33:27" (1/1) ... [2023-11-06 22:33:27,896 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:33:27" (1/1) ... [2023-11-06 22:33:27,901 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:33:27" (1/1) ... [2023-11-06 22:33:27,902 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:33:27" (1/1) ... [2023-11-06 22:33:27,914 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:33:27" (1/1) ... [2023-11-06 22:33:27,918 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:33:27" (1/1) ... [2023-11-06 22:33:27,921 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:33:27" (1/1) ... [2023-11-06 22:33:27,923 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:33:27" (1/1) ... [2023-11-06 22:33:27,927 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:33:27,929 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:33:27,929 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:33:27,929 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:33:27,930 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:33:27" (1/1) ... [2023-11-06 22:33:27,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:33:27,954 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_366ce1ea-eedd-4ea0-b61b-6e2972955b45/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:33:27,970 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_366ce1ea-eedd-4ea0-b61b-6e2972955b45/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:33:28,005 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_366ce1ea-eedd-4ea0-b61b-6e2972955b45/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:33:28,016 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:33:28,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-11-06 22:33:28,017 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-06 22:33:28,017 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-06 22:33:28,017 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:33:28,017 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:33:28,119 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:33:28,120 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:33:28,411 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:33:28,422 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:33:28,424 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-06 22:33:28,427 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:33:28 BoogieIcfgContainer [2023-11-06 22:33:28,428 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:33:28,432 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:33:28,432 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:33:28,436 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:33:28,436 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:33:27" (1/3) ... [2023-11-06 22:33:28,437 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5adc9fa1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:33:28, skipping insertion in model container [2023-11-06 22:33:28,437 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:33:27" (2/3) ... [2023-11-06 22:33:28,438 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5adc9fa1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:33:28, skipping insertion in model container [2023-11-06 22:33:28,439 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:33:28" (3/3) ... [2023-11-06 22:33:28,441 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-90.i [2023-11-06 22:33:28,461 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:33:28,462 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 22:33:28,530 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:33:28,537 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5be6e39c, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:33:28,538 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-06 22:33:28,544 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 32 states have internal predecessors, (41), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-11-06 22:33:28,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-11-06 22:33:28,562 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:33:28,564 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:33:28,566 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:33:28,574 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:33:28,574 INFO L85 PathProgramCache]: Analyzing trace with hash 1387335848, now seen corresponding path program 1 times [2023-11-06 22:33:28,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:33:28,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [31987926] [2023-11-06 22:33:28,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:33:28,593 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:33:28,593 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_366ce1ea-eedd-4ea0-b61b-6e2972955b45/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:33:28,605 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_366ce1ea-eedd-4ea0-b61b-6e2972955b45/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:33:28,670 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_366ce1ea-eedd-4ea0-b61b-6e2972955b45/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-11-06 22:33:28,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:33:28,912 INFO L262 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-06 22:33:28,924 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:33:29,004 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 284 proven. 0 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2023-11-06 22:33:29,006 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:33:29,007 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:33:29,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [31987926] [2023-11-06 22:33:29,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [31987926] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:33:29,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:33:29,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:33:29,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307405965] [2023-11-06 22:33:29,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:33:29,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 22:33:29,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:33:29,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 22:33:29,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:33:29,073 INFO L87 Difference]: Start difference. First operand has 51 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 32 states have internal predecessors, (41), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2023-11-06 22:33:29,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:33:29,124 INFO L93 Difference]: Finished difference Result 95 states and 161 transitions. [2023-11-06 22:33:29,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 22:33:29,126 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 107 [2023-11-06 22:33:29,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:33:29,139 INFO L225 Difference]: With dead ends: 95 [2023-11-06 22:33:29,139 INFO L226 Difference]: Without dead ends: 47 [2023-11-06 22:33:29,144 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:33:29,149 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:33:29,151 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:33:29,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2023-11-06 22:33:29,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2023-11-06 22:33:29,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 28 states have internal predecessors, (34), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-11-06 22:33:29,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 68 transitions. [2023-11-06 22:33:29,274 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 68 transitions. Word has length 107 [2023-11-06 22:33:29,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:33:29,275 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 68 transitions. [2023-11-06 22:33:29,275 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2023-11-06 22:33:29,276 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 68 transitions. [2023-11-06 22:33:29,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-11-06 22:33:29,280 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:33:29,281 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:33:29,302 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_366ce1ea-eedd-4ea0-b61b-6e2972955b45/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-11-06 22:33:29,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_366ce1ea-eedd-4ea0-b61b-6e2972955b45/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:33:29,495 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:33:29,496 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:33:29,496 INFO L85 PathProgramCache]: Analyzing trace with hash 2101967718, now seen corresponding path program 1 times [2023-11-06 22:33:29,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:33:29,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2005495673] [2023-11-06 22:33:29,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:33:29,498 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:33:29,498 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_366ce1ea-eedd-4ea0-b61b-6e2972955b45/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:33:29,499 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_366ce1ea-eedd-4ea0-b61b-6e2972955b45/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:33:29,535 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_366ce1ea-eedd-4ea0-b61b-6e2972955b45/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-11-06 22:33:29,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:33:29,726 INFO L262 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 17 conjunts are in the unsatisfiable core [2023-11-06 22:33:29,741 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:33:49,217 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2023-11-06 22:33:49,217 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:33:49,217 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:33:49,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2005495673] [2023-11-06 22:33:49,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2005495673] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:33:49,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:33:49,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-11-06 22:33:49,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564474028] [2023-11-06 22:33:49,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:33:49,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-06 22:33:49,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:33:49,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-06 22:33:49,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2023-11-06 22:33:49,222 INFO L87 Difference]: Start difference. First operand 47 states and 68 transitions. Second operand has 14 states, 14 states have (on average 2.0) internal successors, (28), 12 states have internal predecessors, (28), 1 states have call successors, (17), 1 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) [2023-11-06 22:34:01,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:34:01,022 INFO L93 Difference]: Finished difference Result 162 states and 232 transitions. [2023-11-06 22:34:01,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-06 22:34:01,023 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.0) internal successors, (28), 12 states have internal predecessors, (28), 1 states have call successors, (17), 1 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) Word has length 107 [2023-11-06 22:34:01,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:34:01,027 INFO L225 Difference]: With dead ends: 162 [2023-11-06 22:34:01,027 INFO L226 Difference]: Without dead ends: 160 [2023-11-06 22:34:01,028 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 14.0s TimeCoverageRelationStatistics Valid=174, Invalid=582, Unknown=0, NotChecked=0, Total=756 [2023-11-06 22:34:01,030 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 163 mSDsluCounter, 622 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 718 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.8s IncrementalHoareTripleChecker+Time [2023-11-06 22:34:01,031 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 718 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 6.8s Time] [2023-11-06 22:34:01,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2023-11-06 22:34:01,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 90. [2023-11-06 22:34:01,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 52 states have (on average 1.1730769230769231) internal successors, (61), 52 states have internal predecessors, (61), 34 states have call successors, (34), 3 states have call predecessors, (34), 3 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2023-11-06 22:34:01,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 129 transitions. [2023-11-06 22:34:01,067 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 129 transitions. Word has length 107 [2023-11-06 22:34:01,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:34:01,068 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 129 transitions. [2023-11-06 22:34:01,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.0) internal successors, (28), 12 states have internal predecessors, (28), 1 states have call successors, (17), 1 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) [2023-11-06 22:34:01,069 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 129 transitions. [2023-11-06 22:34:01,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-11-06 22:34:01,071 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:34:01,071 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:34:01,090 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_366ce1ea-eedd-4ea0-b61b-6e2972955b45/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-11-06 22:34:01,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_366ce1ea-eedd-4ea0-b61b-6e2972955b45/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:34:01,286 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:34:01,290 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:34:01,291 INFO L85 PathProgramCache]: Analyzing trace with hash -417992216, now seen corresponding path program 1 times [2023-11-06 22:34:01,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:34:01,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1648718828] [2023-11-06 22:34:01,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:34:01,292 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:34:01,292 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_366ce1ea-eedd-4ea0-b61b-6e2972955b45/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:34:01,293 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_366ce1ea-eedd-4ea0-b61b-6e2972955b45/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:34:01,313 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_366ce1ea-eedd-4ea0-b61b-6e2972955b45/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-11-06 22:34:01,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:34:01,431 INFO L262 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-06 22:34:01,436 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:34:01,607 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 160 proven. 6 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2023-11-06 22:34:01,607 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:34:01,812 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 42 proven. 6 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2023-11-06 22:34:01,812 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:34:01,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1648718828] [2023-11-06 22:34:01,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1648718828] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:34:01,813 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:34:01,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 12 [2023-11-06 22:34:01,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109890763] [2023-11-06 22:34:01,814 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:34:01,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-06 22:34:01,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:34:01,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-06 22:34:01,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2023-11-06 22:34:01,817 INFO L87 Difference]: Start difference. First operand 90 states and 129 transitions. Second operand has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 12 states have internal predecessors, (41), 3 states have call successors, (19), 3 states have call predecessors, (19), 5 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2023-11-06 22:34:02,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:34:02,493 INFO L93 Difference]: Finished difference Result 150 states and 207 transitions. [2023-11-06 22:34:02,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-06 22:34:02,505 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 12 states have internal predecessors, (41), 3 states have call successors, (19), 3 states have call predecessors, (19), 5 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) Word has length 107 [2023-11-06 22:34:02,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:34:02,508 INFO L225 Difference]: With dead ends: 150 [2023-11-06 22:34:02,508 INFO L226 Difference]: Without dead ends: 106 [2023-11-06 22:34:02,509 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 203 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=153, Invalid=309, Unknown=0, NotChecked=0, Total=462 [2023-11-06 22:34:02,511 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 98 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-06 22:34:02,511 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 172 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-06 22:34:02,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2023-11-06 22:34:02,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 102. [2023-11-06 22:34:02,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 61 states have (on average 1.0819672131147542) internal successors, (66), 61 states have internal predecessors, (66), 34 states have call successors, (34), 6 states have call predecessors, (34), 6 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2023-11-06 22:34:02,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 134 transitions. [2023-11-06 22:34:02,536 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 134 transitions. Word has length 107 [2023-11-06 22:34:02,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:34:02,537 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 134 transitions. [2023-11-06 22:34:02,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 12 states have internal predecessors, (41), 3 states have call successors, (19), 3 states have call predecessors, (19), 5 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2023-11-06 22:34:02,537 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 134 transitions. [2023-11-06 22:34:02,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-11-06 22:34:02,539 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:34:02,540 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:34:02,556 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_366ce1ea-eedd-4ea0-b61b-6e2972955b45/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-11-06 22:34:02,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_366ce1ea-eedd-4ea0-b61b-6e2972955b45/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:34:02,754 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:34:02,755 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:34:02,755 INFO L85 PathProgramCache]: Analyzing trace with hash 331001653, now seen corresponding path program 1 times [2023-11-06 22:34:02,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:34:02,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1278685015] [2023-11-06 22:34:02,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:34:02,756 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:34:02,756 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_366ce1ea-eedd-4ea0-b61b-6e2972955b45/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:34:02,757 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_366ce1ea-eedd-4ea0-b61b-6e2972955b45/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:34:02,768 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_366ce1ea-eedd-4ea0-b61b-6e2972955b45/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-11-06 22:34:02,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:34:02,902 INFO L262 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 20 conjunts are in the unsatisfiable core [2023-11-06 22:34:02,908 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:34:19,497 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 217 proven. 36 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2023-11-06 22:34:19,497 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:34:31,408 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2023-11-06 22:34:31,409 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:34:31,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1278685015] [2023-11-06 22:34:31,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1278685015] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-06 22:34:31,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 22:34:31,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [16] total 27 [2023-11-06 22:34:31,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40455032] [2023-11-06 22:34:31,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:34:31,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-06 22:34:31,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:34:31,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-06 22:34:31,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=554, Unknown=0, NotChecked=0, Total=702 [2023-11-06 22:34:31,413 INFO L87 Difference]: Start difference. First operand 102 states and 134 transitions. Second operand has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 12 states have internal predecessors, (29), 1 states have call successors, (17), 1 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) [2023-11-06 22:34:41,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:34:41,708 INFO L93 Difference]: Finished difference Result 154 states and 204 transitions. [2023-11-06 22:34:41,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-06 22:34:41,709 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 12 states have internal predecessors, (29), 1 states have call successors, (17), 1 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) Word has length 108 [2023-11-06 22:34:41,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:34:41,712 INFO L225 Difference]: With dead ends: 154 [2023-11-06 22:34:41,713 INFO L226 Difference]: Without dead ends: 152 [2023-11-06 22:34:41,714 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 368 ImplicationChecksByTransitivity, 14.4s TimeCoverageRelationStatistics Valid=313, Invalid=1247, Unknown=0, NotChecked=0, Total=1560 [2023-11-06 22:34:41,716 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 201 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 608 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:34:41,716 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 419 Invalid, 691 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 608 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2023-11-06 22:34:41,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2023-11-06 22:34:41,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 110. [2023-11-06 22:34:41,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 67 states have (on average 1.0746268656716418) internal successors, (72), 67 states have internal predecessors, (72), 34 states have call successors, (34), 8 states have call predecessors, (34), 8 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2023-11-06 22:34:41,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 140 transitions. [2023-11-06 22:34:41,752 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 140 transitions. Word has length 108 [2023-11-06 22:34:41,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:34:41,753 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 140 transitions. [2023-11-06 22:34:41,753 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 12 states have internal predecessors, (29), 1 states have call successors, (17), 1 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) [2023-11-06 22:34:41,753 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 140 transitions. [2023-11-06 22:34:41,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-11-06 22:34:41,756 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:34:41,756 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:34:41,773 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_366ce1ea-eedd-4ea0-b61b-6e2972955b45/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-11-06 22:34:41,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_366ce1ea-eedd-4ea0-b61b-6e2972955b45/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:34:41,970 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:34:41,970 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:34:41,971 INFO L85 PathProgramCache]: Analyzing trace with hash 1432785787, now seen corresponding path program 1 times [2023-11-06 22:34:41,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:34:41,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [228447667] [2023-11-06 22:34:41,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:34:41,972 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:34:41,972 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_366ce1ea-eedd-4ea0-b61b-6e2972955b45/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:34:41,973 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_366ce1ea-eedd-4ea0-b61b-6e2972955b45/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:34:41,979 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_366ce1ea-eedd-4ea0-b61b-6e2972955b45/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-11-06 22:34:42,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:34:42,097 INFO L262 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 22 conjunts are in the unsatisfiable core [2023-11-06 22:34:42,102 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:34:55,518 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 217 proven. 36 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2023-11-06 22:34:55,518 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:35:08,783 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2023-11-06 22:35:08,783 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:35:08,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [228447667] [2023-11-06 22:35:08,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [228447667] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-06 22:35:08,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 22:35:08,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [17] total 29 [2023-11-06 22:35:08,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847728291] [2023-11-06 22:35:08,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:35:08,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-06 22:35:08,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:35:08,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-06 22:35:08,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=651, Unknown=0, NotChecked=0, Total=812 [2023-11-06 22:35:08,787 INFO L87 Difference]: Start difference. First operand 110 states and 140 transitions. Second operand has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 13 states have internal predecessors, (30), 1 states have call successors, (17), 1 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) [2023-11-06 22:35:49,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:35:49,383 INFO L93 Difference]: Finished difference Result 167 states and 215 transitions. [2023-11-06 22:35:49,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-11-06 22:35:49,385 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 13 states have internal predecessors, (30), 1 states have call successors, (17), 1 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) Word has length 109 [2023-11-06 22:35:49,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:35:49,387 INFO L225 Difference]: With dead ends: 167 [2023-11-06 22:35:49,387 INFO L226 Difference]: Without dead ends: 165 [2023-11-06 22:35:49,389 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 508 ImplicationChecksByTransitivity, 40.3s TimeCoverageRelationStatistics Valid=427, Invalid=1643, Unknown=0, NotChecked=0, Total=2070 [2023-11-06 22:35:49,390 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 91 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 750 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 778 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 750 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.3s IncrementalHoareTripleChecker+Time [2023-11-06 22:35:49,391 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 388 Invalid, 778 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 750 Invalid, 0 Unknown, 0 Unchecked, 17.3s Time] [2023-11-06 22:35:49,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2023-11-06 22:35:49,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 118. [2023-11-06 22:35:49,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 73 states have (on average 1.0684931506849316) internal successors, (78), 73 states have internal predecessors, (78), 34 states have call successors, (34), 10 states have call predecessors, (34), 10 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2023-11-06 22:35:49,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 146 transitions. [2023-11-06 22:35:49,434 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 146 transitions. Word has length 109 [2023-11-06 22:35:49,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:35:49,435 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 146 transitions. [2023-11-06 22:35:49,435 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 13 states have internal predecessors, (30), 1 states have call successors, (17), 1 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) [2023-11-06 22:35:49,436 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 146 transitions. [2023-11-06 22:35:49,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-11-06 22:35:49,438 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:35:49,438 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:35:49,452 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_366ce1ea-eedd-4ea0-b61b-6e2972955b45/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2023-11-06 22:35:49,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_366ce1ea-eedd-4ea0-b61b-6e2972955b45/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:35:49,653 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:35:49,653 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:35:49,653 INFO L85 PathProgramCache]: Analyzing trace with hash 1434632829, now seen corresponding path program 1 times [2023-11-06 22:35:49,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:35:49,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [554733353] [2023-11-06 22:35:49,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:35:49,654 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:35:49,654 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_366ce1ea-eedd-4ea0-b61b-6e2972955b45/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:35:49,656 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_366ce1ea-eedd-4ea0-b61b-6e2972955b45/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:35:49,657 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_366ce1ea-eedd-4ea0-b61b-6e2972955b45/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-11-06 22:35:49,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:49,763 INFO L262 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 20 conjunts are in the unsatisfiable core [2023-11-06 22:35:49,767 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:36:06,907 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 217 proven. 36 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2023-11-06 22:36:06,908 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:36:24,170 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2023-11-06 22:36:24,171 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:36:24,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [554733353] [2023-11-06 22:36:24,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [554733353] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-06 22:36:24,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 22:36:24,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [16] total 27 [2023-11-06 22:36:24,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269022717] [2023-11-06 22:36:24,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:36:24,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-06 22:36:24,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:36:24,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-06 22:36:24,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=542, Unknown=0, NotChecked=0, Total=702 [2023-11-06 22:36:24,174 INFO L87 Difference]: Start difference. First operand 118 states and 146 transitions. Second operand has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 12 states have internal predecessors, (30), 1 states have call successors, (17), 1 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) [2023-11-06 22:36:43,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:36:43,485 INFO L93 Difference]: Finished difference Result 160 states and 208 transitions. [2023-11-06 22:36:43,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-11-06 22:36:43,488 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 12 states have internal predecessors, (30), 1 states have call successors, (17), 1 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) Word has length 109 [2023-11-06 22:36:43,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:36:43,489 INFO L225 Difference]: With dead ends: 160 [2023-11-06 22:36:43,489 INFO L226 Difference]: Without dead ends: 0 [2023-11-06 22:36:43,491 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 390 ImplicationChecksByTransitivity, 29.8s TimeCoverageRelationStatistics Valid=341, Invalid=1299, Unknown=0, NotChecked=0, Total=1640 [2023-11-06 22:36:43,493 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 177 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2023-11-06 22:36:43,493 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 292 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time] [2023-11-06 22:36:43,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-06 22:36:43,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-06 22:36:43,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:36:43,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-06 22:36:43,495 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 109 [2023-11-06 22:36:43,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:36:43,495 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-06 22:36:43,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 12 states have internal predecessors, (30), 1 states have call successors, (17), 1 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) [2023-11-06 22:36:43,496 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-06 22:36:43,496 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-06 22:36:43,498 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-06 22:36:43,516 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_366ce1ea-eedd-4ea0-b61b-6e2972955b45/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-11-06 22:36:43,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_366ce1ea-eedd-4ea0-b61b-6e2972955b45/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:36:43,707 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-06 22:36:51,505 WARN L293 SmtUtils]: Spent 7.26s on a formula simplification. DAG size of input: 192 DAG size of output: 80 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-11-06 22:37:07,520 WARN L293 SmtUtils]: Spent 9.40s on a formula simplification. DAG size of input: 388 DAG size of output: 1 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-11-06 22:37:14,846 WARN L293 SmtUtils]: Spent 7.32s on a formula simplification. DAG size of input: 192 DAG size of output: 80 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-11-06 22:37:25,792 WARN L293 SmtUtils]: Spent 7.19s on a formula simplification. DAG size of input: 255 DAG size of output: 79 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter)