./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-65.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbd71a70-b7f1-4312-a7ba-f3d5576ed13e/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbd71a70-b7f1-4312-a7ba-f3d5576ed13e/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbd71a70-b7f1-4312-a7ba-f3d5576ed13e/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbd71a70-b7f1-4312-a7ba-f3d5576ed13e/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-65.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbd71a70-b7f1-4312-a7ba-f3d5576ed13e/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbd71a70-b7f1-4312-a7ba-f3d5576ed13e/bin/uautomizer-verify-BQ2R08f2Ya --witnessprinter.witness.filename witness --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 fc224bde26358da9997f9941009f63e79d979df8df0c5e0ccdb6f1d2abc5adfc --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 03:20:35,783 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 03:20:35,849 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbd71a70-b7f1-4312-a7ba-f3d5576ed13e/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-29 03:20:35,853 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 03:20:35,854 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 03:20:35,879 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 03:20:35,879 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 03:20:35,880 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 03:20:35,880 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 03:20:35,881 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 03:20:35,881 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 03:20:35,882 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 03:20:35,883 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 03:20:35,883 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 03:20:35,884 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 03:20:35,885 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 03:20:35,885 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 03:20:35,886 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 03:20:35,886 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 03:20:35,887 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 03:20:35,887 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 03:20:35,888 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 03:20:35,888 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 03:20:35,889 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 03:20:35,889 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 03:20:35,890 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 03:20:35,890 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 03:20:35,890 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 03:20:35,891 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 03:20:35,891 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 03:20:35,892 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 03:20:35,892 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 03:20:35,892 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 03:20:35,893 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 03:20:35,893 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 03:20:35,893 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 03:20:35,893 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 03:20:35,893 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 03:20:35,894 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 03:20:35,894 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 03:20:35,894 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 03:20:35,894 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 03:20:35,895 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_bbd71a70-b7f1-4312-a7ba-f3d5576ed13e/bin/uautomizer-verify-BQ2R08f2Ya/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_bbd71a70-b7f1-4312-a7ba-f3d5576ed13e/bin/uautomizer-verify-BQ2R08f2Ya Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> fc224bde26358da9997f9941009f63e79d979df8df0c5e0ccdb6f1d2abc5adfc [2023-11-29 03:20:36,107 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 03:20:36,127 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 03:20:36,129 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 03:20:36,130 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 03:20:36,131 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 03:20:36,132 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbd71a70-b7f1-4312-a7ba-f3d5576ed13e/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-65.i [2023-11-29 03:20:38,875 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 03:20:39,092 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 03:20:39,093 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbd71a70-b7f1-4312-a7ba-f3d5576ed13e/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-65.i [2023-11-29 03:20:39,102 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbd71a70-b7f1-4312-a7ba-f3d5576ed13e/bin/uautomizer-verify-BQ2R08f2Ya/data/ef2c4ddc3/51e25ba368f74401a9ad91620dea209f/FLAGd20909fa3 [2023-11-29 03:20:39,116 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbd71a70-b7f1-4312-a7ba-f3d5576ed13e/bin/uautomizer-verify-BQ2R08f2Ya/data/ef2c4ddc3/51e25ba368f74401a9ad91620dea209f [2023-11-29 03:20:39,119 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 03:20:39,120 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 03:20:39,122 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 03:20:39,122 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 03:20:39,127 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 03:20:39,127 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 03:20:39" (1/1) ... [2023-11-29 03:20:39,128 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d31d5f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:20:39, skipping insertion in model container [2023-11-29 03:20:39,129 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 03:20:39" (1/1) ... [2023-11-29 03:20:39,159 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 03:20:39,301 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_bbd71a70-b7f1-4312-a7ba-f3d5576ed13e/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-65.i[913,926] [2023-11-29 03:20:39,353 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 03:20:39,366 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 03:20:39,378 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_bbd71a70-b7f1-4312-a7ba-f3d5576ed13e/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-65.i[913,926] [2023-11-29 03:20:39,407 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 03:20:39,424 INFO L206 MainTranslator]: Completed translation [2023-11-29 03:20:39,425 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:20:39 WrapperNode [2023-11-29 03:20:39,425 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 03:20:39,426 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 03:20:39,426 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 03:20:39,427 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 03:20:39,434 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:20:39" (1/1) ... [2023-11-29 03:20:39,445 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:20:39" (1/1) ... [2023-11-29 03:20:39,479 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 198 [2023-11-29 03:20:39,479 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 03:20:39,480 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 03:20:39,480 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 03:20:39,480 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 03:20:39,492 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:20:39" (1/1) ... [2023-11-29 03:20:39,492 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:20:39" (1/1) ... [2023-11-29 03:20:39,495 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:20:39" (1/1) ... [2023-11-29 03:20:39,509 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-11-29 03:20:39,510 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:20:39" (1/1) ... [2023-11-29 03:20:39,510 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:20:39" (1/1) ... [2023-11-29 03:20:39,519 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:20:39" (1/1) ... [2023-11-29 03:20:39,523 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:20:39" (1/1) ... [2023-11-29 03:20:39,525 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:20:39" (1/1) ... [2023-11-29 03:20:39,528 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:20:39" (1/1) ... [2023-11-29 03:20:39,532 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 03:20:39,533 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 03:20:39,533 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 03:20:39,533 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 03:20:39,534 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:20:39" (1/1) ... [2023-11-29 03:20:39,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 03:20:39,550 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbd71a70-b7f1-4312-a7ba-f3d5576ed13e/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:20:39,564 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbd71a70-b7f1-4312-a7ba-f3d5576ed13e/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 03:20:39,570 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbd71a70-b7f1-4312-a7ba-f3d5576ed13e/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 03:20:39,600 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 03:20:39,601 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-29 03:20:39,601 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-29 03:20:39,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 03:20:39,601 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 03:20:39,601 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 03:20:39,689 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 03:20:39,692 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 03:20:39,990 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 03:20:40,017 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 03:20:40,017 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-29 03:20:40,018 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 03:20:40 BoogieIcfgContainer [2023-11-29 03:20:40,018 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 03:20:40,021 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 03:20:40,021 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 03:20:40,024 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 03:20:40,024 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 03:20:39" (1/3) ... [2023-11-29 03:20:40,025 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51a0db86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 03:20:40, skipping insertion in model container [2023-11-29 03:20:40,025 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:20:39" (2/3) ... [2023-11-29 03:20:40,025 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51a0db86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 03:20:40, skipping insertion in model container [2023-11-29 03:20:40,026 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 03:20:40" (3/3) ... [2023-11-29 03:20:40,027 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_normal_file-65.i [2023-11-29 03:20:40,042 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 03:20:40,042 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 03:20:40,078 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 03:20:40,083 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=LoopHeads, 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;@45bcd28, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 03:20:40,083 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 03:20:40,086 INFO L276 IsEmpty]: Start isEmpty. Operand has 67 states, 46 states have (on average 1.5434782608695652) internal successors, (71), 47 states have internal predecessors, (71), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-11-29 03:20:40,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2023-11-29 03:20:40,099 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:20:40,100 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 03:20:40,100 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:20:40,104 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:20:40,104 INFO L85 PathProgramCache]: Analyzing trace with hash -1849087304, now seen corresponding path program 1 times [2023-11-29 03:20:40,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:20:40,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349433873] [2023-11-29 03:20:40,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:20:40,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:20:40,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:20:40,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:20:40,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:20:40,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 03:20:40,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:20:40,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 03:20:40,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:20:40,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 03:20:40,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:20:40,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 03:20:40,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:20:40,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 03:20:40,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:20:40,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 03:20:40,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:20:40,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 03:20:40,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:20:40,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 03:20:40,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:20:40,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 03:20:40,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:20:40,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 03:20:40,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:20:40,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-29 03:20:40,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:20:40,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-29 03:20:40,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:20:40,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 03:20:40,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:20:40,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 03:20:40,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:20:40,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-29 03:20:40,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:20:40,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-29 03:20:40,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:20:40,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-11-29 03:20:40,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:20:40,438 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-29 03:20:40,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:20:40,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349433873] [2023-11-29 03:20:40,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349433873] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:20:40,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:20:40,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 03:20:40,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661697311] [2023-11-29 03:20:40,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:20:40,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 03:20:40,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:20:40,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 03:20:40,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 03:20:40,486 INFO L87 Difference]: Start difference. First operand has 67 states, 46 states have (on average 1.5434782608695652) internal successors, (71), 47 states have internal predecessors, (71), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2023-11-29 03:20:40,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:20:40,530 INFO L93 Difference]: Finished difference Result 131 states and 230 transitions. [2023-11-29 03:20:40,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 03:20:40,532 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 118 [2023-11-29 03:20:40,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:20:40,539 INFO L225 Difference]: With dead ends: 131 [2023-11-29 03:20:40,539 INFO L226 Difference]: Without dead ends: 65 [2023-11-29 03:20:40,542 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 56 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-29 03:20:40,546 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 03:20:40,547 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 96 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 03:20:40,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2023-11-29 03:20:40,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2023-11-29 03:20:40,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 45 states have (on average 1.4) internal successors, (63), 45 states have internal predecessors, (63), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-11-29 03:20:40,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 99 transitions. [2023-11-29 03:20:40,587 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 99 transitions. Word has length 118 [2023-11-29 03:20:40,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:20:40,588 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 99 transitions. [2023-11-29 03:20:40,588 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2023-11-29 03:20:40,588 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 99 transitions. [2023-11-29 03:20:40,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2023-11-29 03:20:40,592 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:20:40,592 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 03:20:40,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 03:20:40,592 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:20:40,593 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:20:40,593 INFO L85 PathProgramCache]: Analyzing trace with hash 766469948, now seen corresponding path program 1 times [2023-11-29 03:20:40,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:20:40,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190517099] [2023-11-29 03:20:40,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:20:40,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:20:40,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:20:40,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:20:40,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:20:40,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 03:20:40,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:20:40,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 03:20:40,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:20:40,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 03:20:40,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:20:40,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 03:20:40,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:20:40,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 03:20:40,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:20:40,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 03:20:40,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:20:40,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 03:20:40,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:20:40,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 03:20:40,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:20:40,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 03:20:40,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:20:40,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 03:20:40,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:20:40,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-29 03:20:40,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:20:40,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-29 03:20:40,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:20:40,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 03:20:40,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:20:40,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 03:20:40,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:20:40,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-29 03:20:40,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:20:40,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-29 03:20:40,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:20:40,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-11-29 03:20:40,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:20:40,833 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-29 03:20:40,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:20:40,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190517099] [2023-11-29 03:20:40,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190517099] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:20:40,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:20:40,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 03:20:40,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983853986] [2023-11-29 03:20:40,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:20:40,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 03:20:40,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:20:40,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 03:20:40,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:20:40,838 INFO L87 Difference]: Start difference. First operand 65 states and 99 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-29 03:20:40,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:20:40,920 INFO L93 Difference]: Finished difference Result 193 states and 295 transitions. [2023-11-29 03:20:40,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 03:20:40,920 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 118 [2023-11-29 03:20:40,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:20:40,924 INFO L225 Difference]: With dead ends: 193 [2023-11-29 03:20:40,924 INFO L226 Difference]: Without dead ends: 129 [2023-11-29 03:20:40,925 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:20:40,926 INFO L413 NwaCegarLoop]: 167 mSDtfsCounter, 85 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 03:20:40,927 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 246 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 03:20:40,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2023-11-29 03:20:40,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 81. [2023-11-29 03:20:40,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 61 states have (on average 1.4098360655737705) internal successors, (86), 61 states have internal predecessors, (86), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-11-29 03:20:40,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 122 transitions. [2023-11-29 03:20:40,946 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 122 transitions. Word has length 118 [2023-11-29 03:20:40,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:20:40,948 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 122 transitions. [2023-11-29 03:20:40,948 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-29 03:20:40,949 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 122 transitions. [2023-11-29 03:20:40,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-11-29 03:20:40,951 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:20:40,951 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 03:20:40,952 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 03:20:40,952 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:20:40,952 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:20:40,952 INFO L85 PathProgramCache]: Analyzing trace with hash 649737770, now seen corresponding path program 1 times [2023-11-29 03:20:40,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:20:40,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866400486] [2023-11-29 03:20:40,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:20:40,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:20:40,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:20:41,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:20:41,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:20:41,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 03:20:41,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:20:41,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 03:20:41,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:20:41,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 03:20:41,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:20:41,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 03:20:41,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:20:41,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 03:20:41,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:20:41,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 03:20:41,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:20:41,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 03:20:41,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:20:41,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 03:20:41,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:20:41,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 03:20:41,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:20:41,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 03:20:41,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:20:41,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-29 03:20:41,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:20:41,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-29 03:20:41,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:20:41,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 03:20:41,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:20:41,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 03:20:41,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:20:41,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-29 03:20:41,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:20:41,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-29 03:20:41,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:20:41,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-11-29 03:20:41,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:20:41,104 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-29 03:20:41,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:20:41,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866400486] [2023-11-29 03:20:41,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866400486] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:20:41,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:20:41,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 03:20:41,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336665118] [2023-11-29 03:20:41,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:20:41,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 03:20:41,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:20:41,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 03:20:41,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:20:41,107 INFO L87 Difference]: Start difference. First operand 81 states and 122 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-29 03:20:41,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:20:41,134 INFO L93 Difference]: Finished difference Result 143 states and 212 transitions. [2023-11-29 03:20:41,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 03:20:41,134 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 119 [2023-11-29 03:20:41,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:20:41,136 INFO L225 Difference]: With dead ends: 143 [2023-11-29 03:20:41,136 INFO L226 Difference]: Without dead ends: 63 [2023-11-29 03:20:41,138 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:20:41,139 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 19 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 03:20:41,139 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 149 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 03:20:41,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2023-11-29 03:20:41,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2023-11-29 03:20:41,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 43 states have (on average 1.255813953488372) internal successors, (54), 43 states have internal predecessors, (54), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-11-29 03:20:41,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 90 transitions. [2023-11-29 03:20:41,149 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 90 transitions. Word has length 119 [2023-11-29 03:20:41,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:20:41,150 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 90 transitions. [2023-11-29 03:20:41,150 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-29 03:20:41,151 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 90 transitions. [2023-11-29 03:20:41,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-11-29 03:20:41,153 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:20:41,153 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 03:20:41,153 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 03:20:41,154 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:20:41,154 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:20:41,154 INFO L85 PathProgramCache]: Analyzing trace with hash 549557303, now seen corresponding path program 1 times [2023-11-29 03:20:41,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:20:41,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143249168] [2023-11-29 03:20:41,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:20:41,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:20:41,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:20:42,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:20:42,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:20:42,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 03:20:42,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:20:42,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 03:20:42,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:20:42,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 03:20:42,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:20:42,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 03:20:42,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:20:42,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 03:20:42,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:20:42,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 03:20:42,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:20:42,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 03:20:42,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:20:42,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 03:20:42,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:20:42,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 03:20:42,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:20:42,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 03:20:42,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:20:42,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-29 03:20:42,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:20:42,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-29 03:20:42,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:20:42,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 03:20:42,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:20:42,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 03:20:42,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:20:42,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-29 03:20:42,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:20:42,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-29 03:20:42,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:20:42,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-11-29 03:20:42,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:20:42,181 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-29 03:20:42,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:20:42,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143249168] [2023-11-29 03:20:42,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143249168] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:20:42,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:20:42,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 03:20:42,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12831395] [2023-11-29 03:20:42,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:20:42,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 03:20:42,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:20:42,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 03:20:42,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-29 03:20:42,183 INFO L87 Difference]: Start difference. First operand 63 states and 90 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-29 03:20:42,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:20:42,590 INFO L93 Difference]: Finished difference Result 159 states and 230 transitions. [2023-11-29 03:20:42,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 03:20:42,591 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 120 [2023-11-29 03:20:42,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:20:42,593 INFO L225 Difference]: With dead ends: 159 [2023-11-29 03:20:42,593 INFO L226 Difference]: Without dead ends: 97 [2023-11-29 03:20:42,594 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-11-29 03:20:42,595 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 97 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 03:20:42,595 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 369 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 03:20:42,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2023-11-29 03:20:42,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 63. [2023-11-29 03:20:42,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 43 states have (on average 1.2325581395348837) internal successors, (53), 43 states have internal predecessors, (53), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-11-29 03:20:42,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 89 transitions. [2023-11-29 03:20:42,609 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 89 transitions. Word has length 120 [2023-11-29 03:20:42,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:20:42,610 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 89 transitions. [2023-11-29 03:20:42,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-29 03:20:42,610 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 89 transitions. [2023-11-29 03:20:42,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-11-29 03:20:42,612 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:20:42,612 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 03:20:42,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 03:20:42,613 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:20:42,613 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:20:42,613 INFO L85 PathProgramCache]: Analyzing trace with hash 39746241, now seen corresponding path program 1 times [2023-11-29 03:20:42,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:20:42,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217008875] [2023-11-29 03:20:42,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:20:42,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:20:42,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:20:42,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:20:42,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:20:42,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 03:20:42,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:20:42,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 03:20:42,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:20:42,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 03:20:42,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:20:42,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 03:20:42,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:20:42,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 03:20:42,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:20:42,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 03:20:42,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:20:42,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 03:20:42,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:20:42,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 03:20:42,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:20:42,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 03:20:42,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:20:42,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 03:20:42,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:20:42,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-29 03:20:42,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:20:42,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-29 03:20:42,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:20:42,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 03:20:42,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:20:42,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 03:20:42,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:20:42,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-29 03:20:42,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:20:42,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-29 03:20:42,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:20:42,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-11-29 03:20:42,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:20:42,958 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 18 proven. 33 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2023-11-29 03:20:42,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:20:42,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217008875] [2023-11-29 03:20:42,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217008875] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:20:42,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1091723661] [2023-11-29 03:20:42,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:20:42,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:20:42,959 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbd71a70-b7f1-4312-a7ba-f3d5576ed13e/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:20:42,963 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbd71a70-b7f1-4312-a7ba-f3d5576ed13e/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:20:42,964 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbd71a70-b7f1-4312-a7ba-f3d5576ed13e/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-29 03:20:43,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:20:43,074 INFO L262 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-29 03:20:43,083 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:20:43,320 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 293 proven. 33 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2023-11-29 03:20:43,320 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:20:43,556 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 18 proven. 33 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2023-11-29 03:20:43,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1091723661] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 03:20:43,557 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 03:20:43,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2023-11-29 03:20:43,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283501833] [2023-11-29 03:20:43,557 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 03:20:43,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 03:20:43,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:20:43,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 03:20:43,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2023-11-29 03:20:43,560 INFO L87 Difference]: Start difference. First operand 63 states and 89 transitions. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 2 states have call successors, (29), 2 states have call predecessors, (29), 4 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2023-11-29 03:20:43,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:20:43,843 INFO L93 Difference]: Finished difference Result 143 states and 200 transitions. [2023-11-29 03:20:43,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 03:20:43,845 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 2 states have call successors, (29), 2 states have call predecessors, (29), 4 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) Word has length 124 [2023-11-29 03:20:43,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:20:43,846 INFO L225 Difference]: With dead ends: 143 [2023-11-29 03:20:43,846 INFO L226 Difference]: Without dead ends: 81 [2023-11-29 03:20:43,847 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 278 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2023-11-29 03:20:43,848 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 211 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 03:20:43,848 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 169 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 03:20:43,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2023-11-29 03:20:43,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 76. [2023-11-29 03:20:43,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 49 states have (on average 1.183673469387755) internal successors, (58), 50 states have internal predecessors, (58), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2023-11-29 03:20:43,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 106 transitions. [2023-11-29 03:20:43,868 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 106 transitions. Word has length 124 [2023-11-29 03:20:43,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:20:43,868 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 106 transitions. [2023-11-29 03:20:43,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 2 states have call successors, (29), 2 states have call predecessors, (29), 4 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2023-11-29 03:20:43,869 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 106 transitions. [2023-11-29 03:20:43,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2023-11-29 03:20:43,871 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:20:43,871 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 03:20:43,878 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbd71a70-b7f1-4312-a7ba-f3d5576ed13e/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-29 03:20:44,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbd71a70-b7f1-4312-a7ba-f3d5576ed13e/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:20:44,073 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:20:44,073 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:20:44,073 INFO L85 PathProgramCache]: Analyzing trace with hash 585793252, now seen corresponding path program 1 times [2023-11-29 03:20:44,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:20:44,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891677143] [2023-11-29 03:20:44,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:20:44,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:20:44,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:20:45,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:20:45,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:20:45,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 03:20:45,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:20:45,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 03:20:45,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:20:45,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 03:20:45,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:20:45,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 03:20:45,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:20:45,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 03:20:45,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:20:45,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 03:20:45,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:20:45,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 03:20:45,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:20:45,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 03:20:45,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:20:45,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 03:20:45,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:20:45,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 03:20:45,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:20:45,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-29 03:20:45,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:20:45,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-29 03:20:45,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:20:45,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 03:20:45,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:20:45,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 03:20:45,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:20:45,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-29 03:20:45,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:20:45,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-29 03:20:45,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:20:45,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-11-29 03:20:45,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:20:45,064 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-29 03:20:45,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:20:45,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891677143] [2023-11-29 03:20:45,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891677143] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:20:45,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:20:45,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 03:20:45,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879078730] [2023-11-29 03:20:45,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:20:45,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 03:20:45,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:20:45,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 03:20:45,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-29 03:20:45,067 INFO L87 Difference]: Start difference. First operand 76 states and 106 transitions. Second operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2023-11-29 03:20:45,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:20:45,436 INFO L93 Difference]: Finished difference Result 165 states and 222 transitions. [2023-11-29 03:20:45,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 03:20:45,437 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 125 [2023-11-29 03:20:45,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:20:45,438 INFO L225 Difference]: With dead ends: 165 [2023-11-29 03:20:45,438 INFO L226 Difference]: Without dead ends: 99 [2023-11-29 03:20:45,439 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2023-11-29 03:20:45,440 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 206 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 03:20:45,440 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 152 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 03:20:45,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2023-11-29 03:20:45,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2023-11-29 03:20:45,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 62 states have (on average 1.1290322580645162) internal successors, (70), 63 states have internal predecessors, (70), 30 states have call successors, (30), 5 states have call predecessors, (30), 5 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2023-11-29 03:20:45,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 130 transitions. [2023-11-29 03:20:45,464 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 130 transitions. Word has length 125 [2023-11-29 03:20:45,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:20:45,464 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 130 transitions. [2023-11-29 03:20:45,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2023-11-29 03:20:45,465 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 130 transitions. [2023-11-29 03:20:45,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2023-11-29 03:20:45,466 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:20:45,466 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 03:20:45,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 03:20:45,467 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:20:45,467 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:20:45,467 INFO L85 PathProgramCache]: Analyzing trace with hash 843958690, now seen corresponding path program 1 times [2023-11-29 03:20:45,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:20:45,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855244303] [2023-11-29 03:20:45,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:20:45,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:20:45,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 03:20:45,527 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 03:20:45,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 03:20:45,608 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 03:20:45,609 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 03:20:45,609 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-29 03:20:45,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 03:20:45,614 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:20:45,617 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 03:20:45,684 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated [2023-11-29 03:20:45,686 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet5 could not be translated [2023-11-29 03:20:45,686 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short17 could not be translated [2023-11-29 03:20:45,687 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet16 could not be translated [2023-11-29 03:20:45,687 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short17 could not be translated [2023-11-29 03:20:45,687 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short17 could not be translated [2023-11-29 03:20:45,687 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet16 could not be translated [2023-11-29 03:20:45,687 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short17 could not be translated [2023-11-29 03:20:45,687 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short19 could not be translated [2023-11-29 03:20:45,687 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet16 could not be translated [2023-11-29 03:20:45,726 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 03:20:45 BoogieIcfgContainer [2023-11-29 03:20:45,726 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 03:20:45,727 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 03:20:45,727 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 03:20:45,727 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 03:20:45,727 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 03:20:40" (3/4) ... [2023-11-29 03:20:45,729 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-29 03:20:45,730 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 03:20:45,731 INFO L158 Benchmark]: Toolchain (without parser) took 6610.70ms. Allocated memory was 188.7MB in the beginning and 272.6MB in the end (delta: 83.9MB). Free memory was 158.0MB in the beginning and 240.1MB in the end (delta: -82.2MB). Peak memory consumption was 3.1MB. Max. memory is 16.1GB. [2023-11-29 03:20:45,731 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 188.7MB. Free memory is still 146.2MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 03:20:45,731 INFO L158 Benchmark]: CACSL2BoogieTranslator took 303.95ms. Allocated memory is still 188.7MB. Free memory was 158.0MB in the beginning and 144.5MB in the end (delta: 13.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-29 03:20:45,732 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.44ms. Allocated memory is still 188.7MB. Free memory was 144.5MB in the beginning and 141.2MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 03:20:45,732 INFO L158 Benchmark]: Boogie Preprocessor took 51.80ms. Allocated memory is still 188.7MB. Free memory was 141.2MB in the beginning and 137.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 03:20:45,732 INFO L158 Benchmark]: RCFGBuilder took 485.14ms. Allocated memory is still 188.7MB. Free memory was 137.0MB in the beginning and 114.7MB in the end (delta: 22.2MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2023-11-29 03:20:45,732 INFO L158 Benchmark]: TraceAbstraction took 5705.77ms. Allocated memory was 188.7MB in the beginning and 272.6MB in the end (delta: 83.9MB). Free memory was 113.9MB in the beginning and 240.1MB in the end (delta: -126.2MB). Peak memory consumption was 114.4MB. Max. memory is 16.1GB. [2023-11-29 03:20:45,733 INFO L158 Benchmark]: Witness Printer took 3.49ms. Allocated memory is still 272.6MB. Free memory is still 240.1MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 03:20:45,734 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.19ms. Allocated memory is still 188.7MB. Free memory is still 146.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 303.95ms. Allocated memory is still 188.7MB. Free memory was 158.0MB in the beginning and 144.5MB in the end (delta: 13.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.44ms. Allocated memory is still 188.7MB. Free memory was 144.5MB in the beginning and 141.2MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.80ms. Allocated memory is still 188.7MB. Free memory was 141.2MB in the beginning and 137.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 485.14ms. Allocated memory is still 188.7MB. Free memory was 137.0MB in the beginning and 114.7MB in the end (delta: 22.2MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 5705.77ms. Allocated memory was 188.7MB in the beginning and 272.6MB in the end (delta: 83.9MB). Free memory was 113.9MB in the beginning and 240.1MB in the end (delta: -126.2MB). Peak memory consumption was 114.4MB. Max. memory is 16.1GB. * Witness Printer took 3.49ms. Allocated memory is still 272.6MB. Free memory is still 240.1MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short17 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet16 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short17 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short17 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet16 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short17 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short19 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet16 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * 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 127, overapproximation of someBinaryArithmeticDOUBLEoperation at line 69. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 4; [L23] unsigned short int var_1_8 = 64; [L24] unsigned short int var_1_11 = 256; [L25] unsigned short int var_1_12 = 0; [L26] unsigned short int var_1_13 = 64; [L27] unsigned char var_1_14 = 1; [L28] unsigned char var_1_15 = 0; [L29] signed char var_1_16 = 50; [L30] signed char var_1_19 = -100; [L31] double var_1_20 = 100000000.8; [L32] double var_1_21 = 15.125; [L33] double var_1_22 = 99.22; [L34] signed long int var_1_23 = -16; [L35] unsigned char var_1_24 = 1; [L36] signed char var_1_25 = 10; [L37] signed char var_1_26 = 16; [L38] unsigned char var_1_27 = 0; [L39] double var_1_28 = 5.5; [L40] signed short int last_1_var_1_1 = 4; [L41] unsigned char last_1_var_1_14 = 1; [L42] signed char last_1_var_1_16 = 50; [L43] signed long int last_1_var_1_23 = -16; [L44] unsigned char last_1_var_1_24 = 1; [L45] double last_1_var_1_28 = 5.5; [L131] isInitial = 1 [L132] FCALL initially() [L133] COND TRUE 1 [L134] CALL updateLastVariables() [L119] last_1_var_1_1 = var_1_1 [L120] last_1_var_1_14 = var_1_14 [L121] last_1_var_1_16 = var_1_16 [L122] last_1_var_1_23 = var_1_23 [L123] last_1_var_1_24 = var_1_24 [L124] last_1_var_1_28 = var_1_28 [L134] RET updateLastVariables() [L135] CALL updateVariables() [L89] var_1_11 = __VERIFIER_nondet_ushort() [L90] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L90] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L91] CALL assume_abort_if_not(var_1_11 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L91] RET assume_abort_if_not(var_1_11 <= 32767) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L92] var_1_12 = __VERIFIER_nondet_ushort() [L93] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L93] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L94] CALL assume_abort_if_not(var_1_12 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L94] RET assume_abort_if_not(var_1_12 <= 32767) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L95] var_1_13 = __VERIFIER_nondet_ushort() [L96] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=0, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=0, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L96] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=0, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L97] CALL assume_abort_if_not(var_1_13 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=0, var_1_13=32767, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=0, var_1_13=32767, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L97] RET assume_abort_if_not(var_1_13 <= 65534) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=0, var_1_13=32767, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L98] var_1_15 = __VERIFIER_nondet_uchar() [L99] CALL assume_abort_if_not(var_1_15 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=0, var_1_13=32767, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=0, var_1_13=32767, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L99] RET assume_abort_if_not(var_1_15 >= 1) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=0, var_1_13=32767, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L100] CALL assume_abort_if_not(var_1_15 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=0, var_1_13=32767, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=0, var_1_13=32767, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L100] RET assume_abort_if_not(var_1_15 <= 1) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=0, var_1_13=32767, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L101] var_1_19 = __VERIFIER_nondet_char() [L102] CALL assume_abort_if_not(var_1_19 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=0, var_1_13=32767, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=0, var_1_13=32767, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L102] RET assume_abort_if_not(var_1_19 >= -127) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=0, var_1_13=32767, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L103] CALL assume_abort_if_not(var_1_19 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=0, var_1_13=32767, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=0, var_1_13=32767, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L103] RET assume_abort_if_not(var_1_19 <= 126) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=0, var_1_13=32767, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L104] var_1_21 = __VERIFIER_nondet_double() [L105] CALL assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=0, var_1_13=32767, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=0, var_1_13=32767, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L105] RET assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=0, var_1_13=32767, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L106] var_1_22 = __VERIFIER_nondet_double() [L107] CALL assume_abort_if_not((var_1_22 >= 0.0F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 4611686.018427382800e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=0, var_1_13=32767, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=0, var_1_13=32767, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L107] RET assume_abort_if_not((var_1_22 >= 0.0F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 4611686.018427382800e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=0, var_1_13=32767, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L108] var_1_25 = __VERIFIER_nondet_char() [L109] CALL assume_abort_if_not(var_1_25 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=0, var_1_13=32767, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=0, var_1_13=32767, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L109] RET assume_abort_if_not(var_1_25 >= -1) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=0, var_1_13=32767, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L110] CALL assume_abort_if_not(var_1_25 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=0, var_1_13=32767, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=0, var_1_13=32767, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L110] RET assume_abort_if_not(var_1_25 <= 127) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=0, var_1_13=32767, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L111] var_1_26 = __VERIFIER_nondet_char() [L112] CALL assume_abort_if_not(var_1_26 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=0, var_1_13=32767, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=127, var_1_27=0, var_1_28=11/2, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=0, var_1_13=32767, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=127, var_1_27=0, var_1_28=11/2, var_1_8=64] [L112] RET assume_abort_if_not(var_1_26 >= 0) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=0, var_1_13=32767, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=127, var_1_27=0, var_1_28=11/2, var_1_8=64] [L113] CALL assume_abort_if_not(var_1_26 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=0, var_1_13=32767, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=127, var_1_27=0, var_1_28=11/2, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=0, var_1_13=32767, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=127, var_1_27=0, var_1_28=11/2, var_1_8=64] [L113] RET assume_abort_if_not(var_1_26 <= 127) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=0, var_1_13=32767, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=127, var_1_27=0, var_1_28=11/2, var_1_8=64] [L114] var_1_27 = __VERIFIER_nondet_uchar() [L115] CALL assume_abort_if_not(var_1_27 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=0, var_1_13=32767, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=127, var_1_28=11/2, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=0, var_1_13=32767, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=127, var_1_28=11/2, var_1_8=64] [L115] RET assume_abort_if_not(var_1_27 >= 0) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=0, var_1_13=32767, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=127, var_1_28=11/2, var_1_8=64] [L116] CALL assume_abort_if_not(var_1_27 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=0, var_1_13=32767, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=127, var_1_27=0, var_1_28=11/2, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=0, var_1_13=32767, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=127, var_1_27=0, var_1_28=11/2, var_1_8=64] [L116] RET assume_abort_if_not(var_1_27 <= 0) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=0, var_1_13=32767, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=127, var_1_27=0, var_1_28=11/2, var_1_8=64] [L135] RET updateVariables() [L136] CALL step() [L49] signed long int stepLocal_3 = last_1_var_1_23; [L50] unsigned char stepLocal_2 = ! (last_1_var_1_14 || last_1_var_1_14); VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, stepLocal_2=0, stepLocal_3=-16, var_1_11=32767, var_1_12=0, var_1_13=32767, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=127, var_1_27=0, var_1_28=11/2, var_1_8=64] [L51] COND FALSE !(last_1_var_1_23 < stepLocal_3) [L62] var_1_16 = 100 VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, stepLocal_2=0, stepLocal_3=-16, var_1_11=32767, var_1_12=0, var_1_13=32767, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=127, var_1_27=0, var_1_28=11/2, var_1_8=64] [L64] EXPR ((((last_1_var_1_1) > (last_1_var_1_16)) ? (last_1_var_1_1) : (last_1_var_1_16))) | last_1_var_1_16 VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, stepLocal_2=0, stepLocal_3=-16, var_1_11=32767, var_1_12=0, var_1_13=32767, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=127, var_1_27=0, var_1_28=11/2, var_1_8=64] [L64] COND TRUE (((((last_1_var_1_1) > (last_1_var_1_16)) ? (last_1_var_1_1) : (last_1_var_1_16))) | last_1_var_1_16) >= last_1_var_1_23 [L65] var_1_23 = (5 - var_1_12) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, stepLocal_2=0, stepLocal_3=-16, var_1_11=32767, var_1_12=0, var_1_13=32767, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=5, var_1_24=1, var_1_25=-1, var_1_26=127, var_1_27=0, var_1_28=11/2, var_1_8=64] [L69] var_1_20 = (var_1_21 - (var_1_22 + 1.5)) [L70] var_1_28 = var_1_21 [L71] unsigned char stepLocal_0 = var_1_23 > 4; VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, stepLocal_0=1, stepLocal_2=0, stepLocal_3=-16, var_1_11=32767, var_1_12=0, var_1_13=32767, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=4, var_1_21=100000005, var_1_23=5, var_1_24=1, var_1_25=-1, var_1_26=127, var_1_27=0, var_1_28=100000005, var_1_8=64] [L72] COND TRUE (var_1_23 <= var_1_23) || stepLocal_0 [L73] var_1_1 = (((((var_1_16 + (var_1_16 + var_1_16))) > (-100)) ? ((var_1_16 + (var_1_16 + var_1_16))) : (-100))) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, stepLocal_0=1, stepLocal_2=0, stepLocal_3=-16, var_1_11=32767, var_1_12=0, var_1_13=32767, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=300, var_1_21=100000005, var_1_23=5, var_1_24=1, var_1_25=-1, var_1_26=127, var_1_27=0, var_1_28=100000005, var_1_8=64] [L77] var_1_24 = ((var_1_1 <= (var_1_25 - var_1_26)) && var_1_27) [L78] signed char stepLocal_1 = var_1_16; VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, stepLocal_0=1, stepLocal_1=100, stepLocal_2=0, stepLocal_3=-16, var_1_11=32767, var_1_12=0, var_1_13=32767, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=300, var_1_21=100000005, var_1_23=5, var_1_24=0, var_1_25=-1, var_1_26=127, var_1_27=0, var_1_28=100000005, var_1_8=64] [L79] EXPR var_1_16 ^ var_1_16 VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, stepLocal_0=1, stepLocal_1=100, stepLocal_2=0, stepLocal_3=-16, var_1_11=32767, var_1_12=0, var_1_13=32767, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=300, var_1_21=100000005, var_1_23=5, var_1_24=0, var_1_25=-1, var_1_26=127, var_1_27=0, var_1_28=100000005, var_1_8=64] [L79] COND TRUE stepLocal_1 > (var_1_23 + (var_1_16 ^ var_1_16)) [L80] var_1_14 = (var_1_24 || var_1_15) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, stepLocal_0=1, stepLocal_1=100, stepLocal_2=0, stepLocal_3=-16, var_1_11=32767, var_1_12=0, var_1_13=32767, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=300, var_1_21=100000005, var_1_23=5, var_1_24=0, var_1_25=-1, var_1_26=127, var_1_27=0, var_1_28=100000005, var_1_8=64] [L82] COND TRUE \read(var_1_14) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, stepLocal_0=1, stepLocal_1=100, stepLocal_2=0, stepLocal_3=-16, var_1_11=32767, var_1_12=0, var_1_13=32767, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=300, var_1_21=100000005, var_1_23=5, var_1_24=0, var_1_25=-1, var_1_26=127, var_1_27=0, var_1_28=100000005, var_1_8=64] [L83] COND FALSE !(\read(var_1_24)) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, stepLocal_0=1, stepLocal_1=100, stepLocal_2=0, stepLocal_3=-16, var_1_11=32767, var_1_12=0, var_1_13=32767, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=300, var_1_21=100000005, var_1_23=5, var_1_24=0, var_1_25=-1, var_1_26=127, var_1_27=0, var_1_28=100000005, var_1_8=64] [L136] RET step() [L137] CALL, EXPR property() [L127] EXPR ((((var_1_23 <= var_1_23) || (var_1_23 > 4)) ? (var_1_1 == ((signed short int) (((((var_1_16 + (var_1_16 + var_1_16))) > (-100)) ? ((var_1_16 + (var_1_16 + var_1_16))) : (-100))))) : (var_1_1 == ((signed short int) var_1_16))) && (var_1_14 ? (var_1_24 ? (var_1_8 == ((unsigned short int) (((((var_1_11 + var_1_12)) > (var_1_13)) ? ((var_1_11 + var_1_12)) : (var_1_13))))) : 1) : 1)) && ((var_1_16 > (var_1_23 + (var_1_16 ^ var_1_16))) ? (var_1_14 == ((unsigned char) (var_1_24 || var_1_15))) : 1) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=0, var_1_13=32767, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=300, var_1_21=100000005, var_1_23=5, var_1_24=0, var_1_25=-1, var_1_26=127, var_1_27=0, var_1_28=100000005, var_1_8=64] [L127] EXPR var_1_16 ^ var_1_16 VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=0, var_1_13=32767, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=300, var_1_21=100000005, var_1_23=5, var_1_24=0, var_1_25=-1, var_1_26=127, var_1_27=0, var_1_28=100000005, var_1_8=64] [L127] EXPR ((((var_1_23 <= var_1_23) || (var_1_23 > 4)) ? (var_1_1 == ((signed short int) (((((var_1_16 + (var_1_16 + var_1_16))) > (-100)) ? ((var_1_16 + (var_1_16 + var_1_16))) : (-100))))) : (var_1_1 == ((signed short int) var_1_16))) && (var_1_14 ? (var_1_24 ? (var_1_8 == ((unsigned short int) (((((var_1_11 + var_1_12)) > (var_1_13)) ? ((var_1_11 + var_1_12)) : (var_1_13))))) : 1) : 1)) && ((var_1_16 > (var_1_23 + (var_1_16 ^ var_1_16))) ? (var_1_14 == ((unsigned char) (var_1_24 || var_1_15))) : 1) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=0, var_1_13=32767, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=300, var_1_21=100000005, var_1_23=5, var_1_24=0, var_1_25=-1, var_1_26=127, var_1_27=0, var_1_28=100000005, var_1_8=64] [L127] EXPR (((((((var_1_23 <= var_1_23) || (var_1_23 > 4)) ? (var_1_1 == ((signed short int) (((((var_1_16 + (var_1_16 + var_1_16))) > (-100)) ? ((var_1_16 + (var_1_16 + var_1_16))) : (-100))))) : (var_1_1 == ((signed short int) var_1_16))) && (var_1_14 ? (var_1_24 ? (var_1_8 == ((unsigned short int) (((((var_1_11 + var_1_12)) > (var_1_13)) ? ((var_1_11 + var_1_12)) : (var_1_13))))) : 1) : 1)) && ((var_1_16 > (var_1_23 + (var_1_16 ^ var_1_16))) ? (var_1_14 == ((unsigned char) (var_1_24 || var_1_15))) : 1)) && ((last_1_var_1_23 < last_1_var_1_23) ? (((! (last_1_var_1_14 || last_1_var_1_14)) && last_1_var_1_24) ? ((((((2.75f) > (((((last_1_var_1_28) < (999999.95f)) ? (last_1_var_1_28) : (999999.95f))))) ? (2.75f) : (((((last_1_var_1_28) < (999999.95f)) ? (last_1_var_1_28) : (999999.95f)))))) != last_1_var_1_28) ? (var_1_16 == ((signed char) 10)) : (var_1_16 == ((signed char) var_1_19))) : (var_1_16 == ((signed char) var_1_19))) : (var_1_16 == ((signed char) 100)))) && (var_1_20 == ((double) (var_1_21 - (var_1_22 + 1.5))))) && (((((((last_1_var_1_1) > (last_1_var_1_16)) ? (last_1_var_1_1) : (last_1_var_1_16))) | last_1_var_1_16) >= last_1_var_1_23) ? (var_1_23 == ((signed long int) (5 - var_1_12))) : (var_1_23 == ((signed long int) ((((var_1_11) > (last_1_var_1_1)) ? (var_1_11) : (last_1_var_1_1)))))) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=0, var_1_13=32767, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=300, var_1_21=100000005, var_1_23=5, var_1_24=0, var_1_25=-1, var_1_26=127, var_1_27=0, var_1_28=100000005, var_1_8=64] [L127-L128] return (((((((((var_1_23 <= var_1_23) || (var_1_23 > 4)) ? (var_1_1 == ((signed short int) (((((var_1_16 + (var_1_16 + var_1_16))) > (-100)) ? ((var_1_16 + (var_1_16 + var_1_16))) : (-100))))) : (var_1_1 == ((signed short int) var_1_16))) && (var_1_14 ? (var_1_24 ? (var_1_8 == ((unsigned short int) (((((var_1_11 + var_1_12)) > (var_1_13)) ? ((var_1_11 + var_1_12)) : (var_1_13))))) : 1) : 1)) && ((var_1_16 > (var_1_23 + (var_1_16 ^ var_1_16))) ? (var_1_14 == ((unsigned char) (var_1_24 || var_1_15))) : 1)) && ((last_1_var_1_23 < last_1_var_1_23) ? (((! (last_1_var_1_14 || last_1_var_1_14)) && last_1_var_1_24) ? ((((((2.75f) > (((((last_1_var_1_28) < (999999.95f)) ? (last_1_var_1_28) : (999999.95f))))) ? (2.75f) : (((((last_1_var_1_28) < (999999.95f)) ? (last_1_var_1_28) : (999999.95f)))))) != last_1_var_1_28) ? (var_1_16 == ((signed char) 10)) : (var_1_16 == ((signed char) var_1_19))) : (var_1_16 == ((signed char) var_1_19))) : (var_1_16 == ((signed char) 100)))) && (var_1_20 == ((double) (var_1_21 - (var_1_22 + 1.5))))) && (((((((last_1_var_1_1) > (last_1_var_1_16)) ? (last_1_var_1_1) : (last_1_var_1_16))) | last_1_var_1_16) >= last_1_var_1_23) ? (var_1_23 == ((signed long int) (5 - var_1_12))) : (var_1_23 == ((signed long int) ((((var_1_11) > (last_1_var_1_1)) ? (var_1_11) : (last_1_var_1_1))))))) && (var_1_24 == ((unsigned char) ((var_1_1 <= (var_1_25 - var_1_26)) && var_1_27)))) && (var_1_28 == ((double) var_1_21)) ; [L137] RET, EXPR property() [L137] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=0, var_1_13=32767, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=300, var_1_21=100000005, var_1_23=5, var_1_24=0, var_1_25=-1, var_1_26=127, var_1_27=0, var_1_28=100000005, var_1_8=64] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=0, var_1_13=32767, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=300, var_1_21=100000005, var_1_23=5, var_1_24=0, var_1_25=-1, var_1_26=127, var_1_27=0, var_1_28=100000005, var_1_8=64] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 67 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.5s, OverallIterations: 7, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 642 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 618 mSDsluCounter, 1181 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 533 mSDsCounter, 220 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 439 IncrementalHoareTripleChecker+Invalid, 659 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 220 mSolverCounterUnsat, 648 mSDtfsCounter, 439 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 524 GetRequests, 492 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=98occurred in iteration=6, InterpolantAutomatonStates: 31, 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, 6 MinimizatonAttempts, 88 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 973 NumberOfCodeBlocks, 973 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 964 ConstructedInterpolants, 0 QuantifiedInterpolants, 3388 SizeOfPredicates, 5 NumberOfNonLiveVariables, 311 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 8 InterpolantComputations, 5 PerfectInterpolantSequences, 4797/4896 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-29 03:20:45,754 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbd71a70-b7f1-4312-a7ba-f3d5576ed13e/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with 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-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbd71a70-b7f1-4312-a7ba-f3d5576ed13e/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbd71a70-b7f1-4312-a7ba-f3d5576ed13e/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbd71a70-b7f1-4312-a7ba-f3d5576ed13e/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbd71a70-b7f1-4312-a7ba-f3d5576ed13e/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-65.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbd71a70-b7f1-4312-a7ba-f3d5576ed13e/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbd71a70-b7f1-4312-a7ba-f3d5576ed13e/bin/uautomizer-verify-BQ2R08f2Ya --witnessprinter.witness.filename witness --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 fc224bde26358da9997f9941009f63e79d979df8df0c5e0ccdb6f1d2abc5adfc --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 03:20:47,623 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 03:20:47,700 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbd71a70-b7f1-4312-a7ba-f3d5576ed13e/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-11-29 03:20:47,706 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 03:20:47,707 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 03:20:47,733 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 03:20:47,734 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 03:20:47,734 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 03:20:47,735 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 03:20:47,736 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 03:20:47,736 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 03:20:47,737 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 03:20:47,737 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 03:20:47,738 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 03:20:47,738 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 03:20:47,739 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 03:20:47,740 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 03:20:47,740 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 03:20:47,741 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 03:20:47,741 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 03:20:47,742 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 03:20:47,742 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 03:20:47,743 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 03:20:47,743 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 03:20:47,743 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-29 03:20:47,744 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-29 03:20:47,744 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 03:20:47,745 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 03:20:47,745 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 03:20:47,746 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 03:20:47,746 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 03:20:47,746 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 03:20:47,747 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 03:20:47,747 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 03:20:47,747 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 03:20:47,747 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 03:20:47,748 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 03:20:47,748 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-29 03:20:47,748 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-29 03:20:47,748 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 03:20:47,748 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 03:20:47,749 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 03:20:47,749 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 03:20:47,749 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 03:20:47,749 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-29 03:20:47,749 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_bbd71a70-b7f1-4312-a7ba-f3d5576ed13e/bin/uautomizer-verify-BQ2R08f2Ya/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_bbd71a70-b7f1-4312-a7ba-f3d5576ed13e/bin/uautomizer-verify-BQ2R08f2Ya Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> fc224bde26358da9997f9941009f63e79d979df8df0c5e0ccdb6f1d2abc5adfc [2023-11-29 03:20:48,035 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 03:20:48,055 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 03:20:48,058 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 03:20:48,059 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 03:20:48,059 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 03:20:48,061 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbd71a70-b7f1-4312-a7ba-f3d5576ed13e/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-65.i [2023-11-29 03:20:50,856 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 03:20:51,027 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 03:20:51,028 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbd71a70-b7f1-4312-a7ba-f3d5576ed13e/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-65.i [2023-11-29 03:20:51,038 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbd71a70-b7f1-4312-a7ba-f3d5576ed13e/bin/uautomizer-verify-BQ2R08f2Ya/data/70c08345f/c6a08b1e2cf948769ef06d8d367d4fae/FLAG2f8af9c11 [2023-11-29 03:20:51,052 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbd71a70-b7f1-4312-a7ba-f3d5576ed13e/bin/uautomizer-verify-BQ2R08f2Ya/data/70c08345f/c6a08b1e2cf948769ef06d8d367d4fae [2023-11-29 03:20:51,054 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 03:20:51,056 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 03:20:51,057 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 03:20:51,057 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 03:20:51,062 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 03:20:51,063 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 03:20:51" (1/1) ... [2023-11-29 03:20:51,064 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49b2c476 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:20:51, skipping insertion in model container [2023-11-29 03:20:51,064 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 03:20:51" (1/1) ... [2023-11-29 03:20:51,094 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 03:20:51,242 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_bbd71a70-b7f1-4312-a7ba-f3d5576ed13e/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-65.i[913,926] [2023-11-29 03:20:51,303 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 03:20:51,319 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 03:20:51,331 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_bbd71a70-b7f1-4312-a7ba-f3d5576ed13e/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-65.i[913,926] [2023-11-29 03:20:51,360 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 03:20:51,378 INFO L206 MainTranslator]: Completed translation [2023-11-29 03:20:51,379 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:20:51 WrapperNode [2023-11-29 03:20:51,379 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 03:20:51,380 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 03:20:51,380 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 03:20:51,380 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 03:20:51,387 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:20:51" (1/1) ... [2023-11-29 03:20:51,400 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:20:51" (1/1) ... [2023-11-29 03:20:51,428 INFO L138 Inliner]: procedures = 27, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 137 [2023-11-29 03:20:51,428 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 03:20:51,429 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 03:20:51,429 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 03:20:51,429 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 03:20:51,441 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:20:51" (1/1) ... [2023-11-29 03:20:51,441 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:20:51" (1/1) ... [2023-11-29 03:20:51,446 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:20:51" (1/1) ... [2023-11-29 03:20:51,459 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-11-29 03:20:51,459 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:20:51" (1/1) ... [2023-11-29 03:20:51,460 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:20:51" (1/1) ... [2023-11-29 03:20:51,470 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:20:51" (1/1) ... [2023-11-29 03:20:51,473 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:20:51" (1/1) ... [2023-11-29 03:20:51,476 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:20:51" (1/1) ... [2023-11-29 03:20:51,478 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:20:51" (1/1) ... [2023-11-29 03:20:51,483 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 03:20:51,484 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 03:20:51,484 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 03:20:51,484 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 03:20:51,485 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:20:51" (1/1) ... [2023-11-29 03:20:51,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 03:20:51,502 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbd71a70-b7f1-4312-a7ba-f3d5576ed13e/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:20:51,513 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbd71a70-b7f1-4312-a7ba-f3d5576ed13e/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 03:20:51,517 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbd71a70-b7f1-4312-a7ba-f3d5576ed13e/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 03:20:51,546 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 03:20:51,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-29 03:20:51,547 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-29 03:20:51,547 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-29 03:20:51,547 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 03:20:51,547 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 03:20:51,636 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 03:20:51,639 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 03:20:53,075 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 03:20:53,123 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 03:20:53,123 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-29 03:20:53,123 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 03:20:53 BoogieIcfgContainer [2023-11-29 03:20:53,124 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 03:20:53,127 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 03:20:53,127 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 03:20:53,130 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 03:20:53,131 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 03:20:51" (1/3) ... [2023-11-29 03:20:53,131 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11937678 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 03:20:53, skipping insertion in model container [2023-11-29 03:20:53,132 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:20:51" (2/3) ... [2023-11-29 03:20:53,132 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11937678 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 03:20:53, skipping insertion in model container [2023-11-29 03:20:53,132 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 03:20:53" (3/3) ... [2023-11-29 03:20:53,133 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_normal_file-65.i [2023-11-29 03:20:53,153 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 03:20:53,153 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 03:20:53,200 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 03:20:53,206 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=LoopHeads, 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;@7208742f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 03:20:53,207 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 03:20:53,211 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 30 states have (on average 1.4333333333333333) internal successors, (43), 31 states have internal predecessors, (43), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-11-29 03:20:53,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-11-29 03:20:53,224 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:20:53,225 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 03:20:53,225 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:20:53,230 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:20:53,231 INFO L85 PathProgramCache]: Analyzing trace with hash -332515944, now seen corresponding path program 1 times [2023-11-29 03:20:53,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:20:53,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [339561064] [2023-11-29 03:20:53,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:20:53,245 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-29 03:20:53,245 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbd71a70-b7f1-4312-a7ba-f3d5576ed13e/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:20:53,268 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbd71a70-b7f1-4312-a7ba-f3d5576ed13e/bin/uautomizer-verify-BQ2R08f2Ya/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-29 03:20:53,270 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbd71a70-b7f1-4312-a7ba-f3d5576ed13e/bin/uautomizer-verify-BQ2R08f2Ya/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-29 03:20:53,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:20:53,581 INFO L262 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-29 03:20:53,591 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:20:53,631 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 314 proven. 0 refuted. 0 times theorem prover too weak. 298 trivial. 0 not checked. [2023-11-29 03:20:53,632 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:20:53,632 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:20:53,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [339561064] [2023-11-29 03:20:53,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [339561064] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:20:53,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:20:53,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 03:20:53,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302833621] [2023-11-29 03:20:53,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:20:53,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 03:20:53,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:20:53,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 03:20:53,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 03:20:53,667 INFO L87 Difference]: Start difference. First operand has 51 states, 30 states have (on average 1.4333333333333333) internal successors, (43), 31 states have internal predecessors, (43), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) 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, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2023-11-29 03:20:54,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:20:54,307 INFO L93 Difference]: Finished difference Result 99 states and 174 transitions. [2023-11-29 03:20:54,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 03:20:54,322 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, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 112 [2023-11-29 03:20:54,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:20:54,327 INFO L225 Difference]: With dead ends: 99 [2023-11-29 03:20:54,328 INFO L226 Difference]: Without dead ends: 49 [2023-11-29 03:20:54,330 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 111 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-29 03:20:54,332 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-29 03:20:54,333 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 70 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-29 03:20:54,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2023-11-29 03:20:54,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2023-11-29 03:20:54,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 29 states have internal predecessors, (37), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-11-29 03:20:54,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 73 transitions. [2023-11-29 03:20:54,364 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 73 transitions. Word has length 112 [2023-11-29 03:20:54,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:20:54,365 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 73 transitions. [2023-11-29 03:20:54,365 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, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2023-11-29 03:20:54,365 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 73 transitions. [2023-11-29 03:20:54,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-11-29 03:20:54,367 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:20:54,367 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 03:20:54,375 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbd71a70-b7f1-4312-a7ba-f3d5576ed13e/bin/uautomizer-verify-BQ2R08f2Ya/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-29 03:20:54,568 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbd71a70-b7f1-4312-a7ba-f3d5576ed13e/bin/uautomizer-verify-BQ2R08f2Ya/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-29 03:20:54,568 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:20:54,569 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:20:54,569 INFO L85 PathProgramCache]: Analyzing trace with hash 244131100, now seen corresponding path program 1 times [2023-11-29 03:20:54,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:20:54,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [557809292] [2023-11-29 03:20:54,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:20:54,571 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-29 03:20:54,571 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbd71a70-b7f1-4312-a7ba-f3d5576ed13e/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:20:54,572 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbd71a70-b7f1-4312-a7ba-f3d5576ed13e/bin/uautomizer-verify-BQ2R08f2Ya/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-29 03:20:54,573 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbd71a70-b7f1-4312-a7ba-f3d5576ed13e/bin/uautomizer-verify-BQ2R08f2Ya/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-29 03:20:54,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:20:54,826 INFO L262 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 03:20:54,832 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:20:55,188 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-29 03:20:55,188 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:20:55,188 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:20:55,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [557809292] [2023-11-29 03:20:55,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [557809292] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:20:55,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:20:55,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 03:20:55,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598315411] [2023-11-29 03:20:55,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:20:55,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 03:20:55,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:20:55,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 03:20:55,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:20:55,193 INFO L87 Difference]: Start difference. First operand 49 states and 73 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 2 states have internal predecessors, (25), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-29 03:20:56,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:20:56,079 INFO L93 Difference]: Finished difference Result 145 states and 217 transitions. [2023-11-29 03:20:56,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 03:20:56,080 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 2 states have internal predecessors, (25), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 112 [2023-11-29 03:20:56,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:20:56,083 INFO L225 Difference]: With dead ends: 145 [2023-11-29 03:20:56,083 INFO L226 Difference]: Without dead ends: 97 [2023-11-29 03:20:56,084 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:20:56,085 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 14 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-29 03:20:56,086 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 140 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-29 03:20:56,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2023-11-29 03:20:56,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 95. [2023-11-29 03:20:56,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 56 states have (on average 1.2678571428571428) internal successors, (71), 56 states have internal predecessors, (71), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-11-29 03:20:56,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 143 transitions. [2023-11-29 03:20:56,117 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 143 transitions. Word has length 112 [2023-11-29 03:20:56,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:20:56,118 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 143 transitions. [2023-11-29 03:20:56,118 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 2 states have internal predecessors, (25), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-29 03:20:56,118 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 143 transitions. [2023-11-29 03:20:56,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-11-29 03:20:56,120 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:20:56,121 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 03:20:56,127 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbd71a70-b7f1-4312-a7ba-f3d5576ed13e/bin/uautomizer-verify-BQ2R08f2Ya/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)] Ended with exit code 0 [2023-11-29 03:20:56,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbd71a70-b7f1-4312-a7ba-f3d5576ed13e/bin/uautomizer-verify-BQ2R08f2Ya/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-29 03:20:56,322 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:20:56,322 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:20:56,322 INFO L85 PathProgramCache]: Analyzing trace with hash 242284058, now seen corresponding path program 1 times [2023-11-29 03:20:56,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:20:56,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [134435912] [2023-11-29 03:20:56,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:20:56,323 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-29 03:20:56,323 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbd71a70-b7f1-4312-a7ba-f3d5576ed13e/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:20:56,324 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbd71a70-b7f1-4312-a7ba-f3d5576ed13e/bin/uautomizer-verify-BQ2R08f2Ya/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-29 03:20:56,325 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbd71a70-b7f1-4312-a7ba-f3d5576ed13e/bin/uautomizer-verify-BQ2R08f2Ya/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-29 03:20:56,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:20:56,640 INFO L262 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 03:20:56,645 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:20:56,952 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 293 proven. 33 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2023-11-29 03:20:56,952 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:20:57,254 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 18 proven. 33 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2023-11-29 03:20:57,254 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:20:57,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [134435912] [2023-11-29 03:20:57,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [134435912] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 03:20:57,255 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 03:20:57,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2023-11-29 03:20:57,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23328004] [2023-11-29 03:20:57,255 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 03:20:57,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 03:20:57,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:20:57,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 03:20:57,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-11-29 03:20:57,258 INFO L87 Difference]: Start difference. First operand 95 states and 143 transitions. Second operand has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 2 states have call successors, (29), 2 states have call predecessors, (29), 4 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2023-11-29 03:20:58,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:20:58,321 INFO L93 Difference]: Finished difference Result 167 states and 243 transitions. [2023-11-29 03:20:58,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 03:20:58,322 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 2 states have call successors, (29), 2 states have call predecessors, (29), 4 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) Word has length 112 [2023-11-29 03:20:58,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:20:58,325 INFO L225 Difference]: With dead ends: 167 [2023-11-29 03:20:58,325 INFO L226 Difference]: Without dead ends: 119 [2023-11-29 03:20:58,326 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 215 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2023-11-29 03:20:58,328 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 105 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-29 03:20:58,328 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 122 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-29 03:20:58,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2023-11-29 03:20:58,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 112. [2023-11-29 03:20:58,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 65 states have (on average 1.2153846153846153) internal successors, (79), 66 states have internal predecessors, (79), 42 states have call successors, (42), 4 states have call predecessors, (42), 4 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2023-11-29 03:20:58,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 163 transitions. [2023-11-29 03:20:58,352 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 163 transitions. Word has length 112 [2023-11-29 03:20:58,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:20:58,353 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 163 transitions. [2023-11-29 03:20:58,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 2 states have call successors, (29), 2 states have call predecessors, (29), 4 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2023-11-29 03:20:58,353 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 163 transitions. [2023-11-29 03:20:58,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-11-29 03:20:58,355 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:20:58,356 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 03:20:58,362 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbd71a70-b7f1-4312-a7ba-f3d5576ed13e/bin/uautomizer-verify-BQ2R08f2Ya/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)] Ended with exit code 0 [2023-11-29 03:20:58,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbd71a70-b7f1-4312-a7ba-f3d5576ed13e/bin/uautomizer-verify-BQ2R08f2Ya/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-29 03:20:58,561 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:20:58,561 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:20:58,561 INFO L85 PathProgramCache]: Analyzing trace with hash -1031490062, now seen corresponding path program 1 times [2023-11-29 03:20:58,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:20:58,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [173488828] [2023-11-29 03:20:58,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:20:58,562 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-29 03:20:58,562 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbd71a70-b7f1-4312-a7ba-f3d5576ed13e/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:20:58,563 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbd71a70-b7f1-4312-a7ba-f3d5576ed13e/bin/uautomizer-verify-BQ2R08f2Ya/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-29 03:20:58,564 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbd71a70-b7f1-4312-a7ba-f3d5576ed13e/bin/uautomizer-verify-BQ2R08f2Ya/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-29 03:20:58,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:20:58,791 INFO L262 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 03:20:58,795 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:20:58,887 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2023-11-29 03:20:58,887 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:20:58,888 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:20:58,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [173488828] [2023-11-29 03:20:58,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [173488828] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:20:58,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:20:58,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 03:20:58,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011282550] [2023-11-29 03:20:58,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:20:58,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 03:20:58,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:20:58,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 03:20:58,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 03:20:58,891 INFO L87 Difference]: Start difference. First operand 112 states and 163 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (18), 1 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-29 03:21:00,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:21:00,619 INFO L93 Difference]: Finished difference Result 275 states and 382 transitions. [2023-11-29 03:21:00,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-29 03:21:00,620 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (18), 1 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 1 states have call successors, (18) Word has length 113 [2023-11-29 03:21:00,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:21:00,623 INFO L225 Difference]: With dead ends: 275 [2023-11-29 03:21:00,623 INFO L226 Difference]: Without dead ends: 173 [2023-11-29 03:21:00,625 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2023-11-29 03:21:00,626 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 94 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-11-29 03:21:00,627 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 217 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2023-11-29 03:21:00,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2023-11-29 03:21:00,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 90. [2023-11-29 03:21:00,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 50 states have (on average 1.12) internal successors, (56), 51 states have internal predecessors, (56), 34 states have call successors, (34), 5 states have call predecessors, (34), 5 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2023-11-29 03:21:00,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 124 transitions. [2023-11-29 03:21:00,652 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 124 transitions. Word has length 113 [2023-11-29 03:21:00,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:21:00,652 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 124 transitions. [2023-11-29 03:21:00,653 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (18), 1 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-29 03:21:00,653 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 124 transitions. [2023-11-29 03:21:00,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-11-29 03:21:00,655 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:21:00,655 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 03:21:00,663 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbd71a70-b7f1-4312-a7ba-f3d5576ed13e/bin/uautomizer-verify-BQ2R08f2Ya/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)] Ended with exit code 0 [2023-11-29 03:21:00,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbd71a70-b7f1-4312-a7ba-f3d5576ed13e/bin/uautomizer-verify-BQ2R08f2Ya/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-29 03:21:00,861 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:21:00,861 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:21:00,861 INFO L85 PathProgramCache]: Analyzing trace with hash -1031430480, now seen corresponding path program 1 times [2023-11-29 03:21:00,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:21:00,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [133229853] [2023-11-29 03:21:00,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:21:00,862 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-29 03:21:00,862 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbd71a70-b7f1-4312-a7ba-f3d5576ed13e/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:21:00,863 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbd71a70-b7f1-4312-a7ba-f3d5576ed13e/bin/uautomizer-verify-BQ2R08f2Ya/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-29 03:21:00,864 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbd71a70-b7f1-4312-a7ba-f3d5576ed13e/bin/uautomizer-verify-BQ2R08f2Ya/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-29 03:21:01,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:21:01,169 INFO L262 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 31 conjunts are in the unsatisfiable core [2023-11-29 03:21:01,175 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:21:31,027 WARN L293 SmtUtils]: Spent 10.03s on a formula simplification that was a NOOP. DAG size: 58 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 03:21:58,609 WARN L293 SmtUtils]: Spent 11.38s on a formula simplification that was a NOOP. DAG size: 64 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 03:22:28,574 WARN L293 SmtUtils]: Spent 13.15s on a formula simplification that was a NOOP. DAG size: 67 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)