./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-48.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_d4db7e3b-a630-4c9d-b6b7-22c61028345b/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4db7e3b-a630-4c9d-b6b7-22c61028345b/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_d4db7e3b-a630-4c9d-b6b7-22c61028345b/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4db7e3b-a630-4c9d-b6b7-22c61028345b/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-48.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4db7e3b-a630-4c9d-b6b7-22c61028345b/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_d4db7e3b-a630-4c9d-b6b7-22c61028345b/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 45a08fcee4ca717bf2d75cca462db1a8e3270cd7b26ded37876e062399a1dff7 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 19:11:02,775 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 19:11:02,908 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4db7e3b-a630-4c9d-b6b7-22c61028345b/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 19:11:02,918 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 19:11:02,919 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 19:11:02,969 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 19:11:02,969 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 19:11:02,970 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 19:11:02,971 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 19:11:02,971 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 19:11:02,975 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 19:11:02,976 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 19:11:02,977 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 19:11:02,978 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 19:11:02,979 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 19:11:02,979 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 19:11:02,982 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 19:11:02,983 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 19:11:02,983 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 19:11:02,984 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 19:11:02,984 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 19:11:02,985 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 19:11:02,986 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 19:11:02,986 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 19:11:02,987 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 19:11:02,988 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 19:11:02,989 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 19:11:02,989 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 19:11:02,990 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 19:11:02,990 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 19:11:02,991 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 19:11:02,991 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 19:11:02,992 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 19:11:02,993 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 19:11:02,993 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 19:11:02,994 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 19:11:02,995 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 19:11:02,995 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 19:11:02,996 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 19:11:02,997 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 19:11:02,998 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 19:11:02,999 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 19:11:02,999 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_d4db7e3b-a630-4c9d-b6b7-22c61028345b/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_d4db7e3b-a630-4c9d-b6b7-22c61028345b/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 -> 45a08fcee4ca717bf2d75cca462db1a8e3270cd7b26ded37876e062399a1dff7 [2024-11-08 19:11:03,304 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 19:11:03,337 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 19:11:03,343 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 19:11:03,344 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 19:11:03,345 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 19:11:03,346 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4db7e3b-a630-4c9d-b6b7-22c61028345b/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-48.i Unable to find full path for "g++" [2024-11-08 19:11:05,715 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 19:11:05,960 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 19:11:05,961 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4db7e3b-a630-4c9d-b6b7-22c61028345b/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-48.i [2024-11-08 19:11:05,975 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4db7e3b-a630-4c9d-b6b7-22c61028345b/bin/uautomizer-verify-jihMAELWvX/data/4b41a3e03/b2698b5ef3c543109d7784a5f0a9e57c/FLAG77f36d2e1 [2024-11-08 19:11:05,993 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4db7e3b-a630-4c9d-b6b7-22c61028345b/bin/uautomizer-verify-jihMAELWvX/data/4b41a3e03/b2698b5ef3c543109d7784a5f0a9e57c [2024-11-08 19:11:05,996 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 19:11:05,998 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 19:11:06,000 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 19:11:06,001 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 19:11:06,009 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 19:11:06,010 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:11:05" (1/1) ... [2024-11-08 19:11:06,015 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d00def and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:11:06, skipping insertion in model container [2024-11-08 19:11:06,015 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:11:05" (1/1) ... [2024-11-08 19:11:06,049 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 19:11:06,249 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_d4db7e3b-a630-4c9d-b6b7-22c61028345b/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-48.i[915,928] [2024-11-08 19:11:06,320 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:11:06,335 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 19:11:06,352 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_d4db7e3b-a630-4c9d-b6b7-22c61028345b/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-48.i[915,928] [2024-11-08 19:11:06,395 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:11:06,419 INFO L204 MainTranslator]: Completed translation [2024-11-08 19:11:06,420 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:11:06 WrapperNode [2024-11-08 19:11:06,420 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 19:11:06,421 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 19:11:06,421 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 19:11:06,421 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 19:11:06,428 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:11:06" (1/1) ... [2024-11-08 19:11:06,442 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:11:06" (1/1) ... [2024-11-08 19:11:06,490 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 142 [2024-11-08 19:11:06,490 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 19:11:06,491 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 19:11:06,491 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 19:11:06,491 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 19:11:06,517 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:11:06" (1/1) ... [2024-11-08 19:11:06,518 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:11:06" (1/1) ... [2024-11-08 19:11:06,524 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:11:06" (1/1) ... [2024-11-08 19:11:06,550 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 19:11:06,551 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:11:06" (1/1) ... [2024-11-08 19:11:06,551 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:11:06" (1/1) ... [2024-11-08 19:11:06,560 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:11:06" (1/1) ... [2024-11-08 19:11:06,564 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:11:06" (1/1) ... [2024-11-08 19:11:06,567 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:11:06" (1/1) ... [2024-11-08 19:11:06,569 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:11:06" (1/1) ... [2024-11-08 19:11:06,574 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 19:11:06,575 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 19:11:06,575 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 19:11:06,575 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 19:11:06,576 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:11:06" (1/1) ... [2024-11-08 19:11:06,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 19:11:06,603 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4db7e3b-a630-4c9d-b6b7-22c61028345b/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 19:11:06,631 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4db7e3b-a630-4c9d-b6b7-22c61028345b/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 19:11:06,638 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4db7e3b-a630-4c9d-b6b7-22c61028345b/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 19:11:06,679 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 19:11:06,679 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 19:11:06,680 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 19:11:06,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 19:11:06,680 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 19:11:06,680 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 19:11:06,814 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 19:11:06,817 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 19:11:07,252 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-08 19:11:07,253 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 19:11:07,270 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 19:11:07,270 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 19:11:07,270 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:11:07 BoogieIcfgContainer [2024-11-08 19:11:07,271 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 19:11:07,274 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 19:11:07,274 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 19:11:07,280 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 19:11:07,280 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 07:11:05" (1/3) ... [2024-11-08 19:11:07,281 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e5593ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 07:11:07, skipping insertion in model container [2024-11-08 19:11:07,281 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:11:06" (2/3) ... [2024-11-08 19:11:07,282 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e5593ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 07:11:07, skipping insertion in model container [2024-11-08 19:11:07,282 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:11:07" (3/3) ... [2024-11-08 19:11:07,283 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount50_file-48.i [2024-11-08 19:11:07,304 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 19:11:07,304 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 19:11:07,404 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 19:11:07,413 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;@408b8eef, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 19:11:07,414 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 19:11:07,422 INFO L276 IsEmpty]: Start isEmpty. Operand has 65 states, 42 states have (on average 1.4047619047619047) internal successors, (59), 43 states have internal predecessors, (59), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-08 19:11:07,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-08 19:11:07,465 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:11:07,466 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:11:07,467 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:11:07,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:11:07,472 INFO L85 PathProgramCache]: Analyzing trace with hash -492283683, now seen corresponding path program 1 times [2024-11-08 19:11:07,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:11:07,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934116165] [2024-11-08 19:11:07,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:11:07,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:11:07,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:11:07,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 19:11:07,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:11:07,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 19:11:07,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:11:07,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 19:11:07,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:11:07,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 19:11:07,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:11:07,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 19:11:07,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:11:07,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 19:11:07,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:11:07,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-08 19:11:07,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:11:07,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 19:11:07,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:11:07,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-08 19:11:07,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:11:07,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 19:11:07,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:11:07,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 19:11:07,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:11:07,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 19:11:07,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:11:07,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-08 19:11:07,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:11:07,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 19:11:07,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:11:07,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 19:11:07,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:11:08,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 19:11:08,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:11:08,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 19:11:08,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:11:08,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 19:11:08,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:11:08,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-08 19:11:08,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:11:08,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 19:11:08,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:11:08,068 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-08 19:11:08,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:11:08,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934116165] [2024-11-08 19:11:08,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934116165] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:11:08,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:11:08,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 19:11:08,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32621972] [2024-11-08 19:11:08,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:11:08,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 19:11:08,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:11:08,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 19:11:08,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 19:11:08,116 INFO L87 Difference]: Start difference. First operand has 65 states, 42 states have (on average 1.4047619047619047) internal successors, (59), 43 states have internal predecessors, (59), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-08 19:11:08,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:11:08,155 INFO L93 Difference]: Finished difference Result 122 states and 210 transitions. [2024-11-08 19:11:08,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 19:11:08,157 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 129 [2024-11-08 19:11:08,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:11:08,168 INFO L225 Difference]: With dead ends: 122 [2024-11-08 19:11:08,168 INFO L226 Difference]: Without dead ends: 60 [2024-11-08 19:11:08,172 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 62 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 19:11:08,176 INFO L432 NwaCegarLoop]: 89 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, 89 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 19:11:08,178 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 19:11:08,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-11-08 19:11:08,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2024-11-08 19:11:08,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 38 states have (on average 1.2894736842105263) internal successors, (49), 38 states have internal predecessors, (49), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-08 19:11:08,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 89 transitions. [2024-11-08 19:11:08,237 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 89 transitions. Word has length 129 [2024-11-08 19:11:08,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:11:08,240 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 89 transitions. [2024-11-08 19:11:08,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-08 19:11:08,242 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 89 transitions. [2024-11-08 19:11:08,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-08 19:11:08,249 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:11:08,250 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:11:08,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 19:11:08,251 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:11:08,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:11:08,253 INFO L85 PathProgramCache]: Analyzing trace with hash -71343131, now seen corresponding path program 1 times [2024-11-08 19:11:08,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:11:08,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035170421] [2024-11-08 19:11:08,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:11:08,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:11:08,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:11:08,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 19:11:08,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:11:08,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 19:11:08,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:11:08,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 19:11:08,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:11:08,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 19:11:08,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:11:08,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 19:11:08,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:11:08,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 19:11:08,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:11:08,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-08 19:11:08,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:11:08,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 19:11:08,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:11:08,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-08 19:11:08,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:11:08,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 19:11:08,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:11:08,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 19:11:08,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:11:08,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 19:11:08,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:11:08,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-08 19:11:08,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:11:08,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 19:11:08,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:11:08,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 19:11:08,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:11:08,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 19:11:08,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:11:08,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 19:11:08,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:11:08,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 19:11:08,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:11:08,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-08 19:11:08,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:11:08,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 19:11:08,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:11:08,649 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-08 19:11:08,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:11:08,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035170421] [2024-11-08 19:11:08,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035170421] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:11:08,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:11:08,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 19:11:08,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138045723] [2024-11-08 19:11:08,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:11:08,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 19:11:08,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:11:08,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 19:11:08,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 19:11:08,656 INFO L87 Difference]: Start difference. First operand 60 states and 89 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-08 19:11:08,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:11:08,730 INFO L93 Difference]: Finished difference Result 135 states and 201 transitions. [2024-11-08 19:11:08,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 19:11:08,731 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 129 [2024-11-08 19:11:08,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:11:08,734 INFO L225 Difference]: With dead ends: 135 [2024-11-08 19:11:08,734 INFO L226 Difference]: Without dead ends: 78 [2024-11-08 19:11:08,735 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 42 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 19:11:08,737 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 18 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 19:11:08,737 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 167 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 19:11:08,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-08 19:11:08,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 67. [2024-11-08 19:11:08,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 45 states have (on average 1.3111111111111111) internal successors, (59), 45 states have internal predecessors, (59), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-08 19:11:08,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 99 transitions. [2024-11-08 19:11:08,755 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 99 transitions. Word has length 129 [2024-11-08 19:11:08,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:11:08,759 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 99 transitions. [2024-11-08 19:11:08,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-08 19:11:08,762 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 99 transitions. [2024-11-08 19:11:08,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-08 19:11:08,765 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:11:08,765 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:11:08,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 19:11:08,768 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:11:08,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:11:08,768 INFO L85 PathProgramCache]: Analyzing trace with hash -14084829, now seen corresponding path program 1 times [2024-11-08 19:11:08,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:11:08,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894234553] [2024-11-08 19:11:08,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:11:08,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:11:08,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:11:09,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 19:11:09,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:11:09,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 19:11:09,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:11:09,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 19:11:09,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:11:09,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 19:11:09,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:11:09,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 19:11:09,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:11:09,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 19:11:09,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:11:09,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-08 19:11:09,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:11:09,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 19:11:09,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:11:09,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-08 19:11:09,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:11:09,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 19:11:09,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:11:09,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 19:11:09,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:11:09,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 19:11:09,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:11:09,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-08 19:11:09,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:11:09,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 19:11:09,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:11:09,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 19:11:09,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:11:09,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 19:11:09,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:11:09,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 19:11:09,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:11:09,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 19:11:09,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:11:09,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-08 19:11:09,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:11:09,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 19:11:09,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:11:09,255 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-08 19:11:09,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:11:09,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894234553] [2024-11-08 19:11:09,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894234553] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:11:09,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:11:09,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 19:11:09,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66645912] [2024-11-08 19:11:09,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:11:09,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 19:11:09,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:11:09,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 19:11:09,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 19:11:09,262 INFO L87 Difference]: Start difference. First operand 67 states and 99 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-08 19:11:09,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:11:09,340 INFO L93 Difference]: Finished difference Result 195 states and 291 transitions. [2024-11-08 19:11:09,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 19:11:09,341 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 129 [2024-11-08 19:11:09,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:11:09,344 INFO L225 Difference]: With dead ends: 195 [2024-11-08 19:11:09,347 INFO L226 Difference]: Without dead ends: 131 [2024-11-08 19:11:09,349 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 41 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 19:11:09,350 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 42 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 19:11:09,351 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 166 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 19:11:09,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-11-08 19:11:09,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 129. [2024-11-08 19:11:09,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 86 states have (on average 1.302325581395349) internal successors, (112), 86 states have internal predecessors, (112), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-08 19:11:09,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 192 transitions. [2024-11-08 19:11:09,380 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 192 transitions. Word has length 129 [2024-11-08 19:11:09,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:11:09,381 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 192 transitions. [2024-11-08 19:11:09,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-08 19:11:09,382 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 192 transitions. [2024-11-08 19:11:09,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-08 19:11:09,385 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:11:09,385 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:11:09,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 19:11:09,386 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:11:09,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:11:09,387 INFO L85 PathProgramCache]: Analyzing trace with hash -381280839, now seen corresponding path program 1 times [2024-11-08 19:11:09,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:11:09,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821545281] [2024-11-08 19:11:09,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:11:09,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:11:09,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 19:11:09,530 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 19:11:09,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 19:11:09,670 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 19:11:09,671 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 19:11:09,672 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 19:11:09,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 19:11:09,679 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-08 19:11:09,803 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 19:11:09,808 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 07:11:09 BoogieIcfgContainer [2024-11-08 19:11:09,808 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 19:11:09,809 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 19:11:09,809 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 19:11:09,810 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 19:11:09,810 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:11:07" (3/4) ... [2024-11-08 19:11:09,814 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 19:11:09,815 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 19:11:09,817 INFO L158 Benchmark]: Toolchain (without parser) took 3818.24ms. Allocated memory was 157.3MB in the beginning and 201.3MB in the end (delta: 44.0MB). Free memory was 114.6MB in the beginning and 78.0MB in the end (delta: 36.6MB). Peak memory consumption was 79.3MB. Max. memory is 16.1GB. [2024-11-08 19:11:09,817 INFO L158 Benchmark]: CDTParser took 0.37ms. Allocated memory is still 157.3MB. Free memory is still 102.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 19:11:09,818 INFO L158 Benchmark]: CACSL2BoogieTranslator took 420.10ms. Allocated memory is still 157.3MB. Free memory was 114.2MB in the beginning and 98.2MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-08 19:11:09,819 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.47ms. Allocated memory is still 157.3MB. Free memory was 98.2MB in the beginning and 94.9MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 19:11:09,819 INFO L158 Benchmark]: Boogie Preprocessor took 82.78ms. Allocated memory is still 157.3MB. Free memory was 94.9MB in the beginning and 89.9MB in the end (delta: 5.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-08 19:11:09,820 INFO L158 Benchmark]: RCFGBuilder took 695.94ms. Allocated memory is still 157.3MB. Free memory was 89.9MB in the beginning and 69.7MB in the end (delta: 20.1MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-08 19:11:09,821 INFO L158 Benchmark]: TraceAbstraction took 2534.35ms. Allocated memory was 157.3MB in the beginning and 201.3MB in the end (delta: 44.0MB). Free memory was 69.3MB in the beginning and 78.0MB in the end (delta: -8.7MB). Peak memory consumption was 35.3MB. Max. memory is 16.1GB. [2024-11-08 19:11:09,821 INFO L158 Benchmark]: Witness Printer took 6.55ms. Allocated memory is still 201.3MB. Free memory is still 78.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 19:11:09,825 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 157.3MB. Free memory is still 102.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 420.10ms. Allocated memory is still 157.3MB. Free memory was 114.2MB in the beginning and 98.2MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 69.47ms. Allocated memory is still 157.3MB. Free memory was 98.2MB in the beginning and 94.9MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 82.78ms. Allocated memory is still 157.3MB. Free memory was 94.9MB in the beginning and 89.9MB in the end (delta: 5.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 695.94ms. Allocated memory is still 157.3MB. Free memory was 89.9MB in the beginning and 69.7MB in the end (delta: 20.1MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 2534.35ms. Allocated memory was 157.3MB in the beginning and 201.3MB in the end (delta: 44.0MB). Free memory was 69.3MB in the beginning and 78.0MB in the end (delta: -8.7MB). Peak memory consumption was 35.3MB. Max. memory is 16.1GB. * Witness Printer took 6.55ms. Allocated memory is still 201.3MB. Free memory is still 78.0MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 137. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 10; [L23] unsigned char var_1_2 = 1; [L24] double var_1_3 = 0.0; [L25] double var_1_4 = 128.2; [L26] double var_1_5 = 50.1; [L27] double var_1_6 = 64.5; [L28] unsigned short int var_1_7 = 1; [L29] unsigned char var_1_8 = 5; [L30] double var_1_9 = 15.35; [L31] unsigned char var_1_10 = 10; [L32] unsigned char var_1_11 = 2; [L33] signed long int var_1_12 = 32; [L34] signed long int var_1_13 = 256; [L35] signed char var_1_14 = 1; [L36] unsigned char var_1_15 = 128; [L37] unsigned char var_1_16 = 0; [L38] signed char var_1_17 = -64; [L39] unsigned short int var_1_18 = 64; [L40] unsigned char last_1_var_1_8 = 5; [L41] unsigned short int last_1_var_1_18 = 64; VAL [isInitial=0, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=1, var_1_3=0, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L141] isInitial = 1 [L142] FCALL initially() [L143] COND TRUE 1 [L144] CALL updateLastVariables() [L133] last_1_var_1_8 = var_1_8 [L134] last_1_var_1_18 = var_1_18 VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=1, var_1_3=0, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L144] RET updateLastVariables() [L145] CALL updateVariables() [L99] var_1_2 = __VERIFIER_nondet_uchar() [L100] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_3=0, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_3=0, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L100] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_3=0, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L101] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_3=0, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_3=0, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L101] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_3=0, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L102] var_1_3 = __VERIFIER_nondet_double() [L103] CALL assume_abort_if_not((var_1_3 >= 4611686.018427387900e+12F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L103] RET assume_abort_if_not((var_1_3 >= 4611686.018427387900e+12F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L104] var_1_4 = __VERIFIER_nondet_double() [L105] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 4611686.018427387900e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L105] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 4611686.018427387900e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L106] var_1_5 = __VERIFIER_nondet_double() [L107] CALL assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L107] RET assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L108] var_1_6 = __VERIFIER_nondet_double() [L109] CALL assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854776000e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=1, var_1_8=5, var_1_9=307/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=1, var_1_8=5, var_1_9=307/20] [L109] RET assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854776000e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=1, var_1_8=5, var_1_9=307/20] [L110] var_1_7 = __VERIFIER_nondet_ushort() [L111] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_8=5, var_1_9=307/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_8=5, var_1_9=307/20] [L111] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_8=5, var_1_9=307/20] [L112] CALL assume_abort_if_not(var_1_7 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5, var_1_9=307/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5, var_1_9=307/20] [L112] RET assume_abort_if_not(var_1_7 <= 32767) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5, var_1_9=307/20] [L113] var_1_9 = __VERIFIER_nondet_double() [L114] 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_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L114] 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_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L115] CALL assume_abort_if_not(var_1_9 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L115] RET assume_abort_if_not(var_1_9 != 0.0F) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L116] var_1_10 = __VERIFIER_nondet_uchar() [L117] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L117] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L118] CALL assume_abort_if_not(var_1_10 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=65, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=65, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L118] RET assume_abort_if_not(var_1_10 <= 254) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=65, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L119] var_1_11 = __VERIFIER_nondet_uchar() [L120] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=65, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=65, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L120] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=65, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L121] CALL assume_abort_if_not(var_1_11 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=65, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=65, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L121] RET assume_abort_if_not(var_1_11 <= 254) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=65, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L122] var_1_15 = __VERIFIER_nondet_uchar() [L123] CALL assume_abort_if_not(var_1_15 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=65, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=129, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=65, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=129, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L123] RET assume_abort_if_not(var_1_15 >= 127) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=65, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=129, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L124] CALL assume_abort_if_not(var_1_15 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=65, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=129, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=65, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=129, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L124] RET assume_abort_if_not(var_1_15 <= 255) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=65, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=129, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L125] var_1_16 = __VERIFIER_nondet_uchar() [L126] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=65, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=129, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=65, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=129, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L126] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=65, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=129, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L127] CALL assume_abort_if_not(var_1_16 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=65, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=129, var_1_16=64, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=65, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=129, var_1_16=64, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L127] RET assume_abort_if_not(var_1_16 <= 127) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=65, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=129, var_1_16=64, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L128] var_1_17 = __VERIFIER_nondet_char() [L129] CALL assume_abort_if_not(var_1_17 >= -126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=65, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=129, var_1_16=64, var_1_17=126, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=65, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=129, var_1_16=64, var_1_17=126, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L129] RET assume_abort_if_not(var_1_17 >= -126) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=65, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=129, var_1_16=64, var_1_17=126, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L130] CALL assume_abort_if_not(var_1_17 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=65, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=129, var_1_16=64, var_1_17=126, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=65, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=129, var_1_16=64, var_1_17=126, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L130] RET assume_abort_if_not(var_1_17 <= 126) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=65, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=129, var_1_16=64, var_1_17=126, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L145] RET updateVariables() [L146] CALL step() [L45] COND FALSE !(\read(var_1_2)) [L54] var_1_12 = last_1_var_1_18 VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=65, var_1_11=254, var_1_12=64, var_1_13=256, var_1_14=1, var_1_15=129, var_1_16=64, var_1_17=126, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L56] signed long int stepLocal_1 = ((((var_1_15 - var_1_16)) > (var_1_12)) ? ((var_1_15 - var_1_16)) : (var_1_12)); VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, stepLocal_1=65, var_1_10=65, var_1_11=254, var_1_12=64, var_1_13=256, var_1_14=1, var_1_15=129, var_1_16=64, var_1_17=126, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L57] COND TRUE var_1_10 == stepLocal_1 [L58] var_1_14 = ((((var_1_17) < 0 ) ? -(var_1_17) : (var_1_17))) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=65, var_1_11=254, var_1_12=64, var_1_13=256, var_1_14=126, var_1_15=129, var_1_16=64, var_1_17=126, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L62] COND FALSE !(\read(var_1_2)) [L69] var_1_1 = 1 VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=65, var_1_11=254, var_1_12=64, var_1_13=256, var_1_14=126, var_1_15=129, var_1_16=64, var_1_17=126, var_1_18=64, var_1_1=1, var_1_2=0, var_1_7=0, var_1_8=5] [L71] unsigned short int stepLocal_0 = var_1_1; VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, stepLocal_0=1, var_1_10=65, var_1_11=254, var_1_12=64, var_1_13=256, var_1_14=126, var_1_15=129, var_1_16=64, var_1_17=126, var_1_18=64, var_1_1=1, var_1_2=0, var_1_7=0, var_1_8=5] [L72] COND TRUE var_1_6 > (var_1_5 / ((((var_1_3) > (var_1_9)) ? (var_1_3) : (var_1_9)))) [L73] var_1_8 = ((((var_1_10) < 0 ) ? -(var_1_10) : (var_1_10))) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, stepLocal_0=1, var_1_10=65, var_1_11=254, var_1_12=64, var_1_13=256, var_1_14=126, var_1_15=129, var_1_16=64, var_1_17=126, var_1_18=64, var_1_1=1, var_1_2=0, var_1_7=0, var_1_8=65] [L81] COND FALSE !(\read(var_1_2)) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, stepLocal_0=1, var_1_10=65, var_1_11=254, var_1_12=64, var_1_13=256, var_1_14=126, var_1_15=129, var_1_16=64, var_1_17=126, var_1_18=64, var_1_1=1, var_1_2=0, var_1_7=0, var_1_8=65] [L84] COND FALSE !(var_1_8 == var_1_13) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, stepLocal_0=1, var_1_10=65, var_1_11=254, var_1_12=64, var_1_13=256, var_1_14=126, var_1_15=129, var_1_16=64, var_1_17=126, var_1_18=64, var_1_1=1, var_1_2=0, var_1_7=0, var_1_8=65] [L87] COND FALSE !(last_1_var_1_18 != var_1_16) [L94] var_1_18 = var_1_10 VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, stepLocal_0=1, var_1_10=65, var_1_11=254, var_1_12=64, var_1_13=256, var_1_14=126, var_1_15=129, var_1_16=64, var_1_17=126, var_1_18=65, var_1_1=1, var_1_2=0, var_1_7=0, var_1_8=65] [L146] RET step() [L147] CALL, EXPR property() [L137-L138] return (((((var_1_2 ? ((((var_1_3 - var_1_4) - var_1_5) == (15.75 - var_1_6)) ? (var_1_1 == ((unsigned short int) (5 + last_1_var_1_8))) : (var_1_1 == ((unsigned short int) last_1_var_1_8))) : (var_1_1 == ((unsigned short int) 1))) && ((var_1_6 > (var_1_5 / ((((var_1_3) > (var_1_9)) ? (var_1_3) : (var_1_9))))) ? (var_1_8 == ((unsigned char) ((((var_1_10) < 0 ) ? -(var_1_10) : (var_1_10))))) : ((var_1_1 <= var_1_7) ? (var_1_8 == ((unsigned char) var_1_10)) : (var_1_8 == ((unsigned char) var_1_11))))) && (var_1_2 ? ((-128 > var_1_10) ? ((var_1_3 >= (2.75 / var_1_9)) ? (var_1_12 == ((signed long int) (var_1_11 + (last_1_var_1_18 + var_1_10)))) : (var_1_12 == ((signed long int) last_1_var_1_18))) : 1) : (var_1_12 == ((signed long int) last_1_var_1_18)))) && (var_1_2 ? (var_1_13 == ((signed long int) var_1_11)) : 1)) && ((var_1_10 == (((((var_1_15 - var_1_16)) > (var_1_12)) ? ((var_1_15 - var_1_16)) : (var_1_12)))) ? (var_1_14 == ((signed char) ((((var_1_17) < 0 ) ? -(var_1_17) : (var_1_17))))) : (var_1_14 == ((signed char) var_1_17)))) && ((var_1_8 == var_1_13) ? (var_1_18 == ((unsigned short int) (var_1_10 + ((((var_1_14) < (var_1_16)) ? (var_1_14) : (var_1_16)))))) : ((last_1_var_1_18 != var_1_16) ? ((-256 >= var_1_13) ? (var_1_18 == ((unsigned short int) var_1_16)) : (var_1_18 == ((unsigned short int) var_1_15))) : (var_1_18 == ((unsigned short int) var_1_10)))) ; VAL [\result=0, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=65, var_1_11=254, var_1_12=64, var_1_13=256, var_1_14=126, var_1_15=129, var_1_16=64, var_1_17=126, var_1_18=65, var_1_1=1, var_1_2=0, var_1_7=0, var_1_8=65] [L147] RET, EXPR property() [L147] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=65, var_1_11=254, var_1_12=64, var_1_13=256, var_1_14=126, var_1_15=129, var_1_16=64, var_1_17=126, var_1_18=65, var_1_1=1, var_1_2=0, var_1_7=0, var_1_8=65] [L19] reach_error() VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=65, var_1_11=254, var_1_12=64, var_1_13=256, var_1_14=126, var_1_15=129, var_1_16=64, var_1_17=126, var_1_18=65, var_1_1=1, var_1_2=0, var_1_7=0, var_1_8=65] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 65 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.3s, OverallIterations: 4, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 60 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 60 mSDsluCounter, 422 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 159 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 20 IncrementalHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 263 mSDtfsCounter, 20 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 147 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=129occurred in iteration=3, InterpolantAutomatonStates: 8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 13 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 517 NumberOfCodeBlocks, 517 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 384 ConstructedInterpolants, 0 QuantifiedInterpolants, 496 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 2280/2280 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 19:11:09,881 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4db7e3b-a630-4c9d-b6b7-22c61028345b/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_d4db7e3b-a630-4c9d-b6b7-22c61028345b/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4db7e3b-a630-4c9d-b6b7-22c61028345b/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_d4db7e3b-a630-4c9d-b6b7-22c61028345b/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4db7e3b-a630-4c9d-b6b7-22c61028345b/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-48.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4db7e3b-a630-4c9d-b6b7-22c61028345b/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_d4db7e3b-a630-4c9d-b6b7-22c61028345b/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 45a08fcee4ca717bf2d75cca462db1a8e3270cd7b26ded37876e062399a1dff7 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 19:11:12,780 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 19:11:12,887 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4db7e3b-a630-4c9d-b6b7-22c61028345b/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 19:11:12,895 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 19:11:12,896 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 19:11:12,947 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 19:11:12,948 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 19:11:12,949 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 19:11:12,949 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 19:11:12,950 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 19:11:12,950 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 19:11:12,951 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 19:11:12,952 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 19:11:12,957 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 19:11:12,957 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 19:11:12,958 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 19:11:12,958 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 19:11:12,958 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 19:11:12,959 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 19:11:12,959 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 19:11:12,959 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 19:11:12,962 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 19:11:12,962 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 19:11:12,963 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 19:11:12,963 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 19:11:12,963 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 19:11:12,964 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 19:11:12,964 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 19:11:12,964 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 19:11:12,965 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 19:11:12,965 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 19:11:12,965 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 19:11:12,966 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 19:11:12,966 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 19:11:12,966 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 19:11:12,967 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 19:11:12,967 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 19:11:12,967 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 19:11:12,967 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-08 19:11:12,968 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 19:11:12,968 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 19:11:12,970 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 19:11:12,970 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 19:11:12,970 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 19:11:12,971 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_d4db7e3b-a630-4c9d-b6b7-22c61028345b/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_d4db7e3b-a630-4c9d-b6b7-22c61028345b/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 -> 45a08fcee4ca717bf2d75cca462db1a8e3270cd7b26ded37876e062399a1dff7 [2024-11-08 19:11:13,484 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 19:11:13,514 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 19:11:13,517 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 19:11:13,518 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 19:11:13,519 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 19:11:13,520 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4db7e3b-a630-4c9d-b6b7-22c61028345b/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-48.i Unable to find full path for "g++" [2024-11-08 19:11:15,668 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 19:11:16,044 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 19:11:16,045 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4db7e3b-a630-4c9d-b6b7-22c61028345b/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-48.i [2024-11-08 19:11:16,064 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4db7e3b-a630-4c9d-b6b7-22c61028345b/bin/uautomizer-verify-jihMAELWvX/data/adc939808/e216051daecd452696e51fbd84968493/FLAG515fe1487 [2024-11-08 19:11:16,083 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4db7e3b-a630-4c9d-b6b7-22c61028345b/bin/uautomizer-verify-jihMAELWvX/data/adc939808/e216051daecd452696e51fbd84968493 [2024-11-08 19:11:16,087 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 19:11:16,089 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 19:11:16,091 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 19:11:16,091 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 19:11:16,102 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 19:11:16,104 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:11:16" (1/1) ... [2024-11-08 19:11:16,105 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57b7e6fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:11:16, skipping insertion in model container [2024-11-08 19:11:16,106 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:11:16" (1/1) ... [2024-11-08 19:11:16,146 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 19:11:16,462 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_d4db7e3b-a630-4c9d-b6b7-22c61028345b/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-48.i[915,928] [2024-11-08 19:11:16,587 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:11:16,622 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 19:11:16,641 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_d4db7e3b-a630-4c9d-b6b7-22c61028345b/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-48.i[915,928] [2024-11-08 19:11:16,718 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:11:16,782 INFO L204 MainTranslator]: Completed translation [2024-11-08 19:11:16,783 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:11:16 WrapperNode [2024-11-08 19:11:16,783 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 19:11:16,784 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 19:11:16,785 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 19:11:16,785 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 19:11:16,795 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:11:16" (1/1) ... [2024-11-08 19:11:16,814 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:11:16" (1/1) ... [2024-11-08 19:11:16,869 INFO L138 Inliner]: procedures = 27, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 141 [2024-11-08 19:11:16,874 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 19:11:16,875 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 19:11:16,875 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 19:11:16,875 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 19:11:16,892 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:11:16" (1/1) ... [2024-11-08 19:11:16,892 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:11:16" (1/1) ... [2024-11-08 19:11:16,901 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:11:16" (1/1) ... [2024-11-08 19:11:16,933 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 19:11:16,934 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:11:16" (1/1) ... [2024-11-08 19:11:16,934 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:11:16" (1/1) ... [2024-11-08 19:11:16,956 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:11:16" (1/1) ... [2024-11-08 19:11:16,965 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:11:16" (1/1) ... [2024-11-08 19:11:16,968 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:11:16" (1/1) ... [2024-11-08 19:11:16,970 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:11:16" (1/1) ... [2024-11-08 19:11:16,974 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 19:11:16,976 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 19:11:16,976 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 19:11:16,976 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 19:11:16,978 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:11:16" (1/1) ... [2024-11-08 19:11:16,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 19:11:17,005 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4db7e3b-a630-4c9d-b6b7-22c61028345b/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 19:11:17,026 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4db7e3b-a630-4c9d-b6b7-22c61028345b/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 19:11:17,035 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4db7e3b-a630-4c9d-b6b7-22c61028345b/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 19:11:17,076 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 19:11:17,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 19:11:17,077 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 19:11:17,077 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 19:11:17,077 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 19:11:17,078 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 19:11:17,216 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 19:11:17,219 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 19:11:40,167 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-08 19:11:40,167 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 19:11:40,188 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 19:11:40,189 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 19:11:40,189 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:11:40 BoogieIcfgContainer [2024-11-08 19:11:40,190 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 19:11:40,193 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 19:11:40,196 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 19:11:40,200 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 19:11:40,201 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 07:11:16" (1/3) ... [2024-11-08 19:11:40,203 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66694578 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 07:11:40, skipping insertion in model container [2024-11-08 19:11:40,204 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:11:16" (2/3) ... [2024-11-08 19:11:40,204 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66694578 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 07:11:40, skipping insertion in model container [2024-11-08 19:11:40,207 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:11:40" (3/3) ... [2024-11-08 19:11:40,209 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount50_file-48.i [2024-11-08 19:11:40,234 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 19:11:40,234 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 19:11:40,312 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 19:11:40,321 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;@285cd261, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 19:11:40,322 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 19:11:40,328 INFO L276 IsEmpty]: Start isEmpty. Operand has 65 states, 42 states have (on average 1.4047619047619047) internal successors, (59), 43 states have internal predecessors, (59), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-08 19:11:40,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-08 19:11:40,349 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:11:40,351 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:11:40,351 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:11:40,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:11:40,358 INFO L85 PathProgramCache]: Analyzing trace with hash -492283683, now seen corresponding path program 1 times [2024-11-08 19:11:40,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 19:11:40,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2140167372] [2024-11-08 19:11:40,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:11:40,376 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 19:11:40,377 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4db7e3b-a630-4c9d-b6b7-22c61028345b/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 19:11:40,381 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4db7e3b-a630-4c9d-b6b7-22c61028345b/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 19:11:40,384 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4db7e3b-a630-4c9d-b6b7-22c61028345b/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 19:11:42,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:11:42,780 INFO L255 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 19:11:42,792 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:11:42,875 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 650 trivial. 0 not checked. [2024-11-08 19:11:42,875 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 19:11:42,877 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 19:11:42,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2140167372] [2024-11-08 19:11:42,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2140167372] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:11:42,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:11:42,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 19:11:42,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747048889] [2024-11-08 19:11:42,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:11:42,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 19:11:42,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 19:11:42,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 19:11:42,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 19:11:42,928 INFO L87 Difference]: Start difference. First operand has 65 states, 42 states have (on average 1.4047619047619047) internal successors, (59), 43 states have internal predecessors, (59), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-08 19:11:42,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:11:42,969 INFO L93 Difference]: Finished difference Result 122 states and 210 transitions. [2024-11-08 19:11:42,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 19:11:42,972 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 129 [2024-11-08 19:11:42,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:11:42,982 INFO L225 Difference]: With dead ends: 122 [2024-11-08 19:11:42,982 INFO L226 Difference]: Without dead ends: 60 [2024-11-08 19:11:42,987 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 128 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 19:11:42,995 INFO L432 NwaCegarLoop]: 89 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, 89 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 19:11:42,997 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 19:11:43,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-11-08 19:11:43,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2024-11-08 19:11:43,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 38 states have (on average 1.2894736842105263) internal successors, (49), 38 states have internal predecessors, (49), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-08 19:11:43,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 89 transitions. [2024-11-08 19:11:43,055 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 89 transitions. Word has length 129 [2024-11-08 19:11:43,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:11:43,056 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 89 transitions. [2024-11-08 19:11:43,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-08 19:11:43,057 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 89 transitions. [2024-11-08 19:11:43,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-08 19:11:43,061 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:11:43,061 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:11:43,083 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4db7e3b-a630-4c9d-b6b7-22c61028345b/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 19:11:43,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4db7e3b-a630-4c9d-b6b7-22c61028345b/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 19:11:43,263 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:11:43,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:11:43,265 INFO L85 PathProgramCache]: Analyzing trace with hash -71343131, now seen corresponding path program 1 times [2024-11-08 19:11:43,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 19:11:43,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [177994059] [2024-11-08 19:11:43,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:11:43,267 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 19:11:43,267 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4db7e3b-a630-4c9d-b6b7-22c61028345b/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 19:11:43,271 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4db7e3b-a630-4c9d-b6b7-22c61028345b/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 19:11:43,272 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4db7e3b-a630-4c9d-b6b7-22c61028345b/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 19:11:45,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:11:45,658 INFO L255 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 19:11:45,665 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:11:45,840 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-08 19:11:45,841 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 19:11:45,841 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 19:11:45,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [177994059] [2024-11-08 19:11:45,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [177994059] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:11:45,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:11:45,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 19:11:45,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044563670] [2024-11-08 19:11:45,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:11:45,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 19:11:45,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 19:11:45,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 19:11:45,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 19:11:45,846 INFO L87 Difference]: Start difference. First operand 60 states and 89 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-08 19:11:50,428 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.44s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 19:11:55,052 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.43s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 19:11:55,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:11:55,249 INFO L93 Difference]: Finished difference Result 135 states and 201 transitions. [2024-11-08 19:11:55,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 19:11:55,250 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 129 [2024-11-08 19:11:55,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:11:55,253 INFO L225 Difference]: With dead ends: 135 [2024-11-08 19:11:55,254 INFO L226 Difference]: Without dead ends: 78 [2024-11-08 19:11:55,255 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 19:11:55,256 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 20 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.4s IncrementalHoareTripleChecker+Time [2024-11-08 19:11:55,257 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 167 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 2 Unknown, 0 Unchecked, 9.4s Time] [2024-11-08 19:11:55,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-08 19:11:55,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 67. [2024-11-08 19:11:55,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 45 states have (on average 1.3111111111111111) internal successors, (59), 45 states have internal predecessors, (59), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-08 19:11:55,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 99 transitions. [2024-11-08 19:11:55,273 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 99 transitions. Word has length 129 [2024-11-08 19:11:55,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:11:55,277 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 99 transitions. [2024-11-08 19:11:55,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-08 19:11:55,278 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 99 transitions. [2024-11-08 19:11:55,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-08 19:11:55,281 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:11:55,281 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:11:55,313 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4db7e3b-a630-4c9d-b6b7-22c61028345b/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)] Forceful destruction successful, exit code 0 [2024-11-08 19:11:55,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4db7e3b-a630-4c9d-b6b7-22c61028345b/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 19:11:55,482 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:11:55,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:11:55,484 INFO L85 PathProgramCache]: Analyzing trace with hash -14084829, now seen corresponding path program 1 times [2024-11-08 19:11:55,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 19:11:55,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2062286724] [2024-11-08 19:11:55,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:11:55,485 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 19:11:55,486 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4db7e3b-a630-4c9d-b6b7-22c61028345b/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 19:11:55,488 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4db7e3b-a630-4c9d-b6b7-22c61028345b/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 19:11:55,490 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4db7e3b-a630-4c9d-b6b7-22c61028345b/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 19:11:57,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:11:57,507 INFO L255 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 19:11:57,512 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:12:01,490 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-08 19:12:01,495 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 19:12:01,495 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 19:12:01,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2062286724] [2024-11-08 19:12:01,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2062286724] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:12:01,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:12:01,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 19:12:01,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045755800] [2024-11-08 19:12:01,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:12:01,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 19:12:01,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 19:12:01,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 19:12:01,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 19:12:01,500 INFO L87 Difference]: Start difference. First operand 67 states and 99 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 2 states have internal predecessors, (32), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-08 19:12:06,027 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.48s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 19:12:10,765 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.53s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 19:12:10,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:12:10,981 INFO L93 Difference]: Finished difference Result 195 states and 291 transitions. [2024-11-08 19:12:10,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 19:12:10,985 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 2 states have internal predecessors, (32), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 129 [2024-11-08 19:12:10,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:12:10,990 INFO L225 Difference]: With dead ends: 195 [2024-11-08 19:12:10,990 INFO L226 Difference]: Without dead ends: 131 [2024-11-08 19:12:10,992 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 19:12:10,995 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 19 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.4s IncrementalHoareTripleChecker+Time [2024-11-08 19:12:10,996 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 167 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 2 Unknown, 0 Unchecked, 9.4s Time] [2024-11-08 19:12:10,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-11-08 19:12:11,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 129. [2024-11-08 19:12:11,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 86 states have (on average 1.302325581395349) internal successors, (112), 86 states have internal predecessors, (112), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-08 19:12:11,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 192 transitions. [2024-11-08 19:12:11,051 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 192 transitions. Word has length 129 [2024-11-08 19:12:11,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:12:11,052 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 192 transitions. [2024-11-08 19:12:11,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 2 states have internal predecessors, (32), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-08 19:12:11,053 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 192 transitions. [2024-11-08 19:12:11,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-08 19:12:11,059 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:12:11,059 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:12:11,098 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4db7e3b-a630-4c9d-b6b7-22c61028345b/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 19:12:11,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4db7e3b-a630-4c9d-b6b7-22c61028345b/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 19:12:11,260 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:12:11,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:12:11,261 INFO L85 PathProgramCache]: Analyzing trace with hash -381280839, now seen corresponding path program 1 times [2024-11-08 19:12:11,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 19:12:11,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1142061428] [2024-11-08 19:12:11,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:12:11,263 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 19:12:11,263 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4db7e3b-a630-4c9d-b6b7-22c61028345b/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 19:12:11,267 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4db7e3b-a630-4c9d-b6b7-22c61028345b/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 19:12:11,269 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4db7e3b-a630-4c9d-b6b7-22c61028345b/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 19:12:13,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:12:13,543 INFO L255 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-08 19:12:13,562 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:12:28,906 WARN L286 SmtUtils]: Spent 8.61s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:12:37,481 WARN L286 SmtUtils]: Spent 8.57s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:12:50,440 WARN L286 SmtUtils]: Spent 8.57s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:12:58,623 WARN L286 SmtUtils]: Spent 8.18s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:13:11,738 WARN L286 SmtUtils]: Spent 8.53s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:13:21,051 WARN L286 SmtUtils]: Spent 8.73s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:13:29,823 WARN L286 SmtUtils]: Spent 8.77s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:13:38,379 WARN L286 SmtUtils]: Spent 8.55s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:13:47,042 WARN L286 SmtUtils]: Spent 8.66s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:13:55,625 WARN L286 SmtUtils]: Spent 8.58s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:14:04,387 WARN L286 SmtUtils]: Spent 8.76s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:14:13,061 WARN L286 SmtUtils]: Spent 8.67s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:14:21,719 WARN L286 SmtUtils]: Spent 8.66s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:14:30,343 WARN L286 SmtUtils]: Spent 8.62s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:14:38,904 WARN L286 SmtUtils]: Spent 8.56s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:14:47,472 WARN L286 SmtUtils]: Spent 8.57s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:14:51,629 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ zero_extend 24) c_~var_1_10~0))) (and (let ((.cse1 ((_ sign_extend 24) c_~var_1_17~0))) (let ((.cse0 (bvslt .cse1 (_ bv0 32)))) (or (and (not .cse0) (= ((_ extract 7 0) .cse1) c_~var_1_14~0)) (and .cse0 (= ((_ extract 7 0) (bvneg .cse1)) c_~var_1_14~0))))) (let ((.cse4 (bvadd (bvneg ((_ zero_extend 24) c_~var_1_16~0)) ((_ zero_extend 24) c_~var_1_15~0)))) (let ((.cse3 (bvsgt .cse4 c_~var_1_12~0))) (or (and (= c_~var_1_12~0 .cse2) (not .cse3)) (and .cse3 (= .cse4 .cse2))))) (= ((_ extract 7 0) .cse2) c_~var_1_8~0) (= (_ bv256 32) c_~var_1_13~0) (let ((.cse5 (fp.gt c_~var_1_3~0 c_~var_1_9~0))) (or (and (not .cse5) (fp.gt c_~var_1_6~0 (fp.div c_currentRoundingMode c_~var_1_5~0 c_~var_1_9~0))) (and (fp.gt c_~var_1_6~0 (fp.div c_currentRoundingMode c_~var_1_5~0 c_~var_1_3~0)) .cse5))) (= ((_ zero_extend 16) c_~last_1_var_1_18~0) c_~var_1_12~0) (= c_~var_1_1~0 (_ bv1 16)) (= (_ bv0 8) c_~var_1_2~0))) is different from false [2024-11-08 19:14:55,770 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ zero_extend 24) c_~var_1_10~0))) (and (let ((.cse1 ((_ sign_extend 24) c_~var_1_17~0))) (let ((.cse0 (bvslt .cse1 (_ bv0 32)))) (or (and (not .cse0) (= ((_ extract 7 0) .cse1) c_~var_1_14~0)) (and .cse0 (= ((_ extract 7 0) (bvneg .cse1)) c_~var_1_14~0))))) (let ((.cse4 (bvadd (bvneg ((_ zero_extend 24) c_~var_1_16~0)) ((_ zero_extend 24) c_~var_1_15~0)))) (let ((.cse3 (bvsgt .cse4 c_~var_1_12~0))) (or (and (= c_~var_1_12~0 .cse2) (not .cse3)) (and .cse3 (= .cse4 .cse2))))) (= ((_ extract 7 0) .cse2) c_~var_1_8~0) (= (_ bv256 32) c_~var_1_13~0) (let ((.cse5 (fp.gt c_~var_1_3~0 c_~var_1_9~0))) (or (and (not .cse5) (fp.gt c_~var_1_6~0 (fp.div c_currentRoundingMode c_~var_1_5~0 c_~var_1_9~0))) (and (fp.gt c_~var_1_6~0 (fp.div c_currentRoundingMode c_~var_1_5~0 c_~var_1_3~0)) .cse5))) (= ((_ zero_extend 16) c_~last_1_var_1_18~0) c_~var_1_12~0) (= c_~var_1_1~0 (_ bv1 16)) (= (_ bv0 8) c_~var_1_2~0))) is different from true [2024-11-08 19:15:04,359 WARN L286 SmtUtils]: Spent 8.54s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:15:12,911 WARN L286 SmtUtils]: Spent 8.55s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:15:21,073 WARN L286 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:15:29,602 WARN L286 SmtUtils]: Spent 8.53s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:15:37,764 WARN L286 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:15:46,264 WARN L286 SmtUtils]: Spent 8.50s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:15:54,765 WARN L286 SmtUtils]: Spent 8.50s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:16:03,298 WARN L286 SmtUtils]: Spent 8.53s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:16:11,806 WARN L286 SmtUtils]: Spent 8.51s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:16:20,297 WARN L286 SmtUtils]: Spent 8.49s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:16:28,865 WARN L286 SmtUtils]: Spent 8.57s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:16:37,377 WARN L286 SmtUtils]: Spent 8.51s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:16:45,896 WARN L286 SmtUtils]: Spent 8.52s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:16:54,412 WARN L286 SmtUtils]: Spent 8.51s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:17:02,941 WARN L286 SmtUtils]: Spent 8.53s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:17:11,481 WARN L286 SmtUtils]: Spent 8.54s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:17:20,001 WARN L286 SmtUtils]: Spent 8.52s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:17:28,679 WARN L286 SmtUtils]: Spent 8.62s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:17:37,216 WARN L286 SmtUtils]: Spent 8.54s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:17:45,368 WARN L286 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:17:53,903 WARN L286 SmtUtils]: Spent 8.53s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:18:02,056 WARN L286 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:18:10,601 WARN L286 SmtUtils]: Spent 8.54s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:18:19,149 WARN L286 SmtUtils]: Spent 8.55s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:18:26,621 WARN L286 SmtUtils]: Spent 7.47s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:18:35,153 WARN L286 SmtUtils]: Spent 8.53s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:18:43,710 WARN L286 SmtUtils]: Spent 8.56s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:18:52,215 WARN L286 SmtUtils]: Spent 8.50s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:19:00,732 WARN L286 SmtUtils]: Spent 8.52s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:19:09,218 WARN L286 SmtUtils]: Spent 8.49s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:19:17,703 WARN L286 SmtUtils]: Spent 8.48s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:19:26,185 WARN L286 SmtUtils]: Spent 8.48s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:19:34,687 WARN L286 SmtUtils]: Spent 8.50s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:19:43,159 WARN L286 SmtUtils]: Spent 8.47s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:19:51,714 WARN L286 SmtUtils]: Spent 8.50s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:20:00,216 WARN L286 SmtUtils]: Spent 8.50s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:20:08,740 WARN L286 SmtUtils]: Spent 8.52s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:20:16,412 WARN L286 SmtUtils]: Spent 7.67s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:20:24,921 WARN L286 SmtUtils]: Spent 8.51s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:20:31,729 WARN L286 SmtUtils]: Spent 6.81s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:20:40,214 WARN L286 SmtUtils]: Spent 8.48s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:20:48,744 WARN L286 SmtUtils]: Spent 8.53s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:20:57,258 WARN L286 SmtUtils]: Spent 8.51s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:21:05,753 WARN L286 SmtUtils]: Spent 8.49s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:21:14,263 WARN L286 SmtUtils]: Spent 8.51s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:21:22,827 WARN L286 SmtUtils]: Spent 8.56s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:21:31,333 WARN L286 SmtUtils]: Spent 8.51s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:21:39,836 WARN L286 SmtUtils]: Spent 8.50s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:21:48,340 WARN L286 SmtUtils]: Spent 8.50s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:21:56,900 WARN L286 SmtUtils]: Spent 8.56s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:22:05,405 WARN L286 SmtUtils]: Spent 8.50s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:22:13,978 WARN L286 SmtUtils]: Spent 8.57s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:22:22,494 WARN L286 SmtUtils]: Spent 8.52s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:22:26,629 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ zero_extend 24) c_~var_1_16~0)) (.cse4 ((_ zero_extend 24) c_~var_1_10~0)) (.cse1 ((_ zero_extend 16) c_~last_1_var_1_18~0))) (and (= .cse0 .cse1) (let ((.cse3 ((_ sign_extend 24) c_~var_1_17~0))) (let ((.cse2 (bvslt .cse3 (_ bv0 32)))) (or (and (not .cse2) (= ((_ extract 7 0) .cse3) c_~var_1_14~0)) (and .cse2 (= ((_ extract 7 0) (bvneg .cse3)) c_~var_1_14~0))))) (let ((.cse6 (bvadd (bvneg .cse0) ((_ zero_extend 24) c_~var_1_15~0)))) (let ((.cse5 (bvsgt .cse6 c_~var_1_12~0))) (or (and (= c_~var_1_12~0 .cse4) (not .cse5)) (and .cse5 (= .cse6 .cse4))))) (= ((_ extract 7 0) .cse4) c_~var_1_8~0) (= c_~var_1_18~0 ((_ zero_extend 8) c_~var_1_10~0)) (= (_ bv256 32) c_~var_1_13~0) (let ((.cse7 (fp.gt c_~var_1_3~0 c_~var_1_9~0))) (or (and (not .cse7) (fp.gt c_~var_1_6~0 (fp.div c_currentRoundingMode c_~var_1_5~0 c_~var_1_9~0))) (and (fp.gt c_~var_1_6~0 (fp.div c_currentRoundingMode c_~var_1_5~0 c_~var_1_3~0)) .cse7))) (= .cse1 c_~var_1_12~0) (= c_~var_1_1~0 (_ bv1 16)) (= (_ bv0 8) c_~var_1_2~0))) is different from false [2024-11-08 19:22:30,796 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ zero_extend 24) c_~var_1_16~0)) (.cse4 ((_ zero_extend 24) c_~var_1_10~0)) (.cse1 ((_ zero_extend 16) c_~last_1_var_1_18~0))) (and (= .cse0 .cse1) (let ((.cse3 ((_ sign_extend 24) c_~var_1_17~0))) (let ((.cse2 (bvslt .cse3 (_ bv0 32)))) (or (and (not .cse2) (= ((_ extract 7 0) .cse3) c_~var_1_14~0)) (and .cse2 (= ((_ extract 7 0) (bvneg .cse3)) c_~var_1_14~0))))) (let ((.cse6 (bvadd (bvneg .cse0) ((_ zero_extend 24) c_~var_1_15~0)))) (let ((.cse5 (bvsgt .cse6 c_~var_1_12~0))) (or (and (= c_~var_1_12~0 .cse4) (not .cse5)) (and .cse5 (= .cse6 .cse4))))) (= ((_ extract 7 0) .cse4) c_~var_1_8~0) (= c_~var_1_18~0 ((_ zero_extend 8) c_~var_1_10~0)) (= (_ bv256 32) c_~var_1_13~0) (let ((.cse7 (fp.gt c_~var_1_3~0 c_~var_1_9~0))) (or (and (not .cse7) (fp.gt c_~var_1_6~0 (fp.div c_currentRoundingMode c_~var_1_5~0 c_~var_1_9~0))) (and (fp.gt c_~var_1_6~0 (fp.div c_currentRoundingMode c_~var_1_5~0 c_~var_1_3~0)) .cse7))) (= .cse1 c_~var_1_12~0) (= c_~var_1_1~0 (_ bv1 16)) (= (_ bv0 8) c_~var_1_2~0))) is different from true