./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-97.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0156e362-4196-4396-8b7a-c1f2eb61f4bf/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0156e362-4196-4396-8b7a-c1f2eb61f4bf/bin/uautomizer-verify-jihMAELWvX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0156e362-4196-4396-8b7a-c1f2eb61f4bf/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0156e362-4196-4396-8b7a-c1f2eb61f4bf/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-97.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0156e362-4196-4396-8b7a-c1f2eb61f4bf/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0156e362-4196-4396-8b7a-c1f2eb61f4bf/bin/uautomizer-verify-jihMAELWvX --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash abf1fadcf9bfc6046971a4719244290526d1ce32a1ee2d2e74022cac98e38aab --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 18:22:43,801 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 18:22:43,919 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0156e362-4196-4396-8b7a-c1f2eb61f4bf/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 18:22:43,929 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 18:22:43,929 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 18:22:43,962 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 18:22:43,963 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 18:22:43,964 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 18:22:43,965 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 18:22:43,966 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 18:22:43,967 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 18:22:43,968 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 18:22:43,969 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 18:22:43,970 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 18:22:43,970 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 18:22:43,971 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 18:22:43,972 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 18:22:43,973 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 18:22:43,973 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 18:22:43,974 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 18:22:43,975 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 18:22:43,976 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 18:22:43,976 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 18:22:43,977 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 18:22:43,978 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 18:22:43,978 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 18:22:43,979 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 18:22:43,980 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 18:22:43,994 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 18:22:43,994 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 18:22:43,995 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 18:22:43,995 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 18:22:43,996 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 18:22:43,998 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 18:22:43,998 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 18:22:43,999 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 18:22:43,999 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 18:22:44,000 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 18:22:44,000 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 18:22:44,001 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 18:22:44,001 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 18:22:44,002 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 18:22:44,002 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0156e362-4196-4396-8b7a-c1f2eb61f4bf/bin/uautomizer-verify-jihMAELWvX/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0156e362-4196-4396-8b7a-c1f2eb61f4bf/bin/uautomizer-verify-jihMAELWvX Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> abf1fadcf9bfc6046971a4719244290526d1ce32a1ee2d2e74022cac98e38aab [2024-11-08 18:22:44,441 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 18:22:44,488 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 18:22:44,492 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 18:22:44,496 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 18:22:44,497 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 18:22:44,499 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0156e362-4196-4396-8b7a-c1f2eb61f4bf/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-97.i Unable to find full path for "g++" [2024-11-08 18:22:47,265 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 18:22:47,624 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 18:22:47,628 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0156e362-4196-4396-8b7a-c1f2eb61f4bf/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-97.i [2024-11-08 18:22:47,643 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0156e362-4196-4396-8b7a-c1f2eb61f4bf/bin/uautomizer-verify-jihMAELWvX/data/c87ab4a0f/46600ed260b847d8a83cfb7a756d2c0f/FLAG43ee2aed3 [2024-11-08 18:22:47,668 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0156e362-4196-4396-8b7a-c1f2eb61f4bf/bin/uautomizer-verify-jihMAELWvX/data/c87ab4a0f/46600ed260b847d8a83cfb7a756d2c0f [2024-11-08 18:22:47,672 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 18:22:47,675 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 18:22:47,677 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 18:22:47,677 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 18:22:47,687 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 18:22:47,688 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 06:22:47" (1/1) ... [2024-11-08 18:22:47,690 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70bde037 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:22:47, skipping insertion in model container [2024-11-08 18:22:47,691 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 06:22:47" (1/1) ... [2024-11-08 18:22:47,747 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 18:22:48,091 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_0156e362-4196-4396-8b7a-c1f2eb61f4bf/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-97.i[915,928] [2024-11-08 18:22:48,203 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 18:22:48,228 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 18:22:48,243 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_0156e362-4196-4396-8b7a-c1f2eb61f4bf/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-97.i[915,928] [2024-11-08 18:22:48,287 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 18:22:48,323 INFO L204 MainTranslator]: Completed translation [2024-11-08 18:22:48,324 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:22:48 WrapperNode [2024-11-08 18:22:48,324 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 18:22:48,326 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 18:22:48,326 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 18:22:48,326 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 18:22:48,337 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:22:48" (1/1) ... [2024-11-08 18:22:48,361 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:22:48" (1/1) ... [2024-11-08 18:22:48,432 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 188 [2024-11-08 18:22:48,433 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 18:22:48,434 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 18:22:48,435 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 18:22:48,435 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 18:22:48,460 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:22:48" (1/1) ... [2024-11-08 18:22:48,461 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:22:48" (1/1) ... [2024-11-08 18:22:48,467 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:22:48" (1/1) ... [2024-11-08 18:22:48,495 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 18:22:48,495 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:22:48" (1/1) ... [2024-11-08 18:22:48,496 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:22:48" (1/1) ... [2024-11-08 18:22:48,510 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:22:48" (1/1) ... [2024-11-08 18:22:48,516 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:22:48" (1/1) ... [2024-11-08 18:22:48,521 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:22:48" (1/1) ... [2024-11-08 18:22:48,524 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:22:48" (1/1) ... [2024-11-08 18:22:48,534 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 18:22:48,540 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 18:22:48,540 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 18:22:48,541 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 18:22:48,542 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:22:48" (1/1) ... [2024-11-08 18:22:48,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 18:22:48,591 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0156e362-4196-4396-8b7a-c1f2eb61f4bf/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:22:48,616 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0156e362-4196-4396-8b7a-c1f2eb61f4bf/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 18:22:48,627 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0156e362-4196-4396-8b7a-c1f2eb61f4bf/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 18:22:48,672 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 18:22:48,672 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 18:22:48,673 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 18:22:48,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 18:22:48,673 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 18:22:48,674 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 18:22:48,812 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 18:22:48,816 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 18:22:49,612 INFO L? ?]: Removed 26 outVars from TransFormulas that were not future-live. [2024-11-08 18:22:49,612 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 18:22:49,633 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 18:22:49,633 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 18:22:49,634 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:22:49 BoogieIcfgContainer [2024-11-08 18:22:49,634 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 18:22:49,639 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 18:22:49,640 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 18:22:49,645 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 18:22:49,646 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 06:22:47" (1/3) ... [2024-11-08 18:22:49,647 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30dcb2ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 06:22:49, skipping insertion in model container [2024-11-08 18:22:49,648 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:22:48" (2/3) ... [2024-11-08 18:22:49,649 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30dcb2ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 06:22:49, skipping insertion in model container [2024-11-08 18:22:49,650 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:22:49" (3/3) ... [2024-11-08 18:22:49,652 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount50_file-97.i [2024-11-08 18:22:49,679 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 18:22:49,679 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 18:22:49,806 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 18:22:49,817 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;@59bcfdbd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 18:22:49,818 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 18:22:49,826 INFO L276 IsEmpty]: Start isEmpty. Operand has 82 states, 63 states have (on average 1.4444444444444444) internal successors, (91), 64 states have internal predecessors, (91), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-08 18:22:49,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-08 18:22:49,851 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:22:49,853 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:22:49,854 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:22:49,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:22:49,865 INFO L85 PathProgramCache]: Analyzing trace with hash 1075548958, now seen corresponding path program 1 times [2024-11-08 18:22:49,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:22:49,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190708473] [2024-11-08 18:22:49,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:22:49,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:22:50,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:22:50,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:22:50,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:22:50,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 18:22:50,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:22:50,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 18:22:50,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:22:50,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 18:22:50,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:22:50,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 18:22:50,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:22:50,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 18:22:50,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:22:50,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 18:22:50,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:22:50,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 18:22:50,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:22:50,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 18:22:50,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:22:50,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 18:22:50,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:22:50,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 18:22:50,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:22:50,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 18:22:50,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:22:50,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 18:22:50,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:22:50,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 18:22:50,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:22:50,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 18:22:50,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:22:50,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 18:22:50,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:22:50,634 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-08 18:22:50,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:22:50,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190708473] [2024-11-08 18:22:50,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190708473] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:22:50,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:22:50,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 18:22:50,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702730632] [2024-11-08 18:22:50,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:22:50,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 18:22:50,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:22:50,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 18:22:50,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 18:22:50,701 INFO L87 Difference]: Start difference. First operand has 82 states, 63 states have (on average 1.4444444444444444) internal successors, (91), 64 states have internal predecessors, (91), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-08 18:22:50,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:22:50,760 INFO L93 Difference]: Finished difference Result 157 states and 256 transitions. [2024-11-08 18:22:50,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 18:22:50,765 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 111 [2024-11-08 18:22:50,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:22:50,784 INFO L225 Difference]: With dead ends: 157 [2024-11-08 18:22:50,784 INFO L226 Difference]: Without dead ends: 78 [2024-11-08 18:22:50,789 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 18:22:50,793 INFO L432 NwaCegarLoop]: 116 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, 116 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 18:22:50,794 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 18:22:50,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-08 18:22:50,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-11-08 18:22:50,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 60 states have (on average 1.4) internal successors, (84), 60 states have internal predecessors, (84), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-08 18:22:50,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 116 transitions. [2024-11-08 18:22:50,881 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 116 transitions. Word has length 111 [2024-11-08 18:22:50,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:22:50,882 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 116 transitions. [2024-11-08 18:22:50,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-08 18:22:50,883 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 116 transitions. [2024-11-08 18:22:50,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-08 18:22:50,888 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:22:50,889 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:22:50,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 18:22:50,889 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:22:50,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:22:50,893 INFO L85 PathProgramCache]: Analyzing trace with hash 928286298, now seen corresponding path program 1 times [2024-11-08 18:22:50,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:22:50,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876051327] [2024-11-08 18:22:50,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:22:50,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:22:51,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:22:51,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:22:51,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:22:51,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 18:22:51,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:22:51,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 18:22:51,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:22:51,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 18:22:51,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:22:51,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 18:22:51,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:22:51,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 18:22:51,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:22:51,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 18:22:51,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:22:51,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 18:22:51,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:22:51,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 18:22:51,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:22:51,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 18:22:51,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:22:51,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 18:22:51,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:22:51,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 18:22:51,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:22:51,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 18:22:51,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:22:51,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 18:22:51,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:22:51,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 18:22:51,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:22:51,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 18:22:51,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:22:51,432 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-08 18:22:51,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:22:51,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876051327] [2024-11-08 18:22:51,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876051327] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:22:51,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:22:51,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 18:22:51,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800211689] [2024-11-08 18:22:51,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:22:51,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 18:22:51,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:22:51,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 18:22:51,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 18:22:51,442 INFO L87 Difference]: Start difference. First operand 78 states and 116 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 18:22:51,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:22:51,634 INFO L93 Difference]: Finished difference Result 214 states and 319 transitions. [2024-11-08 18:22:51,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 18:22:51,635 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 111 [2024-11-08 18:22:51,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:22:51,639 INFO L225 Difference]: With dead ends: 214 [2024-11-08 18:22:51,640 INFO L226 Difference]: Without dead ends: 139 [2024-11-08 18:22:51,641 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 18:22:51,643 INFO L432 NwaCegarLoop]: 191 mSDtfsCounter, 101 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 18:22:51,644 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 269 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 18:22:51,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2024-11-08 18:22:51,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 99. [2024-11-08 18:22:51,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 81 states have (on average 1.3950617283950617) internal successors, (113), 81 states have internal predecessors, (113), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-08 18:22:51,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 145 transitions. [2024-11-08 18:22:51,668 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 145 transitions. Word has length 111 [2024-11-08 18:22:51,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:22:51,670 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 145 transitions. [2024-11-08 18:22:51,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 18:22:51,671 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 145 transitions. [2024-11-08 18:22:51,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-08 18:22:51,674 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:22:51,674 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:22:51,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 18:22:51,675 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:22:51,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:22:51,676 INFO L85 PathProgramCache]: Analyzing trace with hash -351577380, now seen corresponding path program 1 times [2024-11-08 18:22:51,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:22:51,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958324011] [2024-11-08 18:22:51,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:22:51,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:22:51,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:22:52,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:22:52,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:22:52,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 18:22:52,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:22:52,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 18:22:52,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:22:52,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 18:22:52,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:22:52,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 18:22:52,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:22:52,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 18:22:52,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:22:52,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 18:22:52,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:22:52,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 18:22:52,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:22:52,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 18:22:52,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:22:52,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 18:22:52,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:22:52,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 18:22:52,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:22:52,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 18:22:52,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:22:52,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 18:22:52,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:22:52,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 18:22:52,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:22:52,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 18:22:52,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:22:52,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 18:22:52,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:22:52,689 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-08 18:22:52,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:22:52,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958324011] [2024-11-08 18:22:52,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958324011] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:22:52,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:22:52,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 18:22:52,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685707145] [2024-11-08 18:22:52,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:22:52,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 18:22:52,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:22:52,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 18:22:52,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 18:22:52,696 INFO L87 Difference]: Start difference. First operand 99 states and 145 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 18:22:53,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:22:53,369 INFO L93 Difference]: Finished difference Result 318 states and 470 transitions. [2024-11-08 18:22:53,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 18:22:53,370 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 111 [2024-11-08 18:22:53,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:22:53,374 INFO L225 Difference]: With dead ends: 318 [2024-11-08 18:22:53,377 INFO L226 Difference]: Without dead ends: 222 [2024-11-08 18:22:53,379 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-08 18:22:53,380 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 119 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 18:22:53,385 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 371 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 18:22:53,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2024-11-08 18:22:53,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 187. [2024-11-08 18:22:53,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 152 states have (on average 1.381578947368421) internal successors, (210), 152 states have internal predecessors, (210), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-08 18:22:53,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 274 transitions. [2024-11-08 18:22:53,461 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 274 transitions. Word has length 111 [2024-11-08 18:22:53,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:22:53,462 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 274 transitions. [2024-11-08 18:22:53,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 18:22:53,466 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 274 transitions. [2024-11-08 18:22:53,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-08 18:22:53,472 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:22:53,472 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:22:53,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 18:22:53,473 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:22:53,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:22:53,474 INFO L85 PathProgramCache]: Analyzing trace with hash 291836623, now seen corresponding path program 1 times [2024-11-08 18:22:53,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:22:53,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060383553] [2024-11-08 18:22:53,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:22:53,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:22:53,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:22:54,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:22:54,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:22:54,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 18:22:54,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:22:54,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 18:22:54,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:22:54,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 18:22:54,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:22:54,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 18:22:54,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:22:54,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 18:22:54,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:22:54,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 18:22:54,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:22:54,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 18:22:54,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:22:54,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 18:22:54,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:22:54,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 18:22:54,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:22:54,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 18:22:54,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:22:54,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 18:22:54,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:22:54,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 18:22:54,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:22:54,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 18:22:54,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:22:54,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 18:22:54,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:22:54,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 18:22:54,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:22:54,662 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-08 18:22:54,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:22:54,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060383553] [2024-11-08 18:22:54,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060383553] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:22:54,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:22:54,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 18:22:54,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405751457] [2024-11-08 18:22:54,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:22:54,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 18:22:54,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:22:54,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 18:22:54,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-08 18:22:54,671 INFO L87 Difference]: Start difference. First operand 187 states and 274 transitions. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 18:22:55,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:22:55,484 INFO L93 Difference]: Finished difference Result 493 states and 717 transitions. [2024-11-08 18:22:55,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 18:22:55,485 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 112 [2024-11-08 18:22:55,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:22:55,492 INFO L225 Difference]: With dead ends: 493 [2024-11-08 18:22:55,492 INFO L226 Difference]: Without dead ends: 309 [2024-11-08 18:22:55,494 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-08 18:22:55,499 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 119 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 18:22:55,499 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 480 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 18:22:55,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2024-11-08 18:22:55,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 285. [2024-11-08 18:22:55,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 233 states have (on average 1.3304721030042919) internal successors, (310), 233 states have internal predecessors, (310), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-08 18:22:55,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 406 transitions. [2024-11-08 18:22:55,583 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 406 transitions. Word has length 112 [2024-11-08 18:22:55,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:22:55,584 INFO L471 AbstractCegarLoop]: Abstraction has 285 states and 406 transitions. [2024-11-08 18:22:55,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 18:22:55,588 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 406 transitions. [2024-11-08 18:22:55,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-08 18:22:55,591 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:22:55,591 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:22:55,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 18:22:55,592 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:22:55,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:22:55,593 INFO L85 PathProgramCache]: Analyzing trace with hash -1176227694, now seen corresponding path program 1 times [2024-11-08 18:22:55,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:22:55,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097280680] [2024-11-08 18:22:55,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:22:55,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:22:55,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:22:56,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:22:56,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:22:56,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 18:22:56,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:22:56,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 18:22:56,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:22:56,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 18:22:56,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:22:56,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 18:22:56,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:22:56,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 18:22:56,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:22:56,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 18:22:56,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:22:56,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 18:22:56,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:22:56,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 18:22:56,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:22:56,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 18:22:56,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:22:56,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 18:22:56,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:22:56,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 18:22:56,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:22:56,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 18:22:56,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:22:56,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 18:22:56,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:22:56,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 18:22:56,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:22:56,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 18:22:56,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:22:56,107 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-08 18:22:56,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:22:56,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097280680] [2024-11-08 18:22:56,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097280680] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:22:56,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:22:56,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 18:22:56,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707563258] [2024-11-08 18:22:56,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:22:56,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 18:22:56,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:22:56,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 18:22:56,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 18:22:56,113 INFO L87 Difference]: Start difference. First operand 285 states and 406 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 18:22:56,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:22:56,769 INFO L93 Difference]: Finished difference Result 489 states and 704 transitions. [2024-11-08 18:22:56,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 18:22:56,773 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 113 [2024-11-08 18:22:56,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:22:56,781 INFO L225 Difference]: With dead ends: 489 [2024-11-08 18:22:56,781 INFO L226 Difference]: Without dead ends: 393 [2024-11-08 18:22:56,782 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-08 18:22:56,788 INFO L432 NwaCegarLoop]: 211 mSDtfsCounter, 200 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 18:22:56,789 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 570 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 18:22:56,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2024-11-08 18:22:56,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 291. [2024-11-08 18:22:56,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 239 states have (on average 1.3347280334728033) internal successors, (319), 239 states have internal predecessors, (319), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-08 18:22:56,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 415 transitions. [2024-11-08 18:22:56,872 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 415 transitions. Word has length 113 [2024-11-08 18:22:56,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:22:56,877 INFO L471 AbstractCegarLoop]: Abstraction has 291 states and 415 transitions. [2024-11-08 18:22:56,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 18:22:56,877 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 415 transitions. [2024-11-08 18:22:56,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-08 18:22:56,882 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:22:56,882 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:22:56,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 18:22:56,882 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:22:56,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:22:56,883 INFO L85 PathProgramCache]: Analyzing trace with hash 1250881255, now seen corresponding path program 1 times [2024-11-08 18:22:56,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:22:56,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034016067] [2024-11-08 18:22:56,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:22:56,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:22:56,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:22:57,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:22:57,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:22:57,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 18:22:57,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:22:57,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 18:22:57,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:22:57,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 18:22:57,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:22:57,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 18:22:57,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:22:57,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 18:22:57,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:22:57,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 18:22:57,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:22:57,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 18:22:57,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:22:57,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 18:22:57,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:22:57,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 18:22:57,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:22:57,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 18:22:57,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:22:57,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 18:22:57,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:22:57,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 18:22:57,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:22:57,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 18:22:57,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:22:57,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 18:22:57,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:22:57,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 18:22:57,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:22:57,558 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-08 18:22:57,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:22:57,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034016067] [2024-11-08 18:22:57,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034016067] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:22:57,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:22:57,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 18:22:57,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115931054] [2024-11-08 18:22:57,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:22:57,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 18:22:57,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:22:57,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 18:22:57,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 18:22:57,565 INFO L87 Difference]: Start difference. First operand 291 states and 415 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 18:22:57,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:22:57,726 INFO L93 Difference]: Finished difference Result 612 states and 876 transitions. [2024-11-08 18:22:57,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 18:22:57,730 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 113 [2024-11-08 18:22:57,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:22:57,737 INFO L225 Difference]: With dead ends: 612 [2024-11-08 18:22:57,738 INFO L226 Difference]: Without dead ends: 324 [2024-11-08 18:22:57,739 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 18:22:57,742 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 89 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 18:22:57,746 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 383 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 18:22:57,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2024-11-08 18:22:57,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 291. [2024-11-08 18:22:57,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 239 states have (on average 1.301255230125523) internal successors, (311), 239 states have internal predecessors, (311), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-08 18:22:57,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 407 transitions. [2024-11-08 18:22:57,842 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 407 transitions. Word has length 113 [2024-11-08 18:22:57,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:22:57,843 INFO L471 AbstractCegarLoop]: Abstraction has 291 states and 407 transitions. [2024-11-08 18:22:57,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 18:22:57,845 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 407 transitions. [2024-11-08 18:22:57,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-08 18:22:57,847 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:22:57,848 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:22:57,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 18:22:57,848 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:22:57,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:22:57,849 INFO L85 PathProgramCache]: Analyzing trace with hash -480512734, now seen corresponding path program 1 times [2024-11-08 18:22:57,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:22:57,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204327311] [2024-11-08 18:22:57,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:22:57,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:22:57,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:22:58,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:22:58,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:22:58,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 18:22:58,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:22:58,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 18:22:58,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:22:58,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 18:22:58,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:22:58,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 18:22:58,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:22:58,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 18:22:58,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:22:58,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 18:22:58,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:22:58,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 18:22:58,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:22:58,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 18:22:58,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:22:58,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 18:22:58,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:22:58,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 18:22:58,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:22:58,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 18:22:58,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:22:58,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 18:22:58,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:22:58,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 18:22:58,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:22:58,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 18:22:58,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:22:58,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 18:22:58,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:22:58,203 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-08 18:22:58,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:22:58,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204327311] [2024-11-08 18:22:58,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204327311] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:22:58,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:22:58,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 18:22:58,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484941600] [2024-11-08 18:22:58,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:22:58,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 18:22:58,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:22:58,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 18:22:58,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 18:22:58,212 INFO L87 Difference]: Start difference. First operand 291 states and 407 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 18:22:58,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:22:58,300 INFO L93 Difference]: Finished difference Result 581 states and 815 transitions. [2024-11-08 18:22:58,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 18:22:58,301 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 117 [2024-11-08 18:22:58,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:22:58,305 INFO L225 Difference]: With dead ends: 581 [2024-11-08 18:22:58,308 INFO L226 Difference]: Without dead ends: 293 [2024-11-08 18:22:58,309 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 18:22:58,311 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 0 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 222 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-08 18:22:58,311 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 222 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 18:22:58,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2024-11-08 18:22:58,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 293. [2024-11-08 18:22:58,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 241 states have (on average 1.2904564315352698) internal successors, (311), 241 states have internal predecessors, (311), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-08 18:22:58,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 407 transitions. [2024-11-08 18:22:58,397 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 407 transitions. Word has length 117 [2024-11-08 18:22:58,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:22:58,399 INFO L471 AbstractCegarLoop]: Abstraction has 293 states and 407 transitions. [2024-11-08 18:22:58,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 18:22:58,400 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 407 transitions. [2024-11-08 18:22:58,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-08 18:22:58,402 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:22:58,404 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:22:58,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 18:22:58,405 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:22:58,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:22:58,405 INFO L85 PathProgramCache]: Analyzing trace with hash -2068860636, now seen corresponding path program 1 times [2024-11-08 18:22:58,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:22:58,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315718429] [2024-11-08 18:22:58,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:22:58,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:22:58,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:22:58,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:22:58,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:22:58,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 18:22:58,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:22:58,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 18:22:58,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:22:58,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 18:22:58,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:22:58,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 18:22:58,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:22:58,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 18:22:58,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:22:58,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 18:22:58,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:22:58,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 18:22:58,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:22:58,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 18:22:58,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:22:58,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 18:22:58,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:22:58,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 18:22:58,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:22:58,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 18:22:58,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:22:58,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 18:22:58,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:22:58,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 18:22:58,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:22:58,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 18:22:58,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:22:58,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 18:22:58,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:22:58,985 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-08 18:22:58,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:22:58,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315718429] [2024-11-08 18:22:58,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315718429] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:22:58,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:22:58,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 18:22:58,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220441471] [2024-11-08 18:22:58,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:22:58,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 18:22:58,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:22:58,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 18:22:58,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 18:22:58,989 INFO L87 Difference]: Start difference. First operand 293 states and 407 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 18:23:00,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:23:00,005 INFO L93 Difference]: Finished difference Result 802 states and 1111 transitions. [2024-11-08 18:23:00,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 18:23:00,007 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 117 [2024-11-08 18:23:00,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:23:00,012 INFO L225 Difference]: With dead ends: 802 [2024-11-08 18:23:00,012 INFO L226 Difference]: Without dead ends: 698 [2024-11-08 18:23:00,025 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-08 18:23:00,027 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 268 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 18:23:00,027 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 469 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 18:23:00,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2024-11-08 18:23:00,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 504. [2024-11-08 18:23:00,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 504 states, 418 states have (on average 1.291866028708134) internal successors, (540), 418 states have internal predecessors, (540), 80 states have call successors, (80), 5 states have call predecessors, (80), 5 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) [2024-11-08 18:23:00,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 700 transitions. [2024-11-08 18:23:00,185 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 700 transitions. Word has length 117 [2024-11-08 18:23:00,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:23:00,186 INFO L471 AbstractCegarLoop]: Abstraction has 504 states and 700 transitions. [2024-11-08 18:23:00,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 18:23:00,186 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 700 transitions. [2024-11-08 18:23:00,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-08 18:23:00,188 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:23:00,189 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:23:00,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 18:23:00,189 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:23:00,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:23:00,190 INFO L85 PathProgramCache]: Analyzing trace with hash 1132040990, now seen corresponding path program 1 times [2024-11-08 18:23:00,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:23:00,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726827462] [2024-11-08 18:23:00,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:23:00,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:23:00,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:23:13,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:23:13,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:23:13,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 18:23:13,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:23:13,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 18:23:13,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:23:13,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 18:23:13,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:23:13,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 18:23:13,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:23:13,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 18:23:13,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:23:13,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 18:23:13,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:23:13,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 18:23:13,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:23:13,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 18:23:13,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:23:13,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 18:23:13,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:23:13,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 18:23:13,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:23:13,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 18:23:13,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:23:13,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 18:23:13,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:23:13,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 18:23:13,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:23:13,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 18:23:13,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:23:13,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 18:23:13,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:23:13,167 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-08 18:23:13,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:23:13,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726827462] [2024-11-08 18:23:13,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726827462] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:23:13,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:23:13,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-08 18:23:13,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116684598] [2024-11-08 18:23:13,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:23:13,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 18:23:13,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:23:13,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 18:23:13,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-11-08 18:23:13,172 INFO L87 Difference]: Start difference. First operand 504 states and 700 transitions. Second operand has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 18:23:17,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:23:17,747 INFO L93 Difference]: Finished difference Result 1146 states and 1558 transitions. [2024-11-08 18:23:17,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 18:23:17,749 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 117 [2024-11-08 18:23:17,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:23:17,755 INFO L225 Difference]: With dead ends: 1146 [2024-11-08 18:23:17,756 INFO L226 Difference]: Without dead ends: 954 [2024-11-08 18:23:17,757 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2024-11-08 18:23:17,758 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 130 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 437 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-08 18:23:17,758 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 503 Invalid, 442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 437 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-08 18:23:17,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 954 states. [2024-11-08 18:23:17,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 954 to 879. [2024-11-08 18:23:17,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 879 states, 778 states have (on average 1.2982005141388175) internal successors, (1010), 783 states have internal predecessors, (1010), 90 states have call successors, (90), 10 states have call predecessors, (90), 10 states have return successors, (90), 85 states have call predecessors, (90), 90 states have call successors, (90) [2024-11-08 18:23:17,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 879 states and 1190 transitions. [2024-11-08 18:23:17,946 INFO L78 Accepts]: Start accepts. Automaton has 879 states and 1190 transitions. Word has length 117 [2024-11-08 18:23:17,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:23:17,947 INFO L471 AbstractCegarLoop]: Abstraction has 879 states and 1190 transitions. [2024-11-08 18:23:17,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 18:23:17,948 INFO L276 IsEmpty]: Start isEmpty. Operand 879 states and 1190 transitions. [2024-11-08 18:23:17,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-08 18:23:17,951 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:23:17,951 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:23:17,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 18:23:17,952 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:23:17,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:23:17,953 INFO L85 PathProgramCache]: Analyzing trace with hash -673397344, now seen corresponding path program 1 times [2024-11-08 18:23:17,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:23:17,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345232773] [2024-11-08 18:23:17,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:23:17,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:23:18,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 18:23:18,062 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 18:23:18,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 18:23:18,222 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 18:23:18,223 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 18:23:18,224 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 18:23:18,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 18:23:18,232 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:23:18,390 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 18:23:18,394 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 06:23:18 BoogieIcfgContainer [2024-11-08 18:23:18,395 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 18:23:18,396 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 18:23:18,396 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 18:23:18,396 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 18:23:18,397 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:22:49" (3/4) ... [2024-11-08 18:23:18,401 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 18:23:18,403 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 18:23:18,404 INFO L158 Benchmark]: Toolchain (without parser) took 30729.36ms. Allocated memory was 136.3MB in the beginning and 249.6MB in the end (delta: 113.2MB). Free memory was 94.7MB in the beginning and 76.9MB in the end (delta: 17.8MB). Peak memory consumption was 132.6MB. Max. memory is 16.1GB. [2024-11-08 18:23:18,404 INFO L158 Benchmark]: CDTParser took 0.37ms. Allocated memory is still 136.3MB. Free memory is still 105.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 18:23:18,405 INFO L158 Benchmark]: CACSL2BoogieTranslator took 647.71ms. Allocated memory is still 136.3MB. Free memory was 94.7MB in the beginning and 79.1MB in the end (delta: 15.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-08 18:23:18,405 INFO L158 Benchmark]: Boogie Procedure Inliner took 107.93ms. Allocated memory is still 136.3MB. Free memory was 78.6MB in the beginning and 74.9MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 18:23:18,406 INFO L158 Benchmark]: Boogie Preprocessor took 100.44ms. Allocated memory is still 136.3MB. Free memory was 74.9MB in the beginning and 68.6MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-08 18:23:18,406 INFO L158 Benchmark]: RCFGBuilder took 1094.79ms. Allocated memory was 136.3MB in the beginning and 172.0MB in the end (delta: 35.7MB). Free memory was 68.6MB in the beginning and 136.7MB in the end (delta: -68.1MB). Peak memory consumption was 33.0MB. Max. memory is 16.1GB. [2024-11-08 18:23:18,407 INFO L158 Benchmark]: TraceAbstraction took 28755.56ms. Allocated memory was 172.0MB in the beginning and 249.6MB in the end (delta: 77.6MB). Free memory was 136.7MB in the beginning and 76.9MB in the end (delta: 59.8MB). Peak memory consumption was 137.4MB. Max. memory is 16.1GB. [2024-11-08 18:23:18,407 INFO L158 Benchmark]: Witness Printer took 7.34ms. Allocated memory is still 249.6MB. Free memory is still 76.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 18:23:18,410 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.37ms. Allocated memory is still 136.3MB. Free memory is still 105.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 647.71ms. Allocated memory is still 136.3MB. Free memory was 94.7MB in the beginning and 79.1MB in the end (delta: 15.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 107.93ms. Allocated memory is still 136.3MB. Free memory was 78.6MB in the beginning and 74.9MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 100.44ms. Allocated memory is still 136.3MB. Free memory was 74.9MB in the beginning and 68.6MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1094.79ms. Allocated memory was 136.3MB in the beginning and 172.0MB in the end (delta: 35.7MB). Free memory was 68.6MB in the beginning and 136.7MB in the end (delta: -68.1MB). Peak memory consumption was 33.0MB. Max. memory is 16.1GB. * TraceAbstraction took 28755.56ms. Allocated memory was 172.0MB in the beginning and 249.6MB in the end (delta: 77.6MB). Free memory was 136.7MB in the beginning and 76.9MB in the end (delta: 59.8MB). Peak memory consumption was 137.4MB. Max. memory is 16.1GB. * Witness Printer took 7.34ms. Allocated memory is still 249.6MB. Free memory is still 76.9MB. 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 someBinaryFLOATComparisonOperation at line 122. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 2; [L23] signed long int var_1_5 = 5; [L24] unsigned char var_1_8 = 0; [L25] float var_1_9 = 128.6; [L26] float var_1_10 = 32.5; [L27] unsigned char var_1_11 = 16; [L28] unsigned char var_1_12 = 64; [L29] unsigned char var_1_13 = 4; [L30] unsigned char var_1_14 = 4; [L31] unsigned long int var_1_15 = 0; [L32] signed short int var_1_16 = 0; [L33] signed char var_1_17 = 1; [L34] signed char var_1_18 = -1; [L35] signed char var_1_19 = 0; [L36] signed long int var_1_20 = -64; [L37] unsigned char var_1_22 = 0; [L38] unsigned char var_1_23 = 0; [L39] signed long int last_1_var_1_5 = 5; VAL [isInitial=0, last_1_var_1_5=5, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0, var_1_9=643/5] [L126] isInitial = 1 [L127] FCALL initially() [L128] COND TRUE 1 [L129] CALL updateLastVariables() [L119] last_1_var_1_5 = var_1_5 VAL [isInitial=1, last_1_var_1_5=5, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0, var_1_9=643/5] [L129] RET updateLastVariables() [L130] CALL updateVariables() [L92] var_1_9 = __VERIFIER_nondet_float() [L93] CALL assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L93] RET assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_5=5, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L94] var_1_10 = __VERIFIER_nondet_float() [L95] CALL assume_abort_if_not((var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L95] RET assume_abort_if_not((var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L96] var_1_11 = __VERIFIER_nondet_uchar() [L97] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L97] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L98] CALL assume_abort_if_not(var_1_11 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L98] RET assume_abort_if_not(var_1_11 <= 127) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L99] var_1_12 = __VERIFIER_nondet_uchar() [L100] CALL assume_abort_if_not(var_1_12 >= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L100] RET assume_abort_if_not(var_1_12 >= 63) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L101] CALL assume_abort_if_not(var_1_12 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L101] RET assume_abort_if_not(var_1_12 <= 127) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L102] var_1_13 = __VERIFIER_nondet_uchar() [L103] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L103] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L104] CALL assume_abort_if_not(var_1_13 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L104] RET assume_abort_if_not(var_1_13 <= 63) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L105] var_1_14 = __VERIFIER_nondet_uchar() [L106] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L106] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L107] CALL assume_abort_if_not(var_1_14 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L107] RET assume_abort_if_not(var_1_14 <= 127) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L108] var_1_18 = __VERIFIER_nondet_char() [L109] CALL assume_abort_if_not(var_1_18 >= -31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L109] RET assume_abort_if_not(var_1_18 >= -31) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L110] CALL assume_abort_if_not(var_1_18 <= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L110] RET assume_abort_if_not(var_1_18 <= 32) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L111] var_1_19 = __VERIFIER_nondet_char() [L112] CALL assume_abort_if_not(var_1_19 >= -15) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L112] RET assume_abort_if_not(var_1_19 >= -15) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L113] CALL assume_abort_if_not(var_1_19 <= 16) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L113] RET assume_abort_if_not(var_1_19 <= 16) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L114] var_1_23 = __VERIFIER_nondet_uchar() [L115] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_5=5, var_1_8=0] [L115] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_5=5, var_1_8=0] [L116] CALL assume_abort_if_not(var_1_23 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L116] RET assume_abort_if_not(var_1_23 <= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L130] RET updateVariables() [L131] CALL step() [L43] COND FALSE !(var_1_9 > var_1_10) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L46] var_1_20 = var_1_8 [L47] var_1_22 = var_1_23 VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-15, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L48] COND FALSE !(\read(var_1_22)) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-15, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L51] var_1_16 = (((((var_1_15) < (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12))))) ? (var_1_15) : (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12)))))) - var_1_11) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=-127, var_1_17=1, var_1_18=0, var_1_19=-15, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L52] COND FALSE !(\read(var_1_22)) [L59] var_1_17 = -32 VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=0, var_1_19=-15, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L61] unsigned long int stepLocal_1 = var_1_20 + var_1_15; [L62] signed long int stepLocal_0 = var_1_20; VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, stepLocal_1=0, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=0, var_1_19=-15, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L63] COND TRUE stepLocal_1 < -200 VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=0, var_1_19=-15, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L64] COND FALSE !(\read(var_1_22)) [L71] var_1_1 = var_1_20 VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=0, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L76] signed long int stepLocal_4 = 256; [L77] unsigned char stepLocal_3 = var_1_22; [L78] unsigned long int stepLocal_2 = var_1_15; VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, stepLocal_2=0, stepLocal_3=0, stepLocal_4=256, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=0, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L79] COND FALSE !(stepLocal_4 > (var_1_15 - (last_1_var_1_5 + var_1_8))) VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, stepLocal_2=0, stepLocal_3=0, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=0, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L82] COND FALSE !(stepLocal_3 || var_1_22) [L87] var_1_5 = -10000 VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, stepLocal_2=0, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=0, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=-10000, var_1_8=0] [L131] RET step() [L132] CALL, EXPR property() [L122] EXPR (((var_1_20 + var_1_15) < -200) ? (var_1_22 ? ((var_1_20 > (- var_1_15)) ? (var_1_1 == ((unsigned long int) var_1_20)) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) && ((256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000)))) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=0, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=-10000, var_1_8=0] [L122] EXPR (256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000))) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=0, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=-10000, var_1_8=0] [L122] EXPR (var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000)) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=0, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=-10000, var_1_8=0] [L122] EXPR (256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000))) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=0, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=-10000, var_1_8=0] [L122] EXPR (((var_1_20 + var_1_15) < -200) ? (var_1_22 ? ((var_1_20 > (- var_1_15)) ? (var_1_1 == ((unsigned long int) var_1_20)) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) && ((256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000)))) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=0, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=-10000, var_1_8=0] [L122] EXPR (((((((var_1_20 + var_1_15) < -200) ? (var_1_22 ? ((var_1_20 > (- var_1_15)) ? (var_1_1 == ((unsigned long int) var_1_20)) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) && ((256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000))))) && ((var_1_9 > var_1_10) ? (var_1_8 == ((unsigned char) (((((var_1_11 + (var_1_12 - var_1_13))) < ((5 + var_1_14))) ? ((var_1_11 + (var_1_12 - var_1_13))) : ((5 + var_1_14)))))) : 1)) && (var_1_22 ? (var_1_15 == ((unsigned long int) var_1_8)) : 1)) && (var_1_16 == ((signed short int) (((((var_1_15) < (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12))))) ? (var_1_15) : (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12)))))) - var_1_11)))) && (var_1_22 ? ((var_1_14 < (var_1_13 & (var_1_15 / 2))) ? (var_1_17 == ((signed char) (var_1_13 + (var_1_18 + (var_1_19 + 5))))) : (var_1_17 == ((signed char) var_1_18))) : (var_1_17 == ((signed char) -32))) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=0, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=-10000, var_1_8=0] [L122-L123] return (((((((((var_1_20 + var_1_15) < -200) ? (var_1_22 ? ((var_1_20 > (- var_1_15)) ? (var_1_1 == ((unsigned long int) var_1_20)) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) && ((256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000))))) && ((var_1_9 > var_1_10) ? (var_1_8 == ((unsigned char) (((((var_1_11 + (var_1_12 - var_1_13))) < ((5 + var_1_14))) ? ((var_1_11 + (var_1_12 - var_1_13))) : ((5 + var_1_14)))))) : 1)) && (var_1_22 ? (var_1_15 == ((unsigned long int) var_1_8)) : 1)) && (var_1_16 == ((signed short int) (((((var_1_15) < (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12))))) ? (var_1_15) : (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12)))))) - var_1_11)))) && (var_1_22 ? ((var_1_14 < (var_1_13 & (var_1_15 / 2))) ? (var_1_17 == ((signed char) (var_1_13 + (var_1_18 + (var_1_19 + 5))))) : (var_1_17 == ((signed char) var_1_18))) : (var_1_17 == ((signed char) -32)))) && (var_1_20 == ((signed long int) var_1_8))) && (var_1_22 == ((unsigned char) var_1_23)) ; [L132] RET, EXPR property() [L132] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=0, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=-10000, var_1_8=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=0, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=-10000, var_1_8=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 82 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 28.5s, OverallIterations: 10, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 8.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1026 SdHoareTripleChecker+Valid, 4.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1026 mSDsluCounter, 3383 SdHoareTripleChecker+Invalid, 4.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2045 mSDsCounter, 249 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1218 IncrementalHoareTripleChecker+Invalid, 1467 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 249 mSolverCounterUnsat, 1338 mSDtfsCounter, 1218 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 367 GetRequests, 328 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 6.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=879occurred in iteration=9, InterpolantAutomatonStates: 44, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 9 MinimizatonAttempts, 503 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 17.6s InterpolantComputationTime, 1139 NumberOfCodeBlocks, 1139 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1013 ConstructedInterpolants, 0 QuantifiedInterpolants, 10371 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 4320/4320 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-08 18:23:18,476 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0156e362-4196-4396-8b7a-c1f2eb61f4bf/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0156e362-4196-4396-8b7a-c1f2eb61f4bf/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0156e362-4196-4396-8b7a-c1f2eb61f4bf/bin/uautomizer-verify-jihMAELWvX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0156e362-4196-4396-8b7a-c1f2eb61f4bf/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0156e362-4196-4396-8b7a-c1f2eb61f4bf/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-97.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0156e362-4196-4396-8b7a-c1f2eb61f4bf/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0156e362-4196-4396-8b7a-c1f2eb61f4bf/bin/uautomizer-verify-jihMAELWvX --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash abf1fadcf9bfc6046971a4719244290526d1ce32a1ee2d2e74022cac98e38aab --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 18:23:21,827 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 18:23:21,981 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0156e362-4196-4396-8b7a-c1f2eb61f4bf/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 18:23:21,991 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 18:23:21,992 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 18:23:22,039 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 18:23:22,042 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 18:23:22,043 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 18:23:22,044 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 18:23:22,046 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 18:23:22,047 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 18:23:22,048 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 18:23:22,049 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 18:23:22,049 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 18:23:22,050 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 18:23:22,053 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 18:23:22,054 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 18:23:22,054 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 18:23:22,055 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 18:23:22,055 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 18:23:22,055 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 18:23:22,061 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 18:23:22,061 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 18:23:22,062 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 18:23:22,062 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 18:23:22,063 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 18:23:22,063 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 18:23:22,065 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 18:23:22,066 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 18:23:22,066 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 18:23:22,067 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 18:23:22,069 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 18:23:22,070 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 18:23:22,070 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 18:23:22,071 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 18:23:22,072 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 18:23:22,073 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 18:23:22,074 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 18:23:22,075 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-08 18:23:22,075 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 18:23:22,076 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 18:23:22,077 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 18:23:22,077 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 18:23:22,077 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 18:23:22,078 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0156e362-4196-4396-8b7a-c1f2eb61f4bf/bin/uautomizer-verify-jihMAELWvX/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0156e362-4196-4396-8b7a-c1f2eb61f4bf/bin/uautomizer-verify-jihMAELWvX Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> abf1fadcf9bfc6046971a4719244290526d1ce32a1ee2d2e74022cac98e38aab [2024-11-08 18:23:22,617 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 18:23:22,655 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 18:23:22,658 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 18:23:22,660 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 18:23:22,661 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 18:23:22,663 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0156e362-4196-4396-8b7a-c1f2eb61f4bf/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-97.i Unable to find full path for "g++" [2024-11-08 18:23:25,705 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 18:23:26,026 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 18:23:26,027 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0156e362-4196-4396-8b7a-c1f2eb61f4bf/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-97.i [2024-11-08 18:23:26,044 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0156e362-4196-4396-8b7a-c1f2eb61f4bf/bin/uautomizer-verify-jihMAELWvX/data/56b8a345d/a7b423e17bd74c33a0199fbc58de5998/FLAGf674ce110 [2024-11-08 18:23:26,073 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0156e362-4196-4396-8b7a-c1f2eb61f4bf/bin/uautomizer-verify-jihMAELWvX/data/56b8a345d/a7b423e17bd74c33a0199fbc58de5998 [2024-11-08 18:23:26,078 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 18:23:26,080 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 18:23:26,084 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 18:23:26,085 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 18:23:26,094 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 18:23:26,095 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 06:23:26" (1/1) ... [2024-11-08 18:23:26,097 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18c0d504 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:23:26, skipping insertion in model container [2024-11-08 18:23:26,099 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 06:23:26" (1/1) ... [2024-11-08 18:23:26,148 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 18:23:26,464 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_0156e362-4196-4396-8b7a-c1f2eb61f4bf/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-97.i[915,928] [2024-11-08 18:23:26,577 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 18:23:26,599 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 18:23:26,634 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_0156e362-4196-4396-8b7a-c1f2eb61f4bf/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-97.i[915,928] [2024-11-08 18:23:26,718 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 18:23:26,756 INFO L204 MainTranslator]: Completed translation [2024-11-08 18:23:26,756 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:23:26 WrapperNode [2024-11-08 18:23:26,757 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 18:23:26,758 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 18:23:26,758 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 18:23:26,758 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 18:23:26,768 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:23:26" (1/1) ... [2024-11-08 18:23:26,782 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:23:26" (1/1) ... [2024-11-08 18:23:26,818 INFO L138 Inliner]: procedures = 27, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 125 [2024-11-08 18:23:26,819 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 18:23:26,820 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 18:23:26,820 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 18:23:26,820 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 18:23:26,836 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:23:26" (1/1) ... [2024-11-08 18:23:26,837 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:23:26" (1/1) ... [2024-11-08 18:23:26,841 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:23:26" (1/1) ... [2024-11-08 18:23:26,870 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 18:23:26,871 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:23:26" (1/1) ... [2024-11-08 18:23:26,871 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:23:26" (1/1) ... [2024-11-08 18:23:26,893 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:23:26" (1/1) ... [2024-11-08 18:23:26,899 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:23:26" (1/1) ... [2024-11-08 18:23:26,906 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:23:26" (1/1) ... [2024-11-08 18:23:26,908 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:23:26" (1/1) ... [2024-11-08 18:23:26,912 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 18:23:26,916 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 18:23:26,917 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 18:23:26,917 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 18:23:26,918 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:23:26" (1/1) ... [2024-11-08 18:23:26,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 18:23:26,945 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0156e362-4196-4396-8b7a-c1f2eb61f4bf/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:23:26,959 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0156e362-4196-4396-8b7a-c1f2eb61f4bf/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 18:23:26,964 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0156e362-4196-4396-8b7a-c1f2eb61f4bf/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 18:23:26,992 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 18:23:26,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 18:23:26,992 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 18:23:26,992 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 18:23:26,993 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 18:23:26,993 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 18:23:27,122 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 18:23:27,126 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 18:23:27,679 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-11-08 18:23:27,681 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 18:23:27,705 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 18:23:27,705 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 18:23:27,706 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:23:27 BoogieIcfgContainer [2024-11-08 18:23:27,707 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 18:23:27,710 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 18:23:27,710 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 18:23:27,715 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 18:23:27,716 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 06:23:26" (1/3) ... [2024-11-08 18:23:27,718 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@920e8dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 06:23:27, skipping insertion in model container [2024-11-08 18:23:27,718 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:23:26" (2/3) ... [2024-11-08 18:23:27,719 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@920e8dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 06:23:27, skipping insertion in model container [2024-11-08 18:23:27,719 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:23:27" (3/3) ... [2024-11-08 18:23:27,721 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount50_file-97.i [2024-11-08 18:23:27,747 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 18:23:27,747 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 18:23:27,860 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 18:23:27,869 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;@1a775ef0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 18:23:27,870 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 18:23:27,875 INFO L276 IsEmpty]: Start isEmpty. Operand has 58 states, 39 states have (on average 1.3846153846153846) internal successors, (54), 40 states have internal predecessors, (54), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-08 18:23:27,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-08 18:23:27,892 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:23:27,893 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:23:27,894 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:23:27,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:23:27,904 INFO L85 PathProgramCache]: Analyzing trace with hash 775850723, now seen corresponding path program 1 times [2024-11-08 18:23:27,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 18:23:27,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1858955618] [2024-11-08 18:23:27,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:23:27,925 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 18:23:27,926 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0156e362-4196-4396-8b7a-c1f2eb61f4bf/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 18:23:27,935 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0156e362-4196-4396-8b7a-c1f2eb61f4bf/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 18:23:27,937 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0156e362-4196-4396-8b7a-c1f2eb61f4bf/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-08 18:23:28,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:23:28,246 INFO L255 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 18:23:28,261 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:23:28,318 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 346 trivial. 0 not checked. [2024-11-08 18:23:28,319 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 18:23:28,320 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 18:23:28,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1858955618] [2024-11-08 18:23:28,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1858955618] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:23:28,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:23:28,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 18:23:28,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708418093] [2024-11-08 18:23:28,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:23:28,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 18:23:28,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 18:23:28,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 18:23:28,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 18:23:28,380 INFO L87 Difference]: Start difference. First operand has 58 states, 39 states have (on average 1.3846153846153846) internal successors, (54), 40 states have internal predecessors, (54), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-08 18:23:28,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:23:28,418 INFO L93 Difference]: Finished difference Result 109 states and 182 transitions. [2024-11-08 18:23:28,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 18:23:28,421 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 107 [2024-11-08 18:23:28,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:23:28,432 INFO L225 Difference]: With dead ends: 109 [2024-11-08 18:23:28,432 INFO L226 Difference]: Without dead ends: 54 [2024-11-08 18:23:28,437 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 18:23:28,442 INFO L432 NwaCegarLoop]: 79 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, 79 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 18:23:28,444 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 18:23:28,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-11-08 18:23:28,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2024-11-08 18:23:28,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 36 states have internal predecessors, (47), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-08 18:23:28,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 79 transitions. [2024-11-08 18:23:28,503 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 79 transitions. Word has length 107 [2024-11-08 18:23:28,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:23:28,504 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 79 transitions. [2024-11-08 18:23:28,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-08 18:23:28,505 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 79 transitions. [2024-11-08 18:23:28,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-08 18:23:28,509 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:23:28,509 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:23:28,519 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0156e362-4196-4396-8b7a-c1f2eb61f4bf/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-08 18:23:28,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0156e362-4196-4396-8b7a-c1f2eb61f4bf/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 18:23:28,711 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:23:28,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:23:28,713 INFO L85 PathProgramCache]: Analyzing trace with hash 2072673311, now seen corresponding path program 1 times [2024-11-08 18:23:28,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 18:23:28,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1802433790] [2024-11-08 18:23:28,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:23:28,715 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 18:23:28,715 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0156e362-4196-4396-8b7a-c1f2eb61f4bf/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 18:23:28,720 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0156e362-4196-4396-8b7a-c1f2eb61f4bf/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 18:23:28,726 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0156e362-4196-4396-8b7a-c1f2eb61f4bf/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-08 18:23:28,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:23:28,968 INFO L255 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-08 18:23:28,982 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:23:29,168 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2024-11-08 18:23:29,168 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 18:23:29,168 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 18:23:29,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1802433790] [2024-11-08 18:23:29,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1802433790] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:23:29,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:23:29,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 18:23:29,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161344217] [2024-11-08 18:23:29,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:23:29,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 18:23:29,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 18:23:29,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 18:23:29,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 18:23:29,174 INFO L87 Difference]: Start difference. First operand 54 states and 79 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (16), 1 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 18:23:29,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:23:29,706 INFO L93 Difference]: Finished difference Result 111 states and 158 transitions. [2024-11-08 18:23:29,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 18:23:29,708 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (16), 1 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 1 states have call successors, (16) Word has length 107 [2024-11-08 18:23:29,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:23:29,710 INFO L225 Difference]: With dead ends: 111 [2024-11-08 18:23:29,711 INFO L226 Difference]: Without dead ends: 60 [2024-11-08 18:23:29,712 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2024-11-08 18:23:29,713 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 83 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 18:23:29,714 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 107 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 18:23:29,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-11-08 18:23:29,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 56. [2024-11-08 18:23:29,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 37 states have (on average 1.162162162162162) internal successors, (43), 37 states have internal predecessors, (43), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-08 18:23:29,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 75 transitions. [2024-11-08 18:23:29,734 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 75 transitions. Word has length 107 [2024-11-08 18:23:29,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:23:29,735 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 75 transitions. [2024-11-08 18:23:29,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (16), 1 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 18:23:29,736 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 75 transitions. [2024-11-08 18:23:29,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-08 18:23:29,738 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:23:29,739 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:23:29,747 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0156e362-4196-4396-8b7a-c1f2eb61f4bf/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-08 18:23:29,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0156e362-4196-4396-8b7a-c1f2eb61f4bf/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 18:23:29,941 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:23:29,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:23:29,942 INFO L85 PathProgramCache]: Analyzing trace with hash -1521229407, now seen corresponding path program 1 times [2024-11-08 18:23:29,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 18:23:29,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [978405181] [2024-11-08 18:23:29,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:23:29,944 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 18:23:29,944 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0156e362-4196-4396-8b7a-c1f2eb61f4bf/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 18:23:29,949 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0156e362-4196-4396-8b7a-c1f2eb61f4bf/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 18:23:29,954 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0156e362-4196-4396-8b7a-c1f2eb61f4bf/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-08 18:23:30,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:23:30,190 INFO L255 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 18:23:30,196 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:23:30,670 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-08 18:23:30,670 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 18:23:30,672 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 18:23:30,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [978405181] [2024-11-08 18:23:30,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [978405181] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:23:30,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:23:30,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 18:23:30,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674465666] [2024-11-08 18:23:30,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:23:30,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 18:23:30,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 18:23:30,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 18:23:30,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 18:23:30,678 INFO L87 Difference]: Start difference. First operand 56 states and 75 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 18:23:31,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:23:31,081 INFO L93 Difference]: Finished difference Result 146 states and 199 transitions. [2024-11-08 18:23:31,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 18:23:31,082 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 107 [2024-11-08 18:23:31,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:23:31,088 INFO L225 Difference]: With dead ends: 146 [2024-11-08 18:23:31,089 INFO L226 Difference]: Without dead ends: 93 [2024-11-08 18:23:31,090 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-08 18:23:31,095 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 81 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 18:23:31,096 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 240 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 18:23:31,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-08 18:23:31,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 56. [2024-11-08 18:23:31,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 37 states have (on average 1.135135135135135) internal successors, (42), 37 states have internal predecessors, (42), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-08 18:23:31,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 74 transitions. [2024-11-08 18:23:31,135 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 74 transitions. Word has length 107 [2024-11-08 18:23:31,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:23:31,138 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 74 transitions. [2024-11-08 18:23:31,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 18:23:31,142 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 74 transitions. [2024-11-08 18:23:31,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-08 18:23:31,144 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:23:31,144 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:23:31,155 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0156e362-4196-4396-8b7a-c1f2eb61f4bf/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-08 18:23:31,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0156e362-4196-4396-8b7a-c1f2eb61f4bf/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 18:23:31,346 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:23:31,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:23:31,347 INFO L85 PathProgramCache]: Analyzing trace with hash 1214633932, now seen corresponding path program 1 times [2024-11-08 18:23:31,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 18:23:31,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1822294840] [2024-11-08 18:23:31,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:23:31,348 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 18:23:31,349 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0156e362-4196-4396-8b7a-c1f2eb61f4bf/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 18:23:31,358 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0156e362-4196-4396-8b7a-c1f2eb61f4bf/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 18:23:31,360 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0156e362-4196-4396-8b7a-c1f2eb61f4bf/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-08 18:23:31,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:23:31,594 INFO L255 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-08 18:23:31,603 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:23:32,644 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-08 18:23:32,644 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 18:23:32,645 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 18:23:32,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1822294840] [2024-11-08 18:23:32,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1822294840] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:23:32,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:23:32,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 18:23:32,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551940963] [2024-11-08 18:23:32,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:23:32,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 18:23:32,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 18:23:32,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 18:23:32,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 18:23:32,653 INFO L87 Difference]: Start difference. First operand 56 states and 74 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 18:23:33,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:23:33,086 INFO L93 Difference]: Finished difference Result 169 states and 223 transitions. [2024-11-08 18:23:33,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 18:23:33,087 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 108 [2024-11-08 18:23:33,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:23:33,091 INFO L225 Difference]: With dead ends: 169 [2024-11-08 18:23:33,094 INFO L226 Difference]: Without dead ends: 116 [2024-11-08 18:23:33,096 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-08 18:23:33,097 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 47 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 18:23:33,097 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 219 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 18:23:33,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-08 18:23:33,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 107. [2024-11-08 18:23:33,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 70 states have (on average 1.1285714285714286) internal successors, (79), 70 states have internal predecessors, (79), 32 states have call successors, (32), 4 states have call predecessors, (32), 4 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-08 18:23:33,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 143 transitions. [2024-11-08 18:23:33,172 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 143 transitions. Word has length 108 [2024-11-08 18:23:33,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:23:33,174 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 143 transitions. [2024-11-08 18:23:33,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 18:23:33,175 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 143 transitions. [2024-11-08 18:23:33,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-08 18:23:33,177 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:23:33,177 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:23:33,184 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0156e362-4196-4396-8b7a-c1f2eb61f4bf/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-08 18:23:33,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0156e362-4196-4396-8b7a-c1f2eb61f4bf/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 18:23:33,379 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:23:33,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:23:33,379 INFO L85 PathProgramCache]: Analyzing trace with hash -945704928, now seen corresponding path program 1 times [2024-11-08 18:23:33,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 18:23:33,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1445354880] [2024-11-08 18:23:33,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:23:33,381 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 18:23:33,381 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0156e362-4196-4396-8b7a-c1f2eb61f4bf/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 18:23:33,385 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0156e362-4196-4396-8b7a-c1f2eb61f4bf/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 18:23:33,387 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0156e362-4196-4396-8b7a-c1f2eb61f4bf/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-08 18:23:33,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:23:33,566 INFO L255 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-08 18:23:33,578 INFO L278 TraceCheckSpWp]: Computing forward predicates...