./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-24.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6497de01 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e98d4a07-83f7-4711-a5e8-f63921dec43e/bin/uautomizer-verify-LYvppIcaGC/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e98d4a07-83f7-4711-a5e8-f63921dec43e/bin/uautomizer-verify-LYvppIcaGC/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e98d4a07-83f7-4711-a5e8-f63921dec43e/bin/uautomizer-verify-LYvppIcaGC/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e98d4a07-83f7-4711-a5e8-f63921dec43e/bin/uautomizer-verify-LYvppIcaGC/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-24.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e98d4a07-83f7-4711-a5e8-f63921dec43e/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e98d4a07-83f7-4711-a5e8-f63921dec43e/bin/uautomizer-verify-LYvppIcaGC --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 27f1e743425525541ce4822cf6e51a4737fceae5e241bd8bfab81b1f43b03433 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-6497de0 [2024-11-24 01:27:17,980 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-24 01:27:18,062 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e98d4a07-83f7-4711-a5e8-f63921dec43e/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-24 01:27:18,067 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-24 01:27:18,067 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-24 01:27:18,090 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-24 01:27:18,091 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-24 01:27:18,091 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-24 01:27:18,092 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-24 01:27:18,092 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-24 01:27:18,092 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-24 01:27:18,092 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-24 01:27:18,093 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-24 01:27:18,093 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-24 01:27:18,093 INFO L153 SettingsManager]: * Use SBE=true [2024-11-24 01:27:18,093 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-24 01:27:18,093 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-24 01:27:18,094 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-24 01:27:18,094 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-24 01:27:18,094 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-24 01:27:18,094 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-24 01:27:18,094 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-24 01:27:18,094 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-24 01:27:18,094 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-24 01:27:18,095 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-24 01:27:18,095 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-24 01:27:18,095 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-24 01:27:18,095 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-24 01:27:18,095 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-24 01:27:18,095 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-24 01:27:18,095 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-24 01:27:18,096 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-24 01:27:18,096 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-24 01:27:18,096 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-24 01:27:18,096 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-24 01:27:18,096 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-24 01:27:18,096 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-24 01:27:18,096 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-24 01:27:18,097 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-24 01:27:18,097 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-24 01:27:18,097 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-24 01:27:18,097 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-24 01:27:18,097 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-24 01:27:18,097 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-24 01:27:18,097 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-24 01:27:18,098 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-24 01:27:18,098 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-24 01:27:18,098 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-24 01:27:18,098 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_e98d4a07-83f7-4711-a5e8-f63921dec43e/bin/uautomizer-verify-LYvppIcaGC 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 -> 27f1e743425525541ce4822cf6e51a4737fceae5e241bd8bfab81b1f43b03433 [2024-11-24 01:27:18,428 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-24 01:27:18,438 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-24 01:27:18,444 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-24 01:27:18,446 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-24 01:27:18,447 INFO L274 PluginConnector]: CDTParser initialized [2024-11-24 01:27:18,449 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e98d4a07-83f7-4711-a5e8-f63921dec43e/bin/uautomizer-verify-LYvppIcaGC/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-24.i [2024-11-24 01:27:21,590 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e98d4a07-83f7-4711-a5e8-f63921dec43e/bin/uautomizer-verify-LYvppIcaGC/data/7a50c9af0/26fda9117781453187cc15801661bb79/FLAG2aa39c74f [2024-11-24 01:27:21,874 INFO L384 CDTParser]: Found 1 translation units. [2024-11-24 01:27:21,875 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e98d4a07-83f7-4711-a5e8-f63921dec43e/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-24.i [2024-11-24 01:27:21,882 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e98d4a07-83f7-4711-a5e8-f63921dec43e/bin/uautomizer-verify-LYvppIcaGC/data/7a50c9af0/26fda9117781453187cc15801661bb79/FLAG2aa39c74f [2024-11-24 01:27:21,905 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e98d4a07-83f7-4711-a5e8-f63921dec43e/bin/uautomizer-verify-LYvppIcaGC/data/7a50c9af0/26fda9117781453187cc15801661bb79 [2024-11-24 01:27:21,907 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-24 01:27:21,909 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-24 01:27:21,910 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-24 01:27:21,910 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-24 01:27:21,915 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-24 01:27:21,916 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 01:27:21" (1/1) ... [2024-11-24 01:27:21,918 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@663dad07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:27:21, skipping insertion in model container [2024-11-24 01:27:21,918 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 01:27:21" (1/1) ... [2024-11-24 01:27:21,943 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-24 01:27:22,115 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_e98d4a07-83f7-4711-a5e8-f63921dec43e/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-24.i[916,929] [2024-11-24 01:27:22,178 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-24 01:27:22,197 INFO L200 MainTranslator]: Completed pre-run [2024-11-24 01:27:22,207 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_e98d4a07-83f7-4711-a5e8-f63921dec43e/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-24.i[916,929] [2024-11-24 01:27:22,258 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-24 01:27:22,282 INFO L204 MainTranslator]: Completed translation [2024-11-24 01:27:22,283 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:27:22 WrapperNode [2024-11-24 01:27:22,285 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-24 01:27:22,286 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-24 01:27:22,286 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-24 01:27:22,287 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-24 01:27:22,295 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:27:22" (1/1) ... [2024-11-24 01:27:22,316 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:27:22" (1/1) ... [2024-11-24 01:27:22,383 INFO L138 Inliner]: procedures = 30, calls = 153, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 456 [2024-11-24 01:27:22,384 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-24 01:27:22,388 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-24 01:27:22,388 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-24 01:27:22,388 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-24 01:27:22,400 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:27:22" (1/1) ... [2024-11-24 01:27:22,400 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:27:22" (1/1) ... [2024-11-24 01:27:22,413 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:27:22" (1/1) ... [2024-11-24 01:27:22,426 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2024-11-24 01:27:22,426 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:27:22" (1/1) ... [2024-11-24 01:27:22,426 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:27:22" (1/1) ... [2024-11-24 01:27:22,463 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:27:22" (1/1) ... [2024-11-24 01:27:22,467 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:27:22" (1/1) ... [2024-11-24 01:27:22,477 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:27:22" (1/1) ... [2024-11-24 01:27:22,479 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:27:22" (1/1) ... [2024-11-24 01:27:22,484 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:27:22" (1/1) ... [2024-11-24 01:27:22,492 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-24 01:27:22,493 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-24 01:27:22,493 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-24 01:27:22,493 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-24 01:27:22,494 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:27:22" (1/1) ... [2024-11-24 01:27:22,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-24 01:27:22,537 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e98d4a07-83f7-4711-a5e8-f63921dec43e/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 01:27:22,554 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e98d4a07-83f7-4711-a5e8-f63921dec43e/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-24 01:27:22,559 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e98d4a07-83f7-4711-a5e8-f63921dec43e/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-24 01:27:22,592 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-24 01:27:22,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2024-11-24 01:27:22,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2024-11-24 01:27:22,592 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-11-24 01:27:22,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-24 01:27:22,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-11-24 01:27:22,593 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-24 01:27:22,593 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-24 01:27:22,593 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-24 01:27:22,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-24 01:27:22,593 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-24 01:27:22,594 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-24 01:27:22,706 INFO L234 CfgBuilder]: Building ICFG [2024-11-24 01:27:22,708 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-24 01:27:23,527 INFO L? ?]: Removed 118 outVars from TransFormulas that were not future-live. [2024-11-24 01:27:23,530 INFO L283 CfgBuilder]: Performing block encoding [2024-11-24 01:27:23,546 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-24 01:27:23,549 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-24 01:27:23,550 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 01:27:23 BoogieIcfgContainer [2024-11-24 01:27:23,550 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-24 01:27:23,553 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-24 01:27:23,554 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-24 01:27:23,560 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-24 01:27:23,561 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 01:27:21" (1/3) ... [2024-11-24 01:27:23,562 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7852249e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 01:27:23, skipping insertion in model container [2024-11-24 01:27:23,562 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:27:22" (2/3) ... [2024-11-24 01:27:23,563 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7852249e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 01:27:23, skipping insertion in model container [2024-11-24 01:27:23,564 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 01:27:23" (3/3) ... [2024-11-24 01:27:23,566 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-24.i [2024-11-24 01:27:23,596 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-24 01:27:23,598 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-s_file-24.i that has 2 procedures, 101 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-24 01:27:23,680 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-24 01:27:23,699 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;@4b566851, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-24 01:27:23,699 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-24 01:27:23,704 INFO L276 IsEmpty]: Start isEmpty. Operand has 101 states, 83 states have (on average 1.3975903614457832) internal successors, (116), 84 states have internal predecessors, (116), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-24 01:27:23,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-24 01:27:23,719 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:27:23,720 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 01:27:23,720 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:27:23,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:27:23,729 INFO L85 PathProgramCache]: Analyzing trace with hash 341014851, now seen corresponding path program 1 times [2024-11-24 01:27:23,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:27:23,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065372166] [2024-11-24 01:27:23,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:27:23,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:27:23,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:27:24,264 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2024-11-24 01:27:24,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:27:24,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065372166] [2024-11-24 01:27:24,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065372166] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-24 01:27:24,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1477945720] [2024-11-24 01:27:24,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:27:24,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 01:27:24,267 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e98d4a07-83f7-4711-a5e8-f63921dec43e/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 01:27:24,277 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e98d4a07-83f7-4711-a5e8-f63921dec43e/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-24 01:27:24,282 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e98d4a07-83f7-4711-a5e8-f63921dec43e/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-24 01:27:24,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:27:24,640 INFO L256 TraceCheckSpWp]: Trace formula consists of 463 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-24 01:27:24,651 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 01:27:24,728 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2024-11-24 01:27:24,729 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-24 01:27:24,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1477945720] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:27:24,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-24 01:27:24,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-24 01:27:24,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117367942] [2024-11-24 01:27:24,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:27:24,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-24 01:27:24,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:27:24,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-24 01:27:24,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-24 01:27:24,758 INFO L87 Difference]: Start difference. First operand has 101 states, 83 states have (on average 1.3975903614457832) internal successors, (116), 84 states have internal predecessors, (116), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-24 01:27:24,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:27:24,790 INFO L93 Difference]: Finished difference Result 195 states and 301 transitions. [2024-11-24 01:27:24,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-24 01:27:24,793 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 124 [2024-11-24 01:27:24,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:27:24,802 INFO L225 Difference]: With dead ends: 195 [2024-11-24 01:27:24,803 INFO L226 Difference]: Without dead ends: 97 [2024-11-24 01:27:24,808 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 125 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-24 01:27:24,811 INFO L435 NwaCegarLoop]: 139 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, 139 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-24 01:27:24,812 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-24 01:27:24,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-24 01:27:24,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2024-11-24 01:27:24,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 80 states have (on average 1.3625) internal successors, (109), 80 states have internal predecessors, (109), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-24 01:27:24,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 139 transitions. [2024-11-24 01:27:24,863 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 139 transitions. Word has length 124 [2024-11-24 01:27:24,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:27:24,864 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 139 transitions. [2024-11-24 01:27:24,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-24 01:27:24,864 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 139 transitions. [2024-11-24 01:27:24,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-24 01:27:24,867 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:27:24,867 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 01:27:24,874 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e98d4a07-83f7-4711-a5e8-f63921dec43e/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-24 01:27:25,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e98d4a07-83f7-4711-a5e8-f63921dec43e/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-24 01:27:25,069 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:27:25,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:27:25,070 INFO L85 PathProgramCache]: Analyzing trace with hash -984360163, now seen corresponding path program 1 times [2024-11-24 01:27:25,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:27:25,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411117589] [2024-11-24 01:27:25,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:27:25,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:27:25,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:27:25,559 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-24 01:27:25,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:27:25,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411117589] [2024-11-24 01:27:25,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411117589] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:27:25,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:27:25,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-24 01:27:25,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398446141] [2024-11-24 01:27:25,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:27:25,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-24 01:27:25,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:27:25,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-24 01:27:25,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-24 01:27:25,566 INFO L87 Difference]: Start difference. First operand 97 states and 139 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-24 01:27:25,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:27:25,630 INFO L93 Difference]: Finished difference Result 193 states and 278 transitions. [2024-11-24 01:27:25,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-24 01:27:25,631 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 124 [2024-11-24 01:27:25,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:27:25,633 INFO L225 Difference]: With dead ends: 193 [2024-11-24 01:27:25,633 INFO L226 Difference]: Without dead ends: 99 [2024-11-24 01:27:25,634 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-24 01:27:25,635 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 0 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-24 01:27:25,638 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 400 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-24 01:27:25,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-24 01:27:25,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2024-11-24 01:27:25,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 82 states have (on average 1.353658536585366) internal successors, (111), 82 states have internal predecessors, (111), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-24 01:27:25,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 141 transitions. [2024-11-24 01:27:25,661 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 141 transitions. Word has length 124 [2024-11-24 01:27:25,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:27:25,662 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 141 transitions. [2024-11-24 01:27:25,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-24 01:27:25,662 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 141 transitions. [2024-11-24 01:27:25,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-24 01:27:25,664 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:27:25,668 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 01:27:25,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-24 01:27:25,668 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:27:25,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:27:25,669 INFO L85 PathProgramCache]: Analyzing trace with hash -140354661, now seen corresponding path program 1 times [2024-11-24 01:27:25,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:27:25,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203959622] [2024-11-24 01:27:25,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:27:25,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:27:25,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:27:25,925 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-24 01:27:25,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:27:25,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203959622] [2024-11-24 01:27:25,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203959622] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:27:25,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:27:25,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-24 01:27:25,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531652640] [2024-11-24 01:27:25,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:27:25,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-24 01:27:25,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:27:25,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-24 01:27:25,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 01:27:25,931 INFO L87 Difference]: Start difference. First operand 99 states and 141 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-24 01:27:25,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:27:25,966 INFO L93 Difference]: Finished difference Result 196 states and 281 transitions. [2024-11-24 01:27:25,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-24 01:27:25,967 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 124 [2024-11-24 01:27:25,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:27:25,971 INFO L225 Difference]: With dead ends: 196 [2024-11-24 01:27:25,972 INFO L226 Difference]: Without dead ends: 100 [2024-11-24 01:27:25,972 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-24 01:27:25,973 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 0 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-24 01:27:25,973 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 270 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-24 01:27:25,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-24 01:27:25,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2024-11-24 01:27:25,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 83 states have (on average 1.3493975903614457) internal successors, (112), 83 states have internal predecessors, (112), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-24 01:27:25,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 142 transitions. [2024-11-24 01:27:25,992 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 142 transitions. Word has length 124 [2024-11-24 01:27:25,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:27:25,996 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 142 transitions. [2024-11-24 01:27:25,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-24 01:27:25,997 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 142 transitions. [2024-11-24 01:27:25,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-24 01:27:25,998 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:27:25,999 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 01:27:25,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-24 01:27:25,999 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:27:25,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:27:25,999 INFO L85 PathProgramCache]: Analyzing trace with hash -1945792995, now seen corresponding path program 1 times [2024-11-24 01:27:26,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:27:26,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125464679] [2024-11-24 01:27:26,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:27:26,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:27:26,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:27:26,221 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-24 01:27:26,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:27:26,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125464679] [2024-11-24 01:27:26,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125464679] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:27:26,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:27:26,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-24 01:27:26,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543606138] [2024-11-24 01:27:26,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:27:26,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-24 01:27:26,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:27:26,225 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-24 01:27:26,225 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 01:27:26,225 INFO L87 Difference]: Start difference. First operand 100 states and 142 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-24 01:27:26,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:27:26,265 INFO L93 Difference]: Finished difference Result 198 states and 283 transitions. [2024-11-24 01:27:26,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-24 01:27:26,266 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 124 [2024-11-24 01:27:26,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:27:26,268 INFO L225 Difference]: With dead ends: 198 [2024-11-24 01:27:26,271 INFO L226 Difference]: Without dead ends: 101 [2024-11-24 01:27:26,272 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-24 01:27:26,273 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 0 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-24 01:27:26,273 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 270 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-24 01:27:26,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-24 01:27:26,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2024-11-24 01:27:26,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 84 states have (on average 1.3452380952380953) internal successors, (113), 84 states have internal predecessors, (113), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-24 01:27:26,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 143 transitions. [2024-11-24 01:27:26,292 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 143 transitions. Word has length 124 [2024-11-24 01:27:26,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:27:26,294 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 143 transitions. [2024-11-24 01:27:26,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-24 01:27:26,295 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 143 transitions. [2024-11-24 01:27:26,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-24 01:27:26,296 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:27:26,297 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 01:27:26,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-24 01:27:26,300 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:27:26,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:27:26,300 INFO L85 PathProgramCache]: Analyzing trace with hash 1328105947, now seen corresponding path program 1 times [2024-11-24 01:27:26,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:27:26,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747331864] [2024-11-24 01:27:26,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:27:26,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:27:26,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:27:26,568 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-24 01:27:26,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:27:26,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747331864] [2024-11-24 01:27:26,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747331864] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:27:26,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:27:26,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-24 01:27:26,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016395582] [2024-11-24 01:27:26,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:27:26,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-24 01:27:26,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:27:26,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-24 01:27:26,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-24 01:27:26,571 INFO L87 Difference]: Start difference. First operand 101 states and 143 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-24 01:27:26,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:27:26,615 INFO L93 Difference]: Finished difference Result 202 states and 287 transitions. [2024-11-24 01:27:26,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-24 01:27:26,616 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 124 [2024-11-24 01:27:26,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:27:26,618 INFO L225 Difference]: With dead ends: 202 [2024-11-24 01:27:26,618 INFO L226 Difference]: Without dead ends: 104 [2024-11-24 01:27:26,618 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-24 01:27:26,619 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 1 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-24 01:27:26,619 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 397 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-24 01:27:26,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-24 01:27:26,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2024-11-24 01:27:26,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 86 states have (on average 1.3372093023255813) internal successors, (115), 86 states have internal predecessors, (115), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-24 01:27:26,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 145 transitions. [2024-11-24 01:27:26,636 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 145 transitions. Word has length 124 [2024-11-24 01:27:26,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:27:26,637 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 145 transitions. [2024-11-24 01:27:26,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-24 01:27:26,637 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 145 transitions. [2024-11-24 01:27:26,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-24 01:27:26,642 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:27:26,642 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 01:27:26,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-24 01:27:26,642 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:27:26,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:27:26,643 INFO L85 PathProgramCache]: Analyzing trace with hash 2008164317, now seen corresponding path program 1 times [2024-11-24 01:27:26,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:27:26,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553165868] [2024-11-24 01:27:26,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:27:26,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:27:26,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:27:26,870 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-24 01:27:26,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:27:26,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553165868] [2024-11-24 01:27:26,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553165868] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:27:26,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:27:26,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-24 01:27:26,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888291294] [2024-11-24 01:27:26,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:27:26,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-24 01:27:26,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:27:26,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-24 01:27:26,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-24 01:27:26,873 INFO L87 Difference]: Start difference. First operand 103 states and 145 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-24 01:27:26,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:27:26,920 INFO L93 Difference]: Finished difference Result 206 states and 291 transitions. [2024-11-24 01:27:26,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-24 01:27:26,921 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 124 [2024-11-24 01:27:26,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:27:26,922 INFO L225 Difference]: With dead ends: 206 [2024-11-24 01:27:26,922 INFO L226 Difference]: Without dead ends: 106 [2024-11-24 01:27:26,922 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-24 01:27:26,923 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 1 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-24 01:27:26,923 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 398 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-24 01:27:26,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-24 01:27:26,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2024-11-24 01:27:26,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 88 states have (on average 1.3295454545454546) internal successors, (117), 88 states have internal predecessors, (117), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-24 01:27:26,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 147 transitions. [2024-11-24 01:27:26,940 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 147 transitions. Word has length 124 [2024-11-24 01:27:26,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:27:26,942 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 147 transitions. [2024-11-24 01:27:26,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-24 01:27:26,942 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 147 transitions. [2024-11-24 01:27:26,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-24 01:27:26,945 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:27:26,945 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 01:27:26,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-24 01:27:26,946 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:27:26,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:27:26,946 INFO L85 PathProgramCache]: Analyzing trace with hash -511795617, now seen corresponding path program 1 times [2024-11-24 01:27:26,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:27:26,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657462693] [2024-11-24 01:27:26,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:27:26,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:27:27,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:27:27,190 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-24 01:27:27,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:27:27,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657462693] [2024-11-24 01:27:27,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657462693] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:27:27,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:27:27,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-24 01:27:27,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56528328] [2024-11-24 01:27:27,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:27:27,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-24 01:27:27,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:27:27,194 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-24 01:27:27,194 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-24 01:27:27,194 INFO L87 Difference]: Start difference. First operand 105 states and 147 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-24 01:27:27,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:27:27,235 INFO L93 Difference]: Finished difference Result 210 states and 295 transitions. [2024-11-24 01:27:27,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-24 01:27:27,237 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 124 [2024-11-24 01:27:27,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:27:27,239 INFO L225 Difference]: With dead ends: 210 [2024-11-24 01:27:27,239 INFO L226 Difference]: Without dead ends: 108 [2024-11-24 01:27:27,239 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-24 01:27:27,240 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 1 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-24 01:27:27,240 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 400 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-24 01:27:27,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-24 01:27:27,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2024-11-24 01:27:27,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 90 states have (on average 1.3222222222222222) internal successors, (119), 90 states have internal predecessors, (119), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-24 01:27:27,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 149 transitions. [2024-11-24 01:27:27,255 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 149 transitions. Word has length 124 [2024-11-24 01:27:27,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:27:27,255 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 149 transitions. [2024-11-24 01:27:27,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-24 01:27:27,256 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 149 transitions. [2024-11-24 01:27:27,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-24 01:27:27,257 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:27:27,257 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 01:27:27,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-24 01:27:27,257 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:27:27,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:27:27,258 INFO L85 PathProgramCache]: Analyzing trace with hash -509948575, now seen corresponding path program 1 times [2024-11-24 01:27:27,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:27:27,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65642771] [2024-11-24 01:27:27,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:27:27,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:27:27,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:27:27,867 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-24 01:27:27,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:27:27,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65642771] [2024-11-24 01:27:27,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65642771] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:27:27,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:27:27,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-24 01:27:27,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394291142] [2024-11-24 01:27:27,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:27:27,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-24 01:27:27,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:27:27,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-24 01:27:27,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-24 01:27:27,870 INFO L87 Difference]: Start difference. First operand 107 states and 149 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-24 01:27:28,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:27:28,305 INFO L93 Difference]: Finished difference Result 271 states and 375 transitions. [2024-11-24 01:27:28,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-24 01:27:28,308 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 124 [2024-11-24 01:27:28,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:27:28,309 INFO L225 Difference]: With dead ends: 271 [2024-11-24 01:27:28,309 INFO L226 Difference]: Without dead ends: 167 [2024-11-24 01:27:28,310 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-24 01:27:28,311 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 63 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-24 01:27:28,312 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 457 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-24 01:27:28,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2024-11-24 01:27:28,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 164. [2024-11-24 01:27:28,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 144 states have (on average 1.3333333333333333) internal successors, (192), 145 states have internal predecessors, (192), 17 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-24 01:27:28,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 226 transitions. [2024-11-24 01:27:28,333 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 226 transitions. Word has length 124 [2024-11-24 01:27:28,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:27:28,334 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 226 transitions. [2024-11-24 01:27:28,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-24 01:27:28,334 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 226 transitions. [2024-11-24 01:27:28,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-24 01:27:28,336 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:27:28,336 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 01:27:28,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-24 01:27:28,336 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:27:28,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:27:28,337 INFO L85 PathProgramCache]: Analyzing trace with hash 1378439380, now seen corresponding path program 1 times [2024-11-24 01:27:28,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:27:28,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200448416] [2024-11-24 01:27:28,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:27:28,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:27:28,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:27:30,111 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-24 01:27:30,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:27:30,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200448416] [2024-11-24 01:27:30,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200448416] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:27:30,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:27:30,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-24 01:27:30,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251624416] [2024-11-24 01:27:30,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:27:30,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-24 01:27:30,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:27:30,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-24 01:27:30,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-24 01:27:30,115 INFO L87 Difference]: Start difference. First operand 164 states and 226 transitions. Second operand has 6 states, 5 states have (on average 10.6) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-24 01:27:31,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:27:31,026 INFO L93 Difference]: Finished difference Result 424 states and 587 transitions. [2024-11-24 01:27:31,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-24 01:27:31,026 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.6) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 125 [2024-11-24 01:27:31,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:27:31,030 INFO L225 Difference]: With dead ends: 424 [2024-11-24 01:27:31,031 INFO L226 Difference]: Without dead ends: 263 [2024-11-24 01:27:31,031 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-24 01:27:31,033 INFO L435 NwaCegarLoop]: 187 mSDtfsCounter, 111 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 445 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 598 SdHoareTripleChecker+Invalid, 457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-24 01:27:31,034 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 598 Invalid, 457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 445 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-24 01:27:31,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2024-11-24 01:27:31,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 179. [2024-11-24 01:27:31,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 159 states have (on average 1.3459119496855345) internal successors, (214), 160 states have internal predecessors, (214), 17 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-24 01:27:31,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 248 transitions. [2024-11-24 01:27:31,057 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 248 transitions. Word has length 125 [2024-11-24 01:27:31,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:27:31,057 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 248 transitions. [2024-11-24 01:27:31,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.6) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-24 01:27:31,057 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 248 transitions. [2024-11-24 01:27:31,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-24 01:27:31,059 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:27:31,059 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 01:27:31,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-24 01:27:31,060 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:27:31,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:27:31,060 INFO L85 PathProgramCache]: Analyzing trace with hash 1244425874, now seen corresponding path program 1 times [2024-11-24 01:27:31,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:27:31,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852849670] [2024-11-24 01:27:31,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:27:31,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:27:31,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:27:31,615 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-24 01:27:31,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:27:31,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852849670] [2024-11-24 01:27:31,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852849670] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:27:31,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:27:31,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-24 01:27:31,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765599282] [2024-11-24 01:27:31,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:27:31,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-24 01:27:31,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:27:31,617 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-24 01:27:31,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-24 01:27:31,618 INFO L87 Difference]: Start difference. First operand 179 states and 248 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-24 01:27:32,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:27:32,066 INFO L93 Difference]: Finished difference Result 439 states and 608 transitions. [2024-11-24 01:27:32,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-24 01:27:32,066 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 125 [2024-11-24 01:27:32,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:27:32,070 INFO L225 Difference]: With dead ends: 439 [2024-11-24 01:27:32,070 INFO L226 Difference]: Without dead ends: 263 [2024-11-24 01:27:32,071 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-24 01:27:32,072 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 213 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-24 01:27:32,072 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 226 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-24 01:27:32,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2024-11-24 01:27:32,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 179. [2024-11-24 01:27:32,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 159 states have (on average 1.3396226415094339) internal successors, (213), 160 states have internal predecessors, (213), 17 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-24 01:27:32,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 247 transitions. [2024-11-24 01:27:32,089 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 247 transitions. Word has length 125 [2024-11-24 01:27:32,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:27:32,090 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 247 transitions. [2024-11-24 01:27:32,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-24 01:27:32,090 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 247 transitions. [2024-11-24 01:27:32,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-24 01:27:32,091 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:27:32,092 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 01:27:32,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-24 01:27:32,092 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:27:32,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:27:32,093 INFO L85 PathProgramCache]: Analyzing trace with hash -2064726594, now seen corresponding path program 1 times [2024-11-24 01:27:32,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:27:32,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893159813] [2024-11-24 01:27:32,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:27:32,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:27:32,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:27:33,578 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-24 01:27:33,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:27:33,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893159813] [2024-11-24 01:27:33,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893159813] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:27:33,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:27:33,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-24 01:27:33,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714981509] [2024-11-24 01:27:33,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:27:33,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-24 01:27:33,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:27:33,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-24 01:27:33,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-24 01:27:33,580 INFO L87 Difference]: Start difference. First operand 179 states and 247 transitions. Second operand has 7 states, 5 states have (on average 10.8) internal successors, (54), 7 states have internal predecessors, (54), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-24 01:27:34,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:27:34,545 INFO L93 Difference]: Finished difference Result 437 states and 604 transitions. [2024-11-24 01:27:34,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-24 01:27:34,546 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 10.8) internal successors, (54), 7 states have internal predecessors, (54), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 3 states have call successors, (15) Word has length 126 [2024-11-24 01:27:34,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:27:34,548 INFO L225 Difference]: With dead ends: 437 [2024-11-24 01:27:34,548 INFO L226 Difference]: Without dead ends: 261 [2024-11-24 01:27:34,548 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-24 01:27:34,552 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 115 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 501 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-24 01:27:34,553 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 357 Invalid, 516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 501 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-24 01:27:34,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2024-11-24 01:27:34,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 178. [2024-11-24 01:27:34,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 158 states have (on average 1.3291139240506329) internal successors, (210), 159 states have internal predecessors, (210), 17 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-24 01:27:34,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 244 transitions. [2024-11-24 01:27:34,576 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 244 transitions. Word has length 126 [2024-11-24 01:27:34,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:27:34,580 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 244 transitions. [2024-11-24 01:27:34,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 10.8) internal successors, (54), 7 states have internal predecessors, (54), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-24 01:27:34,580 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 244 transitions. [2024-11-24 01:27:34,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-24 01:27:34,582 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:27:34,582 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 01:27:34,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-24 01:27:34,582 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:27:34,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:27:34,583 INFO L85 PathProgramCache]: Analyzing trace with hash 236095996, now seen corresponding path program 1 times [2024-11-24 01:27:34,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:27:34,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513045211] [2024-11-24 01:27:34,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:27:34,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:27:34,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:27:34,949 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-24 01:27:34,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:27:34,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513045211] [2024-11-24 01:27:34,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513045211] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:27:34,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:27:34,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-24 01:27:34,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808416302] [2024-11-24 01:27:34,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:27:34,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-24 01:27:34,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:27:34,951 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-24 01:27:34,951 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-24 01:27:34,951 INFO L87 Difference]: Start difference. First operand 178 states and 244 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-24 01:27:35,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:27:35,358 INFO L93 Difference]: Finished difference Result 436 states and 599 transitions. [2024-11-24 01:27:35,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-24 01:27:35,359 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 126 [2024-11-24 01:27:35,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:27:35,361 INFO L225 Difference]: With dead ends: 436 [2024-11-24 01:27:35,361 INFO L226 Difference]: Without dead ends: 261 [2024-11-24 01:27:35,362 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-24 01:27:35,363 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 169 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-24 01:27:35,363 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 290 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-24 01:27:35,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2024-11-24 01:27:35,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 179. [2024-11-24 01:27:35,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 159 states have (on average 1.320754716981132) internal successors, (210), 160 states have internal predecessors, (210), 17 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-24 01:27:35,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 244 transitions. [2024-11-24 01:27:35,377 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 244 transitions. Word has length 126 [2024-11-24 01:27:35,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:27:35,377 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 244 transitions. [2024-11-24 01:27:35,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-24 01:27:35,378 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 244 transitions. [2024-11-24 01:27:35,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-24 01:27:35,379 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:27:35,380 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 01:27:35,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-24 01:27:35,380 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:27:35,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:27:35,380 INFO L85 PathProgramCache]: Analyzing trace with hash 199899249, now seen corresponding path program 1 times [2024-11-24 01:27:35,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:27:35,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260240231] [2024-11-24 01:27:35,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:27:35,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:27:35,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:27:38,159 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-24 01:27:38,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:27:38,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260240231] [2024-11-24 01:27:38,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260240231] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:27:38,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:27:38,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-24 01:27:38,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95745295] [2024-11-24 01:27:38,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:27:38,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-24 01:27:38,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:27:38,161 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-24 01:27:38,161 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-24 01:27:38,162 INFO L87 Difference]: Start difference. First operand 179 states and 244 transitions. Second operand has 7 states, 6 states have (on average 9.166666666666666) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-24 01:27:39,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:27:39,078 INFO L93 Difference]: Finished difference Result 415 states and 563 transitions. [2024-11-24 01:27:39,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-24 01:27:39,079 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 9.166666666666666) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 127 [2024-11-24 01:27:39,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:27:39,081 INFO L225 Difference]: With dead ends: 415 [2024-11-24 01:27:39,081 INFO L226 Difference]: Without dead ends: 239 [2024-11-24 01:27:39,082 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-24 01:27:39,083 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 61 mSDsluCounter, 630 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 796 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-24 01:27:39,083 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 796 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-24 01:27:39,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2024-11-24 01:27:39,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 190. [2024-11-24 01:27:39,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 170 states have (on average 1.3235294117647058) internal successors, (225), 171 states have internal predecessors, (225), 17 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-24 01:27:39,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 259 transitions. [2024-11-24 01:27:39,099 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 259 transitions. Word has length 127 [2024-11-24 01:27:39,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:27:39,099 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 259 transitions. [2024-11-24 01:27:39,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 9.166666666666666) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-24 01:27:39,100 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 259 transitions. [2024-11-24 01:27:39,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-24 01:27:39,102 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:27:39,102 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 01:27:39,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-24 01:27:39,102 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:27:39,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:27:39,103 INFO L85 PathProgramCache]: Analyzing trace with hash 1335042000, now seen corresponding path program 1 times [2024-11-24 01:27:39,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:27:39,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839557227] [2024-11-24 01:27:39,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:27:39,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:27:39,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:27:39,337 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-11-24 01:27:39,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:27:39,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839557227] [2024-11-24 01:27:39,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839557227] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-24 01:27:39,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [816700349] [2024-11-24 01:27:39,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:27:39,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 01:27:39,338 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e98d4a07-83f7-4711-a5e8-f63921dec43e/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 01:27:39,340 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e98d4a07-83f7-4711-a5e8-f63921dec43e/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-24 01:27:39,345 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e98d4a07-83f7-4711-a5e8-f63921dec43e/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-24 01:27:39,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:27:39,649 INFO L256 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-24 01:27:39,653 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 01:27:39,697 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-24 01:27:39,697 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-24 01:27:39,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [816700349] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:27:39,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-24 01:27:39,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2024-11-24 01:27:39,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88848049] [2024-11-24 01:27:39,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:27:39,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-24 01:27:39,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:27:39,699 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-24 01:27:39,699 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-24 01:27:39,700 INFO L87 Difference]: Start difference. First operand 190 states and 259 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-24 01:27:39,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:27:39,743 INFO L93 Difference]: Finished difference Result 383 states and 523 transitions. [2024-11-24 01:27:39,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-24 01:27:39,744 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 128 [2024-11-24 01:27:39,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:27:39,746 INFO L225 Difference]: With dead ends: 383 [2024-11-24 01:27:39,746 INFO L226 Difference]: Without dead ends: 196 [2024-11-24 01:27:39,747 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-24 01:27:39,747 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 0 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-24 01:27:39,748 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 527 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-24 01:27:39,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2024-11-24 01:27:39,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2024-11-24 01:27:39,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 176 states have (on average 1.3125) internal successors, (231), 177 states have internal predecessors, (231), 17 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-24 01:27:39,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 265 transitions. [2024-11-24 01:27:39,765 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 265 transitions. Word has length 128 [2024-11-24 01:27:39,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:27:39,765 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 265 transitions. [2024-11-24 01:27:39,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-24 01:27:39,766 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 265 transitions. [2024-11-24 01:27:39,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-24 01:27:39,767 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:27:39,768 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 01:27:39,781 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e98d4a07-83f7-4711-a5e8-f63921dec43e/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-24 01:27:39,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e98d4a07-83f7-4711-a5e8-f63921dec43e/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 01:27:39,969 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:27:39,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:27:39,970 INFO L85 PathProgramCache]: Analyzing trace with hash -1530403510, now seen corresponding path program 1 times [2024-11-24 01:27:39,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:27:39,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519420434] [2024-11-24 01:27:39,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:27:39,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:27:40,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:27:40,780 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 30 proven. 12 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-11-24 01:27:40,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:27:40,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519420434] [2024-11-24 01:27:40,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519420434] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-24 01:27:40,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2126685189] [2024-11-24 01:27:40,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:27:40,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 01:27:40,782 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e98d4a07-83f7-4711-a5e8-f63921dec43e/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 01:27:40,784 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e98d4a07-83f7-4711-a5e8-f63921dec43e/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-24 01:27:40,788 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e98d4a07-83f7-4711-a5e8-f63921dec43e/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-24 01:27:41,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:27:41,096 INFO L256 TraceCheckSpWp]: Trace formula consists of 475 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-24 01:27:41,102 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 01:27:41,189 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2024-11-24 01:27:41,249 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2024-11-24 01:27:41,308 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 26 [2024-11-24 01:27:41,356 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-24 01:27:41,356 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 70 treesize of output 47 [2024-11-24 01:27:41,420 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-24 01:27:41,420 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 17 [2024-11-24 01:27:41,445 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 194 proven. 12 refuted. 0 times theorem prover too weak. 214 trivial. 0 not checked. [2024-11-24 01:27:41,446 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-24 01:27:41,863 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 30 proven. 12 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-11-24 01:27:41,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2126685189] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-24 01:27:41,864 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-24 01:27:41,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 8] total 14 [2024-11-24 01:27:41,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259023828] [2024-11-24 01:27:41,864 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-24 01:27:41,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-24 01:27:41,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:27:41,866 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-24 01:27:41,866 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2024-11-24 01:27:41,867 INFO L87 Difference]: Start difference. First operand 196 states and 265 transitions. Second operand has 14 states, 12 states have (on average 6.25) internal successors, (75), 14 states have internal predecessors, (75), 4 states have call successors, (20), 2 states have call predecessors, (20), 4 states have return successors, (20), 2 states have call predecessors, (20), 4 states have call successors, (20) [2024-11-24 01:27:44,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:27:44,033 INFO L93 Difference]: Finished difference Result 517 states and 686 transitions. [2024-11-24 01:27:44,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-24 01:27:44,034 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 6.25) internal successors, (75), 14 states have internal predecessors, (75), 4 states have call successors, (20), 2 states have call predecessors, (20), 4 states have return successors, (20), 2 states have call predecessors, (20), 4 states have call successors, (20) Word has length 129 [2024-11-24 01:27:44,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:27:44,036 INFO L225 Difference]: With dead ends: 517 [2024-11-24 01:27:44,036 INFO L226 Difference]: Without dead ends: 324 [2024-11-24 01:27:44,037 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 248 SyntacticMatches, 8 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=242, Invalid=814, Unknown=0, NotChecked=0, Total=1056 [2024-11-24 01:27:44,038 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 293 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 1284 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 591 SdHoareTripleChecker+Invalid, 1367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 1284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-24 01:27:44,038 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 591 Invalid, 1367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 1284 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-24 01:27:44,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2024-11-24 01:27:44,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 313. [2024-11-24 01:27:44,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 272 states have (on average 1.275735294117647) internal successors, (347), 274 states have internal predecessors, (347), 32 states have call successors, (32), 8 states have call predecessors, (32), 8 states have return successors, (32), 30 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-24 01:27:44,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 411 transitions. [2024-11-24 01:27:44,080 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 411 transitions. Word has length 129 [2024-11-24 01:27:44,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:27:44,082 INFO L471 AbstractCegarLoop]: Abstraction has 313 states and 411 transitions. [2024-11-24 01:27:44,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 6.25) internal successors, (75), 14 states have internal predecessors, (75), 4 states have call successors, (20), 2 states have call predecessors, (20), 4 states have return successors, (20), 2 states have call predecessors, (20), 4 states have call successors, (20) [2024-11-24 01:27:44,082 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 411 transitions. [2024-11-24 01:27:44,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-24 01:27:44,086 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:27:44,086 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 01:27:44,098 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e98d4a07-83f7-4711-a5e8-f63921dec43e/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-24 01:27:44,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e98d4a07-83f7-4711-a5e8-f63921dec43e/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 01:27:44,287 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:27:44,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:27:44,288 INFO L85 PathProgramCache]: Analyzing trace with hash -1507771256, now seen corresponding path program 1 times [2024-11-24 01:27:44,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:27:44,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994393637] [2024-11-24 01:27:44,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:27:44,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:27:44,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-24 01:27:44,445 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-24 01:27:44,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-24 01:27:44,599 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-24 01:27:44,599 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-24 01:27:44,601 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-24 01:27:44,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-24 01:27:44,606 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:27:44,686 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-24 01:27:44,690 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.11 01:27:44 BoogieIcfgContainer [2024-11-24 01:27:44,690 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-24 01:27:44,692 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-24 01:27:44,692 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-24 01:27:44,692 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-24 01:27:44,693 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 01:27:23" (3/4) ... [2024-11-24 01:27:44,696 INFO L149 WitnessPrinter]: No result that supports witness generation found [2024-11-24 01:27:44,697 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-24 01:27:44,697 INFO L158 Benchmark]: Toolchain (without parser) took 22789.05ms. Allocated memory was 117.4MB in the beginning and 369.1MB in the end (delta: 251.7MB). Free memory was 92.6MB in the beginning and 207.0MB in the end (delta: -114.4MB). Peak memory consumption was 137.2MB. Max. memory is 16.1GB. [2024-11-24 01:27:44,698 INFO L158 Benchmark]: CDTParser took 1.18ms. Allocated memory is still 117.4MB. Free memory is still 72.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-24 01:27:44,699 INFO L158 Benchmark]: CACSL2BoogieTranslator took 375.33ms. Allocated memory is still 117.4MB. Free memory was 92.4MB in the beginning and 76.2MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-24 01:27:44,699 INFO L158 Benchmark]: Boogie Procedure Inliner took 97.64ms. Allocated memory is still 117.4MB. Free memory was 76.2MB in the beginning and 72.7MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-24 01:27:44,699 INFO L158 Benchmark]: Boogie Preprocessor took 103.65ms. Allocated memory is still 117.4MB. Free memory was 72.7MB in the beginning and 69.5MB in the end (delta: 3.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-24 01:27:44,700 INFO L158 Benchmark]: RCFGBuilder took 1057.88ms. Allocated memory is still 117.4MB. Free memory was 69.3MB in the beginning and 39.9MB in the end (delta: 29.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-24 01:27:44,702 INFO L158 Benchmark]: TraceAbstraction took 21137.50ms. Allocated memory was 117.4MB in the beginning and 369.1MB in the end (delta: 251.7MB). Free memory was 39.3MB in the beginning and 207.0MB in the end (delta: -167.8MB). Peak memory consumption was 86.9MB. Max. memory is 16.1GB. [2024-11-24 01:27:44,702 INFO L158 Benchmark]: Witness Printer took 4.79ms. Allocated memory is still 369.1MB. Free memory was 207.0MB in the beginning and 207.0MB in the end (delta: 49.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-24 01:27:44,703 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.18ms. Allocated memory is still 117.4MB. Free memory is still 72.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 375.33ms. Allocated memory is still 117.4MB. Free memory was 92.4MB in the beginning and 76.2MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 97.64ms. Allocated memory is still 117.4MB. Free memory was 76.2MB in the beginning and 72.7MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 103.65ms. Allocated memory is still 117.4MB. Free memory was 72.7MB in the beginning and 69.5MB in the end (delta: 3.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1057.88ms. Allocated memory is still 117.4MB. Free memory was 69.3MB in the beginning and 39.9MB in the end (delta: 29.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 21137.50ms. Allocated memory was 117.4MB in the beginning and 369.1MB in the end (delta: 251.7MB). Free memory was 39.3MB in the beginning and 207.0MB in the end (delta: -167.8MB). Peak memory consumption was 86.9MB. Max. memory is 16.1GB. * Witness Printer took 4.79ms. Allocated memory is still 369.1MB. Free memory was 207.0MB in the beginning and 207.0MB in the end (delta: 49.0kB). 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 someBinaryArithmeticDOUBLEoperation at line 75, overapproximation of someBinaryFLOATComparisonOperation at line 66, overapproximation of someBinaryFLOATComparisonOperation at line 102, overapproximation of someBinaryFLOATComparisonOperation at line 102, overapproximation of someBinaryFLOATComparisonOperation at line 107, overapproximation of someBinaryDOUBLEComparisonOperation at line 75, overapproximation of someBinaryDOUBLEComparisonOperation at line 75. Possible FailurePath: [L38] unsigned char isInitial = 0; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 32, 0, 16, 4, 0, 0, 55182, 0, 1, 1, 100, 2.25, 199.4, -128 }; VAL [WrapperStruct00={4:0}, isInitial=0] [L111] isInitial = 1 [L112] FCALL initially() [L114] FCALL updateLastVariables() [L115] CALL updateVariables() [L80] WrapperStruct00.var_1_2 = __VERIFIER_nondet_uchar() [L81] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1] [L81] CALL assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L81] RET assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L82] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1] [L82] CALL assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L82] RET assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L83] WrapperStruct00.var_1_4 = __VERIFIER_nondet_char() [L84] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1] [L84] CALL assume_abort_if_not(WrapperStruct00.var_1_4 >= -1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L84] RET assume_abort_if_not(WrapperStruct00.var_1_4 >= -1) VAL [WrapperStruct00={4:0}, isInitial=1] [L85] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1] [L85] CALL assume_abort_if_not(WrapperStruct00.var_1_4 <= 126) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L85] RET assume_abort_if_not(WrapperStruct00.var_1_4 <= 126) VAL [WrapperStruct00={4:0}, isInitial=1] [L86] WrapperStruct00.var_1_5 = __VERIFIER_nondet_char() [L87] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1] [L87] CALL assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L87] RET assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L88] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1] [L88] CALL assume_abort_if_not(WrapperStruct00.var_1_5 <= 126) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L88] RET assume_abort_if_not(WrapperStruct00.var_1_5 <= 126) VAL [WrapperStruct00={4:0}, isInitial=1] [L89] WrapperStruct00.var_1_6 = __VERIFIER_nondet_char() [L90] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1] [L90] CALL assume_abort_if_not(WrapperStruct00.var_1_6 >= -127) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L90] RET assume_abort_if_not(WrapperStruct00.var_1_6 >= -127) VAL [WrapperStruct00={4:0}, isInitial=1] [L91] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1] [L91] CALL assume_abort_if_not(WrapperStruct00.var_1_6 <= 126) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L91] RET assume_abort_if_not(WrapperStruct00.var_1_6 <= 126) VAL [WrapperStruct00={4:0}, isInitial=1] [L92] WrapperStruct00.var_1_10 = __VERIFIER_nondet_ushort() [L93] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1] [L93] CALL assume_abort_if_not(WrapperStruct00.var_1_10 >= 32767) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L93] RET assume_abort_if_not(WrapperStruct00.var_1_10 >= 32767) VAL [WrapperStruct00={4:0}, isInitial=1] [L94] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1] [L94] CALL assume_abort_if_not(WrapperStruct00.var_1_10 <= 65534) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L94] RET assume_abort_if_not(WrapperStruct00.var_1_10 <= 65534) VAL [WrapperStruct00={4:0}, isInitial=1] [L95] WrapperStruct00.var_1_14 = __VERIFIER_nondet_uchar() [L96] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1] [L96] CALL assume_abort_if_not(WrapperStruct00.var_1_14 >= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L96] RET assume_abort_if_not(WrapperStruct00.var_1_14 >= 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L97] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1] [L97] CALL assume_abort_if_not(WrapperStruct00.var_1_14 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L97] RET assume_abort_if_not(WrapperStruct00.var_1_14 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L98] WrapperStruct00.var_1_15 = __VERIFIER_nondet_uchar() [L99] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1] [L99] CALL assume_abort_if_not(WrapperStruct00.var_1_15 >= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L99] RET assume_abort_if_not(WrapperStruct00.var_1_15 >= 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L100] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1] [L100] CALL assume_abort_if_not(WrapperStruct00.var_1_15 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L100] RET assume_abort_if_not(WrapperStruct00.var_1_15 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L101] WrapperStruct00.var_1_18 = __VERIFIER_nondet_float() [L102] EXPR WrapperStruct00.var_1_18 [L102] EXPR WrapperStruct00.var_1_18 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_18 <= -1.0e-20F [L102] EXPR WrapperStruct00.var_1_18 [L102] EXPR WrapperStruct00.var_1_18 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_18 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L102] EXPR (WrapperStruct00.var_1_18 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_18 <= -1.0e-20F) || (WrapperStruct00.var_1_18 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_18 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L102] CALL assume_abort_if_not((WrapperStruct00.var_1_18 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_18 <= -1.0e-20F) || (WrapperStruct00.var_1_18 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_18 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L102] RET assume_abort_if_not((WrapperStruct00.var_1_18 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_18 <= -1.0e-20F) || (WrapperStruct00.var_1_18 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_18 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1] [L115] RET updateVariables() [L116] CALL step() [L58] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1] [L58] COND FALSE !(! WrapperStruct00.var_1_2) [L61] EXPR WrapperStruct00.var_1_15 [L61] WrapperStruct00.var_1_12 = ((! WrapperStruct00.var_1_15) || (! (! 0))) [L63] EXPR WrapperStruct00.var_1_5 [L63] WrapperStruct00.var_1_16 = WrapperStruct00.var_1_5 [L64] EXPR WrapperStruct00.var_1_18 [L64] WrapperStruct00.var_1_17 = WrapperStruct00.var_1_18 [L65] EXPR WrapperStruct00.var_1_4 [L65] WrapperStruct00.var_1_19 = WrapperStruct00.var_1_4 [L66] EXPR WrapperStruct00.var_1_12 [L66] WrapperStruct00.var_1_12 || (64.75f < WrapperStruct00.var_1_17) [L66] EXPR WrapperStruct00.var_1_17 [L66] WrapperStruct00.var_1_12 || (64.75f < WrapperStruct00.var_1_17) VAL [WrapperStruct00={4:0}, isInitial=1] [L66] COND TRUE WrapperStruct00.var_1_12 || (64.75f < WrapperStruct00.var_1_17) [L67] WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1] [L67] COND FALSE !(WrapperStruct00.var_1_12) [L70] EXPR WrapperStruct00.var_1_4 [L70] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1] [L70] EXPR ((WrapperStruct00.var_1_4) > (WrapperStruct00.var_1_5)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_5) [L70] EXPR WrapperStruct00.var_1_4 [L70] EXPR ((WrapperStruct00.var_1_4) > (WrapperStruct00.var_1_5)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_5) VAL [WrapperStruct00={4:0}, isInitial=1] [L70] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1] [L70] EXPR ((((((WrapperStruct00.var_1_4) > (WrapperStruct00.var_1_5)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_5)))) < (WrapperStruct00.var_1_6)) ? (((((WrapperStruct00.var_1_4) > (WrapperStruct00.var_1_5)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_5)))) : (WrapperStruct00.var_1_6) [L70] EXPR WrapperStruct00.var_1_6 [L70] EXPR ((((((WrapperStruct00.var_1_4) > (WrapperStruct00.var_1_5)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_5)))) < (WrapperStruct00.var_1_6)) ? (((((WrapperStruct00.var_1_4) > (WrapperStruct00.var_1_5)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_5)))) : (WrapperStruct00.var_1_6) VAL [WrapperStruct00={4:0}, isInitial=1] [L70] WrapperStruct00.var_1_1 = ((((((((WrapperStruct00.var_1_4) > (WrapperStruct00.var_1_5)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_5)))) < (WrapperStruct00.var_1_6)) ? (((((WrapperStruct00.var_1_4) > (WrapperStruct00.var_1_5)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_5)))) : (WrapperStruct00.var_1_6))) [L75] EXPR WrapperStruct00.var_1_17 [L75] EXPR WrapperStruct00.var_1_17 VAL [WrapperStruct00={4:0}, isInitial=1] [L75] EXPR (((WrapperStruct00.var_1_17 * 127.75)) > ((WrapperStruct00.var_1_17 / 3.4))) ? ((WrapperStruct00.var_1_17 * 127.75)) : ((WrapperStruct00.var_1_17 / 3.4)) [L75] EXPR WrapperStruct00.var_1_17 [L75] EXPR (((WrapperStruct00.var_1_17 * 127.75)) > ((WrapperStruct00.var_1_17 / 3.4))) ? ((WrapperStruct00.var_1_17 * 127.75)) : ((WrapperStruct00.var_1_17 / 3.4)) VAL [WrapperStruct00={4:0}, isInitial=1] [L75] EXPR WrapperStruct00.var_1_17 VAL [WrapperStruct00={4:0}, isInitial=1] [L75] COND FALSE !((((((WrapperStruct00.var_1_17 * 127.75)) > ((WrapperStruct00.var_1_17 / 3.4))) ? ((WrapperStruct00.var_1_17 * 127.75)) : ((WrapperStruct00.var_1_17 / 3.4)))) >= WrapperStruct00.var_1_17) [L116] RET step() [L117] CALL, EXPR property() [L107] EXPR WrapperStruct00.var_1_12 [L107] EXPR WrapperStruct00.var_1_12 || (64.75f < WrapperStruct00.var_1_17) [L107] EXPR WrapperStruct00.var_1_17 [L107] EXPR WrapperStruct00.var_1_12 || (64.75f < WrapperStruct00.var_1_17) VAL [WrapperStruct00={4:0}, isInitial=1] [L107] EXPR (WrapperStruct00.var_1_12 || (64.75f < WrapperStruct00.var_1_17)) ? (WrapperStruct00.var_1_12 ? (WrapperStruct00.var_1_1 == ((signed char) (WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5))) : (WrapperStruct00.var_1_1 == ((signed char) ((((((((WrapperStruct00.var_1_4) > (WrapperStruct00.var_1_5)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_5)))) < (WrapperStruct00.var_1_6)) ? (((((WrapperStruct00.var_1_4) > (WrapperStruct00.var_1_5)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_5)))) : (WrapperStruct00.var_1_6)))))) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_4)) [L107] EXPR WrapperStruct00.var_1_1 [L107] EXPR WrapperStruct00.var_1_4 [L107] EXPR (WrapperStruct00.var_1_12 || (64.75f < WrapperStruct00.var_1_17)) ? (WrapperStruct00.var_1_12 ? (WrapperStruct00.var_1_1 == ((signed char) (WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5))) : (WrapperStruct00.var_1_1 == ((signed char) ((((((((WrapperStruct00.var_1_4) > (WrapperStruct00.var_1_5)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_5)))) < (WrapperStruct00.var_1_6)) ? (((((WrapperStruct00.var_1_4) > (WrapperStruct00.var_1_5)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_5)))) : (WrapperStruct00.var_1_6)))))) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_4)) VAL [WrapperStruct00={4:0}, isInitial=1] [L107] EXPR ((WrapperStruct00.var_1_12 || (64.75f < WrapperStruct00.var_1_17)) ? (WrapperStruct00.var_1_12 ? (WrapperStruct00.var_1_1 == ((signed char) (WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5))) : (WrapperStruct00.var_1_1 == ((signed char) ((((((((WrapperStruct00.var_1_4) > (WrapperStruct00.var_1_5)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_5)))) < (WrapperStruct00.var_1_6)) ? (((((WrapperStruct00.var_1_4) > (WrapperStruct00.var_1_5)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_5)))) : (WrapperStruct00.var_1_6)))))) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_4))) && (((((((WrapperStruct00.var_1_17 * 127.75)) > ((WrapperStruct00.var_1_17 / 3.4))) ? ((WrapperStruct00.var_1_17 * 127.75)) : ((WrapperStruct00.var_1_17 / 3.4)))) >= WrapperStruct00.var_1_17) ? (WrapperStruct00.var_1_7 == ((unsigned short int) (((((WrapperStruct00.var_1_10 - (22925 - WrapperStruct00.var_1_5))) < (WrapperStruct00.var_1_16)) ? ((WrapperStruct00.var_1_10 - (22925 - WrapperStruct00.var_1_5))) : (WrapperStruct00.var_1_16))))) : 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L107] EXPR (((WrapperStruct00.var_1_12 || (64.75f < WrapperStruct00.var_1_17)) ? (WrapperStruct00.var_1_12 ? (WrapperStruct00.var_1_1 == ((signed char) (WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5))) : (WrapperStruct00.var_1_1 == ((signed char) ((((((((WrapperStruct00.var_1_4) > (WrapperStruct00.var_1_5)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_5)))) < (WrapperStruct00.var_1_6)) ? (((((WrapperStruct00.var_1_4) > (WrapperStruct00.var_1_5)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_5)))) : (WrapperStruct00.var_1_6)))))) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_4))) && (((((((WrapperStruct00.var_1_17 * 127.75)) > ((WrapperStruct00.var_1_17 / 3.4))) ? ((WrapperStruct00.var_1_17 * 127.75)) : ((WrapperStruct00.var_1_17 / 3.4)))) >= WrapperStruct00.var_1_17) ? (WrapperStruct00.var_1_7 == ((unsigned short int) (((((WrapperStruct00.var_1_10 - (22925 - WrapperStruct00.var_1_5))) < (WrapperStruct00.var_1_16)) ? ((WrapperStruct00.var_1_10 - (22925 - WrapperStruct00.var_1_5))) : (WrapperStruct00.var_1_16))))) : 1)) && ((! WrapperStruct00.var_1_2) ? (WrapperStruct00.var_1_12 == ((unsigned char) WrapperStruct00.var_1_14)) : (WrapperStruct00.var_1_12 == ((unsigned char) ((! WrapperStruct00.var_1_15) || (! (! 0)))))) VAL [WrapperStruct00={4:0}, isInitial=1] [L107] EXPR ((((WrapperStruct00.var_1_12 || (64.75f < WrapperStruct00.var_1_17)) ? (WrapperStruct00.var_1_12 ? (WrapperStruct00.var_1_1 == ((signed char) (WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5))) : (WrapperStruct00.var_1_1 == ((signed char) ((((((((WrapperStruct00.var_1_4) > (WrapperStruct00.var_1_5)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_5)))) < (WrapperStruct00.var_1_6)) ? (((((WrapperStruct00.var_1_4) > (WrapperStruct00.var_1_5)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_5)))) : (WrapperStruct00.var_1_6)))))) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_4))) && (((((((WrapperStruct00.var_1_17 * 127.75)) > ((WrapperStruct00.var_1_17 / 3.4))) ? ((WrapperStruct00.var_1_17 * 127.75)) : ((WrapperStruct00.var_1_17 / 3.4)))) >= WrapperStruct00.var_1_17) ? (WrapperStruct00.var_1_7 == ((unsigned short int) (((((WrapperStruct00.var_1_10 - (22925 - WrapperStruct00.var_1_5))) < (WrapperStruct00.var_1_16)) ? ((WrapperStruct00.var_1_10 - (22925 - WrapperStruct00.var_1_5))) : (WrapperStruct00.var_1_16))))) : 1)) && ((! WrapperStruct00.var_1_2) ? (WrapperStruct00.var_1_12 == ((unsigned char) WrapperStruct00.var_1_14)) : (WrapperStruct00.var_1_12 == ((unsigned char) ((! WrapperStruct00.var_1_15) || (! (! 0))))))) && (WrapperStruct00.var_1_16 == ((unsigned char) WrapperStruct00.var_1_5)) VAL [WrapperStruct00={4:0}, isInitial=1] [L107] EXPR (((((WrapperStruct00.var_1_12 || (64.75f < WrapperStruct00.var_1_17)) ? (WrapperStruct00.var_1_12 ? (WrapperStruct00.var_1_1 == ((signed char) (WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5))) : (WrapperStruct00.var_1_1 == ((signed char) ((((((((WrapperStruct00.var_1_4) > (WrapperStruct00.var_1_5)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_5)))) < (WrapperStruct00.var_1_6)) ? (((((WrapperStruct00.var_1_4) > (WrapperStruct00.var_1_5)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_5)))) : (WrapperStruct00.var_1_6)))))) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_4))) && (((((((WrapperStruct00.var_1_17 * 127.75)) > ((WrapperStruct00.var_1_17 / 3.4))) ? ((WrapperStruct00.var_1_17 * 127.75)) : ((WrapperStruct00.var_1_17 / 3.4)))) >= WrapperStruct00.var_1_17) ? (WrapperStruct00.var_1_7 == ((unsigned short int) (((((WrapperStruct00.var_1_10 - (22925 - WrapperStruct00.var_1_5))) < (WrapperStruct00.var_1_16)) ? ((WrapperStruct00.var_1_10 - (22925 - WrapperStruct00.var_1_5))) : (WrapperStruct00.var_1_16))))) : 1)) && ((! WrapperStruct00.var_1_2) ? (WrapperStruct00.var_1_12 == ((unsigned char) WrapperStruct00.var_1_14)) : (WrapperStruct00.var_1_12 == ((unsigned char) ((! WrapperStruct00.var_1_15) || (! (! 0))))))) && (WrapperStruct00.var_1_16 == ((unsigned char) WrapperStruct00.var_1_5))) && (WrapperStruct00.var_1_17 == ((float) WrapperStruct00.var_1_18)) VAL [WrapperStruct00={4:0}, isInitial=1] [L107] EXPR ((((((WrapperStruct00.var_1_12 || (64.75f < WrapperStruct00.var_1_17)) ? (WrapperStruct00.var_1_12 ? (WrapperStruct00.var_1_1 == ((signed char) (WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5))) : (WrapperStruct00.var_1_1 == ((signed char) ((((((((WrapperStruct00.var_1_4) > (WrapperStruct00.var_1_5)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_5)))) < (WrapperStruct00.var_1_6)) ? (((((WrapperStruct00.var_1_4) > (WrapperStruct00.var_1_5)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_5)))) : (WrapperStruct00.var_1_6)))))) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_4))) && (((((((WrapperStruct00.var_1_17 * 127.75)) > ((WrapperStruct00.var_1_17 / 3.4))) ? ((WrapperStruct00.var_1_17 * 127.75)) : ((WrapperStruct00.var_1_17 / 3.4)))) >= WrapperStruct00.var_1_17) ? (WrapperStruct00.var_1_7 == ((unsigned short int) (((((WrapperStruct00.var_1_10 - (22925 - WrapperStruct00.var_1_5))) < (WrapperStruct00.var_1_16)) ? ((WrapperStruct00.var_1_10 - (22925 - WrapperStruct00.var_1_5))) : (WrapperStruct00.var_1_16))))) : 1)) && ((! WrapperStruct00.var_1_2) ? (WrapperStruct00.var_1_12 == ((unsigned char) WrapperStruct00.var_1_14)) : (WrapperStruct00.var_1_12 == ((unsigned char) ((! WrapperStruct00.var_1_15) || (! (! 0))))))) && (WrapperStruct00.var_1_16 == ((unsigned char) WrapperStruct00.var_1_5))) && (WrapperStruct00.var_1_17 == ((float) WrapperStruct00.var_1_18))) && (WrapperStruct00.var_1_19 == ((signed char) WrapperStruct00.var_1_4)) VAL [WrapperStruct00={4:0}, isInitial=1] [L107-L108] return ((((((WrapperStruct00.var_1_12 || (64.75f < WrapperStruct00.var_1_17)) ? (WrapperStruct00.var_1_12 ? (WrapperStruct00.var_1_1 == ((signed char) (WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5))) : (WrapperStruct00.var_1_1 == ((signed char) ((((((((WrapperStruct00.var_1_4) > (WrapperStruct00.var_1_5)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_5)))) < (WrapperStruct00.var_1_6)) ? (((((WrapperStruct00.var_1_4) > (WrapperStruct00.var_1_5)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_5)))) : (WrapperStruct00.var_1_6)))))) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_4))) && (((((((WrapperStruct00.var_1_17 * 127.75)) > ((WrapperStruct00.var_1_17 / 3.4))) ? ((WrapperStruct00.var_1_17 * 127.75)) : ((WrapperStruct00.var_1_17 / 3.4)))) >= WrapperStruct00.var_1_17) ? (WrapperStruct00.var_1_7 == ((unsigned short int) (((((WrapperStruct00.var_1_10 - (22925 - WrapperStruct00.var_1_5))) < (WrapperStruct00.var_1_16)) ? ((WrapperStruct00.var_1_10 - (22925 - WrapperStruct00.var_1_5))) : (WrapperStruct00.var_1_16))))) : 1)) && ((! WrapperStruct00.var_1_2) ? (WrapperStruct00.var_1_12 == ((unsigned char) WrapperStruct00.var_1_14)) : (WrapperStruct00.var_1_12 == ((unsigned char) ((! WrapperStruct00.var_1_15) || (! (! 0))))))) && (WrapperStruct00.var_1_16 == ((unsigned char) WrapperStruct00.var_1_5))) && (WrapperStruct00.var_1_17 == ((float) WrapperStruct00.var_1_18))) && (WrapperStruct00.var_1_19 == ((signed char) WrapperStruct00.var_1_4)) ; [L117] RET, EXPR property() [L117] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, isInitial=1] [L19] reach_error() VAL [WrapperStruct00={4:0}, isInitial=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 101 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 21.0s, OverallIterations: 16, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 6.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1053 SdHoareTripleChecker+Valid, 5.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1028 mSDsluCounter, 6116 SdHoareTripleChecker+Invalid, 4.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4159 mSDsCounter, 219 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3272 IncrementalHoareTripleChecker+Invalid, 3491 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 219 mSolverCounterUnsat, 1957 mSDtfsCounter, 3272 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 643 GetRequests, 553 SyntacticMatches, 8 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=313occurred in iteration=15, InterpolantAutomatonStates: 96, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 15 MinimizatonAttempts, 399 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 10.1s InterpolantComputationTime, 2388 NumberOfCodeBlocks, 2388 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 2369 ConstructedInterpolants, 0 QuantifiedInterpolants, 4733 SizeOfPredicates, 7 NumberOfNonLiveVariables, 1406 ConjunctsInSsa, 29 ConjunctsInUnsatCore, 19 InterpolantComputations, 14 PerfectInterpolantSequences, 7874/7980 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, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-24 01:27:44,732 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e98d4a07-83f7-4711-a5e8-f63921dec43e/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e98d4a07-83f7-4711-a5e8-f63921dec43e/bin/uautomizer-verify-LYvppIcaGC/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e98d4a07-83f7-4711-a5e8-f63921dec43e/bin/uautomizer-verify-LYvppIcaGC/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e98d4a07-83f7-4711-a5e8-f63921dec43e/bin/uautomizer-verify-LYvppIcaGC/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e98d4a07-83f7-4711-a5e8-f63921dec43e/bin/uautomizer-verify-LYvppIcaGC/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-24.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e98d4a07-83f7-4711-a5e8-f63921dec43e/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e98d4a07-83f7-4711-a5e8-f63921dec43e/bin/uautomizer-verify-LYvppIcaGC --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 27f1e743425525541ce4822cf6e51a4737fceae5e241bd8bfab81b1f43b03433 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-6497de0 [2024-11-24 01:27:47,748 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-24 01:27:47,872 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e98d4a07-83f7-4711-a5e8-f63921dec43e/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-24 01:27:47,878 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-24 01:27:47,879 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-24 01:27:47,911 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-24 01:27:47,912 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-24 01:27:47,912 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-24 01:27:47,913 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-24 01:27:47,913 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-24 01:27:47,913 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-24 01:27:47,913 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-24 01:27:47,914 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-24 01:27:47,914 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-24 01:27:47,914 INFO L153 SettingsManager]: * Use SBE=true [2024-11-24 01:27:47,914 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-24 01:27:47,914 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-24 01:27:47,914 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-24 01:27:47,915 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-24 01:27:47,915 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-24 01:27:47,915 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-24 01:27:47,915 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-24 01:27:47,915 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-24 01:27:47,915 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-24 01:27:47,915 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-24 01:27:47,915 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-24 01:27:47,916 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-24 01:27:47,916 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-24 01:27:47,916 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-24 01:27:47,916 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-24 01:27:47,916 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-24 01:27:47,916 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-24 01:27:47,916 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-24 01:27:47,916 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-24 01:27:47,916 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-24 01:27:47,916 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-24 01:27:47,917 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-24 01:27:47,917 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-24 01:27:47,917 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-24 01:27:47,917 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-24 01:27:47,917 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-24 01:27:47,917 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-24 01:27:47,917 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-24 01:27:47,917 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-24 01:27:47,917 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-24 01:27:47,917 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-24 01:27:47,918 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-24 01:27:47,918 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-24 01:27:47,918 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-24 01:27:47,918 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-24 01:27:47,918 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_e98d4a07-83f7-4711-a5e8-f63921dec43e/bin/uautomizer-verify-LYvppIcaGC 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 -> 27f1e743425525541ce4822cf6e51a4737fceae5e241bd8bfab81b1f43b03433 [2024-11-24 01:27:48,256 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-24 01:27:48,265 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-24 01:27:48,267 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-24 01:27:48,269 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-24 01:27:48,269 INFO L274 PluginConnector]: CDTParser initialized [2024-11-24 01:27:48,270 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e98d4a07-83f7-4711-a5e8-f63921dec43e/bin/uautomizer-verify-LYvppIcaGC/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-24.i [2024-11-24 01:27:51,471 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e98d4a07-83f7-4711-a5e8-f63921dec43e/bin/uautomizer-verify-LYvppIcaGC/data/a90af7190/80cfe5e8965949c4b81b8c3c4cae418c/FLAGb98cc58ab [2024-11-24 01:27:51,775 INFO L384 CDTParser]: Found 1 translation units. [2024-11-24 01:27:51,776 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e98d4a07-83f7-4711-a5e8-f63921dec43e/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-24.i [2024-11-24 01:27:51,788 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e98d4a07-83f7-4711-a5e8-f63921dec43e/bin/uautomizer-verify-LYvppIcaGC/data/a90af7190/80cfe5e8965949c4b81b8c3c4cae418c/FLAGb98cc58ab [2024-11-24 01:27:51,811 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e98d4a07-83f7-4711-a5e8-f63921dec43e/bin/uautomizer-verify-LYvppIcaGC/data/a90af7190/80cfe5e8965949c4b81b8c3c4cae418c [2024-11-24 01:27:51,817 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-24 01:27:51,819 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-24 01:27:51,821 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-24 01:27:51,822 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-24 01:27:51,826 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-24 01:27:51,827 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 01:27:51" (1/1) ... [2024-11-24 01:27:51,828 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@119038cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:27:51, skipping insertion in model container [2024-11-24 01:27:51,830 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 01:27:51" (1/1) ... [2024-11-24 01:27:51,853 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-24 01:27:52,022 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_e98d4a07-83f7-4711-a5e8-f63921dec43e/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-24.i[916,929] [2024-11-24 01:27:52,113 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-24 01:27:52,132 INFO L200 MainTranslator]: Completed pre-run [2024-11-24 01:27:52,144 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_e98d4a07-83f7-4711-a5e8-f63921dec43e/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-24.i[916,929] [2024-11-24 01:27:52,203 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-24 01:27:52,227 INFO L204 MainTranslator]: Completed translation [2024-11-24 01:27:52,228 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:27:52 WrapperNode [2024-11-24 01:27:52,228 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-24 01:27:52,229 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-24 01:27:52,230 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-24 01:27:52,230 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-24 01:27:52,237 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:27:52" (1/1) ... [2024-11-24 01:27:52,259 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:27:52" (1/1) ... [2024-11-24 01:27:52,303 INFO L138 Inliner]: procedures = 34, calls = 153, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 452 [2024-11-24 01:27:52,303 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-24 01:27:52,304 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-24 01:27:52,304 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-24 01:27:52,304 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-24 01:27:52,313 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:27:52" (1/1) ... [2024-11-24 01:27:52,314 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:27:52" (1/1) ... [2024-11-24 01:27:52,321 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:27:52" (1/1) ... [2024-11-24 01:27:52,338 INFO L175 MemorySlicer]: Split 127 memory accesses to 2 slices as follows [2, 125]. 98 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 32 writes are split as follows [0, 32]. [2024-11-24 01:27:52,338 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:27:52" (1/1) ... [2024-11-24 01:27:52,339 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:27:52" (1/1) ... [2024-11-24 01:27:52,360 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:27:52" (1/1) ... [2024-11-24 01:27:52,362 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:27:52" (1/1) ... [2024-11-24 01:27:52,367 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:27:52" (1/1) ... [2024-11-24 01:27:52,370 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:27:52" (1/1) ... [2024-11-24 01:27:52,372 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:27:52" (1/1) ... [2024-11-24 01:27:52,376 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-24 01:27:52,377 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-24 01:27:52,377 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-24 01:27:52,378 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-24 01:27:52,379 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:27:52" (1/1) ... [2024-11-24 01:27:52,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-24 01:27:52,410 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e98d4a07-83f7-4711-a5e8-f63921dec43e/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 01:27:52,426 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e98d4a07-83f7-4711-a5e8-f63921dec43e/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-24 01:27:52,434 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e98d4a07-83f7-4711-a5e8-f63921dec43e/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-24 01:27:52,461 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-24 01:27:52,462 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-24 01:27:52,462 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-24 01:27:52,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-24 01:27:52,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-24 01:27:52,462 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-24 01:27:52,462 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-24 01:27:52,462 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-24 01:27:52,463 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-24 01:27:52,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-24 01:27:52,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-24 01:27:52,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#0 [2024-11-24 01:27:52,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#1 [2024-11-24 01:27:52,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2024-11-24 01:27:52,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2024-11-24 01:27:52,465 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-24 01:27:52,465 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-24 01:27:52,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#0 [2024-11-24 01:27:52,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#1 [2024-11-24 01:27:52,466 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-24 01:27:52,466 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-24 01:27:52,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-24 01:27:52,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-24 01:27:52,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-24 01:27:52,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-24 01:27:52,655 INFO L234 CfgBuilder]: Building ICFG [2024-11-24 01:27:52,657 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-24 01:28:11,087 INFO L? ?]: Removed 124 outVars from TransFormulas that were not future-live. [2024-11-24 01:28:11,087 INFO L283 CfgBuilder]: Performing block encoding [2024-11-24 01:28:11,098 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-24 01:28:11,099 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-24 01:28:11,099 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 01:28:11 BoogieIcfgContainer [2024-11-24 01:28:11,099 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-24 01:28:11,102 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-24 01:28:11,102 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-24 01:28:11,107 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-24 01:28:11,107 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 01:27:51" (1/3) ... [2024-11-24 01:28:11,108 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cf77e56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 01:28:11, skipping insertion in model container [2024-11-24 01:28:11,108 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:27:52" (2/3) ... [2024-11-24 01:28:11,108 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cf77e56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 01:28:11, skipping insertion in model container [2024-11-24 01:28:11,108 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 01:28:11" (3/3) ... [2024-11-24 01:28:11,110 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-24.i [2024-11-24 01:28:11,125 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-24 01:28:11,126 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-s_file-24.i that has 2 procedures, 101 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-24 01:28:11,216 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-24 01:28:11,231 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;@41477e41, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-24 01:28:11,231 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-24 01:28:11,237 INFO L276 IsEmpty]: Start isEmpty. Operand has 101 states, 83 states have (on average 1.3975903614457832) internal successors, (116), 84 states have internal predecessors, (116), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-24 01:28:11,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-24 01:28:11,247 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:28:11,247 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 01:28:11,248 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:28:11,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:28:11,253 INFO L85 PathProgramCache]: Analyzing trace with hash 1133390607, now seen corresponding path program 1 times [2024-11-24 01:28:11,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-24 01:28:11,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [376463609] [2024-11-24 01:28:11,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:28:11,265 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-24 01:28:11,265 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e98d4a07-83f7-4711-a5e8-f63921dec43e/bin/uautomizer-verify-LYvppIcaGC/mathsat [2024-11-24 01:28:11,267 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e98d4a07-83f7-4711-a5e8-f63921dec43e/bin/uautomizer-verify-LYvppIcaGC/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-24 01:28:11,270 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e98d4a07-83f7-4711-a5e8-f63921dec43e/bin/uautomizer-verify-LYvppIcaGC/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-24 01:28:12,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:28:12,661 INFO L256 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-24 01:28:12,670 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 01:28:12,734 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 220 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2024-11-24 01:28:12,735 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-24 01:28:12,736 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-24 01:28:12,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [376463609] [2024-11-24 01:28:12,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [376463609] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:28:12,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:28:12,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-24 01:28:12,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651381429] [2024-11-24 01:28:12,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:28:12,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-24 01:28:12,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-24 01:28:12,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-24 01:28:12,769 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-24 01:28:12,772 INFO L87 Difference]: Start difference. First operand has 101 states, 83 states have (on average 1.3975903614457832) internal successors, (116), 84 states have internal predecessors, (116), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-24 01:28:12,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:28:12,819 INFO L93 Difference]: Finished difference Result 195 states and 301 transitions. [2024-11-24 01:28:12,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-24 01:28:12,821 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 124 [2024-11-24 01:28:12,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:28:12,830 INFO L225 Difference]: With dead ends: 195 [2024-11-24 01:28:12,831 INFO L226 Difference]: Without dead ends: 97 [2024-11-24 01:28:12,834 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 123 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-24 01:28:12,840 INFO L435 NwaCegarLoop]: 139 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, 139 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-24 01:28:12,842 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-24 01:28:12,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-24 01:28:12,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2024-11-24 01:28:12,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 80 states have (on average 1.3625) internal successors, (109), 80 states have internal predecessors, (109), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-24 01:28:12,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 139 transitions. [2024-11-24 01:28:12,892 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 139 transitions. Word has length 124 [2024-11-24 01:28:12,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:28:12,893 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 139 transitions. [2024-11-24 01:28:12,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-24 01:28:12,894 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 139 transitions. [2024-11-24 01:28:12,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-24 01:28:12,897 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:28:12,897 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 01:28:12,913 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e98d4a07-83f7-4711-a5e8-f63921dec43e/bin/uautomizer-verify-LYvppIcaGC/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-24 01:28:13,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e98d4a07-83f7-4711-a5e8-f63921dec43e/bin/uautomizer-verify-LYvppIcaGC/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-24 01:28:13,098 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:28:13,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:28:13,099 INFO L85 PathProgramCache]: Analyzing trace with hash -191984407, now seen corresponding path program 1 times [2024-11-24 01:28:13,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-24 01:28:13,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [200755193] [2024-11-24 01:28:13,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:28:13,100 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-24 01:28:13,100 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e98d4a07-83f7-4711-a5e8-f63921dec43e/bin/uautomizer-verify-LYvppIcaGC/mathsat [2024-11-24 01:28:13,104 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e98d4a07-83f7-4711-a5e8-f63921dec43e/bin/uautomizer-verify-LYvppIcaGC/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-24 01:28:13,106 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e98d4a07-83f7-4711-a5e8-f63921dec43e/bin/uautomizer-verify-LYvppIcaGC/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-24 01:28:14,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:28:14,383 INFO L256 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-24 01:28:14,389 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 01:28:14,528 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-24 01:28:14,528 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-24 01:28:14,529 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-24 01:28:14,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [200755193] [2024-11-24 01:28:14,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [200755193] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:28:14,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:28:14,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-24 01:28:14,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491918466] [2024-11-24 01:28:14,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:28:14,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-24 01:28:14,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-24 01:28:14,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-24 01:28:14,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 01:28:14,532 INFO L87 Difference]: Start difference. First operand 97 states and 139 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-24 01:28:14,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:28:14,707 INFO L93 Difference]: Finished difference Result 192 states and 277 transitions. [2024-11-24 01:28:14,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-24 01:28:14,709 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 124 [2024-11-24 01:28:14,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:28:14,711 INFO L225 Difference]: With dead ends: 192 [2024-11-24 01:28:14,711 INFO L226 Difference]: Without dead ends: 98 [2024-11-24 01:28:14,712 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 01:28:14,713 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 0 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-24 01:28:14,714 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 270 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-24 01:28:14,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-24 01:28:14,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2024-11-24 01:28:14,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 81 states have (on average 1.3580246913580247) internal successors, (110), 81 states have internal predecessors, (110), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-24 01:28:14,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 140 transitions. [2024-11-24 01:28:14,728 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 140 transitions. Word has length 124 [2024-11-24 01:28:14,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:28:14,731 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 140 transitions. [2024-11-24 01:28:14,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-24 01:28:14,731 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 140 transitions. [2024-11-24 01:28:14,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-24 01:28:14,734 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:28:14,734 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 01:28:14,760 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e98d4a07-83f7-4711-a5e8-f63921dec43e/bin/uautomizer-verify-LYvppIcaGC/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-24 01:28:14,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e98d4a07-83f7-4711-a5e8-f63921dec43e/bin/uautomizer-verify-LYvppIcaGC/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-24 01:28:14,935 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:28:14,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:28:14,936 INFO L85 PathProgramCache]: Analyzing trace with hash -1997422741, now seen corresponding path program 1 times [2024-11-24 01:28:14,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-24 01:28:14,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [420962813] [2024-11-24 01:28:14,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:28:14,937 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-24 01:28:14,937 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e98d4a07-83f7-4711-a5e8-f63921dec43e/bin/uautomizer-verify-LYvppIcaGC/mathsat [2024-11-24 01:28:14,939 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e98d4a07-83f7-4711-a5e8-f63921dec43e/bin/uautomizer-verify-LYvppIcaGC/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-24 01:28:14,940 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e98d4a07-83f7-4711-a5e8-f63921dec43e/bin/uautomizer-verify-LYvppIcaGC/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-24 01:28:16,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:28:16,396 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-24 01:28:16,401 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 01:28:16,497 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-24 01:28:16,497 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-24 01:28:16,497 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-24 01:28:16,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [420962813] [2024-11-24 01:28:16,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [420962813] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:28:16,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:28:16,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-24 01:28:16,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853188727] [2024-11-24 01:28:16,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:28:16,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-24 01:28:16,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-24 01:28:16,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-24 01:28:16,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 01:28:16,500 INFO L87 Difference]: Start difference. First operand 98 states and 140 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-24 01:28:16,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:28:16,666 INFO L93 Difference]: Finished difference Result 194 states and 279 transitions. [2024-11-24 01:28:16,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-24 01:28:16,667 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 124 [2024-11-24 01:28:16,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:28:16,669 INFO L225 Difference]: With dead ends: 194 [2024-11-24 01:28:16,670 INFO L226 Difference]: Without dead ends: 99 [2024-11-24 01:28:16,674 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 01:28:16,675 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 0 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-24 01:28:16,676 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 270 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-24 01:28:16,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-24 01:28:16,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2024-11-24 01:28:16,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 82 states have (on average 1.353658536585366) internal successors, (111), 82 states have internal predecessors, (111), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-24 01:28:16,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 141 transitions. [2024-11-24 01:28:16,688 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 141 transitions. Word has length 124 [2024-11-24 01:28:16,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:28:16,691 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 141 transitions. [2024-11-24 01:28:16,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-24 01:28:16,692 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 141 transitions. [2024-11-24 01:28:16,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-24 01:28:16,694 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:28:16,694 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 01:28:16,722 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e98d4a07-83f7-4711-a5e8-f63921dec43e/bin/uautomizer-verify-LYvppIcaGC/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-24 01:28:16,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e98d4a07-83f7-4711-a5e8-f63921dec43e/bin/uautomizer-verify-LYvppIcaGC/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-24 01:28:16,901 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:28:16,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:28:16,902 INFO L85 PathProgramCache]: Analyzing trace with hash 1276476201, now seen corresponding path program 1 times [2024-11-24 01:28:16,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-24 01:28:16,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1828736311] [2024-11-24 01:28:16,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:28:16,903 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-24 01:28:16,903 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e98d4a07-83f7-4711-a5e8-f63921dec43e/bin/uautomizer-verify-LYvppIcaGC/mathsat [2024-11-24 01:28:16,905 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e98d4a07-83f7-4711-a5e8-f63921dec43e/bin/uautomizer-verify-LYvppIcaGC/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-24 01:28:16,907 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e98d4a07-83f7-4711-a5e8-f63921dec43e/bin/uautomizer-verify-LYvppIcaGC/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-24 01:28:18,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:28:18,124 INFO L256 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-24 01:28:18,127 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 01:28:18,549 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-24 01:28:18,549 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-24 01:28:18,549 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-24 01:28:18,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1828736311] [2024-11-24 01:28:18,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1828736311] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:28:18,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:28:18,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-24 01:28:18,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572049055] [2024-11-24 01:28:18,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:28:18,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-24 01:28:18,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-24 01:28:18,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-24 01:28:18,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-24 01:28:18,552 INFO L87 Difference]: Start difference. First operand 99 states and 141 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-24 01:28:19,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:28:19,155 INFO L93 Difference]: Finished difference Result 200 states and 286 transitions. [2024-11-24 01:28:19,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-24 01:28:19,156 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 124 [2024-11-24 01:28:19,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:28:19,158 INFO L225 Difference]: With dead ends: 200 [2024-11-24 01:28:19,158 INFO L226 Difference]: Without dead ends: 104 [2024-11-24 01:28:19,159 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-24 01:28:19,160 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 1 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-24 01:28:19,160 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 520 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-24 01:28:19,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-24 01:28:19,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2024-11-24 01:28:19,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 86 states have (on average 1.3372093023255813) internal successors, (115), 86 states have internal predecessors, (115), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-24 01:28:19,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 145 transitions. [2024-11-24 01:28:19,175 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 145 transitions. Word has length 124 [2024-11-24 01:28:19,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:28:19,176 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 145 transitions. [2024-11-24 01:28:19,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-24 01:28:19,176 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 145 transitions. [2024-11-24 01:28:19,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-24 01:28:19,182 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:28:19,182 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 01:28:19,206 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e98d4a07-83f7-4711-a5e8-f63921dec43e/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-24 01:28:19,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e98d4a07-83f7-4711-a5e8-f63921dec43e/bin/uautomizer-verify-LYvppIcaGC/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-24 01:28:19,383 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:28:19,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:28:19,384 INFO L85 PathProgramCache]: Analyzing trace with hash 1956534571, now seen corresponding path program 1 times [2024-11-24 01:28:19,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-24 01:28:19,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1678853448] [2024-11-24 01:28:19,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:28:19,385 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-24 01:28:19,385 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e98d4a07-83f7-4711-a5e8-f63921dec43e/bin/uautomizer-verify-LYvppIcaGC/mathsat [2024-11-24 01:28:19,389 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e98d4a07-83f7-4711-a5e8-f63921dec43e/bin/uautomizer-verify-LYvppIcaGC/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-24 01:28:19,390 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e98d4a07-83f7-4711-a5e8-f63921dec43e/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-24 01:28:20,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:28:20,509 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-24 01:28:20,513 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 01:28:21,064 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-24 01:28:21,064 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-24 01:28:21,065 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-24 01:28:21,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1678853448] [2024-11-24 01:28:21,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1678853448] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:28:21,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:28:21,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-24 01:28:21,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443125592] [2024-11-24 01:28:21,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:28:21,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-24 01:28:21,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-24 01:28:21,067 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-24 01:28:21,067 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-24 01:28:21,067 INFO L87 Difference]: Start difference. First operand 103 states and 145 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-24 01:28:21,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:28:21,851 INFO L93 Difference]: Finished difference Result 206 states and 291 transitions. [2024-11-24 01:28:21,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-24 01:28:21,852 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 124 [2024-11-24 01:28:21,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:28:21,854 INFO L225 Difference]: With dead ends: 206 [2024-11-24 01:28:21,854 INFO L226 Difference]: Without dead ends: 106 [2024-11-24 01:28:21,855 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-24 01:28:21,857 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 1 mSDsluCounter, 508 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 640 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-24 01:28:21,858 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 640 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-24 01:28:21,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-24 01:28:21,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2024-11-24 01:28:21,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 88 states have (on average 1.3295454545454546) internal successors, (117), 88 states have internal predecessors, (117), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-24 01:28:21,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 147 transitions. [2024-11-24 01:28:21,878 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 147 transitions. Word has length 124 [2024-11-24 01:28:21,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:28:21,896 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 147 transitions. [2024-11-24 01:28:21,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-24 01:28:21,896 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 147 transitions. [2024-11-24 01:28:21,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-24 01:28:21,898 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:28:21,898 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 01:28:21,923 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e98d4a07-83f7-4711-a5e8-f63921dec43e/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-24 01:28:22,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e98d4a07-83f7-4711-a5e8-f63921dec43e/bin/uautomizer-verify-LYvppIcaGC/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-24 01:28:22,099 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:28:22,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:28:22,100 INFO L85 PathProgramCache]: Analyzing trace with hash -563425363, now seen corresponding path program 1 times [2024-11-24 01:28:22,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-24 01:28:22,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1840837540] [2024-11-24 01:28:22,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:28:22,100 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-24 01:28:22,100 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e98d4a07-83f7-4711-a5e8-f63921dec43e/bin/uautomizer-verify-LYvppIcaGC/mathsat [2024-11-24 01:28:22,102 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e98d4a07-83f7-4711-a5e8-f63921dec43e/bin/uautomizer-verify-LYvppIcaGC/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-24 01:28:22,103 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e98d4a07-83f7-4711-a5e8-f63921dec43e/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-24 01:28:23,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:28:23,270 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-24 01:28:23,273 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 01:28:24,121 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-24 01:28:24,121 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-24 01:28:24,121 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-24 01:28:24,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1840837540] [2024-11-24 01:28:24,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1840837540] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:28:24,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:28:24,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-24 01:28:24,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221525375] [2024-11-24 01:28:24,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:28:24,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-24 01:28:24,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-24 01:28:24,123 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-24 01:28:24,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-24 01:28:24,124 INFO L87 Difference]: Start difference. First operand 105 states and 147 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-24 01:28:25,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:28:25,122 INFO L93 Difference]: Finished difference Result 210 states and 295 transitions. [2024-11-24 01:28:25,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-24 01:28:25,125 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 124 [2024-11-24 01:28:25,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:28:25,127 INFO L225 Difference]: With dead ends: 210 [2024-11-24 01:28:25,128 INFO L226 Difference]: Without dead ends: 108 [2024-11-24 01:28:25,128 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-24 01:28:25,129 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 1 mSDsluCounter, 631 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 761 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-24 01:28:25,129 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 761 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-24 01:28:25,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-24 01:28:25,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2024-11-24 01:28:25,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 90 states have (on average 1.3222222222222222) internal successors, (119), 90 states have internal predecessors, (119), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-24 01:28:25,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 149 transitions. [2024-11-24 01:28:25,153 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 149 transitions. Word has length 124 [2024-11-24 01:28:25,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:28:25,155 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 149 transitions. [2024-11-24 01:28:25,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-24 01:28:25,155 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 149 transitions. [2024-11-24 01:28:25,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-24 01:28:25,157 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:28:25,157 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 01:28:25,177 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e98d4a07-83f7-4711-a5e8-f63921dec43e/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-11-24 01:28:25,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e98d4a07-83f7-4711-a5e8-f63921dec43e/bin/uautomizer-verify-LYvppIcaGC/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-24 01:28:25,358 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:28:25,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:28:25,358 INFO L85 PathProgramCache]: Analyzing trace with hash -561578321, now seen corresponding path program 1 times [2024-11-24 01:28:25,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-24 01:28:25,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1962695520] [2024-11-24 01:28:25,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:28:25,359 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-24 01:28:25,359 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e98d4a07-83f7-4711-a5e8-f63921dec43e/bin/uautomizer-verify-LYvppIcaGC/mathsat [2024-11-24 01:28:25,360 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e98d4a07-83f7-4711-a5e8-f63921dec43e/bin/uautomizer-verify-LYvppIcaGC/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-24 01:28:25,362 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e98d4a07-83f7-4711-a5e8-f63921dec43e/bin/uautomizer-verify-LYvppIcaGC/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 (8)] Waiting until timeout for monitored process [2024-11-24 01:28:27,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:28:27,555 INFO L256 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-24 01:28:27,562 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 01:28:39,245 WARN L286 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 18 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 01:28:52,432 WARN L286 SmtUtils]: Spent 8.28s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 01:28:56,484 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse2 (select (select |c_#memory_int#1| |c_~#WrapperStruct00~0.base|) (bvadd (_ bv13 32) |c_~#WrapperStruct00~0.offset|)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2)))))) (let ((.cse0 (fp.mul c_currentRoundingMode .cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 511.0 4.0))))) (and (= |c_ULTIMATE.start_step_#t~ite34#1| .cse0) (fp.gt .cse0 (fp.div c_currentRoundingMode .cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 17.0 5.0)))) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from false [2024-11-24 01:29:17,740 WARN L286 SmtUtils]: Spent 8.32s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 01:29:21,803 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (let ((.cse3 (select (select |c_#memory_int#1| |c_~#WrapperStruct00~0.base|) (bvadd (_ bv13 32) |c_~#WrapperStruct00~0.offset|)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode .cse1))) (let ((.cse0 (fp.mul c_currentRoundingMode .cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 511.0 4.0))))) (and (= |c_ULTIMATE.start_step_#t~ite34#1| .cse0) (= |c_ULTIMATE.start_step_#t~mem35#1| .cse1) (fp.gt .cse0 (fp.div c_currentRoundingMode .cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 17.0 5.0)))) (= c_currentRoundingMode roundNearestTiesToEven))))) is different from false [2024-11-24 01:29:25,914 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (let ((.cse3 (select (select |c_#memory_int#1| |c_~#WrapperStruct00~0.base|) (bvadd (_ bv13 32) |c_~#WrapperStruct00~0.offset|)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode .cse1))) (let ((.cse0 (fp.mul c_currentRoundingMode .cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 511.0 4.0))))) (and (= |c_ULTIMATE.start_step_#t~ite34#1| .cse0) (= |c_ULTIMATE.start_step_#t~mem35#1| .cse1) (fp.gt .cse0 (fp.div c_currentRoundingMode .cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 17.0 5.0)))) (= c_currentRoundingMode roundNearestTiesToEven))))) is different from true [2024-11-24 01:29:34,089 WARN L286 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 18 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 01:29:41,093 WARN L286 SmtUtils]: Spent 7.00s on a formula simplification that was a NOOP. DAG size: 20 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 01:29:49,398 WARN L286 SmtUtils]: Spent 8.30s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 01:29:53,443 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse2 (select (select |c_#memory_int#1| |c_~#WrapperStruct00~0.base|) (bvadd (_ bv13 32) |c_~#WrapperStruct00~0.offset|)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2)))))) (let ((.cse0 (fp.mul c_currentRoundingMode .cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 511.0 4.0))))) (and (fp.gt .cse0 (fp.div c_currentRoundingMode .cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 17.0 5.0)))) (not (fp.geq .cse0 .cse1)) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from false [2024-11-24 01:29:57,531 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse2 (select (select |c_#memory_int#1| |c_~#WrapperStruct00~0.base|) (bvadd (_ bv13 32) |c_~#WrapperStruct00~0.offset|)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2)))))) (let ((.cse0 (fp.mul c_currentRoundingMode .cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 511.0 4.0))))) (and (fp.gt .cse0 (fp.div c_currentRoundingMode .cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 17.0 5.0)))) (not (fp.geq .cse0 .cse1)) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2024-11-24 01:30:05,701 WARN L286 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 18 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 01:30:13,811 WARN L286 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 20 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 01:30:22,121 WARN L286 SmtUtils]: Spent 8.31s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 01:30:22,194 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 192 treesize of output 84 [2024-11-24 01:30:34,469 WARN L286 SmtUtils]: Spent 8.18s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 01:30:42,579 WARN L286 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 01:30:50,736 WARN L286 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 01:31:02,953 WARN L286 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 01:31:11,062 WARN L286 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 01:31:19,215 WARN L286 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 01:31:23,314 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (/ 259.0 4.0))) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven (/ 17.0 5.0))) (.cse5 ((_ to_fp 11 53) roundNearestTiesToEven (/ 511.0 4.0)))) (or (and (not |c_ULTIMATE.start_property_#t~short74#1|) (exists ((v_arrayElimCell_1 (_ BitVec 32))) (let ((.cse1 (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1)))) (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven .cse1))) (let ((.cse2 (fp.mul roundNearestTiesToEven .cse3 .cse5))) (and (not (fp.lt .cse0 .cse1)) (fp.gt .cse2 (fp.div roundNearestTiesToEven .cse3 .cse4)) (not (fp.geq .cse2 .cse3)))))))) (and |c_ULTIMATE.start_property_#t~short74#1| (exists ((v_arrayElimCell_1 (_ BitVec 32))) (let ((.cse6 (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1)))) (let ((.cse8 ((_ to_fp 11 53) roundNearestTiesToEven .cse6))) (let ((.cse7 (fp.mul roundNearestTiesToEven .cse8 .cse5))) (and (fp.lt .cse0 .cse6) (fp.gt .cse7 (fp.div roundNearestTiesToEven .cse8 .cse4)) (not (fp.geq .cse7 .cse8)))))))))) is different from false [2024-11-24 01:31:27,348 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (/ 259.0 4.0))) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven (/ 17.0 5.0))) (.cse5 ((_ to_fp 11 53) roundNearestTiesToEven (/ 511.0 4.0)))) (or (and (not |c_ULTIMATE.start_property_#t~short74#1|) (exists ((v_arrayElimCell_1 (_ BitVec 32))) (let ((.cse1 (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1)))) (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven .cse1))) (let ((.cse2 (fp.mul roundNearestTiesToEven .cse3 .cse5))) (and (not (fp.lt .cse0 .cse1)) (fp.gt .cse2 (fp.div roundNearestTiesToEven .cse3 .cse4)) (not (fp.geq .cse2 .cse3)))))))) (and |c_ULTIMATE.start_property_#t~short74#1| (exists ((v_arrayElimCell_1 (_ BitVec 32))) (let ((.cse6 (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1)))) (let ((.cse8 ((_ to_fp 11 53) roundNearestTiesToEven .cse6))) (let ((.cse7 (fp.mul roundNearestTiesToEven .cse8 .cse5))) (and (fp.lt .cse0 .cse6) (fp.gt .cse7 (fp.div roundNearestTiesToEven .cse8 .cse4)) (not (fp.geq .cse7 .cse8)))))))))) is different from true [2024-11-24 01:31:39,581 WARN L286 SmtUtils]: Spent 8.18s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 01:31:47,699 WARN L286 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 01:31:55,867 WARN L286 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 01:31:59,917 WARN L851 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_1 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1)))) (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven .cse0))) (let ((.cse1 (fp.mul roundNearestTiesToEven .cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 511.0 4.0))))) (and (not (fp.lt ((_ to_fp 8 24) roundNearestTiesToEven (/ 259.0 4.0)) .cse0)) (fp.gt .cse1 (fp.div roundNearestTiesToEven .cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 17.0 5.0)))) (not (fp.geq .cse1 .cse2))))))) is different from false [2024-11-24 01:32:03,950 WARN L873 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_1 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1)))) (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven .cse0))) (let ((.cse1 (fp.mul roundNearestTiesToEven .cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 511.0 4.0))))) (and (not (fp.lt ((_ to_fp 8 24) roundNearestTiesToEven (/ 259.0 4.0)) .cse0)) (fp.gt .cse1 (fp.div roundNearestTiesToEven .cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 17.0 5.0)))) (not (fp.geq .cse1 .cse2))))))) is different from true [2024-11-24 01:32:20,512 WARN L286 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 01:32:28,683 WARN L286 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 01:32:32,736 WARN L851 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_1 (_ BitVec 32))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1))))) (let ((.cse0 (fp.mul roundNearestTiesToEven .cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 511.0 4.0))))) (and (fp.gt .cse0 (fp.div roundNearestTiesToEven .cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 17.0 5.0)))) (not (fp.geq .cse0 .cse1)))))) is different from false [2024-11-24 01:32:36,768 WARN L873 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_1 (_ BitVec 32))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1))))) (let ((.cse0 (fp.mul roundNearestTiesToEven .cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 511.0 4.0))))) (and (fp.gt .cse0 (fp.div roundNearestTiesToEven .cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 17.0 5.0)))) (not (fp.geq .cse0 .cse1)))))) is different from true [2024-11-24 01:32:48,954 WARN L286 SmtUtils]: Spent 8.13s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 01:32:57,106 WARN L286 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 01:33:08,862 WARN L286 SmtUtils]: Spent 7.70s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 01:33:17,025 WARN L286 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 01:33:28,182 WARN L286 SmtUtils]: Spent 7.11s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 01:33:36,339 WARN L286 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 01:33:48,492 WARN L286 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 01:33:56,668 WARN L286 SmtUtils]: Spent 8.18s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 01:34:08,831 WARN L286 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 01:34:17,039 WARN L286 SmtUtils]: Spent 8.21s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 01:34:29,205 WARN L286 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 01:34:37,422 WARN L286 SmtUtils]: Spent 8.22s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 01:34:48,960 WARN L286 SmtUtils]: Spent 7.48s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 01:34:57,142 WARN L286 SmtUtils]: Spent 8.18s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 01:35:09,307 WARN L286 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 01:35:14,923 WARN L286 SmtUtils]: Spent 5.62s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 01:35:26,419 WARN L286 SmtUtils]: Spent 7.44s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 01:35:34,597 WARN L286 SmtUtils]: Spent 8.18s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 01:35:46,762 WARN L286 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 01:35:54,945 WARN L286 SmtUtils]: Spent 8.18s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 01:36:07,113 WARN L286 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 01:36:15,287 WARN L286 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 01:36:27,474 WARN L286 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 01:36:35,658 WARN L286 SmtUtils]: Spent 8.18s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 01:36:35,660 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-24 01:36:35,660 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-24 01:36:35,660 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-24 01:36:35,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1962695520] [2024-11-24 01:36:35,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1962695520] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:36:35,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:36:35,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-24 01:36:35,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332346323] [2024-11-24 01:36:35,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:36:35,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-24 01:36:35,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-24 01:36:35,662 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-24 01:36:35,662 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=7, Unknown=11, NotChecked=54, Total=90 [2024-11-24 01:36:35,663 INFO L87 Difference]: Start difference. First operand 107 states and 149 transitions. Second operand has 10 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-24 01:36:41,336 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.32s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-24 01:36:45,340 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-24 01:36:50,205 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.86s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-24 01:36:52,917 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.71s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-24 01:36:58,619 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.53s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-24 01:37:02,624 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-24 01:37:07,057 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.43s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-24 01:37:11,062 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-24 01:37:15,716 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.55s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-24 01:37:19,728 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-24 01:37:24,265 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.54s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-24 01:37:28,269 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-24 01:37:34,243 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.36s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-24 01:37:38,250 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-24 01:37:42,805 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.55s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-24 01:37:43,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:37:43,180 INFO L93 Difference]: Finished difference Result 231 states and 319 transitions. [2024-11-24 01:37:43,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-24 01:37:43,187 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 124 [2024-11-24 01:37:43,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:37:43,189 INFO L225 Difference]: With dead ends: 231 [2024-11-24 01:37:43,189 INFO L226 Difference]: Without dead ends: 229 [2024-11-24 01:37:43,190 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 45.4s TimeCoverageRelationStatistics Valid=18, Invalid=7, Unknown=11, NotChecked=54, Total=90 [2024-11-24 01:37:43,191 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 77 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 0 mSolverCounterUnsat, 14 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 66.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 1930 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 14 IncrementalHoareTripleChecker+Unknown, 1773 IncrementalHoareTripleChecker+Unchecked, 67.5s IncrementalHoareTripleChecker+Time [2024-11-24 01:37:43,191 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 390 Invalid, 1930 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 143 Invalid, 14 Unknown, 1773 Unchecked, 67.5s Time] [2024-11-24 01:37:43,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2024-11-24 01:37:43,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 227. [2024-11-24 01:37:43,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 194 states have (on average 1.3195876288659794) internal successors, (256), 194 states have internal predecessors, (256), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-24 01:37:43,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 316 transitions. [2024-11-24 01:37:43,211 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 316 transitions. Word has length 124 [2024-11-24 01:37:43,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:37:43,211 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 316 transitions. [2024-11-24 01:37:43,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-24 01:37:43,212 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 316 transitions. [2024-11-24 01:37:43,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-24 01:37:43,214 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:37:43,214 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 01:37:43,241 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e98d4a07-83f7-4711-a5e8-f63921dec43e/bin/uautomizer-verify-LYvppIcaGC/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 (8)] Forceful destruction successful, exit code 0 [2024-11-24 01:37:43,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e98d4a07-83f7-4711-a5e8-f63921dec43e/bin/uautomizer-verify-LYvppIcaGC/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-24 01:37:43,415 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:37:43,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:37:43,415 INFO L85 PathProgramCache]: Analyzing trace with hash -1379226771, now seen corresponding path program 1 times [2024-11-24 01:37:43,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-24 01:37:43,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [791667142] [2024-11-24 01:37:43,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:37:43,416 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-24 01:37:43,416 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e98d4a07-83f7-4711-a5e8-f63921dec43e/bin/uautomizer-verify-LYvppIcaGC/mathsat [2024-11-24 01:37:43,418 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e98d4a07-83f7-4711-a5e8-f63921dec43e/bin/uautomizer-verify-LYvppIcaGC/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-24 01:37:43,419 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e98d4a07-83f7-4711-a5e8-f63921dec43e/bin/uautomizer-verify-LYvppIcaGC/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 (9)] Waiting until timeout for monitored process [2024-11-24 01:37:47,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:37:47,187 INFO L256 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-24 01:37:47,194 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 01:37:47,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-24 01:37:48,174 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2024-11-24 01:37:48,642 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2024-11-24 01:37:49,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2024-11-24 01:37:49,560 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2024-11-24 01:37:50,007 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2024-11-24 01:37:51,273 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-24 01:37:51,274 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 28 [2024-11-24 01:37:52,274 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 60 [2024-11-24 01:37:52,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-24 01:37:52,358 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-24 01:37:52,358 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 88 [2024-11-24 01:37:52,512 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-24 01:37:52,515 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 23 [2024-11-24 01:37:53,927 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-24 01:37:53,928 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 120 treesize of output 88 [2024-11-24 01:37:55,502 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-24 01:37:55,502 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 113 treesize of output 100 [2024-11-24 01:37:59,777 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-24 01:37:59,778 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 153 treesize of output 75 [2024-11-24 01:38:00,606 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 222 proven. 36 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2024-11-24 01:38:00,606 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-24 01:38:03,236 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-24 01:38:03,236 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-24 01:38:03,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [791667142] [2024-11-24 01:38:03,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [791667142] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-24 01:38:03,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-24 01:38:03,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 14 [2024-11-24 01:38:03,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861696580] [2024-11-24 01:38:03,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:38:03,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-24 01:38:03,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-24 01:38:03,239 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-24 01:38:03,239 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2024-11-24 01:38:03,240 INFO L87 Difference]: Start difference. First operand 227 states and 316 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-24 01:38:08,445 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.36s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-24 01:38:12,452 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-24 01:38:16,458 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-24 01:38:21,095 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.64s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-24 01:38:25,098 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-24 01:38:29,105 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-24 01:38:33,641 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.31s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-24 01:38:38,272 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.63s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-24 01:38:45,022 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.54s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-24 01:38:49,033 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-24 01:38:53,044 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-24 01:38:57,573 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.53s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-24 01:39:01,577 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-24 01:39:05,602 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-24 01:39:10,220 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.48s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-24 01:39:14,729 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.51s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-24 01:39:17,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:39:17,003 INFO L93 Difference]: Finished difference Result 580 states and 803 transitions. [2024-11-24 01:39:17,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-24 01:39:17,004 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 124 [2024-11-24 01:39:17,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:39:17,009 INFO L225 Difference]: With dead ends: 580 [2024-11-24 01:39:17,009 INFO L226 Difference]: Without dead ends: 356 [2024-11-24 01:39:17,010 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2024-11-24 01:39:17,011 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 63 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 2 mSolverCounterUnsat, 16 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 71.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 16 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 73.2s IncrementalHoareTripleChecker+Time [2024-11-24 01:39:17,012 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 448 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 183 Invalid, 16 Unknown, 0 Unchecked, 73.2s Time] [2024-11-24 01:39:17,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2024-11-24 01:39:17,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 345. [2024-11-24 01:39:17,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 306 states have (on average 1.326797385620915) internal successors, (406), 308 states have internal predecessors, (406), 34 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 32 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-24 01:39:17,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 474 transitions. [2024-11-24 01:39:17,043 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 474 transitions. Word has length 124 [2024-11-24 01:39:17,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:39:17,044 INFO L471 AbstractCegarLoop]: Abstraction has 345 states and 474 transitions. [2024-11-24 01:39:17,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-24 01:39:17,044 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 474 transitions. [2024-11-24 01:39:17,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-24 01:39:17,046 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:39:17,047 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 01:39:17,087 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e98d4a07-83f7-4711-a5e8-f63921dec43e/bin/uautomizer-verify-LYvppIcaGC/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 (9)] Ended with exit code 0 [2024-11-24 01:39:17,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e98d4a07-83f7-4711-a5e8-f63921dec43e/bin/uautomizer-verify-LYvppIcaGC/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-24 01:39:17,247 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:39:17,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:39:17,248 INFO L85 PathProgramCache]: Analyzing trace with hash -1039731188, now seen corresponding path program 1 times [2024-11-24 01:39:17,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-24 01:39:17,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1224538443] [2024-11-24 01:39:17,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:39:17,249 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-24 01:39:17,249 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e98d4a07-83f7-4711-a5e8-f63921dec43e/bin/uautomizer-verify-LYvppIcaGC/mathsat [2024-11-24 01:39:17,251 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e98d4a07-83f7-4711-a5e8-f63921dec43e/bin/uautomizer-verify-LYvppIcaGC/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-24 01:39:17,253 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e98d4a07-83f7-4711-a5e8-f63921dec43e/bin/uautomizer-verify-LYvppIcaGC/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 (10)] Waiting until timeout for monitored process [2024-11-24 01:39:21,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:39:21,332 INFO L256 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-24 01:39:21,339 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 01:39:21,451 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-24 01:39:24,014 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 20 [2024-11-24 01:39:24,944 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 61 [2024-11-24 01:39:25,005 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-24 01:39:25,007 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 75 [2024-11-24 01:39:25,900 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-24 01:39:25,901 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 30 [2024-11-24 01:39:26,354 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 138 proven. 6 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2024-11-24 01:39:26,354 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-24 01:39:31,180 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 72 proven. 6 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2024-11-24 01:39:31,181 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-24 01:39:31,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1224538443] [2024-11-24 01:39:31,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1224538443] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-24 01:39:31,181 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-24 01:39:31,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 17 [2024-11-24 01:39:31,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8298887] [2024-11-24 01:39:31,182 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-24 01:39:31,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-24 01:39:31,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-24 01:39:31,184 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-24 01:39:31,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=203, Unknown=0, NotChecked=0, Total=272 [2024-11-24 01:39:31,184 INFO L87 Difference]: Start difference. First operand 345 states and 474 transitions. Second operand has 17 states, 13 states have (on average 5.769230769230769) internal successors, (75), 17 states have internal predecessors, (75), 7 states have call successors, (18), 3 states have call predecessors, (18), 5 states have return successors, (18), 3 states have call predecessors, (18), 7 states have call successors, (18) [2024-11-24 01:39:48,995 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.33s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-24 01:39:53,001 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-24 01:39:57,026 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-24 01:40:01,036 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-24 01:40:05,047 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-24 01:40:09,060 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-24 01:40:13,064 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-24 01:40:17,075 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-24 01:40:21,659 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.58s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-24 01:40:25,667 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-24 01:40:29,675 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-24 01:40:33,689 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-24 01:40:37,694 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-24 01:40:41,704 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-24 01:40:45,717 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-24 01:40:49,728 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-24 01:40:54,566 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.29s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-24 01:40:58,569 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-24 01:41:02,578 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-24 01:41:06,582 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-24 01:41:10,609 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-24 01:41:14,618 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-24 01:41:18,636 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-24 01:41:22,642 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-24 01:41:26,654 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-24 01:41:30,660 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-24 01:41:35,271 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.61s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-24 01:41:39,279 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-24 01:41:43,284 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-24 01:41:47,291 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-24 01:41:51,296 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-24 01:41:55,314 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-24 01:41:59,333 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-24 01:42:03,349 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-24 01:42:07,355 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-24 01:42:11,370 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-24 01:42:20,602 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.50s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers []