./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-71.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a328732-b164-4603-9b2d-7250c6be7254/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a328732-b164-4603-9b2d-7250c6be7254/bin/uautomizer-verify-qhAvR1uOyd/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a328732-b164-4603-9b2d-7250c6be7254/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a328732-b164-4603-9b2d-7250c6be7254/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-71.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a328732-b164-4603-9b2d-7250c6be7254/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a328732-b164-4603-9b2d-7250c6be7254/bin/uautomizer-verify-qhAvR1uOyd --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 b7769f6e88057884e9f756ce4db3366a3e684d2e94a6b3544a7e6cd1c830e602 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 14:31:18,249 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 14:31:18,328 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a328732-b164-4603-9b2d-7250c6be7254/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-13 14:31:18,334 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 14:31:18,334 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 14:31:18,357 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 14:31:18,358 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 14:31:18,358 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 14:31:18,358 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 14:31:18,358 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 14:31:18,359 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 14:31:18,359 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 14:31:18,359 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 14:31:18,359 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 14:31:18,359 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 14:31:18,360 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 14:31:18,360 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 14:31:18,360 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 14:31:18,360 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 14:31:18,360 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 14:31:18,360 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 14:31:18,360 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 14:31:18,361 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 14:31:18,361 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 14:31:18,361 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 14:31:18,361 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 14:31:18,361 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 14:31:18,361 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 14:31:18,361 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 14:31:18,361 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 14:31:18,362 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 14:31:18,362 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 14:31:18,362 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 14:31:18,362 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 14:31:18,362 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 14:31:18,362 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 14:31:18,362 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 14:31:18,362 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 14:31:18,362 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 14:31:18,362 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 14:31:18,363 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 14:31:18,363 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 14:31:18,363 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a328732-b164-4603-9b2d-7250c6be7254/bin/uautomizer-verify-qhAvR1uOyd 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 -> b7769f6e88057884e9f756ce4db3366a3e684d2e94a6b3544a7e6cd1c830e602 [2024-11-13 14:31:18,664 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 14:31:18,676 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 14:31:18,679 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 14:31:18,680 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 14:31:18,680 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 14:31:18,683 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a328732-b164-4603-9b2d-7250c6be7254/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-71.i Unable to find full path for "g++" [2024-11-13 14:31:20,560 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 14:31:20,833 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 14:31:20,834 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a328732-b164-4603-9b2d-7250c6be7254/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-71.i [2024-11-13 14:31:20,856 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a328732-b164-4603-9b2d-7250c6be7254/bin/uautomizer-verify-qhAvR1uOyd/data/486a30dcb/82bee20adf9b4d579782f0d5e0329e3f/FLAGf80f7e583 [2024-11-13 14:31:20,885 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a328732-b164-4603-9b2d-7250c6be7254/bin/uautomizer-verify-qhAvR1uOyd/data/486a30dcb/82bee20adf9b4d579782f0d5e0329e3f [2024-11-13 14:31:20,891 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 14:31:20,893 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 14:31:20,895 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 14:31:20,895 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 14:31:20,900 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 14:31:20,901 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 02:31:20" (1/1) ... [2024-11-13 14:31:20,904 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5944c149 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:31:20, skipping insertion in model container [2024-11-13 14:31:20,904 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 02:31:20" (1/1) ... [2024-11-13 14:31:20,925 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 14:31:21,067 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_5a328732-b164-4603-9b2d-7250c6be7254/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-71.i[915,928] [2024-11-13 14:31:21,136 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 14:31:21,155 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 14:31:21,169 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_5a328732-b164-4603-9b2d-7250c6be7254/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-71.i[915,928] [2024-11-13 14:31:21,202 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 14:31:21,216 INFO L204 MainTranslator]: Completed translation [2024-11-13 14:31:21,217 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:31:21 WrapperNode [2024-11-13 14:31:21,217 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 14:31:21,218 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 14:31:21,218 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 14:31:21,218 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 14:31:21,224 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:31:21" (1/1) ... [2024-11-13 14:31:21,231 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:31:21" (1/1) ... [2024-11-13 14:31:21,273 INFO L138 Inliner]: procedures = 26, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 124 [2024-11-13 14:31:21,274 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 14:31:21,274 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 14:31:21,274 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 14:31:21,274 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 14:31:21,286 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:31:21" (1/1) ... [2024-11-13 14:31:21,286 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:31:21" (1/1) ... [2024-11-13 14:31:21,290 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:31:21" (1/1) ... [2024-11-13 14:31:21,321 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-13 14:31:21,322 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:31:21" (1/1) ... [2024-11-13 14:31:21,322 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:31:21" (1/1) ... [2024-11-13 14:31:21,328 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:31:21" (1/1) ... [2024-11-13 14:31:21,331 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:31:21" (1/1) ... [2024-11-13 14:31:21,337 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:31:21" (1/1) ... [2024-11-13 14:31:21,338 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:31:21" (1/1) ... [2024-11-13 14:31:21,344 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 14:31:21,345 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 14:31:21,345 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 14:31:21,345 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 14:31:21,346 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:31:21" (1/1) ... [2024-11-13 14:31:21,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 14:31:21,378 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a328732-b164-4603-9b2d-7250c6be7254/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:31:21,390 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a328732-b164-4603-9b2d-7250c6be7254/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 14:31:21,398 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a328732-b164-4603-9b2d-7250c6be7254/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 14:31:21,423 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 14:31:21,423 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-13 14:31:21,423 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-13 14:31:21,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-13 14:31:21,424 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 14:31:21,424 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 14:31:21,525 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 14:31:21,527 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 14:31:21,892 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-13 14:31:21,892 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 14:31:21,910 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 14:31:21,911 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 14:31:21,911 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:31:21 BoogieIcfgContainer [2024-11-13 14:31:21,911 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 14:31:21,916 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 14:31:21,916 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 14:31:21,922 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 14:31:21,922 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 02:31:20" (1/3) ... [2024-11-13 14:31:21,923 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@534daddb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 02:31:21, skipping insertion in model container [2024-11-13 14:31:21,923 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:31:21" (2/3) ... [2024-11-13 14:31:21,923 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@534daddb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 02:31:21, skipping insertion in model container [2024-11-13 14:31:21,923 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:31:21" (3/3) ... [2024-11-13 14:31:21,925 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-71.i [2024-11-13 14:31:21,943 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 14:31:21,946 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount25_file-71.i that has 2 procedures, 56 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-13 14:31:22,022 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 14:31:22,039 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;@45133dcb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 14:31:22,039 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-13 14:31:22,045 INFO L276 IsEmpty]: Start isEmpty. Operand has 56 states, 38 states have (on average 1.3421052631578947) internal successors, (51), 39 states have internal predecessors, (51), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-13 14:31:22,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-13 14:31:22,059 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:31:22,059 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:31:22,060 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:31:22,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:31:22,066 INFO L85 PathProgramCache]: Analyzing trace with hash 168545364, now seen corresponding path program 1 times [2024-11-13 14:31:22,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:31:22,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018164627] [2024-11-13 14:31:22,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:31:22,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:31:22,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:31:22,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:31:22,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:31:22,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 14:31:22,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:31:22,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 14:31:22,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:31:22,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 14:31:22,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:31:22,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 14:31:22,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:31:22,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 14:31:22,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:31:22,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 14:31:22,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:31:22,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 14:31:22,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:31:22,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 14:31:22,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:31:22,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-13 14:31:22,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:31:22,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 14:31:22,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:31:22,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 14:31:22,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:31:22,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 14:31:22,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:31:22,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 14:31:22,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:31:22,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 14:31:22,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:31:22,535 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-13 14:31:22,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:31:22,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018164627] [2024-11-13 14:31:22,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018164627] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:31:22,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:31:22,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 14:31:22,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808937048] [2024-11-13 14:31:22,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:31:22,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-13 14:31:22,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:31:22,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-13 14:31:22,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 14:31:22,565 INFO L87 Difference]: Start difference. First operand has 56 states, 38 states have (on average 1.3421052631578947) internal successors, (51), 39 states have internal predecessors, (51), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-13 14:31:22,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:31:22,590 INFO L93 Difference]: Finished difference Result 105 states and 171 transitions. [2024-11-13 14:31:22,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 14:31:22,592 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 99 [2024-11-13 14:31:22,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:31:22,598 INFO L225 Difference]: With dead ends: 105 [2024-11-13 14:31:22,599 INFO L226 Difference]: Without dead ends: 52 [2024-11-13 14:31:22,604 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 47 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-13 14:31:22,607 INFO L432 NwaCegarLoop]: 74 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, 74 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-13 14:31:22,608 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 14:31:22,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-11-13 14:31:22,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2024-11-13 14:31:22,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 35 states have internal predecessors, (44), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-13 14:31:22,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 74 transitions. [2024-11-13 14:31:22,665 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 74 transitions. Word has length 99 [2024-11-13 14:31:22,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:31:22,665 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 74 transitions. [2024-11-13 14:31:22,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-13 14:31:22,666 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 74 transitions. [2024-11-13 14:31:22,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-13 14:31:22,673 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:31:22,673 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:31:22,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 14:31:22,673 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:31:22,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:31:22,676 INFO L85 PathProgramCache]: Analyzing trace with hash -1713075570, now seen corresponding path program 1 times [2024-11-13 14:31:22,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:31:22,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400008141] [2024-11-13 14:31:22,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:31:22,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:31:22,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:31:23,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:31:23,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:31:23,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 14:31:23,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:31:23,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 14:31:23,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:31:23,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 14:31:23,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:31:23,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 14:31:23,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:31:23,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 14:31:23,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:31:23,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 14:31:23,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:31:23,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 14:31:23,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:31:23,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 14:31:23,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:31:23,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-13 14:31:23,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:31:23,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 14:31:23,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:31:23,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 14:31:23,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:31:23,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 14:31:23,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:31:23,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 14:31:23,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:31:23,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 14:31:23,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:31:23,420 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-13 14:31:23,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:31:23,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400008141] [2024-11-13 14:31:23,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400008141] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:31:23,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:31:23,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 14:31:23,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806432394] [2024-11-13 14:31:23,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:31:23,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 14:31:23,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:31:23,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 14:31:23,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 14:31:23,427 INFO L87 Difference]: Start difference. First operand 52 states and 74 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-13 14:31:23,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:31:23,597 INFO L93 Difference]: Finished difference Result 106 states and 150 transitions. [2024-11-13 14:31:23,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 14:31:23,598 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 99 [2024-11-13 14:31:23,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:31:23,599 INFO L225 Difference]: With dead ends: 106 [2024-11-13 14:31:23,600 INFO L226 Difference]: Without dead ends: 57 [2024-11-13 14:31:23,600 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 14:31:23,605 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 32 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 14:31:23,605 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 143 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 14:31:23,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-11-13 14:31:23,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2024-11-13 14:31:23,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 39 states have internal predecessors, (48), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-13 14:31:23,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 78 transitions. [2024-11-13 14:31:23,625 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 78 transitions. Word has length 99 [2024-11-13 14:31:23,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:31:23,625 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 78 transitions. [2024-11-13 14:31:23,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-13 14:31:23,626 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 78 transitions. [2024-11-13 14:31:23,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-13 14:31:23,629 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:31:23,629 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:31:23,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-13 14:31:23,629 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:31:23,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:31:23,630 INFO L85 PathProgramCache]: Analyzing trace with hash -619995519, now seen corresponding path program 1 times [2024-11-13 14:31:23,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:31:23,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115329315] [2024-11-13 14:31:23,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:31:23,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:31:23,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:31:24,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:31:24,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:31:24,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 14:31:24,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:31:24,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 14:31:24,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:31:24,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 14:31:24,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:31:24,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 14:31:24,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:31:24,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 14:31:24,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:31:24,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 14:31:24,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:31:24,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 14:31:24,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:31:24,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 14:31:24,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:31:24,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-13 14:31:24,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:31:24,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 14:31:24,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:31:24,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 14:31:24,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:31:24,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 14:31:24,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:31:24,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 14:31:24,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:31:24,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 14:31:24,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:31:24,550 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-13 14:31:24,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:31:24,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115329315] [2024-11-13 14:31:24,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115329315] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:31:24,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:31:24,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 14:31:24,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874579934] [2024-11-13 14:31:24,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:31:24,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 14:31:24,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:31:24,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 14:31:24,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 14:31:24,552 INFO L87 Difference]: Start difference. First operand 57 states and 78 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-13 14:31:24,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:31:24,799 INFO L93 Difference]: Finished difference Result 130 states and 177 transitions. [2024-11-13 14:31:24,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 14:31:24,802 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 100 [2024-11-13 14:31:24,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:31:24,804 INFO L225 Difference]: With dead ends: 130 [2024-11-13 14:31:24,804 INFO L226 Difference]: Without dead ends: 76 [2024-11-13 14:31:24,804 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 14:31:24,808 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 17 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 14:31:24,808 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 188 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 14:31:24,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-11-13 14:31:24,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 65. [2024-11-13 14:31:24,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 47 states have (on average 1.2553191489361701) internal successors, (59), 47 states have internal predecessors, (59), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-13 14:31:24,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 89 transitions. [2024-11-13 14:31:24,828 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 89 transitions. Word has length 100 [2024-11-13 14:31:24,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:31:24,829 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 89 transitions. [2024-11-13 14:31:24,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-13 14:31:24,829 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 89 transitions. [2024-11-13 14:31:24,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-13 14:31:24,833 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:31:24,833 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:31:24,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-13 14:31:24,834 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:31:24,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:31:24,834 INFO L85 PathProgramCache]: Analyzing trace with hash -1362456870, now seen corresponding path program 1 times [2024-11-13 14:31:24,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:31:24,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565722722] [2024-11-13 14:31:24,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:31:24,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:31:24,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:31:25,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:31:25,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:31:25,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 14:31:25,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:31:25,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 14:31:25,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:31:25,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 14:31:25,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:31:25,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 14:31:25,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:31:25,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 14:31:25,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:31:25,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 14:31:25,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:31:25,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 14:31:25,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:31:25,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 14:31:25,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:31:25,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-13 14:31:25,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:31:25,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 14:31:25,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:31:25,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 14:31:25,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:31:25,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 14:31:25,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:31:25,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 14:31:25,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:31:25,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 14:31:25,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:31:25,506 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-13 14:31:25,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:31:25,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565722722] [2024-11-13 14:31:25,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565722722] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:31:25,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:31:25,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 14:31:25,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743668337] [2024-11-13 14:31:25,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:31:25,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 14:31:25,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:31:25,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 14:31:25,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-13 14:31:25,511 INFO L87 Difference]: Start difference. First operand 65 states and 89 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-13 14:31:25,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:31:25,668 INFO L93 Difference]: Finished difference Result 157 states and 211 transitions. [2024-11-13 14:31:25,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 14:31:25,670 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 101 [2024-11-13 14:31:25,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:31:25,673 INFO L225 Difference]: With dead ends: 157 [2024-11-13 14:31:25,673 INFO L226 Difference]: Without dead ends: 95 [2024-11-13 14:31:25,674 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-13 14:31:25,674 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 43 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 14:31:25,675 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 310 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 14:31:25,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-13 14:31:25,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 65. [2024-11-13 14:31:25,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 47 states have (on average 1.2553191489361701) internal successors, (59), 47 states have internal predecessors, (59), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-13 14:31:25,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 89 transitions. [2024-11-13 14:31:25,697 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 89 transitions. Word has length 101 [2024-11-13 14:31:25,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:31:25,697 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 89 transitions. [2024-11-13 14:31:25,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-13 14:31:25,698 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 89 transitions. [2024-11-13 14:31:25,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-13 14:31:25,699 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:31:25,701 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:31:25,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-13 14:31:25,701 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:31:25,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:31:25,702 INFO L85 PathProgramCache]: Analyzing trace with hash 636303996, now seen corresponding path program 1 times [2024-11-13 14:31:25,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:31:25,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576690429] [2024-11-13 14:31:25,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:31:25,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:31:25,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 14:31:25,741 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 14:31:25,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 14:31:25,838 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 14:31:25,838 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-13 14:31:25,839 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-13 14:31:25,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-13 14:31:25,845 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-13 14:31:25,956 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-13 14:31:25,959 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.11 02:31:25 BoogieIcfgContainer [2024-11-13 14:31:25,961 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-13 14:31:25,963 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 14:31:25,963 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 14:31:25,963 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 14:31:25,964 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:31:21" (3/4) ... [2024-11-13 14:31:25,966 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-13 14:31:25,967 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 14:31:25,968 INFO L158 Benchmark]: Toolchain (without parser) took 5074.81ms. Allocated memory was 117.4MB in the beginning and 142.6MB in the end (delta: 25.2MB). Free memory was 94.0MB in the beginning and 111.3MB in the end (delta: -17.3MB). Peak memory consumption was 6.8MB. Max. memory is 16.1GB. [2024-11-13 14:31:25,968 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 167.8MB. Free memory is still 104.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 14:31:25,968 INFO L158 Benchmark]: CACSL2BoogieTranslator took 322.32ms. Allocated memory is still 117.4MB. Free memory was 94.0MB in the beginning and 81.0MB in the end (delta: 13.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 14:31:25,969 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.86ms. Allocated memory is still 117.4MB. Free memory was 81.0MB in the beginning and 78.5MB in the end (delta: 2.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 14:31:25,969 INFO L158 Benchmark]: Boogie Preprocessor took 69.73ms. Allocated memory is still 117.4MB. Free memory was 78.5MB in the beginning and 75.0MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 14:31:25,969 INFO L158 Benchmark]: RCFGBuilder took 566.59ms. Allocated memory is still 117.4MB. Free memory was 75.0MB in the beginning and 58.0MB in the end (delta: 17.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-13 14:31:25,970 INFO L158 Benchmark]: TraceAbstraction took 4045.85ms. Allocated memory was 117.4MB in the beginning and 142.6MB in the end (delta: 25.2MB). Free memory was 57.3MB in the beginning and 111.3MB in the end (delta: -54.0MB). Peak memory consumption was 32.0MB. Max. memory is 16.1GB. [2024-11-13 14:31:25,970 INFO L158 Benchmark]: Witness Printer took 4.67ms. Allocated memory is still 142.6MB. Free memory was 111.3MB in the beginning and 111.3MB in the end (delta: 21.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 14:31:25,974 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.34ms. Allocated memory is still 167.8MB. Free memory is still 104.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 322.32ms. Allocated memory is still 117.4MB. Free memory was 94.0MB in the beginning and 81.0MB in the end (delta: 13.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.86ms. Allocated memory is still 117.4MB. Free memory was 81.0MB in the beginning and 78.5MB in the end (delta: 2.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 69.73ms. Allocated memory is still 117.4MB. Free memory was 78.5MB in the beginning and 75.0MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 566.59ms. Allocated memory is still 117.4MB. Free memory was 75.0MB in the beginning and 58.0MB in the end (delta: 17.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 4045.85ms. Allocated memory was 117.4MB in the beginning and 142.6MB in the end (delta: 25.2MB). Free memory was 57.3MB in the beginning and 111.3MB in the end (delta: -54.0MB). Peak memory consumption was 32.0MB. Max. memory is 16.1GB. * Witness Printer took 4.67ms. Allocated memory is still 142.6MB. Free memory was 111.3MB in the beginning and 111.3MB in the end (delta: 21.0kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 86, overapproximation of someBinaryFLOATComparisonOperation at line 95, overapproximation of someBinaryFLOATComparisonOperation at line 90, overapproximation of someBinaryFLOATComparisonOperation at line 88, overapproximation of someBinaryArithmeticFLOAToperation at line 58. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 16; [L23] unsigned char var_1_2 = 0; [L24] unsigned char var_1_3 = 8; [L25] unsigned char var_1_4 = 8; [L26] unsigned char var_1_5 = 32; [L27] unsigned char var_1_6 = 0; [L28] unsigned char var_1_7 = 1; [L29] float var_1_8 = 1.8; [L30] float var_1_9 = 9999999999999.75; [L31] float var_1_10 = 8.75; [L32] float var_1_11 = 255.75; [L33] unsigned short int var_1_12 = 10; [L34] unsigned char var_1_13 = 2; [L35] unsigned short int var_1_14 = 4; VAL [isInitial=0, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=0, var_1_3=8, var_1_4=8, var_1_5=32, var_1_6=0, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L99] isInitial = 1 [L100] FCALL initially() [L101] COND TRUE 1 [L102] FCALL updateLastVariables() [L103] CALL updateVariables() [L67] var_1_2 = __VERIFIER_nondet_uchar() [L68] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_3=8, var_1_4=8, var_1_5=32, var_1_6=0, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_3=8, var_1_4=8, var_1_5=32, var_1_6=0, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L68] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_3=8, var_1_4=8, var_1_5=32, var_1_6=0, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L69] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=8, var_1_4=8, var_1_5=32, var_1_6=0, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=8, var_1_4=8, var_1_5=32, var_1_6=0, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L69] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=8, var_1_4=8, var_1_5=32, var_1_6=0, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L70] var_1_3 = __VERIFIER_nondet_uchar() [L71] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_4=8, var_1_5=32, var_1_6=0, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_4=8, var_1_5=32, var_1_6=0, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L71] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_4=8, var_1_5=32, var_1_6=0, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L72] CALL assume_abort_if_not(var_1_3 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_4=8, var_1_5=32, var_1_6=0, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_4=8, var_1_5=32, var_1_6=0, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L72] RET assume_abort_if_not(var_1_3 <= 127) VAL [isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_4=8, var_1_5=32, var_1_6=0, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L73] var_1_4 = __VERIFIER_nondet_uchar() [L74] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_5=32, var_1_6=0, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_5=32, var_1_6=0, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L74] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_5=32, var_1_6=0, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L75] CALL assume_abort_if_not(var_1_4 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_4=50, var_1_5=32, var_1_6=0, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_4=50, var_1_5=32, var_1_6=0, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L75] RET assume_abort_if_not(var_1_4 <= 127) VAL [isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_4=50, var_1_5=32, var_1_6=0, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L76] var_1_5 = __VERIFIER_nondet_uchar() [L77] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_4=50, var_1_6=0, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_4=50, var_1_6=0, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L77] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_4=50, var_1_6=0, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L78] CALL assume_abort_if_not(var_1_5 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_4=50, var_1_5=51, var_1_6=0, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_4=50, var_1_5=51, var_1_6=0, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L78] RET assume_abort_if_not(var_1_5 <= 254) VAL [isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_4=50, var_1_5=51, var_1_6=0, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L79] var_1_6 = __VERIFIER_nondet_uchar() [L80] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_4=50, var_1_5=51, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_4=50, var_1_5=51, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L80] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_4=50, var_1_5=51, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L81] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_4=50, var_1_5=51, var_1_6=-255, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_4=50, var_1_5=51, var_1_6=-255, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L81] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_4=50, var_1_5=51, var_1_6=-255, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L82] var_1_7 = __VERIFIER_nondet_uchar() [L83] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_4=50, var_1_5=51, var_1_6=-255, var_1_8=9/5, var_1_9=39999999999999/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_4=50, var_1_5=51, var_1_6=-255, var_1_8=9/5, var_1_9=39999999999999/4] [L83] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_4=50, var_1_5=51, var_1_6=-255, var_1_8=9/5, var_1_9=39999999999999/4] [L84] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_4=50, var_1_5=51, var_1_6=-255, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_4=50, var_1_5=51, var_1_6=-255, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L84] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_4=50, var_1_5=51, var_1_6=-255, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L85] var_1_9 = __VERIFIER_nondet_float() [L86] CALL assume_abort_if_not((var_1_9 >= -461168.6018427382800e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 4611686.018427382800e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_4=50, var_1_5=51, var_1_6=-255, var_1_7=1, var_1_8=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_4=50, var_1_5=51, var_1_6=-255, var_1_7=1, var_1_8=9/5] [L86] RET assume_abort_if_not((var_1_9 >= -461168.6018427382800e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 4611686.018427382800e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_4=50, var_1_5=51, var_1_6=-255, var_1_7=1, var_1_8=9/5] [L87] var_1_10 = __VERIFIER_nondet_float() [L88] CALL assume_abort_if_not((var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_4=50, var_1_5=51, var_1_6=-255, var_1_7=1, var_1_8=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_4=50, var_1_5=51, var_1_6=-255, var_1_7=1, var_1_8=9/5] [L88] RET assume_abort_if_not((var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_4=50, var_1_5=51, var_1_6=-255, var_1_7=1, var_1_8=9/5] [L89] var_1_11 = __VERIFIER_nondet_float() [L90] CALL assume_abort_if_not((var_1_11 >= -461168.6018427382800e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_4=50, var_1_5=51, var_1_6=-255, var_1_7=1, var_1_8=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_4=50, var_1_5=51, var_1_6=-255, var_1_7=1, var_1_8=9/5] [L90] RET assume_abort_if_not((var_1_11 >= -461168.6018427382800e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_4=50, var_1_5=51, var_1_6=-255, var_1_7=1, var_1_8=9/5] [L103] RET updateVariables() [L104] CALL step() [L39] unsigned char stepLocal_0 = var_1_6; VAL [isInitial=1, stepLocal_0=-255, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_4=50, var_1_5=51, var_1_6=-255, var_1_7=1, var_1_8=9/5] [L40] COND TRUE \read(var_1_2) [L41] var_1_1 = (((((((((var_1_3 + var_1_4)) > (50)) ? ((var_1_3 + var_1_4)) : (50)))) > (var_1_5)) ? ((((((var_1_3 + var_1_4)) > (50)) ? ((var_1_3 + var_1_4)) : (50)))) : (var_1_5))) VAL [isInitial=1, stepLocal_0=-255, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=51, var_1_2=1, var_1_3=0, var_1_4=50, var_1_5=51, var_1_6=-255, var_1_7=1, var_1_8=9/5] [L53] var_1_12 = 100 [L54] var_1_13 = var_1_3 [L55] var_1_14 = var_1_3 VAL [isInitial=1, stepLocal_0=-255, var_1_12=100, var_1_13=0, var_1_14=0, var_1_1=51, var_1_2=1, var_1_3=0, var_1_4=50, var_1_5=51, var_1_6=-255, var_1_7=1, var_1_8=9/5] [L56] EXPR var_1_13 >> var_1_3 VAL [isInitial=1, stepLocal_0=-255, var_1_12=100, var_1_13=0, var_1_14=0, var_1_1=51, var_1_2=1, var_1_3=0, var_1_4=50, var_1_5=51, var_1_6=-255, var_1_7=1, var_1_8=9/5] [L56] COND TRUE (var_1_13 >> var_1_3) <= var_1_5 [L57] COND TRUE (25 > var_1_13) && var_1_7 [L58] var_1_8 = (var_1_9 + ((((var_1_10) > (var_1_11)) ? (var_1_10) : (var_1_11)))) VAL [isInitial=1, stepLocal_0=-255, var_1_12=100, var_1_13=0, var_1_14=0, var_1_1=51, var_1_2=1, var_1_3=0, var_1_4=50, var_1_5=51, var_1_6=-255, var_1_7=1] [L104] RET step() [L105] CALL, EXPR property() [L95] EXPR (var_1_2 ? (var_1_1 == ((unsigned char) (((((((((var_1_3 + var_1_4)) > (50)) ? ((var_1_3 + var_1_4)) : (50)))) > (var_1_5)) ? ((((((var_1_3 + var_1_4)) > (50)) ? ((var_1_3 + var_1_4)) : (50)))) : (var_1_5))))) : ((var_1_6 && var_1_7) ? (var_1_1 == ((unsigned char) var_1_5)) : (var_1_7 ? (var_1_1 == ((unsigned char) var_1_5)) : (var_1_1 == ((unsigned char) var_1_3))))) && (((var_1_13 >> var_1_3) <= var_1_5) ? (((25 > var_1_13) && var_1_7) ? (var_1_8 == ((float) (var_1_9 + ((((var_1_10) > (var_1_11)) ? (var_1_10) : (var_1_11)))))) : (var_1_8 == ((float) var_1_9))) : (var_1_8 == ((float) var_1_9))) VAL [isInitial=1, var_1_12=100, var_1_13=0, var_1_14=0, var_1_1=51, var_1_2=1, var_1_3=0, var_1_4=50, var_1_5=51, var_1_6=-255, var_1_7=1] [L95] EXPR var_1_13 >> var_1_3 VAL [isInitial=1, var_1_12=100, var_1_13=0, var_1_14=0, var_1_1=51, var_1_2=1, var_1_3=0, var_1_4=50, var_1_5=51, var_1_6=-255, var_1_7=1] [L95] EXPR (var_1_2 ? (var_1_1 == ((unsigned char) (((((((((var_1_3 + var_1_4)) > (50)) ? ((var_1_3 + var_1_4)) : (50)))) > (var_1_5)) ? ((((((var_1_3 + var_1_4)) > (50)) ? ((var_1_3 + var_1_4)) : (50)))) : (var_1_5))))) : ((var_1_6 && var_1_7) ? (var_1_1 == ((unsigned char) var_1_5)) : (var_1_7 ? (var_1_1 == ((unsigned char) var_1_5)) : (var_1_1 == ((unsigned char) var_1_3))))) && (((var_1_13 >> var_1_3) <= var_1_5) ? (((25 > var_1_13) && var_1_7) ? (var_1_8 == ((float) (var_1_9 + ((((var_1_10) > (var_1_11)) ? (var_1_10) : (var_1_11)))))) : (var_1_8 == ((float) var_1_9))) : (var_1_8 == ((float) var_1_9))) VAL [isInitial=1, var_1_12=100, var_1_13=0, var_1_14=0, var_1_1=51, var_1_2=1, var_1_3=0, var_1_4=50, var_1_5=51, var_1_6=-255, var_1_7=1] [L95-L96] return ((((var_1_2 ? (var_1_1 == ((unsigned char) (((((((((var_1_3 + var_1_4)) > (50)) ? ((var_1_3 + var_1_4)) : (50)))) > (var_1_5)) ? ((((((var_1_3 + var_1_4)) > (50)) ? ((var_1_3 + var_1_4)) : (50)))) : (var_1_5))))) : ((var_1_6 && var_1_7) ? (var_1_1 == ((unsigned char) var_1_5)) : (var_1_7 ? (var_1_1 == ((unsigned char) var_1_5)) : (var_1_1 == ((unsigned char) var_1_3))))) && (((var_1_13 >> var_1_3) <= var_1_5) ? (((25 > var_1_13) && var_1_7) ? (var_1_8 == ((float) (var_1_9 + ((((var_1_10) > (var_1_11)) ? (var_1_10) : (var_1_11)))))) : (var_1_8 == ((float) var_1_9))) : (var_1_8 == ((float) var_1_9)))) && (var_1_12 == ((unsigned short int) 100))) && (var_1_13 == ((unsigned char) var_1_3))) && (var_1_14 == ((unsigned short int) var_1_3)) ; [L105] RET, EXPR property() [L105] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_12=100, var_1_13=0, var_1_14=0, var_1_1=51, var_1_2=1, var_1_3=0, var_1_4=50, var_1_5=51, var_1_6=-255, var_1_7=1] [L19] reach_error() VAL [isInitial=1, var_1_12=100, var_1_13=0, var_1_14=0, var_1_1=51, var_1_2=1, var_1_3=0, var_1_4=50, var_1_5=51, var_1_6=-255, var_1_7=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 56 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.8s, OverallIterations: 5, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 92 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 92 mSDsluCounter, 715 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 414 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 151 IncrementalHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 301 mSDtfsCounter, 151 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 157 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=65occurred in iteration=3, InterpolantAutomatonStates: 15, 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, 4 MinimizatonAttempts, 41 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 501 NumberOfCodeBlocks, 501 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 395 ConstructedInterpolants, 0 QuantifiedInterpolants, 1040 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 1680/1680 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-13 14:31:26,007 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a328732-b164-4603-9b2d-7250c6be7254/bin/uautomizer-verify-qhAvR1uOyd/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/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a328732-b164-4603-9b2d-7250c6be7254/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a328732-b164-4603-9b2d-7250c6be7254/bin/uautomizer-verify-qhAvR1uOyd/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a328732-b164-4603-9b2d-7250c6be7254/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a328732-b164-4603-9b2d-7250c6be7254/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-71.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a328732-b164-4603-9b2d-7250c6be7254/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a328732-b164-4603-9b2d-7250c6be7254/bin/uautomizer-verify-qhAvR1uOyd --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 b7769f6e88057884e9f756ce4db3366a3e684d2e94a6b3544a7e6cd1c830e602 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 14:31:29,104 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 14:31:29,257 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a328732-b164-4603-9b2d-7250c6be7254/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-13 14:31:29,272 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 14:31:29,273 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 14:31:29,338 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 14:31:29,339 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 14:31:29,339 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 14:31:29,340 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 14:31:29,341 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 14:31:29,342 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 14:31:29,342 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 14:31:29,342 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 14:31:29,343 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 14:31:29,343 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 14:31:29,343 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 14:31:29,344 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 14:31:29,344 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 14:31:29,344 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 14:31:29,344 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 14:31:29,344 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 14:31:29,344 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 14:31:29,345 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 14:31:29,345 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-13 14:31:29,345 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-13 14:31:29,345 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 14:31:29,345 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-13 14:31:29,345 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 14:31:29,346 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 14:31:29,346 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 14:31:29,346 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 14:31:29,346 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 14:31:29,346 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 14:31:29,347 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 14:31:29,347 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 14:31:29,347 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 14:31:29,348 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 14:31:29,348 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 14:31:29,348 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-13 14:31:29,348 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-13 14:31:29,349 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 14:31:29,349 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 14:31:29,349 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 14:31:29,349 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 14:31:29,349 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a328732-b164-4603-9b2d-7250c6be7254/bin/uautomizer-verify-qhAvR1uOyd 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 -> b7769f6e88057884e9f756ce4db3366a3e684d2e94a6b3544a7e6cd1c830e602 [2024-11-13 14:31:29,746 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 14:31:29,757 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 14:31:29,760 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 14:31:29,762 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 14:31:29,763 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 14:31:29,764 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a328732-b164-4603-9b2d-7250c6be7254/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-71.i Unable to find full path for "g++" [2024-11-13 14:31:31,903 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 14:31:32,260 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 14:31:32,261 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a328732-b164-4603-9b2d-7250c6be7254/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-71.i [2024-11-13 14:31:32,273 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a328732-b164-4603-9b2d-7250c6be7254/bin/uautomizer-verify-qhAvR1uOyd/data/d45a323a2/208ac99da2f846c3bce3b36074de283b/FLAGba5902d2d [2024-11-13 14:31:32,504 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a328732-b164-4603-9b2d-7250c6be7254/bin/uautomizer-verify-qhAvR1uOyd/data/d45a323a2/208ac99da2f846c3bce3b36074de283b [2024-11-13 14:31:32,507 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 14:31:32,510 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 14:31:32,512 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 14:31:32,512 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 14:31:32,518 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 14:31:32,519 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 02:31:32" (1/1) ... [2024-11-13 14:31:32,521 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@296b95d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:31:32, skipping insertion in model container [2024-11-13 14:31:32,521 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 02:31:32" (1/1) ... [2024-11-13 14:31:32,543 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 14:31:32,711 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_5a328732-b164-4603-9b2d-7250c6be7254/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-71.i[915,928] [2024-11-13 14:31:32,763 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 14:31:32,783 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 14:31:32,800 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_5a328732-b164-4603-9b2d-7250c6be7254/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-71.i[915,928] [2024-11-13 14:31:32,847 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 14:31:32,868 INFO L204 MainTranslator]: Completed translation [2024-11-13 14:31:32,869 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:31:32 WrapperNode [2024-11-13 14:31:32,869 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 14:31:32,871 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 14:31:32,871 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 14:31:32,871 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 14:31:32,880 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:31:32" (1/1) ... [2024-11-13 14:31:32,891 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:31:32" (1/1) ... [2024-11-13 14:31:32,918 INFO L138 Inliner]: procedures = 27, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 105 [2024-11-13 14:31:32,918 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 14:31:32,919 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 14:31:32,919 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 14:31:32,920 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 14:31:32,931 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:31:32" (1/1) ... [2024-11-13 14:31:32,932 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:31:32" (1/1) ... [2024-11-13 14:31:32,935 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:31:32" (1/1) ... [2024-11-13 14:31:32,950 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-13 14:31:32,950 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:31:32" (1/1) ... [2024-11-13 14:31:32,951 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:31:32" (1/1) ... [2024-11-13 14:31:32,961 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:31:32" (1/1) ... [2024-11-13 14:31:32,965 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:31:32" (1/1) ... [2024-11-13 14:31:32,967 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:31:32" (1/1) ... [2024-11-13 14:31:32,969 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:31:32" (1/1) ... [2024-11-13 14:31:32,972 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 14:31:32,973 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 14:31:32,973 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 14:31:32,974 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 14:31:32,975 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:31:32" (1/1) ... [2024-11-13 14:31:32,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 14:31:32,999 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a328732-b164-4603-9b2d-7250c6be7254/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:31:33,016 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a328732-b164-4603-9b2d-7250c6be7254/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 14:31:33,020 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a328732-b164-4603-9b2d-7250c6be7254/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 14:31:33,056 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 14:31:33,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-13 14:31:33,057 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-13 14:31:33,057 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-13 14:31:33,057 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 14:31:33,057 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 14:31:33,195 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 14:31:33,198 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 14:31:33,804 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-13 14:31:33,805 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 14:31:33,818 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 14:31:33,818 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 14:31:33,819 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:31:33 BoogieIcfgContainer [2024-11-13 14:31:33,819 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 14:31:33,822 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 14:31:33,822 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 14:31:33,829 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 14:31:33,829 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 02:31:32" (1/3) ... [2024-11-13 14:31:33,830 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5217ed39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 02:31:33, skipping insertion in model container [2024-11-13 14:31:33,830 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:31:32" (2/3) ... [2024-11-13 14:31:33,831 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5217ed39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 02:31:33, skipping insertion in model container [2024-11-13 14:31:33,831 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:31:33" (3/3) ... [2024-11-13 14:31:33,833 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-71.i [2024-11-13 14:31:33,852 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 14:31:33,855 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount25_file-71.i that has 2 procedures, 49 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-13 14:31:33,926 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 14:31:33,941 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;@7e09af10, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 14:31:33,941 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-13 14:31:33,946 INFO L276 IsEmpty]: Start isEmpty. Operand has 49 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 32 states have internal predecessors, (41), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-13 14:31:33,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-13 14:31:33,959 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:31:33,960 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:31:33,961 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:31:33,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:31:33,967 INFO L85 PathProgramCache]: Analyzing trace with hash -473602511, now seen corresponding path program 1 times [2024-11-13 14:31:33,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:31:33,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [439980871] [2024-11-13 14:31:33,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:31:33,987 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-13 14:31:33,988 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a328732-b164-4603-9b2d-7250c6be7254/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:31:33,993 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a328732-b164-4603-9b2d-7250c6be7254/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:31:33,997 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a328732-b164-4603-9b2d-7250c6be7254/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:31:34,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:31:34,279 INFO L255 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-13 14:31:34,303 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:31:34,377 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 208 proven. 0 refuted. 0 times theorem prover too weak. 212 trivial. 0 not checked. [2024-11-13 14:31:34,378 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:31:34,378 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:31:34,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [439980871] [2024-11-13 14:31:34,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [439980871] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:31:34,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:31:34,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 14:31:34,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973366332] [2024-11-13 14:31:34,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:31:34,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-13 14:31:34,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:31:34,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-13 14:31:34,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 14:31:34,414 INFO L87 Difference]: Start difference. First operand has 49 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 32 states have internal predecessors, (41), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-13 14:31:34,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:31:34,444 INFO L93 Difference]: Finished difference Result 91 states and 151 transitions. [2024-11-13 14:31:34,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 14:31:34,447 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 96 [2024-11-13 14:31:34,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:31:34,458 INFO L225 Difference]: With dead ends: 91 [2024-11-13 14:31:34,458 INFO L226 Difference]: Without dead ends: 45 [2024-11-13 14:31:34,463 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 95 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-13 14:31:34,469 INFO L432 NwaCegarLoop]: 64 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, 64 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-13 14:31:34,472 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 14:31:34,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-11-13 14:31:34,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2024-11-13 14:31:34,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 28 states have internal predecessors, (34), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-13 14:31:34,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 64 transitions. [2024-11-13 14:31:34,529 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 64 transitions. Word has length 96 [2024-11-13 14:31:34,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:31:34,530 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 64 transitions. [2024-11-13 14:31:34,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-13 14:31:34,531 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 64 transitions. [2024-11-13 14:31:34,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-13 14:31:34,535 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:31:34,535 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:31:34,542 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a328732-b164-4603-9b2d-7250c6be7254/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:31:34,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a328732-b164-4603-9b2d-7250c6be7254/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:31:34,736 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:31:34,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:31:34,737 INFO L85 PathProgramCache]: Analyzing trace with hash 2135810615, now seen corresponding path program 1 times [2024-11-13 14:31:34,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:31:34,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2133451802] [2024-11-13 14:31:34,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:31:34,738 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-13 14:31:34,738 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a328732-b164-4603-9b2d-7250c6be7254/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:31:34,741 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a328732-b164-4603-9b2d-7250c6be7254/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:31:34,743 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a328732-b164-4603-9b2d-7250c6be7254/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:31:35,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:31:35,009 INFO L255 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-13 14:31:35,021 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:31:36,943 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 134 proven. 6 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2024-11-13 14:31:36,944 INFO L311 TraceCheckSpWp]: Computing backward predicates...