./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-81.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a0165632 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_7503ef54-bcb0-4c82-8fd8-e02210764b75/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7503ef54-bcb0-4c82-8fd8-e02210764b75/bin/uautomizer-verify-jihMAELWvX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7503ef54-bcb0-4c82-8fd8-e02210764b75/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7503ef54-bcb0-4c82-8fd8-e02210764b75/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-81.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7503ef54-bcb0-4c82-8fd8-e02210764b75/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7503ef54-bcb0-4c82-8fd8-e02210764b75/bin/uautomizer-verify-jihMAELWvX --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 fccf2d2c93d03d1017d49983a9fd698a073845527500499b9c3f790f8d57593b --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 17:13:16,319 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 17:13:16,466 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7503ef54-bcb0-4c82-8fd8-e02210764b75/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 17:13:16,472 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 17:13:16,473 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 17:13:16,527 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 17:13:16,530 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 17:13:16,531 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 17:13:16,532 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 17:13:16,532 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 17:13:16,533 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 17:13:16,534 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 17:13:16,535 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 17:13:16,538 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 17:13:16,538 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 17:13:16,539 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 17:13:16,541 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 17:13:16,542 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 17:13:16,542 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 17:13:16,543 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 17:13:16,543 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 17:13:16,546 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 17:13:16,546 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 17:13:16,546 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 17:13:16,547 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 17:13:16,547 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 17:13:16,548 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 17:13:16,548 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 17:13:16,548 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 17:13:16,549 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 17:13:16,568 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 17:13:16,569 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 17:13:16,570 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 17:13:16,570 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 17:13:16,570 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 17:13:16,571 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 17:13:16,571 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 17:13:16,571 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 17:13:16,572 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 17:13:16,572 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 17:13:16,572 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 17:13:16,573 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 17:13:16,573 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_7503ef54-bcb0-4c82-8fd8-e02210764b75/bin/uautomizer-verify-jihMAELWvX/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_7503ef54-bcb0-4c82-8fd8-e02210764b75/bin/uautomizer-verify-jihMAELWvX 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 -> fccf2d2c93d03d1017d49983a9fd698a073845527500499b9c3f790f8d57593b [2024-11-08 17:13:16,949 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 17:13:16,992 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 17:13:16,996 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 17:13:16,998 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 17:13:16,999 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 17:13:17,001 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7503ef54-bcb0-4c82-8fd8-e02210764b75/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-81.i Unable to find full path for "g++" [2024-11-08 17:13:19,632 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 17:13:19,871 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 17:13:19,872 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7503ef54-bcb0-4c82-8fd8-e02210764b75/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-81.i [2024-11-08 17:13:19,885 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7503ef54-bcb0-4c82-8fd8-e02210764b75/bin/uautomizer-verify-jihMAELWvX/data/417c17eeb/e876ca895df444acbc83dc5a9f5361c8/FLAG24d2d0b8b [2024-11-08 17:13:20,219 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7503ef54-bcb0-4c82-8fd8-e02210764b75/bin/uautomizer-verify-jihMAELWvX/data/417c17eeb/e876ca895df444acbc83dc5a9f5361c8 [2024-11-08 17:13:20,223 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 17:13:20,225 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 17:13:20,227 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 17:13:20,227 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 17:13:20,240 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 17:13:20,241 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 05:13:20" (1/1) ... [2024-11-08 17:13:20,242 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18d4d34f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:13:20, skipping insertion in model container [2024-11-08 17:13:20,243 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 05:13:20" (1/1) ... [2024-11-08 17:13:20,279 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 17:13:20,520 WARN L250 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_7503ef54-bcb0-4c82-8fd8-e02210764b75/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-81.i[915,928] [2024-11-08 17:13:20,583 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 17:13:20,604 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 17:13:20,620 WARN L250 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_7503ef54-bcb0-4c82-8fd8-e02210764b75/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-81.i[915,928] [2024-11-08 17:13:20,656 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 17:13:20,684 INFO L204 MainTranslator]: Completed translation [2024-11-08 17:13:20,685 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:13:20 WrapperNode [2024-11-08 17:13:20,685 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 17:13:20,687 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 17:13:20,688 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 17:13:20,688 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 17:13:20,698 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:13:20" (1/1) ... [2024-11-08 17:13:20,711 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:13:20" (1/1) ... [2024-11-08 17:13:20,750 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 142 [2024-11-08 17:13:20,751 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 17:13:20,752 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 17:13:20,752 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 17:13:20,752 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 17:13:20,769 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:13:20" (1/1) ... [2024-11-08 17:13:20,769 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:13:20" (1/1) ... [2024-11-08 17:13:20,773 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:13:20" (1/1) ... [2024-11-08 17:13:20,796 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]. [2024-11-08 17:13:20,800 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:13:20" (1/1) ... [2024-11-08 17:13:20,801 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:13:20" (1/1) ... [2024-11-08 17:13:20,817 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:13:20" (1/1) ... [2024-11-08 17:13:20,830 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:13:20" (1/1) ... [2024-11-08 17:13:20,836 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:13:20" (1/1) ... [2024-11-08 17:13:20,838 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:13:20" (1/1) ... [2024-11-08 17:13:20,842 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 17:13:20,843 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 17:13:20,843 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 17:13:20,844 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 17:13:20,848 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:13:20" (1/1) ... [2024-11-08 17:13:20,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 17:13:20,876 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7503ef54-bcb0-4c82-8fd8-e02210764b75/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:13:20,903 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7503ef54-bcb0-4c82-8fd8-e02210764b75/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 17:13:20,912 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7503ef54-bcb0-4c82-8fd8-e02210764b75/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 17:13:20,949 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 17:13:20,950 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 17:13:20,950 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 17:13:20,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 17:13:20,950 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 17:13:20,951 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 17:13:21,048 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 17:13:21,051 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 17:13:21,508 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-11-08 17:13:21,508 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 17:13:21,538 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 17:13:21,539 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 17:13:21,541 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:13:21 BoogieIcfgContainer [2024-11-08 17:13:21,541 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 17:13:21,546 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 17:13:21,547 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 17:13:21,555 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 17:13:21,555 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 05:13:20" (1/3) ... [2024-11-08 17:13:21,557 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fa0c7db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 05:13:21, skipping insertion in model container [2024-11-08 17:13:21,557 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:13:20" (2/3) ... [2024-11-08 17:13:21,558 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fa0c7db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 05:13:21, skipping insertion in model container [2024-11-08 17:13:21,558 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:13:21" (3/3) ... [2024-11-08 17:13:21,563 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-81.i [2024-11-08 17:13:21,594 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 17:13:21,594 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 17:13:21,688 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 17:13:21,696 INFO L333 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, 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;@6770d587, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 17:13:21,696 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 17:13:21,701 INFO L276 IsEmpty]: Start isEmpty. Operand has 65 states, 46 states have (on average 1.4130434782608696) internal successors, (65), 47 states have internal predecessors, (65), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-08 17:13:21,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-08 17:13:21,719 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:13:21,720 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:13:21,722 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:13:21,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:13:21,730 INFO L85 PathProgramCache]: Analyzing trace with hash 592773390, now seen corresponding path program 1 times [2024-11-08 17:13:21,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:13:21,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631827513] [2024-11-08 17:13:21,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:13:21,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:13:21,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:22,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:13:22,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:22,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 17:13:22,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:22,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 17:13:22,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:22,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 17:13:22,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:22,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 17:13:22,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:22,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 17:13:22,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:22,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-08 17:13:22,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:22,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 17:13:22,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:22,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-08 17:13:22,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:22,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:13:22,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:22,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 17:13:22,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:22,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 17:13:22,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:22,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-08 17:13:22,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:22,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 17:13:22,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:22,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 17:13:22,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:22,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 17:13:22,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:22,298 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-08 17:13:22,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:13:22,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631827513] [2024-11-08 17:13:22,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631827513] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:13:22,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:13:22,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 17:13:22,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040993345] [2024-11-08 17:13:22,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:13:22,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 17:13:22,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:13:22,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 17:13:22,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 17:13:22,413 INFO L87 Difference]: Start difference. First operand has 65 states, 46 states have (on average 1.4130434782608696) internal successors, (65), 47 states have internal predecessors, (65), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-08 17:13:22,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:13:22,479 INFO L93 Difference]: Finished difference Result 121 states and 202 transitions. [2024-11-08 17:13:22,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 17:13:22,482 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 108 [2024-11-08 17:13:22,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:13:22,497 INFO L225 Difference]: With dead ends: 121 [2024-11-08 17:13:22,498 INFO L226 Difference]: Without dead ends: 59 [2024-11-08 17:13:22,505 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 17:13:22,509 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:13:22,511 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:13:22,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-11-08 17:13:22,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-11-08 17:13:22,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 41 states have (on average 1.3170731707317074) internal successors, (54), 41 states have internal predecessors, (54), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-08 17:13:22,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 86 transitions. [2024-11-08 17:13:22,571 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 86 transitions. Word has length 108 [2024-11-08 17:13:22,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:13:22,572 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 86 transitions. [2024-11-08 17:13:22,573 INFO L472 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-08 17:13:22,573 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 86 transitions. [2024-11-08 17:13:22,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-08 17:13:22,579 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:13:22,580 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:13:22,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 17:13:22,580 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:13:22,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:13:22,582 INFO L85 PathProgramCache]: Analyzing trace with hash -273061626, now seen corresponding path program 1 times [2024-11-08 17:13:22,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:13:22,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263040118] [2024-11-08 17:13:22,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:13:22,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:13:22,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:23,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:13:23,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:23,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 17:13:23,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:23,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 17:13:23,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:23,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 17:13:23,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:23,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 17:13:23,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:23,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 17:13:23,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:23,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-08 17:13:23,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:23,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 17:13:23,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:23,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-08 17:13:23,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:23,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:13:23,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:23,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 17:13:23,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:23,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 17:13:23,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:23,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-08 17:13:23,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:23,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 17:13:23,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:23,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 17:13:23,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:23,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 17:13:23,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:23,387 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-08 17:13:23,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:13:23,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263040118] [2024-11-08 17:13:23,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263040118] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:13:23,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:13:23,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 17:13:23,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816561676] [2024-11-08 17:13:23,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:13:23,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 17:13:23,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:13:23,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 17:13:23,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 17:13:23,397 INFO L87 Difference]: Start difference. First operand 59 states and 86 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 17:13:23,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:13:23,540 INFO L93 Difference]: Finished difference Result 117 states and 172 transitions. [2024-11-08 17:13:23,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 17:13:23,542 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 108 [2024-11-08 17:13:23,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:13:23,546 INFO L225 Difference]: With dead ends: 117 [2024-11-08 17:13:23,548 INFO L226 Difference]: Without dead ends: 61 [2024-11-08 17:13:23,549 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 17:13:23,553 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 0 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 17:13:23,554 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 213 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 17:13:23,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-11-08 17:13:23,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2024-11-08 17:13:23,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 43 states have (on average 1.302325581395349) internal successors, (56), 43 states have internal predecessors, (56), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-08 17:13:23,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 88 transitions. [2024-11-08 17:13:23,581 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 88 transitions. Word has length 108 [2024-11-08 17:13:23,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:13:23,583 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 88 transitions. [2024-11-08 17:13:23,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 17:13:23,584 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 88 transitions. [2024-11-08 17:13:23,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-08 17:13:23,587 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:13:23,587 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:13:23,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 17:13:23,590 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:13:23,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:13:23,591 INFO L85 PathProgramCache]: Analyzing trace with hash -1016060460, now seen corresponding path program 1 times [2024-11-08 17:13:23,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:13:23,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101991819] [2024-11-08 17:13:23,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:13:23,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:13:23,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:23,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:13:23,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:23,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 17:13:23,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:23,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 17:13:23,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:23,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 17:13:23,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:23,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 17:13:23,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:23,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 17:13:23,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:23,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-08 17:13:23,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:24,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 17:13:24,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:24,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-08 17:13:24,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:24,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:13:24,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:24,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 17:13:24,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:24,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 17:13:24,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:24,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-08 17:13:24,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:24,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 17:13:24,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:24,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 17:13:24,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:24,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 17:13:24,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:24,106 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-08 17:13:24,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:13:24,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101991819] [2024-11-08 17:13:24,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101991819] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:13:24,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:13:24,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 17:13:24,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653435404] [2024-11-08 17:13:24,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:13:24,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 17:13:24,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:13:24,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 17:13:24,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 17:13:24,111 INFO L87 Difference]: Start difference. First operand 61 states and 88 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 17:13:24,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:13:24,495 INFO L93 Difference]: Finished difference Result 191 states and 276 transitions. [2024-11-08 17:13:24,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 17:13:24,497 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 109 [2024-11-08 17:13:24,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:13:24,500 INFO L225 Difference]: With dead ends: 191 [2024-11-08 17:13:24,500 INFO L226 Difference]: Without dead ends: 133 [2024-11-08 17:13:24,505 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-08 17:13:24,510 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 89 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 17:13:24,511 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 314 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 17:13:24,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-11-08 17:13:24,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 117. [2024-11-08 17:13:24,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 82 states have (on average 1.3048780487804879) internal successors, (107), 82 states have internal predecessors, (107), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-08 17:13:24,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 171 transitions. [2024-11-08 17:13:24,567 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 171 transitions. Word has length 109 [2024-11-08 17:13:24,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:13:24,571 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 171 transitions. [2024-11-08 17:13:24,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 17:13:24,572 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 171 transitions. [2024-11-08 17:13:24,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-08 17:13:24,575 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:13:24,575 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:13:24,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 17:13:24,575 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:13:24,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:13:24,576 INFO L85 PathProgramCache]: Analyzing trace with hash -2027177710, now seen corresponding path program 1 times [2024-11-08 17:13:24,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:13:24,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656239959] [2024-11-08 17:13:24,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:13:24,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:13:24,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:25,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:13:25,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:25,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 17:13:25,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:25,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 17:13:25,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:25,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 17:13:25,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:25,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 17:13:25,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:25,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 17:13:25,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:25,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-08 17:13:25,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:25,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 17:13:25,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:25,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-08 17:13:25,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:25,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:13:25,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:25,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 17:13:25,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:25,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 17:13:25,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:25,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-08 17:13:25,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:25,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 17:13:25,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:25,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 17:13:25,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:25,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 17:13:25,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:25,656 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 39 proven. 6 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2024-11-08 17:13:25,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:13:25,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656239959] [2024-11-08 17:13:25,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656239959] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:13:25,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [145658957] [2024-11-08 17:13:25,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:13:25,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:13:25,658 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7503ef54-bcb0-4c82-8fd8-e02210764b75/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:13:25,664 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7503ef54-bcb0-4c82-8fd8-e02210764b75/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:13:25,675 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7503ef54-bcb0-4c82-8fd8-e02210764b75/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 17:13:25,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:25,887 INFO L255 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-08 17:13:25,896 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:13:26,071 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 145 proven. 6 refuted. 0 times theorem prover too weak. 329 trivial. 0 not checked. [2024-11-08 17:13:26,071 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:13:26,370 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 39 proven. 6 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2024-11-08 17:13:26,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [145658957] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 17:13:26,371 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 17:13:26,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2024-11-08 17:13:26,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223191839] [2024-11-08 17:13:26,376 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 17:13:26,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 17:13:26,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:13:26,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 17:13:26,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-08 17:13:26,379 INFO L87 Difference]: Start difference. First operand 117 states and 171 transitions. Second operand has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 2 states have call successors, (18), 2 states have call predecessors, (18), 4 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-08 17:13:27,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:13:27,043 INFO L93 Difference]: Finished difference Result 321 states and 457 transitions. [2024-11-08 17:13:27,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-08 17:13:27,044 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 2 states have call successors, (18), 2 states have call predecessors, (18), 4 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 109 [2024-11-08 17:13:27,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:13:27,048 INFO L225 Difference]: With dead ends: 321 [2024-11-08 17:13:27,048 INFO L226 Difference]: Without dead ends: 207 [2024-11-08 17:13:27,049 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 245 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2024-11-08 17:13:27,050 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 124 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 17:13:27,051 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 246 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 17:13:27,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2024-11-08 17:13:27,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 192. [2024-11-08 17:13:27,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 137 states have (on average 1.27007299270073) internal successors, (174), 137 states have internal predecessors, (174), 48 states have call successors, (48), 6 states have call predecessors, (48), 6 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-08 17:13:27,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 270 transitions. [2024-11-08 17:13:27,120 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 270 transitions. Word has length 109 [2024-11-08 17:13:27,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:13:27,121 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 270 transitions. [2024-11-08 17:13:27,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 2 states have call successors, (18), 2 states have call predecessors, (18), 4 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-08 17:13:27,126 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 270 transitions. [2024-11-08 17:13:27,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-08 17:13:27,128 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:13:27,128 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:13:27,162 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7503ef54-bcb0-4c82-8fd8-e02210764b75/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 17:13:27,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7503ef54-bcb0-4c82-8fd8-e02210764b75/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:13:27,333 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:13:27,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:13:27,334 INFO L85 PathProgramCache]: Analyzing trace with hash -1061516974, now seen corresponding path program 1 times [2024-11-08 17:13:27,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:13:27,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511088466] [2024-11-08 17:13:27,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:13:27,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:13:27,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:27,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:13:27,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:27,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 17:13:27,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:27,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 17:13:27,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:27,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 17:13:27,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:27,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 17:13:27,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:27,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 17:13:27,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:27,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-08 17:13:27,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:27,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 17:13:27,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:27,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-08 17:13:27,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:27,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:13:27,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:27,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 17:13:27,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:27,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 17:13:27,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:27,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-08 17:13:27,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:27,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 17:13:27,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:27,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 17:13:27,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:27,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 17:13:27,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:27,581 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-08 17:13:27,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:13:27,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511088466] [2024-11-08 17:13:27,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511088466] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:13:27,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:13:27,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 17:13:27,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815402684] [2024-11-08 17:13:27,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:13:27,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 17:13:27,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:13:27,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 17:13:27,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 17:13:27,588 INFO L87 Difference]: Start difference. First operand 192 states and 270 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 17:13:27,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:13:27,705 INFO L93 Difference]: Finished difference Result 401 states and 563 transitions. [2024-11-08 17:13:27,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 17:13:27,707 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 109 [2024-11-08 17:13:27,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:13:27,710 INFO L225 Difference]: With dead ends: 401 [2024-11-08 17:13:27,710 INFO L226 Difference]: Without dead ends: 212 [2024-11-08 17:13:27,715 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 17:13:27,716 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 77 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 17:13:27,719 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 251 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 17:13:27,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2024-11-08 17:13:27,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 192. [2024-11-08 17:13:27,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 137 states have (on average 1.2554744525547445) internal successors, (172), 137 states have internal predecessors, (172), 48 states have call successors, (48), 6 states have call predecessors, (48), 6 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-08 17:13:27,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 268 transitions. [2024-11-08 17:13:27,815 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 268 transitions. Word has length 109 [2024-11-08 17:13:27,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:13:27,816 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 268 transitions. [2024-11-08 17:13:27,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 17:13:27,817 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 268 transitions. [2024-11-08 17:13:27,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-08 17:13:27,823 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:13:27,823 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:13:27,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 17:13:27,824 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:13:27,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:13:27,825 INFO L85 PathProgramCache]: Analyzing trace with hash 964555501, now seen corresponding path program 1 times [2024-11-08 17:13:27,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:13:27,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828081200] [2024-11-08 17:13:27,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:13:27,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:13:27,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:32,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:13:32,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:32,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 17:13:32,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:32,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 17:13:32,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:32,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 17:13:32,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:32,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 17:13:32,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:32,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 17:13:32,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:32,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-08 17:13:32,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:32,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 17:13:32,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:32,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-08 17:13:32,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:32,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:13:32,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:32,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 17:13:32,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:32,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 17:13:32,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:32,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-08 17:13:32,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:32,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 17:13:32,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:32,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 17:13:32,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:32,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 17:13:32,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:32,879 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-08 17:13:32,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:13:32,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828081200] [2024-11-08 17:13:32,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828081200] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:13:32,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:13:32,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-08 17:13:32,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737953939] [2024-11-08 17:13:32,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:13:32,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-08 17:13:32,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:13:32,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-08 17:13:32,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2024-11-08 17:13:32,886 INFO L87 Difference]: Start difference. First operand 192 states and 268 transitions. Second operand has 14 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 14 states have internal predecessors, (34), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 17:13:35,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:13:35,658 INFO L93 Difference]: Finished difference Result 537 states and 724 transitions. [2024-11-08 17:13:35,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-08 17:13:35,659 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 14 states have internal predecessors, (34), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 111 [2024-11-08 17:13:35,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:13:35,665 INFO L225 Difference]: With dead ends: 537 [2024-11-08 17:13:35,665 INFO L226 Difference]: Without dead ends: 348 [2024-11-08 17:13:35,667 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=209, Invalid=547, Unknown=0, NotChecked=0, Total=756 [2024-11-08 17:13:35,668 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 256 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 644 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 645 SdHoareTripleChecker+Invalid, 764 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 644 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-08 17:13:35,672 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 645 Invalid, 764 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 644 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-08 17:13:35,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2024-11-08 17:13:35,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 221. [2024-11-08 17:13:35,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 159 states have (on average 1.2327044025157232) internal successors, (196), 160 states have internal predecessors, (196), 54 states have call successors, (54), 7 states have call predecessors, (54), 7 states have return successors, (54), 53 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-08 17:13:35,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 304 transitions. [2024-11-08 17:13:35,737 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 304 transitions. Word has length 111 [2024-11-08 17:13:35,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:13:35,738 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 304 transitions. [2024-11-08 17:13:35,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 14 states have internal predecessors, (34), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 17:13:35,738 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 304 transitions. [2024-11-08 17:13:35,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-08 17:13:35,741 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:13:35,741 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:13:35,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 17:13:35,742 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:13:35,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:13:35,742 INFO L85 PathProgramCache]: Analyzing trace with hash 744254715, now seen corresponding path program 1 times [2024-11-08 17:13:35,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:13:35,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239209686] [2024-11-08 17:13:35,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:13:35,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:13:35,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:36,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:13:36,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:36,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 17:13:36,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:36,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 17:13:36,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:36,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 17:13:36,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:36,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 17:13:36,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:36,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 17:13:36,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:36,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-08 17:13:36,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:36,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 17:13:36,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:36,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-08 17:13:36,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:36,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:13:36,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:36,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 17:13:36,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:36,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 17:13:36,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:36,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-08 17:13:36,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:36,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 17:13:36,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:36,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 17:13:36,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:36,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 17:13:36,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:36,063 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-08 17:13:36,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:13:36,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239209686] [2024-11-08 17:13:36,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239209686] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:13:36,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:13:36,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 17:13:36,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116217153] [2024-11-08 17:13:36,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:13:36,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 17:13:36,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:13:36,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 17:13:36,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 17:13:36,067 INFO L87 Difference]: Start difference. First operand 221 states and 304 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 17:13:36,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:13:36,375 INFO L93 Difference]: Finished difference Result 609 states and 836 transitions. [2024-11-08 17:13:36,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 17:13:36,376 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 111 [2024-11-08 17:13:36,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:13:36,382 INFO L225 Difference]: With dead ends: 609 [2024-11-08 17:13:36,382 INFO L226 Difference]: Without dead ends: 403 [2024-11-08 17:13:36,383 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 17:13:36,384 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 113 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 17:13:36,385 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 207 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 17:13:36,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2024-11-08 17:13:36,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 297. [2024-11-08 17:13:36,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 216 states have (on average 1.1944444444444444) internal successors, (258), 218 states have internal predecessors, (258), 70 states have call successors, (70), 10 states have call predecessors, (70), 10 states have return successors, (70), 68 states have call predecessors, (70), 70 states have call successors, (70) [2024-11-08 17:13:36,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 398 transitions. [2024-11-08 17:13:36,475 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 398 transitions. Word has length 111 [2024-11-08 17:13:36,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:13:36,476 INFO L471 AbstractCegarLoop]: Abstraction has 297 states and 398 transitions. [2024-11-08 17:13:36,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 17:13:36,477 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 398 transitions. [2024-11-08 17:13:36,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-08 17:13:36,479 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:13:36,479 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:13:36,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 17:13:36,480 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:13:36,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:13:36,480 INFO L85 PathProgramCache]: Analyzing trace with hash -1899542336, now seen corresponding path program 1 times [2024-11-08 17:13:36,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:13:36,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515319840] [2024-11-08 17:13:36,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:13:36,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:13:36,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:36,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:13:36,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:36,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 17:13:36,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:36,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 17:13:36,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:36,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 17:13:36,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:36,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 17:13:36,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:36,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 17:13:36,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:36,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-08 17:13:36,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:36,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 17:13:36,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:36,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-08 17:13:36,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:36,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:13:36,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:36,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 17:13:36,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:36,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 17:13:36,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:36,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-08 17:13:36,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:36,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 17:13:36,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:36,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 17:13:36,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:36,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 17:13:36,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:36,625 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-08 17:13:36,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:13:36,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515319840] [2024-11-08 17:13:36,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515319840] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:13:36,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:13:36,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 17:13:36,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103699476] [2024-11-08 17:13:36,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:13:36,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 17:13:36,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:13:36,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 17:13:36,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 17:13:36,630 INFO L87 Difference]: Start difference. First operand 297 states and 398 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 17:13:36,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:13:36,781 INFO L93 Difference]: Finished difference Result 726 states and 973 transitions. [2024-11-08 17:13:36,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 17:13:36,782 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 112 [2024-11-08 17:13:36,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:13:36,788 INFO L225 Difference]: With dead ends: 726 [2024-11-08 17:13:36,791 INFO L226 Difference]: Without dead ends: 444 [2024-11-08 17:13:36,792 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 17:13:36,793 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 64 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:13:36,795 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 152 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:13:36,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2024-11-08 17:13:36,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 291. [2024-11-08 17:13:36,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 210 states have (on average 1.1571428571428573) internal successors, (243), 212 states have internal predecessors, (243), 70 states have call successors, (70), 10 states have call predecessors, (70), 10 states have return successors, (70), 68 states have call predecessors, (70), 70 states have call successors, (70) [2024-11-08 17:13:36,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 383 transitions. [2024-11-08 17:13:36,891 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 383 transitions. Word has length 112 [2024-11-08 17:13:36,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:13:36,891 INFO L471 AbstractCegarLoop]: Abstraction has 291 states and 383 transitions. [2024-11-08 17:13:36,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 17:13:36,892 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 383 transitions. [2024-11-08 17:13:36,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-08 17:13:36,894 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:13:36,894 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:13:36,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 17:13:36,895 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:13:36,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:13:36,895 INFO L85 PathProgramCache]: Analyzing trace with hash 286165658, now seen corresponding path program 1 times [2024-11-08 17:13:36,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:13:36,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736700046] [2024-11-08 17:13:36,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:13:36,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:13:36,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:37,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:13:37,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:37,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 17:13:37,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:37,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 17:13:37,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:37,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 17:13:37,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:37,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 17:13:37,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:37,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 17:13:37,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:37,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-08 17:13:37,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:37,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 17:13:37,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:37,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-08 17:13:37,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:37,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:13:37,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:37,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 17:13:37,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:37,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 17:13:37,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:37,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-08 17:13:37,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:37,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 17:13:37,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:37,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 17:13:37,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:37,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 17:13:37,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:37,174 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-08 17:13:37,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:13:37,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736700046] [2024-11-08 17:13:37,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736700046] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:13:37,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:13:37,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 17:13:37,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838646698] [2024-11-08 17:13:37,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:13:37,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 17:13:37,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:13:37,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 17:13:37,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 17:13:37,177 INFO L87 Difference]: Start difference. First operand 291 states and 383 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 17:13:37,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:13:37,461 INFO L93 Difference]: Finished difference Result 556 states and 741 transitions. [2024-11-08 17:13:37,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 17:13:37,461 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 112 [2024-11-08 17:13:37,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:13:37,468 INFO L225 Difference]: With dead ends: 556 [2024-11-08 17:13:37,469 INFO L226 Difference]: Without dead ends: 423 [2024-11-08 17:13:37,470 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 17:13:37,471 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 66 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 17:13:37,471 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 211 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 17:13:37,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2024-11-08 17:13:37,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 291. [2024-11-08 17:13:37,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 210 states have (on average 1.1333333333333333) internal successors, (238), 212 states have internal predecessors, (238), 70 states have call successors, (70), 10 states have call predecessors, (70), 10 states have return successors, (70), 68 states have call predecessors, (70), 70 states have call successors, (70) [2024-11-08 17:13:37,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 378 transitions. [2024-11-08 17:13:37,555 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 378 transitions. Word has length 112 [2024-11-08 17:13:37,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:13:37,556 INFO L471 AbstractCegarLoop]: Abstraction has 291 states and 378 transitions. [2024-11-08 17:13:37,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 17:13:37,557 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 378 transitions. [2024-11-08 17:13:37,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-08 17:13:37,559 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:13:37,559 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:13:37,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 17:13:37,560 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:13:37,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:13:37,560 INFO L85 PathProgramCache]: Analyzing trace with hash 917517525, now seen corresponding path program 1 times [2024-11-08 17:13:37,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:13:37,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511485376] [2024-11-08 17:13:37,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:13:37,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:13:37,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:42,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:13:42,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:42,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 17:13:42,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:42,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 17:13:42,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:42,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 17:13:42,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:42,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 17:13:42,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:42,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 17:13:42,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:42,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-08 17:13:42,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:42,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 17:13:42,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:42,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-08 17:13:42,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:42,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:13:42,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:42,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 17:13:42,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:42,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 17:13:42,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:42,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-08 17:13:42,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:42,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 17:13:42,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:42,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 17:13:42,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:42,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 17:13:42,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:42,682 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-08 17:13:42,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:13:42,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511485376] [2024-11-08 17:13:42,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511485376] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:13:42,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:13:42,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-08 17:13:42,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794976248] [2024-11-08 17:13:42,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:13:42,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-08 17:13:42,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:13:42,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-08 17:13:42,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2024-11-08 17:13:42,685 INFO L87 Difference]: Start difference. First operand 291 states and 378 transitions. Second operand has 16 states, 16 states have (on average 2.1875) internal successors, (35), 16 states have internal predecessors, (35), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 17:13:44,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:13:44,942 INFO L93 Difference]: Finished difference Result 636 states and 812 transitions. [2024-11-08 17:13:44,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-08 17:13:44,943 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.1875) internal successors, (35), 16 states have internal predecessors, (35), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 112 [2024-11-08 17:13:44,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:13:44,948 INFO L225 Difference]: With dead ends: 636 [2024-11-08 17:13:44,948 INFO L226 Difference]: Without dead ends: 360 [2024-11-08 17:13:44,950 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=188, Invalid=624, Unknown=0, NotChecked=0, Total=812 [2024-11-08 17:13:44,951 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 129 mSDsluCounter, 472 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-08 17:13:44,953 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 571 Invalid, 551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 484 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-08 17:13:44,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2024-11-08 17:13:45,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 283. [2024-11-08 17:13:45,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 202 states have (on average 1.1287128712871286) internal successors, (228), 204 states have internal predecessors, (228), 70 states have call successors, (70), 10 states have call predecessors, (70), 10 states have return successors, (70), 68 states have call predecessors, (70), 70 states have call successors, (70) [2024-11-08 17:13:45,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 368 transitions. [2024-11-08 17:13:45,024 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 368 transitions. Word has length 112 [2024-11-08 17:13:45,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:13:45,025 INFO L471 AbstractCegarLoop]: Abstraction has 283 states and 368 transitions. [2024-11-08 17:13:45,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.1875) internal successors, (35), 16 states have internal predecessors, (35), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 17:13:45,025 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 368 transitions. [2024-11-08 17:13:45,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-08 17:13:45,027 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:13:45,027 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:13:45,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 17:13:45,028 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:13:45,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:13:45,029 INFO L85 PathProgramCache]: Analyzing trace with hash -859883840, now seen corresponding path program 1 times [2024-11-08 17:13:45,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:13:45,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92074709] [2024-11-08 17:13:45,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:13:45,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:13:45,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 17:13:45,122 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 17:13:45,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 17:13:45,230 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 17:13:45,230 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 17:13:45,232 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 17:13:45,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-08 17:13:45,239 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:13:45,382 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 17:13:45,386 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 05:13:45 BoogieIcfgContainer [2024-11-08 17:13:45,386 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 17:13:45,387 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 17:13:45,387 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 17:13:45,387 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 17:13:45,388 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:13:21" (3/4) ... [2024-11-08 17:13:45,391 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 17:13:45,393 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 17:13:45,394 INFO L158 Benchmark]: Toolchain (without parser) took 25169.27ms. Allocated memory was 151.0MB in the beginning and 373.3MB in the end (delta: 222.3MB). Free memory was 112.6MB in the beginning and 229.6MB in the end (delta: -117.0MB). Peak memory consumption was 105.8MB. Max. memory is 16.1GB. [2024-11-08 17:13:45,396 INFO L158 Benchmark]: CDTParser took 1.31ms. Allocated memory is still 151.0MB. Free memory is still 117.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 17:13:45,396 INFO L158 Benchmark]: CACSL2BoogieTranslator took 459.13ms. Allocated memory is still 151.0MB. Free memory was 112.6MB in the beginning and 97.9MB in the end (delta: 14.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-08 17:13:45,397 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.94ms. Allocated memory is still 151.0MB. Free memory was 97.9MB in the beginning and 95.9MB in the end (delta: 2.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 17:13:45,398 INFO L158 Benchmark]: Boogie Preprocessor took 90.29ms. Allocated memory is still 151.0MB. Free memory was 95.9MB in the beginning and 93.3MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 17:13:45,398 INFO L158 Benchmark]: RCFGBuilder took 698.27ms. Allocated memory is still 151.0MB. Free memory was 93.3MB in the beginning and 75.5MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-08 17:13:45,399 INFO L158 Benchmark]: TraceAbstraction took 23839.60ms. Allocated memory was 151.0MB in the beginning and 373.3MB in the end (delta: 222.3MB). Free memory was 74.9MB in the beginning and 229.6MB in the end (delta: -154.7MB). Peak memory consumption was 68.1MB. Max. memory is 16.1GB. [2024-11-08 17:13:45,399 INFO L158 Benchmark]: Witness Printer took 6.55ms. Allocated memory is still 373.3MB. Free memory is still 229.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 17:13:45,402 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.31ms. Allocated memory is still 151.0MB. Free memory is still 117.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 459.13ms. Allocated memory is still 151.0MB. Free memory was 112.6MB in the beginning and 97.9MB in the end (delta: 14.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.94ms. Allocated memory is still 151.0MB. Free memory was 97.9MB in the beginning and 95.9MB in the end (delta: 2.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 90.29ms. Allocated memory is still 151.0MB. Free memory was 95.9MB in the beginning and 93.3MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 698.27ms. Allocated memory is still 151.0MB. Free memory was 93.3MB in the beginning and 75.5MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 23839.60ms. Allocated memory was 151.0MB in the beginning and 373.3MB in the end (delta: 222.3MB). Free memory was 74.9MB in the beginning and 229.6MB in the end (delta: -154.7MB). Peak memory consumption was 68.1MB. Max. memory is 16.1GB. * Witness Printer took 6.55ms. Allocated memory is still 373.3MB. Free memory is still 229.6MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 103, overapproximation of someBinaryArithmeticDOUBLEoperation at line 68. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 9999.5; [L23] unsigned char var_1_2 = 1; [L24] double var_1_3 = 4.5; [L25] double var_1_4 = 2.5; [L26] double var_1_5 = 0.0; [L27] double var_1_6 = 999999999999.3; [L28] signed char var_1_7 = -128; [L29] signed char var_1_11 = -64; [L30] signed char var_1_12 = 5; [L31] signed char var_1_13 = 50; [L32] unsigned char var_1_14 = 0; [L33] unsigned char var_1_15 = 0; [L34] unsigned char var_1_16 = 0; [L35] unsigned char var_1_17 = 0; [L36] signed char last_1_var_1_7 = -128; VAL [isInitial=0, last_1_var_1_7=-128, var_1_11=-64, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=1, var_1_3=9/2, var_1_4=5/2, var_1_5=0, var_1_6=9999999999993/10, var_1_7=-128] [L107] isInitial = 1 [L108] FCALL initially() [L109] COND TRUE 1 [L110] CALL updateLastVariables() [L100] last_1_var_1_7 = var_1_7 VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=-64, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=1, var_1_3=9/2, var_1_4=5/2, var_1_5=0, var_1_6=9999999999993/10, var_1_7=-128] [L110] RET updateLastVariables() [L111] CALL updateVariables() [L72] var_1_2 = __VERIFIER_nondet_uchar() [L73] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=-64, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_3=9/2, var_1_4=5/2, var_1_5=0, var_1_6=9999999999993/10, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=-64, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_3=9/2, var_1_4=5/2, var_1_5=0, var_1_6=9999999999993/10, var_1_7=-128] [L73] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=-64, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_3=9/2, var_1_4=5/2, var_1_5=0, var_1_6=9999999999993/10, var_1_7=-128] [L74] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=-64, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=-256, var_1_3=9/2, var_1_4=5/2, var_1_5=0, var_1_6=9999999999993/10, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=-64, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=-256, var_1_3=9/2, var_1_4=5/2, var_1_5=0, var_1_6=9999999999993/10, var_1_7=-128] [L74] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=-64, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=-256, var_1_3=9/2, var_1_4=5/2, var_1_5=0, var_1_6=9999999999993/10, var_1_7=-128] [L75] var_1_3 = __VERIFIER_nondet_double() [L76] CALL assume_abort_if_not((var_1_3 >= -922337.2036854765600e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854765600e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=-64, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=-256, var_1_4=5/2, var_1_5=0, var_1_6=9999999999993/10, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=-64, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=-256, var_1_4=5/2, var_1_5=0, var_1_6=9999999999993/10, var_1_7=-128] [L76] RET assume_abort_if_not((var_1_3 >= -922337.2036854765600e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854765600e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=-64, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=-256, var_1_4=5/2, var_1_5=0, var_1_6=9999999999993/10, var_1_7=-128] [L77] var_1_4 = __VERIFIER_nondet_double() [L78] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=-64, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=-256, var_1_5=0, var_1_6=9999999999993/10, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=-64, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=-256, var_1_5=0, var_1_6=9999999999993/10, var_1_7=-128] [L78] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=-64, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=-256, var_1_5=0, var_1_6=9999999999993/10, var_1_7=-128] [L79] var_1_5 = __VERIFIER_nondet_double() [L80] CALL assume_abort_if_not((var_1_5 >= 4611686.018427382800e+12F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=-64, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=-256, var_1_6=9999999999993/10, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=-64, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=-256, var_1_6=9999999999993/10, var_1_7=-128] [L80] RET assume_abort_if_not((var_1_5 >= 4611686.018427382800e+12F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=-64, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=-256, var_1_6=9999999999993/10, var_1_7=-128] [L81] var_1_6 = __VERIFIER_nondet_double() [L82] CALL assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 4611686.018427382800e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=-64, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=-256, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=-64, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=-256, var_1_7=-128] [L82] RET assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 4611686.018427382800e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=-64, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=-256, var_1_7=-128] [L83] var_1_11 = __VERIFIER_nondet_char() [L84] CALL assume_abort_if_not(var_1_11 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=25, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=-256, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=25, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=-256, var_1_7=-128] [L84] RET assume_abort_if_not(var_1_11 >= -127) VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=25, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=-256, var_1_7=-128] [L85] CALL assume_abort_if_not(var_1_11 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=25, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=-256, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=25, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=-256, var_1_7=-128] [L85] RET assume_abort_if_not(var_1_11 <= 126) VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=25, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=-256, var_1_7=-128] [L86] var_1_13 = __VERIFIER_nondet_char() [L87] CALL assume_abort_if_not(var_1_13 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=25, var_1_12=5, var_1_13=126, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=-256, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=25, var_1_12=5, var_1_13=126, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=-256, var_1_7=-128] [L87] RET assume_abort_if_not(var_1_13 >= -1) VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=25, var_1_12=5, var_1_13=126, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=-256, var_1_7=-128] [L88] CALL assume_abort_if_not(var_1_13 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=25, var_1_12=5, var_1_13=126, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=-256, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=25, var_1_12=5, var_1_13=126, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=-256, var_1_7=-128] [L88] RET assume_abort_if_not(var_1_13 <= 126) VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=25, var_1_12=5, var_1_13=126, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=-256, var_1_7=-128] [L89] var_1_15 = __VERIFIER_nondet_uchar() [L90] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=25, var_1_12=5, var_1_13=126, var_1_14=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=-256, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=25, var_1_12=5, var_1_13=126, var_1_14=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=-256, var_1_7=-128] [L90] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=25, var_1_12=5, var_1_13=126, var_1_14=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=-256, var_1_7=-128] [L91] CALL assume_abort_if_not(var_1_15 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=25, var_1_12=5, var_1_13=126, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=-256, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=25, var_1_12=5, var_1_13=126, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=-256, var_1_7=-128] [L91] RET assume_abort_if_not(var_1_15 <= 1) VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=25, var_1_12=5, var_1_13=126, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=-256, var_1_7=-128] [L92] var_1_16 = __VERIFIER_nondet_uchar() [L93] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=25, var_1_12=5, var_1_13=126, var_1_14=0, var_1_15=1, var_1_17=0, var_1_1=19999/2, var_1_2=-256, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=25, var_1_12=5, var_1_13=126, var_1_14=0, var_1_15=1, var_1_17=0, var_1_1=19999/2, var_1_2=-256, var_1_7=-128] [L93] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=25, var_1_12=5, var_1_13=126, var_1_14=0, var_1_15=1, var_1_17=0, var_1_1=19999/2, var_1_2=-256, var_1_7=-128] [L94] CALL assume_abort_if_not(var_1_16 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=25, var_1_12=5, var_1_13=126, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=-256, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=25, var_1_12=5, var_1_13=126, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=-256, var_1_7=-128] [L94] RET assume_abort_if_not(var_1_16 <= 0) VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=25, var_1_12=5, var_1_13=126, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=-256, var_1_7=-128] [L95] var_1_17 = __VERIFIER_nondet_uchar() [L96] CALL assume_abort_if_not(var_1_17 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=25, var_1_12=5, var_1_13=126, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_1=19999/2, var_1_2=-256, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=25, var_1_12=5, var_1_13=126, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_1=19999/2, var_1_2=-256, var_1_7=-128] [L96] RET assume_abort_if_not(var_1_17 >= 1) VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=25, var_1_12=5, var_1_13=126, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_1=19999/2, var_1_2=-256, var_1_7=-128] [L97] CALL assume_abort_if_not(var_1_17 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=25, var_1_12=5, var_1_13=126, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_1=19999/2, var_1_2=-256, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=25, var_1_12=5, var_1_13=126, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_1=19999/2, var_1_2=-256, var_1_7=-128] [L97] RET assume_abort_if_not(var_1_17 <= 1) VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=25, var_1_12=5, var_1_13=126, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_1=19999/2, var_1_2=-256, var_1_7=-128] [L111] RET updateVariables() [L112] CALL step() [L40] signed long int stepLocal_1 = ((((last_1_var_1_7) < (last_1_var_1_7)) ? (last_1_var_1_7) : (last_1_var_1_7))) + last_1_var_1_7; VAL [isInitial=1, last_1_var_1_7=-128, stepLocal_1=-256, var_1_11=25, var_1_12=5, var_1_13=126, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_1=19999/2, var_1_2=-256, var_1_7=-128] [L41] COND FALSE !(last_1_var_1_7 <= stepLocal_1) [L44] var_1_12 = var_1_11 VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=25, var_1_12=25, var_1_13=126, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_1=19999/2, var_1_2=-256, var_1_7=-128] [L46] unsigned char stepLocal_3 = var_1_2; [L47] unsigned long int stepLocal_2 = (((25u) > (var_1_12)) ? (25u) : (var_1_12)); VAL [isInitial=1, last_1_var_1_7=-128, stepLocal_2=25, stepLocal_3=-256, var_1_11=25, var_1_12=25, var_1_13=126, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_1=19999/2, var_1_2=-256, var_1_7=-128] [L48] COND TRUE stepLocal_3 || var_1_15 VAL [isInitial=1, last_1_var_1_7=-128, stepLocal_2=25, var_1_11=25, var_1_12=25, var_1_13=126, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_1=19999/2, var_1_2=-256, var_1_7=-128] [L49] COND TRUE stepLocal_2 <= var_1_12 VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=25, var_1_12=25, var_1_13=126, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_1=19999/2, var_1_2=-256, var_1_7=-128] [L50] COND FALSE !(\read(var_1_2)) [L53] var_1_14 = var_1_17 VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=25, var_1_12=25, var_1_13=126, var_1_14=-255, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_1=19999/2, var_1_2=-256, var_1_7=-128] [L59] EXPR var_1_12 ^ var_1_12 VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=25, var_1_12=25, var_1_13=126, var_1_14=-255, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_1=19999/2, var_1_2=-256, var_1_7=-128] [L59] signed long int stepLocal_0 = var_1_12 ^ var_1_12; [L60] COND TRUE ((((-25) < (var_1_12)) ? (-25) : (var_1_12))) != stepLocal_0 VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=25, var_1_12=25, var_1_13=126, var_1_14=-255, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_1=19999/2, var_1_2=-256, var_1_7=-128] [L61] COND TRUE \read(var_1_14) [L62] var_1_7 = var_1_11 VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=25, var_1_12=25, var_1_13=126, var_1_14=-255, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_1=19999/2, var_1_2=-256, var_1_7=25] [L67] COND TRUE \read(var_1_14) [L68] var_1_1 = ((((var_1_3) > ((var_1_4 - (var_1_5 - var_1_6)))) ? (var_1_3) : ((var_1_4 - (var_1_5 - var_1_6))))) VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=25, var_1_12=25, var_1_13=126, var_1_14=-255, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_1=1000000000004, var_1_2=-256, var_1_3=1000000000004, var_1_7=25] [L112] RET step() [L113] CALL, EXPR property() [L103] EXPR (var_1_14 ? (var_1_1 == ((double) ((((var_1_3) > ((var_1_4 - (var_1_5 - var_1_6)))) ? (var_1_3) : ((var_1_4 - (var_1_5 - var_1_6))))))) : 1) && ((((((-25) < (var_1_12)) ? (-25) : (var_1_12))) != (var_1_12 ^ var_1_12)) ? (var_1_14 ? (var_1_7 == ((signed char) var_1_11)) : 1) : (var_1_7 == ((signed char) var_1_11))) VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=25, var_1_12=25, var_1_13=126, var_1_14=-255, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_1=1000000000004, var_1_2=-256, var_1_3=1000000000004, var_1_7=25] [L103-L104] return (((var_1_14 ? (var_1_1 == ((double) ((((var_1_3) > ((var_1_4 - (var_1_5 - var_1_6)))) ? (var_1_3) : ((var_1_4 - (var_1_5 - var_1_6))))))) : 1) && ((((((-25) < (var_1_12)) ? (-25) : (var_1_12))) != (var_1_12 ^ var_1_12)) ? (var_1_14 ? (var_1_7 == ((signed char) var_1_11)) : 1) : (var_1_7 == ((signed char) var_1_11)))) && ((last_1_var_1_7 <= (((((last_1_var_1_7) < (last_1_var_1_7)) ? (last_1_var_1_7) : (last_1_var_1_7))) + last_1_var_1_7)) ? (var_1_12 == ((signed char) (var_1_13 - 1))) : (var_1_12 == ((signed char) var_1_11)))) && ((var_1_2 || var_1_15) ? ((((((25u) > (var_1_12)) ? (25u) : (var_1_12))) <= var_1_12) ? (var_1_2 ? (var_1_14 == ((unsigned char) var_1_16)) : (var_1_14 == ((unsigned char) var_1_17))) : 1) : (var_1_14 == ((unsigned char) var_1_16))) ; [L113] RET, EXPR property() [L113] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=25, var_1_12=25, var_1_13=126, var_1_14=-255, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_1=1000000000004, var_1_2=-256, var_1_3=1000000000004, var_1_7=25] [L19] reach_error() VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=25, var_1_12=25, var_1_13=126, var_1_14=-255, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_1=1000000000004, var_1_2=-256, var_1_3=1000000000004, var_1_7=25] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 65 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 23.6s, OverallIterations: 11, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 7.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 945 SdHoareTripleChecker+Valid, 4.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 918 mSDsluCounter, 2896 SdHoareTripleChecker+Invalid, 3.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1973 mSDsCounter, 293 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1596 IncrementalHoareTripleChecker+Invalid, 1889 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 293 mSolverCounterUnsat, 923 mSDtfsCounter, 1596 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 666 GetRequests, 578 SyntacticMatches, 2 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 269 ImplicationChecksByTransitivity, 4.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=297occurred in iteration=7, InterpolantAutomatonStates: 76, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 10 MinimizatonAttempts, 646 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 13.8s InterpolantComputationTime, 1323 NumberOfCodeBlocks, 1323 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 1307 ConstructedInterpolants, 0 QuantifiedInterpolants, 3501 SizeOfPredicates, 2 NumberOfNonLiveVariables, 257 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 12 InterpolantComputations, 9 PerfectInterpolantSequences, 5742/5760 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 [2024-11-08 17:13:45,445 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7503ef54-bcb0-4c82-8fd8-e02210764b75/bin/uautomizer-verify-jihMAELWvX/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_7503ef54-bcb0-4c82-8fd8-e02210764b75/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7503ef54-bcb0-4c82-8fd8-e02210764b75/bin/uautomizer-verify-jihMAELWvX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7503ef54-bcb0-4c82-8fd8-e02210764b75/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7503ef54-bcb0-4c82-8fd8-e02210764b75/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-81.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7503ef54-bcb0-4c82-8fd8-e02210764b75/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7503ef54-bcb0-4c82-8fd8-e02210764b75/bin/uautomizer-verify-jihMAELWvX --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 fccf2d2c93d03d1017d49983a9fd698a073845527500499b9c3f790f8d57593b --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 17:13:48,696 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 17:13:48,846 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7503ef54-bcb0-4c82-8fd8-e02210764b75/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 17:13:48,857 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 17:13:48,858 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 17:13:48,905 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 17:13:48,906 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 17:13:48,906 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 17:13:48,907 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 17:13:48,908 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 17:13:48,908 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 17:13:48,909 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 17:13:48,910 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 17:13:48,911 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 17:13:48,911 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 17:13:48,912 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 17:13:48,913 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 17:13:48,913 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 17:13:48,918 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 17:13:48,918 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 17:13:48,918 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 17:13:48,919 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 17:13:48,920 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 17:13:48,920 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 17:13:48,920 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 17:13:48,921 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 17:13:48,921 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 17:13:48,922 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 17:13:48,922 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 17:13:48,922 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 17:13:48,923 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 17:13:48,923 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 17:13:48,924 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 17:13:48,924 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 17:13:48,925 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 17:13:48,925 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 17:13:48,926 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 17:13:48,926 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 17:13:48,927 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-08 17:13:48,927 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 17:13:48,927 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 17:13:48,928 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 17:13:48,928 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 17:13:48,929 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 17:13:48,929 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_7503ef54-bcb0-4c82-8fd8-e02210764b75/bin/uautomizer-verify-jihMAELWvX/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_7503ef54-bcb0-4c82-8fd8-e02210764b75/bin/uautomizer-verify-jihMAELWvX 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 -> fccf2d2c93d03d1017d49983a9fd698a073845527500499b9c3f790f8d57593b [2024-11-08 17:13:49,463 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 17:13:49,499 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 17:13:49,503 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 17:13:49,505 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 17:13:49,506 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 17:13:49,508 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7503ef54-bcb0-4c82-8fd8-e02210764b75/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-81.i Unable to find full path for "g++" [2024-11-08 17:13:52,180 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 17:13:52,520 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 17:13:52,521 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7503ef54-bcb0-4c82-8fd8-e02210764b75/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-81.i [2024-11-08 17:13:52,536 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7503ef54-bcb0-4c82-8fd8-e02210764b75/bin/uautomizer-verify-jihMAELWvX/data/675a4c079/c43f3779abfc4e6bb82348f779df9438/FLAGaa46009b7 [2024-11-08 17:13:52,555 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7503ef54-bcb0-4c82-8fd8-e02210764b75/bin/uautomizer-verify-jihMAELWvX/data/675a4c079/c43f3779abfc4e6bb82348f779df9438 [2024-11-08 17:13:52,557 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 17:13:52,559 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 17:13:52,561 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 17:13:52,562 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 17:13:52,570 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 17:13:52,571 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 05:13:52" (1/1) ... [2024-11-08 17:13:52,575 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68e4caa5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:13:52, skipping insertion in model container [2024-11-08 17:13:52,576 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 05:13:52" (1/1) ... [2024-11-08 17:13:52,616 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 17:13:52,943 WARN L250 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_7503ef54-bcb0-4c82-8fd8-e02210764b75/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-81.i[915,928] [2024-11-08 17:13:53,050 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 17:13:53,077 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 17:13:53,100 WARN L250 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_7503ef54-bcb0-4c82-8fd8-e02210764b75/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-81.i[915,928] [2024-11-08 17:13:53,148 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 17:13:53,192 INFO L204 MainTranslator]: Completed translation [2024-11-08 17:13:53,193 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:13:53 WrapperNode [2024-11-08 17:13:53,193 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 17:13:53,195 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 17:13:53,195 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 17:13:53,195 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 17:13:53,244 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:13:53" (1/1) ... [2024-11-08 17:13:53,274 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:13:53" (1/1) ... [2024-11-08 17:13:53,347 INFO L138 Inliner]: procedures = 27, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 114 [2024-11-08 17:13:53,348 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 17:13:53,353 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 17:13:53,353 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 17:13:53,353 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 17:13:53,371 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:13:53" (1/1) ... [2024-11-08 17:13:53,371 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:13:53" (1/1) ... [2024-11-08 17:13:53,379 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:13:53" (1/1) ... [2024-11-08 17:13:53,406 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]. [2024-11-08 17:13:53,406 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:13:53" (1/1) ... [2024-11-08 17:13:53,410 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:13:53" (1/1) ... [2024-11-08 17:13:53,427 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:13:53" (1/1) ... [2024-11-08 17:13:53,435 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:13:53" (1/1) ... [2024-11-08 17:13:53,440 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:13:53" (1/1) ... [2024-11-08 17:13:53,445 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:13:53" (1/1) ... [2024-11-08 17:13:53,449 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 17:13:53,453 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 17:13:53,456 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 17:13:53,457 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 17:13:53,458 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:13:53" (1/1) ... [2024-11-08 17:13:53,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 17:13:53,485 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7503ef54-bcb0-4c82-8fd8-e02210764b75/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:13:53,503 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7503ef54-bcb0-4c82-8fd8-e02210764b75/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 17:13:53,507 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7503ef54-bcb0-4c82-8fd8-e02210764b75/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 17:13:53,547 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 17:13:53,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 17:13:53,547 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 17:13:53,548 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 17:13:53,548 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 17:13:53,548 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 17:13:53,691 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 17:13:53,694 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 17:13:56,615 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-08 17:13:56,615 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 17:13:56,645 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 17:13:56,645 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 17:13:56,646 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:13:56 BoogieIcfgContainer [2024-11-08 17:13:56,646 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 17:13:56,650 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 17:13:56,650 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 17:13:56,654 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 17:13:56,655 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 05:13:52" (1/3) ... [2024-11-08 17:13:56,656 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@114bb4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 05:13:56, skipping insertion in model container [2024-11-08 17:13:56,656 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:13:53" (2/3) ... [2024-11-08 17:13:56,657 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@114bb4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 05:13:56, skipping insertion in model container [2024-11-08 17:13:56,657 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:13:56" (3/3) ... [2024-11-08 17:13:56,659 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-81.i [2024-11-08 17:13:56,682 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 17:13:56,698 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 17:13:56,783 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 17:13:56,792 INFO L333 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, 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;@dc4b104, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 17:13:56,793 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 17:13:56,798 INFO L276 IsEmpty]: Start isEmpty. Operand has 54 states, 35 states have (on average 1.3428571428571427) internal successors, (47), 36 states have internal predecessors, (47), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-08 17:13:56,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-08 17:13:56,814 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:13:56,815 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:13:56,816 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:13:56,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:13:56,824 INFO L85 PathProgramCache]: Analyzing trace with hash -836501013, now seen corresponding path program 1 times [2024-11-08 17:13:56,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:13:56,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [294111135] [2024-11-08 17:13:56,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:13:56,843 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 [2024-11-08 17:13:56,843 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7503ef54-bcb0-4c82-8fd8-e02210764b75/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:13:56,855 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7503ef54-bcb0-4c82-8fd8-e02210764b75/bin/uautomizer-verify-jihMAELWvX/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) [2024-11-08 17:13:56,857 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7503ef54-bcb0-4c82-8fd8-e02210764b75/bin/uautomizer-verify-jihMAELWvX/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 [2024-11-08 17:13:57,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:57,276 INFO L255 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 17:13:57,290 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:13:58,351 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-08 17:13:58,353 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:13:58,355 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:13:58,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [294111135] [2024-11-08 17:13:58,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [294111135] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:13:58,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:13:58,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 17:13:58,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667507067] [2024-11-08 17:13:58,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:13:58,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 17:13:58,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:13:58,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 17:13:58,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 17:13:58,422 INFO L87 Difference]: Start difference. First operand has 54 states, 35 states have (on average 1.3428571428571427) internal successors, (47), 36 states have internal predecessors, (47), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 17:14:00,577 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 17:14:02,095 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 17:14:02,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:14:02,097 INFO L93 Difference]: Finished difference Result 156 states and 269 transitions. [2024-11-08 17:14:02,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 17:14:02,115 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 105 [2024-11-08 17:14:02,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:14:02,129 INFO L225 Difference]: With dead ends: 156 [2024-11-08 17:14:02,129 INFO L226 Difference]: Without dead ends: 105 [2024-11-08 17:14:02,133 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-08 17:14:02,141 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 57 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-11-08 17:14:02,145 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 245 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-11-08 17:14:02,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-11-08 17:14:02,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 95. [2024-11-08 17:14:02,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 60 states have (on average 1.25) internal successors, (75), 60 states have internal predecessors, (75), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-08 17:14:02,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 139 transitions. [2024-11-08 17:14:02,251 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 139 transitions. Word has length 105 [2024-11-08 17:14:02,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:14:02,252 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 139 transitions. [2024-11-08 17:14:02,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 17:14:02,253 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 139 transitions. [2024-11-08 17:14:02,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-08 17:14:02,258 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:14:02,259 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:14:02,270 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7503ef54-bcb0-4c82-8fd8-e02210764b75/bin/uautomizer-verify-jihMAELWvX/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)] Ended with exit code 0 [2024-11-08 17:14:02,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7503ef54-bcb0-4c82-8fd8-e02210764b75/bin/uautomizer-verify-jihMAELWvX/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 [2024-11-08 17:14:02,460 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:14:02,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:14:02,466 INFO L85 PathProgramCache]: Analyzing trace with hash -1229528023, now seen corresponding path program 1 times [2024-11-08 17:14:02,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:14:02,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1692861739] [2024-11-08 17:14:02,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:14:02,468 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 [2024-11-08 17:14:02,469 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7503ef54-bcb0-4c82-8fd8-e02210764b75/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:14:02,474 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7503ef54-bcb0-4c82-8fd8-e02210764b75/bin/uautomizer-verify-jihMAELWvX/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) [2024-11-08 17:14:02,480 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7503ef54-bcb0-4c82-8fd8-e02210764b75/bin/uautomizer-verify-jihMAELWvX/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 [2024-11-08 17:14:02,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:14:02,854 INFO L255 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 17:14:02,860 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:14:02,930 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-08 17:14:02,930 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:14:02,931 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:14:02,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1692861739] [2024-11-08 17:14:02,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1692861739] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:14:02,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:14:02,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 17:14:02,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962988029] [2024-11-08 17:14:02,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:14:02,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 17:14:02,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:14:02,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 17:14:02,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 17:14:02,937 INFO L87 Difference]: Start difference. First operand 95 states and 139 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 17:14:04,241 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 17:14:04,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:14:04,272 INFO L93 Difference]: Finished difference Result 142 states and 208 transitions. [2024-11-08 17:14:04,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 17:14:04,274 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 105 [2024-11-08 17:14:04,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:14:04,281 INFO L225 Difference]: With dead ends: 142 [2024-11-08 17:14:04,282 INFO L226 Difference]: Without dead ends: 95 [2024-11-08 17:14:04,283 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 17:14:04,287 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 0 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-08 17:14:04,288 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 131 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-08 17:14:04,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-08 17:14:04,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2024-11-08 17:14:04,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 60 states have (on average 1.2166666666666666) internal successors, (73), 60 states have internal predecessors, (73), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-08 17:14:04,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 137 transitions. [2024-11-08 17:14:04,338 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 137 transitions. Word has length 105 [2024-11-08 17:14:04,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:14:04,339 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 137 transitions. [2024-11-08 17:14:04,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 17:14:04,340 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 137 transitions. [2024-11-08 17:14:04,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-08 17:14:04,346 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:14:04,347 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:14:04,359 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7503ef54-bcb0-4c82-8fd8-e02210764b75/bin/uautomizer-verify-jihMAELWvX/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 [2024-11-08 17:14:04,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7503ef54-bcb0-4c82-8fd8-e02210764b75/bin/uautomizer-verify-jihMAELWvX/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 [2024-11-08 17:14:04,548 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:14:04,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:14:04,549 INFO L85 PathProgramCache]: Analyzing trace with hash 1767823218, now seen corresponding path program 1 times [2024-11-08 17:14:04,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:14:04,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1700464957] [2024-11-08 17:14:04,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:14:04,550 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 [2024-11-08 17:14:04,550 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7503ef54-bcb0-4c82-8fd8-e02210764b75/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:14:04,554 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7503ef54-bcb0-4c82-8fd8-e02210764b75/bin/uautomizer-verify-jihMAELWvX/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) [2024-11-08 17:14:04,557 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7503ef54-bcb0-4c82-8fd8-e02210764b75/bin/uautomizer-verify-jihMAELWvX/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 [2024-11-08 17:14:04,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:14:04,938 INFO L255 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-08 17:14:04,961 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:14:05,193 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 145 proven. 6 refuted. 0 times theorem prover too weak. 329 trivial. 0 not checked. [2024-11-08 17:14:05,193 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:14:05,691 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 39 proven. 6 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2024-11-08 17:14:05,691 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:14:05,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1700464957] [2024-11-08 17:14:05,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1700464957] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 17:14:05,692 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 17:14:05,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2024-11-08 17:14:05,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335145323] [2024-11-08 17:14:05,693 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 17:14:05,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 17:14:05,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:14:05,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 17:14:05,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-08 17:14:05,697 INFO L87 Difference]: Start difference. First operand 95 states and 137 transitions. Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 2 states have call successors, (18), 2 states have call predecessors, (18), 4 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-08 17:14:07,812 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 17:14:09,305 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 17:14:10,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:14:10,536 INFO L93 Difference]: Finished difference Result 261 states and 364 transitions. [2024-11-08 17:14:10,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-08 17:14:10,538 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 2 states have call successors, (18), 2 states have call predecessors, (18), 4 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 106 [2024-11-08 17:14:10,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:14:10,541 INFO L225 Difference]: With dead ends: 261 [2024-11-08 17:14:10,541 INFO L226 Difference]: Without dead ends: 169 [2024-11-08 17:14:10,543 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 204 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2024-11-08 17:14:10,545 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 111 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2024-11-08 17:14:10,546 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 157 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2024-11-08 17:14:10,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2024-11-08 17:14:10,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 154. [2024-11-08 17:14:10,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 99 states have (on average 1.1616161616161615) internal successors, (115), 99 states have internal predecessors, (115), 48 states have call successors, (48), 6 states have call predecessors, (48), 6 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-08 17:14:10,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 211 transitions. [2024-11-08 17:14:10,595 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 211 transitions. Word has length 106 [2024-11-08 17:14:10,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:14:10,596 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 211 transitions. [2024-11-08 17:14:10,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 2 states have call successors, (18), 2 states have call predecessors, (18), 4 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-08 17:14:10,597 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 211 transitions. [2024-11-08 17:14:10,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-08 17:14:10,600 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:14:10,600 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:14:10,613 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7503ef54-bcb0-4c82-8fd8-e02210764b75/bin/uautomizer-verify-jihMAELWvX/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 [2024-11-08 17:14:10,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7503ef54-bcb0-4c82-8fd8-e02210764b75/bin/uautomizer-verify-jihMAELWvX/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 [2024-11-08 17:14:10,802 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:14:10,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:14:10,803 INFO L85 PathProgramCache]: Analyzing trace with hash 1826928562, now seen corresponding path program 1 times [2024-11-08 17:14:10,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:14:10,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [768551312] [2024-11-08 17:14:10,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:14:10,805 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 [2024-11-08 17:14:10,805 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7503ef54-bcb0-4c82-8fd8-e02210764b75/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:14:10,809 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7503ef54-bcb0-4c82-8fd8-e02210764b75/bin/uautomizer-verify-jihMAELWvX/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) [2024-11-08 17:14:10,811 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7503ef54-bcb0-4c82-8fd8-e02210764b75/bin/uautomizer-verify-jihMAELWvX/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 [2024-11-08 17:14:11,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:14:11,230 INFO L255 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-08 17:14:11,237 INFO L278 TraceCheckSpWp]: Computing forward predicates...