./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-22.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_0d2adae5-20ee-48a8-95d5-1346568ce139/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d2adae5-20ee-48a8-95d5-1346568ce139/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_0d2adae5-20ee-48a8-95d5-1346568ce139/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d2adae5-20ee-48a8-95d5-1346568ce139/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-22.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d2adae5-20ee-48a8-95d5-1346568ce139/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_0d2adae5-20ee-48a8-95d5-1346568ce139/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 51f41c82328a7c1c95cfe78feec09676aa10ab705ad15ff75bf75be08682960b --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 14:52:24,236 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 14:52:24,329 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d2adae5-20ee-48a8-95d5-1346568ce139/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-13 14:52:24,334 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 14:52:24,334 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 14:52:24,360 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 14:52:24,361 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 14:52:24,362 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 14:52:24,362 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 14:52:24,362 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 14:52:24,363 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 14:52:24,363 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 14:52:24,363 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 14:52:24,364 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 14:52:24,365 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 14:52:24,365 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 14:52:24,366 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 14:52:24,366 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 14:52:24,366 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 14:52:24,366 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 14:52:24,366 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 14:52:24,366 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 14:52:24,366 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 14:52:24,366 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 14:52:24,367 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 14:52:24,367 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 14:52:24,367 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 14:52:24,367 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 14:52:24,367 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 14:52:24,367 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 14:52:24,367 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 14:52:24,367 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 14:52:24,367 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 14:52:24,368 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 14:52:24,368 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 14:52:24,368 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 14:52:24,368 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 14:52:24,368 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 14:52:24,368 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 14:52:24,368 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 14:52:24,368 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 14:52:24,368 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 14:52:24,368 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_0d2adae5-20ee-48a8-95d5-1346568ce139/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 -> 51f41c82328a7c1c95cfe78feec09676aa10ab705ad15ff75bf75be08682960b [2024-11-13 14:52:24,638 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 14:52:24,647 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 14:52:24,649 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 14:52:24,651 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 14:52:24,651 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 14:52:24,653 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d2adae5-20ee-48a8-95d5-1346568ce139/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-22.i Unable to find full path for "g++" [2024-11-13 14:52:26,546 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 14:52:26,792 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 14:52:26,792 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d2adae5-20ee-48a8-95d5-1346568ce139/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-22.i [2024-11-13 14:52:26,801 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d2adae5-20ee-48a8-95d5-1346568ce139/bin/uautomizer-verify-qhAvR1uOyd/data/7c184e121/f41ade193c8148bf86a9354ae5a2821f/FLAG1cad85116 [2024-11-13 14:52:26,823 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d2adae5-20ee-48a8-95d5-1346568ce139/bin/uautomizer-verify-qhAvR1uOyd/data/7c184e121/f41ade193c8148bf86a9354ae5a2821f [2024-11-13 14:52:26,826 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 14:52:26,829 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 14:52:26,830 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 14:52:26,831 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 14:52:26,835 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 14:52:26,836 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 02:52:26" (1/1) ... [2024-11-13 14:52:26,839 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b73d8ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:52:26, skipping insertion in model container [2024-11-13 14:52:26,840 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 02:52:26" (1/1) ... [2024-11-13 14:52:26,863 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 14:52:27,026 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_0d2adae5-20ee-48a8-95d5-1346568ce139/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-22.i[913,926] [2024-11-13 14:52:27,098 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 14:52:27,113 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 14:52:27,124 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_0d2adae5-20ee-48a8-95d5-1346568ce139/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-22.i[913,926] [2024-11-13 14:52:27,161 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 14:52:27,186 INFO L204 MainTranslator]: Completed translation [2024-11-13 14:52:27,187 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:52:27 WrapperNode [2024-11-13 14:52:27,187 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 14:52:27,188 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 14:52:27,189 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 14:52:27,189 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 14:52:27,196 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:52:27" (1/1) ... [2024-11-13 14:52:27,205 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:52:27" (1/1) ... [2024-11-13 14:52:27,251 INFO L138 Inliner]: procedures = 26, calls = 22, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 113 [2024-11-13 14:52:27,251 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 14:52:27,252 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 14:52:27,252 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 14:52:27,252 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 14:52:27,263 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:52:27" (1/1) ... [2024-11-13 14:52:27,263 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:52:27" (1/1) ... [2024-11-13 14:52:27,266 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:52:27" (1/1) ... [2024-11-13 14:52:27,289 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:52:27,291 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:52:27" (1/1) ... [2024-11-13 14:52:27,291 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:52:27" (1/1) ... [2024-11-13 14:52:27,303 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:52:27" (1/1) ... [2024-11-13 14:52:27,310 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:52:27" (1/1) ... [2024-11-13 14:52:27,314 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:52:27" (1/1) ... [2024-11-13 14:52:27,315 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:52:27" (1/1) ... [2024-11-13 14:52:27,318 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 14:52:27,319 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 14:52:27,319 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 14:52:27,319 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 14:52:27,320 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:52:27" (1/1) ... [2024-11-13 14:52:27,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 14:52:27,341 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d2adae5-20ee-48a8-95d5-1346568ce139/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:52:27,355 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d2adae5-20ee-48a8-95d5-1346568ce139/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:52:27,358 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d2adae5-20ee-48a8-95d5-1346568ce139/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:52:27,386 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 14:52:27,386 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-13 14:52:27,386 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-13 14:52:27,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-13 14:52:27,387 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 14:52:27,387 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 14:52:27,465 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 14:52:27,466 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 14:52:27,823 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-13 14:52:27,824 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 14:52:27,832 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 14:52:27,834 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 14:52:27,835 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:52:27 BoogieIcfgContainer [2024-11-13 14:52:27,835 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 14:52:27,838 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 14:52:27,838 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 14:52:27,844 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 14:52:27,845 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 02:52:26" (1/3) ... [2024-11-13 14:52:27,845 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@760281a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 02:52:27, skipping insertion in model container [2024-11-13 14:52:27,846 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:52:27" (2/3) ... [2024-11-13 14:52:27,846 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@760281a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 02:52:27, skipping insertion in model container [2024-11-13 14:52:27,848 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:52:27" (3/3) ... [2024-11-13 14:52:27,849 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-22.i [2024-11-13 14:52:27,865 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 14:52:27,867 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_normal_file-22.i that has 2 procedures, 50 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-13 14:52:27,920 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 14:52:27,932 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;@270b4b9f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 14:52:27,933 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-13 14:52:27,937 INFO L276 IsEmpty]: Start isEmpty. Operand has 50 states, 38 states have (on average 1.4473684210526316) internal successors, (55), 39 states have internal predecessors, (55), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-13 14:52:27,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-13 14:52:27,945 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:52:27,946 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:27,947 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:52:27,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:52:27,952 INFO L85 PathProgramCache]: Analyzing trace with hash -1622659191, now seen corresponding path program 1 times [2024-11-13 14:52:27,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:52:27,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767735073] [2024-11-13 14:52:27,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:52:27,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:52:28,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:29,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:52:29,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:29,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 14:52:29,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:29,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 14:52:29,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:29,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 14:52:29,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:29,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 14:52:29,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:29,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-13 14:52:29,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:29,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-13 14:52:29,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:29,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-13 14:52:29,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:29,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 14:52:29,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:29,226 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-13 14:52:29,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:52:29,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767735073] [2024-11-13 14:52:29,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767735073] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:52:29,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:52:29,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 14:52:29,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757619438] [2024-11-13 14:52:29,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:52:29,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 14:52:29,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:52:29,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 14:52:29,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-13 14:52:29,263 INFO L87 Difference]: Start difference. First operand has 50 states, 38 states have (on average 1.4473684210526316) internal successors, (55), 39 states have internal predecessors, (55), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-13 14:52:29,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:52:29,814 INFO L93 Difference]: Finished difference Result 197 states and 330 transitions. [2024-11-13 14:52:29,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 14:52:29,818 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 67 [2024-11-13 14:52:29,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:52:29,830 INFO L225 Difference]: With dead ends: 197 [2024-11-13 14:52:29,830 INFO L226 Difference]: Without dead ends: 150 [2024-11-13 14:52:29,835 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-13 14:52:29,840 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 203 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-13 14:52:29,840 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 239 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-13 14:52:29,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2024-11-13 14:52:29,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 107. [2024-11-13 14:52:29,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 76 states have (on average 1.2894736842105263) internal successors, (98), 76 states have internal predecessors, (98), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-13 14:52:29,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 152 transitions. [2024-11-13 14:52:29,922 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 152 transitions. Word has length 67 [2024-11-13 14:52:29,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:52:29,924 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 152 transitions. [2024-11-13 14:52:29,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-13 14:52:29,925 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 152 transitions. [2024-11-13 14:52:29,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-13 14:52:29,928 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:52:29,928 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:29,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 14:52:29,929 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:52:29,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:52:29,929 INFO L85 PathProgramCache]: Analyzing trace with hash 897300743, now seen corresponding path program 1 times [2024-11-13 14:52:29,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:52:29,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828630868] [2024-11-13 14:52:29,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:52:29,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:52:29,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:30,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:52:30,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:30,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 14:52:30,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:30,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 14:52:30,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:30,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 14:52:30,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:30,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 14:52:30,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:30,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-13 14:52:30,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:30,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-13 14:52:30,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:30,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-13 14:52:30,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:30,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 14:52:30,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:30,513 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-13 14:52:30,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:52:30,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828630868] [2024-11-13 14:52:30,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828630868] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:52:30,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:52:30,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 14:52:30,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516305289] [2024-11-13 14:52:30,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:52:30,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 14:52:30,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:52:30,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 14:52:30,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 14:52:30,519 INFO L87 Difference]: Start difference. First operand 107 states and 152 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-13 14:52:30,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:52:30,893 INFO L93 Difference]: Finished difference Result 230 states and 327 transitions. [2024-11-13 14:52:30,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 14:52:30,894 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 67 [2024-11-13 14:52:30,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:52:30,896 INFO L225 Difference]: With dead ends: 230 [2024-11-13 14:52:30,896 INFO L226 Difference]: Without dead ends: 148 [2024-11-13 14:52:30,897 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-13 14:52:30,898 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 97 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 14:52:30,900 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 140 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 14:52:30,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2024-11-13 14:52:30,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 117. [2024-11-13 14:52:30,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 86 states have (on average 1.302325581395349) internal successors, (112), 86 states have internal predecessors, (112), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-13 14:52:30,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 166 transitions. [2024-11-13 14:52:30,940 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 166 transitions. Word has length 67 [2024-11-13 14:52:30,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:52:30,941 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 166 transitions. [2024-11-13 14:52:30,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-13 14:52:30,941 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 166 transitions. [2024-11-13 14:52:30,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-13 14:52:30,942 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:52:30,943 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:30,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-13 14:52:30,943 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:52:30,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:52:30,943 INFO L85 PathProgramCache]: Analyzing trace with hash -342554507, now seen corresponding path program 1 times [2024-11-13 14:52:30,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:52:30,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570033096] [2024-11-13 14:52:30,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:52:30,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:52:30,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:31,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:52:31,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:31,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 14:52:31,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:31,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 14:52:31,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:31,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 14:52:31,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:31,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 14:52:31,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:31,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-13 14:52:31,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:31,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-13 14:52:31,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:31,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-13 14:52:31,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:31,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 14:52:31,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:31,427 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-13 14:52:31,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:52:31,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570033096] [2024-11-13 14:52:31,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570033096] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:52:31,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:52:31,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 14:52:31,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136342444] [2024-11-13 14:52:31,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:52:31,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 14:52:31,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:52:31,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 14:52:31,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 14:52:31,431 INFO L87 Difference]: Start difference. First operand 117 states and 166 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-13 14:52:31,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:52:31,741 INFO L93 Difference]: Finished difference Result 236 states and 334 transitions. [2024-11-13 14:52:31,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 14:52:31,741 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 68 [2024-11-13 14:52:31,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:52:31,743 INFO L225 Difference]: With dead ends: 236 [2024-11-13 14:52:31,743 INFO L226 Difference]: Without dead ends: 148 [2024-11-13 14:52:31,743 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-13 14:52:31,744 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 75 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 14:52:31,745 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 157 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 14:52:31,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2024-11-13 14:52:31,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 118. [2024-11-13 14:52:31,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 87 states have (on average 1.2873563218390804) internal successors, (112), 87 states have internal predecessors, (112), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-13 14:52:31,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 166 transitions. [2024-11-13 14:52:31,782 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 166 transitions. Word has length 68 [2024-11-13 14:52:31,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:52:31,783 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 166 transitions. [2024-11-13 14:52:31,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-13 14:52:31,783 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 166 transitions. [2024-11-13 14:52:31,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-13 14:52:31,784 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:52:31,785 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:31,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-13 14:52:31,789 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:52:31,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:52:31,789 INFO L85 PathProgramCache]: Analyzing trace with hash -1705529449, now seen corresponding path program 1 times [2024-11-13 14:52:31,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:52:31,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726554302] [2024-11-13 14:52:31,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:52:31,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:52:31,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:32,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:52:33,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:33,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 14:52:33,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:33,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 14:52:33,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:33,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 14:52:33,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:33,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 14:52:33,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:33,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-13 14:52:33,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:33,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-13 14:52:33,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:33,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-13 14:52:33,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:33,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 14:52:33,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:33,064 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-13 14:52:33,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:52:33,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726554302] [2024-11-13 14:52:33,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726554302] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:52:33,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:52:33,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-13 14:52:33,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124086732] [2024-11-13 14:52:33,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:52:33,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-13 14:52:33,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:52:33,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-13 14:52:33,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-13 14:52:33,066 INFO L87 Difference]: Start difference. First operand 118 states and 166 transitions. Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-13 14:52:34,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:52:34,033 INFO L93 Difference]: Finished difference Result 351 states and 486 transitions. [2024-11-13 14:52:34,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 14:52:34,035 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 68 [2024-11-13 14:52:34,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:52:34,041 INFO L225 Difference]: With dead ends: 351 [2024-11-13 14:52:34,041 INFO L226 Difference]: Without dead ends: 309 [2024-11-13 14:52:34,042 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2024-11-13 14:52:34,042 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 188 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-13 14:52:34,043 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 287 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-13 14:52:34,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2024-11-13 14:52:34,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 236. [2024-11-13 14:52:34,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 182 states have (on average 1.3186813186813187) internal successors, (240), 183 states have internal predecessors, (240), 47 states have call successors, (47), 6 states have call predecessors, (47), 6 states have return successors, (47), 46 states have call predecessors, (47), 47 states have call successors, (47) [2024-11-13 14:52:34,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 334 transitions. [2024-11-13 14:52:34,097 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 334 transitions. Word has length 68 [2024-11-13 14:52:34,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:52:34,098 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 334 transitions. [2024-11-13 14:52:34,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-13 14:52:34,098 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 334 transitions. [2024-11-13 14:52:34,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-13 14:52:34,099 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:52:34,100 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:34,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-13 14:52:34,100 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:52:34,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:52:34,100 INFO L85 PathProgramCache]: Analyzing trace with hash -1004464871, now seen corresponding path program 1 times [2024-11-13 14:52:34,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:52:34,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807896692] [2024-11-13 14:52:34,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:52:34,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:52:34,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:34,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:52:34,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:34,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 14:52:34,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:34,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 14:52:34,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:34,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 14:52:34,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:34,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 14:52:34,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:34,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-13 14:52:34,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:34,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-13 14:52:34,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:34,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-13 14:52:34,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:34,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 14:52:34,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:34,184 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-13 14:52:34,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:52:34,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807896692] [2024-11-13 14:52:34,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807896692] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:52:34,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:52:34,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 14:52:34,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123716216] [2024-11-13 14:52:34,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:52:34,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 14:52:34,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:52:34,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 14:52:34,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:52:34,186 INFO L87 Difference]: Start difference. First operand 236 states and 334 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-13 14:52:34,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:52:34,227 INFO L93 Difference]: Finished difference Result 417 states and 591 transitions. [2024-11-13 14:52:34,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 14:52:34,228 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 68 [2024-11-13 14:52:34,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:52:34,231 INFO L225 Difference]: With dead ends: 417 [2024-11-13 14:52:34,231 INFO L226 Difference]: Without dead ends: 222 [2024-11-13 14:52:34,233 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:52:34,233 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 13 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 14:52:34,234 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 116 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 14:52:34,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2024-11-13 14:52:34,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 156. [2024-11-13 14:52:34,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 122 states have (on average 1.2950819672131149) internal successors, (158), 123 states have internal predecessors, (158), 29 states have call successors, (29), 4 states have call predecessors, (29), 4 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-13 14:52:34,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 216 transitions. [2024-11-13 14:52:34,283 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 216 transitions. Word has length 68 [2024-11-13 14:52:34,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:52:34,283 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 216 transitions. [2024-11-13 14:52:34,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-13 14:52:34,283 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 216 transitions. [2024-11-13 14:52:34,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-13 14:52:34,284 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:52:34,285 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:34,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-13 14:52:34,285 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:52:34,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:52:34,285 INFO L85 PathProgramCache]: Analyzing trace with hash -1250757686, now seen corresponding path program 1 times [2024-11-13 14:52:34,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:52:34,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065367057] [2024-11-13 14:52:34,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:52:34,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:52:34,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 14:52:34,338 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 14:52:34,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 14:52:34,435 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 14:52:34,435 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-13 14:52:34,436 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-13 14:52:34,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-13 14:52:34,442 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-13 14:52:34,516 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-13 14:52:34,522 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.11 02:52:34 BoogieIcfgContainer [2024-11-13 14:52:34,522 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-13 14:52:34,522 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 14:52:34,523 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 14:52:34,523 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 14:52:34,527 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:52:27" (3/4) ... [2024-11-13 14:52:34,529 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-13 14:52:34,530 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 14:52:34,531 INFO L158 Benchmark]: Toolchain (without parser) took 7702.72ms. Allocated memory was 117.4MB in the beginning and 142.6MB in the end (delta: 25.2MB). Free memory was 92.6MB in the beginning and 87.6MB in the end (delta: 4.9MB). Peak memory consumption was 32.6MB. Max. memory is 16.1GB. [2024-11-13 14:52:34,532 INFO L158 Benchmark]: CDTParser took 0.44ms. Allocated memory is still 117.4MB. Free memory is still 73.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 14:52:34,532 INFO L158 Benchmark]: CACSL2BoogieTranslator took 357.65ms. Allocated memory is still 117.4MB. Free memory was 92.4MB in the beginning and 79.6MB in the end (delta: 12.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-13 14:52:34,532 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.76ms. Allocated memory is still 117.4MB. Free memory was 79.6MB in the beginning and 77.2MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 14:52:34,532 INFO L158 Benchmark]: Boogie Preprocessor took 66.51ms. Allocated memory is still 117.4MB. Free memory was 77.2MB in the beginning and 74.4MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 14:52:34,533 INFO L158 Benchmark]: RCFGBuilder took 516.12ms. Allocated memory is still 117.4MB. Free memory was 74.4MB in the beginning and 57.9MB in the end (delta: 16.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 14:52:34,533 INFO L158 Benchmark]: TraceAbstraction took 6684.35ms. 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 87.7MB in the end (delta: -30.4MB). Peak memory consumption was 7.5MB. Max. memory is 16.1GB. [2024-11-13 14:52:34,533 INFO L158 Benchmark]: Witness Printer took 7.90ms. Allocated memory is still 142.6MB. Free memory was 87.7MB in the beginning and 87.6MB in the end (delta: 27.1kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 14:52:34,537 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.44ms. Allocated memory is still 117.4MB. Free memory is still 73.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 357.65ms. Allocated memory is still 117.4MB. Free memory was 92.4MB in the beginning and 79.6MB in the end (delta: 12.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.76ms. Allocated memory is still 117.4MB. Free memory was 79.6MB in the beginning and 77.2MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 66.51ms. Allocated memory is still 117.4MB. Free memory was 77.2MB in the beginning and 74.4MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 516.12ms. Allocated memory is still 117.4MB. Free memory was 74.4MB in the beginning and 57.9MB in the end (delta: 16.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 6684.35ms. 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 87.7MB in the end (delta: -30.4MB). Peak memory consumption was 7.5MB. Max. memory is 16.1GB. * Witness Printer took 7.90ms. Allocated memory is still 142.6MB. Free memory was 87.7MB in the beginning and 87.6MB in the end (delta: 27.1kB). 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 75, overapproximation of someBinaryFLOATComparisonOperation at line 77, overapproximation of someBinaryFLOATComparisonOperation at line 73, overapproximation of someBinaryFLOATComparisonOperation at line 87, overapproximation of bitwiseAnd at line 52, overapproximation of someBinaryArithmeticFLOAToperation at line 62. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = -5; [L23] unsigned char var_1_4 = 0; [L24] unsigned short int var_1_5 = 256; [L25] unsigned short int var_1_6 = 44772; [L26] float var_1_7 = 5.9; [L27] float var_1_8 = 7.6; [L28] float var_1_9 = 64.2; [L29] float var_1_10 = 128.75; [L30] unsigned long int var_1_11 = 8; [L31] unsigned long int var_1_12 = 3135928546; [L32] signed short int last_1_var_1_1 = -5; [L33] unsigned long int last_1_var_1_11 = 8; VAL [isInitial=0, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10=515/4, var_1_11=8, var_1_12=3135928546, var_1_1=-5, var_1_4=0, var_1_5=256, var_1_6=44772, var_1_7=59/10, var_1_8=38/5, var_1_9=321/5] [L91] isInitial = 1 [L92] FCALL initially() [L93] COND TRUE 1 [L94] CALL updateLastVariables() [L83] last_1_var_1_1 = var_1_1 [L84] last_1_var_1_11 = var_1_11 VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10=515/4, var_1_11=8, var_1_12=3135928546, var_1_1=-5, var_1_4=0, var_1_5=256, var_1_6=44772, var_1_7=59/10, var_1_8=38/5, var_1_9=321/5] [L94] RET updateLastVariables() [L95] CALL updateVariables() [L66] var_1_4 = __VERIFIER_nondet_uchar() [L67] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10=515/4, var_1_11=8, var_1_12=3135928546, var_1_1=-5, var_1_5=256, var_1_6=44772, var_1_7=59/10, var_1_8=38/5, var_1_9=321/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10=515/4, var_1_11=8, var_1_12=3135928546, var_1_1=-5, var_1_5=256, var_1_6=44772, var_1_7=59/10, var_1_8=38/5, var_1_9=321/5] [L67] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10=515/4, var_1_11=8, var_1_12=3135928546, var_1_1=-5, var_1_5=256, var_1_6=44772, var_1_7=59/10, var_1_8=38/5, var_1_9=321/5] [L68] CALL assume_abort_if_not(var_1_4 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10=515/4, var_1_11=8, var_1_12=3135928546, var_1_1=-5, var_1_4=1, var_1_5=256, var_1_6=44772, var_1_7=59/10, var_1_8=38/5, var_1_9=321/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10=515/4, var_1_11=8, var_1_12=3135928546, var_1_1=-5, var_1_4=1, var_1_5=256, var_1_6=44772, var_1_7=59/10, var_1_8=38/5, var_1_9=321/5] [L68] RET assume_abort_if_not(var_1_4 <= 1) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10=515/4, var_1_11=8, var_1_12=3135928546, var_1_1=-5, var_1_4=1, var_1_5=256, var_1_6=44772, var_1_7=59/10, var_1_8=38/5, var_1_9=321/5] [L69] var_1_6 = __VERIFIER_nondet_ushort() [L70] CALL assume_abort_if_not(var_1_6 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10=515/4, var_1_11=8, var_1_12=3135928546, var_1_1=-5, var_1_4=1, var_1_5=256, var_1_6=32767, var_1_7=59/10, var_1_8=38/5, var_1_9=321/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10=515/4, var_1_11=8, var_1_12=3135928546, var_1_1=-5, var_1_4=1, var_1_5=256, var_1_6=32767, var_1_7=59/10, var_1_8=38/5, var_1_9=321/5] [L70] RET assume_abort_if_not(var_1_6 >= 32767) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10=515/4, var_1_11=8, var_1_12=3135928546, var_1_1=-5, var_1_4=1, var_1_5=256, var_1_6=32767, var_1_7=59/10, var_1_8=38/5, var_1_9=321/5] [L71] CALL assume_abort_if_not(var_1_6 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10=515/4, var_1_11=8, var_1_12=3135928546, var_1_1=-5, var_1_4=1, var_1_5=256, var_1_6=32767, var_1_7=59/10, var_1_8=38/5, var_1_9=321/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10=515/4, var_1_11=8, var_1_12=3135928546, var_1_1=-5, var_1_4=1, var_1_5=256, var_1_6=32767, var_1_7=59/10, var_1_8=38/5, var_1_9=321/5] [L71] RET assume_abort_if_not(var_1_6 <= 65534) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10=515/4, var_1_11=8, var_1_12=3135928546, var_1_1=-5, var_1_4=1, var_1_5=256, var_1_6=32767, var_1_7=59/10, var_1_8=38/5, var_1_9=321/5] [L72] var_1_8 = __VERIFIER_nondet_float() [L73] CALL assume_abort_if_not((var_1_8 >= -115292.1504606845700e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 1152921.504606845700e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10=515/4, var_1_11=8, var_1_12=3135928546, var_1_1=-5, var_1_4=1, var_1_5=256, var_1_6=32767, var_1_7=59/10, var_1_9=321/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10=515/4, var_1_11=8, var_1_12=3135928546, var_1_1=-5, var_1_4=1, var_1_5=256, var_1_6=32767, var_1_7=59/10, var_1_9=321/5] [L73] RET assume_abort_if_not((var_1_8 >= -115292.1504606845700e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 1152921.504606845700e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10=515/4, var_1_11=8, var_1_12=3135928546, var_1_1=-5, var_1_4=1, var_1_5=256, var_1_6=32767, var_1_7=59/10, var_1_9=321/5] [L74] var_1_9 = __VERIFIER_nondet_float() [L75] CALL assume_abort_if_not((var_1_9 >= -230584.3009213691390e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 2305843.009213691390e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10=515/4, var_1_11=8, var_1_12=3135928546, var_1_1=-5, var_1_4=1, var_1_5=256, var_1_6=32767, var_1_7=59/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10=515/4, var_1_11=8, var_1_12=3135928546, var_1_1=-5, var_1_4=1, var_1_5=256, var_1_6=32767, var_1_7=59/10] [L75] RET assume_abort_if_not((var_1_9 >= -230584.3009213691390e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 2305843.009213691390e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10=515/4, var_1_11=8, var_1_12=3135928546, var_1_1=-5, var_1_4=1, var_1_5=256, var_1_6=32767, var_1_7=59/10] [L76] var_1_10 = __VERIFIER_nondet_float() [L77] 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, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_11=8, var_1_12=3135928546, var_1_1=-5, var_1_4=1, var_1_5=256, var_1_6=32767, var_1_7=59/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_11=8, var_1_12=3135928546, var_1_1=-5, var_1_4=1, var_1_5=256, var_1_6=32767, var_1_7=59/10] [L77] 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, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_11=8, var_1_12=3135928546, var_1_1=-5, var_1_4=1, var_1_5=256, var_1_6=32767, var_1_7=59/10] [L78] var_1_12 = __VERIFIER_nondet_ulong() [L79] CALL assume_abort_if_not(var_1_12 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_11=8, var_1_12=2147483647, var_1_1=-5, var_1_4=1, var_1_5=256, var_1_6=32767, var_1_7=59/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_11=8, var_1_12=2147483647, var_1_1=-5, var_1_4=1, var_1_5=256, var_1_6=32767, var_1_7=59/10] [L79] RET assume_abort_if_not(var_1_12 >= 2147483647) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_11=8, var_1_12=2147483647, var_1_1=-5, var_1_4=1, var_1_5=256, var_1_6=32767, var_1_7=59/10] [L80] CALL assume_abort_if_not(var_1_12 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_11=8, var_1_12=2147483647, var_1_1=-5, var_1_4=1, var_1_5=256, var_1_6=32767, var_1_7=59/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_11=8, var_1_12=2147483647, var_1_1=-5, var_1_4=1, var_1_5=256, var_1_6=32767, var_1_7=59/10] [L80] RET assume_abort_if_not(var_1_12 <= 4294967294) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_11=8, var_1_12=2147483647, var_1_1=-5, var_1_4=1, var_1_5=256, var_1_6=32767, var_1_7=59/10] [L95] RET updateVariables() [L96] CALL step() [L37] signed long int stepLocal_0 = last_1_var_1_1; VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, stepLocal_0=-5, var_1_11=8, var_1_12=2147483647, var_1_1=-5, var_1_4=1, var_1_5=256, var_1_6=32767, var_1_7=59/10] [L38] COND TRUE \read(var_1_4) [L39] var_1_5 = last_1_var_1_1 VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, stepLocal_0=-5, var_1_11=8, var_1_12=2147483647, var_1_1=-5, var_1_4=1, var_1_5=-5, var_1_6=32767, var_1_7=59/10] [L45] COND TRUE var_1_5 == var_1_5 [L46] var_1_1 = (var_1_5 + -16) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, stepLocal_0=-5, var_1_11=8, var_1_12=2147483647, var_1_1=-21, var_1_4=1, var_1_5=-5, var_1_6=32767, var_1_7=59/10] [L52] EXPR var_1_5 & last_1_var_1_11 VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, stepLocal_0=-5, var_1_11=8, var_1_12=2147483647, var_1_1=-21, var_1_4=1, var_1_5=-5, var_1_6=32767, var_1_7=59/10] [L52] COND TRUE last_1_var_1_11 >= (var_1_5 & last_1_var_1_11) [L53] var_1_11 = ((((((((((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) < (var_1_6)) ? (((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) : (var_1_6)))) < ((var_1_12 - last_1_var_1_11))) ? (((((((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) < (var_1_6)) ? (((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) : (var_1_6)))) : ((var_1_12 - last_1_var_1_11)))) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, stepLocal_0=-5, var_1_11=8, var_1_12=2147483647, var_1_1=-21, var_1_4=1, var_1_5=-5, var_1_6=32767, var_1_7=59/10] [L61] COND TRUE var_1_1 < var_1_5 [L62] var_1_7 = (((10.25f + var_1_8) + var_1_9) + var_1_10) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, stepLocal_0=-5, var_1_11=8, var_1_12=2147483647, var_1_1=-21, var_1_4=1, var_1_5=-5, var_1_6=32767] [L96] RET step() [L97] CALL, EXPR property() [L87] EXPR ((((var_1_5 == var_1_5) ? (var_1_1 == ((signed short int) (var_1_5 + -16))) : (var_1_4 ? (var_1_1 == ((signed short int) var_1_5)) : 1)) && (var_1_4 ? (var_1_5 == ((unsigned short int) last_1_var_1_1)) : ((last_1_var_1_1 <= last_1_var_1_1) ? (var_1_5 == ((unsigned short int) ((((last_1_var_1_11) > ((var_1_6 - 8))) ? (last_1_var_1_11) : ((var_1_6 - 8)))))) : 1))) && ((var_1_1 < var_1_5) ? (var_1_7 == ((float) (((10.25f + var_1_8) + var_1_9) + var_1_10))) : 1)) && ((last_1_var_1_11 >= (var_1_5 & last_1_var_1_11)) ? (var_1_11 == ((unsigned long int) ((((((((((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) < (var_1_6)) ? (((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) : (var_1_6)))) < ((var_1_12 - last_1_var_1_11))) ? (((((((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) < (var_1_6)) ? (((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) : (var_1_6)))) : ((var_1_12 - last_1_var_1_11)))))) : ((5.7 < var_1_9) ? (var_1_11 == ((unsigned long int) last_1_var_1_11)) : (var_1_11 == ((unsigned long int) last_1_var_1_11)))) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_11=8, var_1_12=2147483647, var_1_1=-21, var_1_4=1, var_1_5=-5, var_1_6=32767] [L87-L88] return ((((var_1_5 == var_1_5) ? (var_1_1 == ((signed short int) (var_1_5 + -16))) : (var_1_4 ? (var_1_1 == ((signed short int) var_1_5)) : 1)) && (var_1_4 ? (var_1_5 == ((unsigned short int) last_1_var_1_1)) : ((last_1_var_1_1 <= last_1_var_1_1) ? (var_1_5 == ((unsigned short int) ((((last_1_var_1_11) > ((var_1_6 - 8))) ? (last_1_var_1_11) : ((var_1_6 - 8)))))) : 1))) && ((var_1_1 < var_1_5) ? (var_1_7 == ((float) (((10.25f + var_1_8) + var_1_9) + var_1_10))) : 1)) && ((last_1_var_1_11 >= (var_1_5 & last_1_var_1_11)) ? (var_1_11 == ((unsigned long int) ((((((((((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) < (var_1_6)) ? (((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) : (var_1_6)))) < ((var_1_12 - last_1_var_1_11))) ? (((((((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) < (var_1_6)) ? (((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) : (var_1_6)))) : ((var_1_12 - last_1_var_1_11)))))) : ((5.7 < var_1_9) ? (var_1_11 == ((unsigned long int) last_1_var_1_11)) : (var_1_11 == ((unsigned long int) last_1_var_1_11)))) ; [L97] RET, EXPR property() [L97] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_11=8, var_1_12=2147483647, var_1_1=-21, var_1_4=1, var_1_5=-5, var_1_6=32767] [L19] reach_error() VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_11=8, var_1_12=2147483647, var_1_1=-21, var_1_4=1, var_1_5=-5, var_1_6=32767] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 50 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.5s, OverallIterations: 6, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 576 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 576 mSDsluCounter, 939 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 605 mSDsCounter, 188 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 635 IncrementalHoareTripleChecker+Invalid, 823 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 188 mSolverCounterUnsat, 334 mSDtfsCounter, 635 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 142 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=236occurred in iteration=4, InterpolantAutomatonStates: 31, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 5 MinimizatonAttempts, 243 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 407 NumberOfCodeBlocks, 407 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 333 ConstructedInterpolants, 0 QuantifiedInterpolants, 1566 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 720/720 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:52:34,573 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d2adae5-20ee-48a8-95d5-1346568ce139/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_0d2adae5-20ee-48a8-95d5-1346568ce139/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d2adae5-20ee-48a8-95d5-1346568ce139/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_0d2adae5-20ee-48a8-95d5-1346568ce139/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d2adae5-20ee-48a8-95d5-1346568ce139/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-22.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d2adae5-20ee-48a8-95d5-1346568ce139/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_0d2adae5-20ee-48a8-95d5-1346568ce139/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 51f41c82328a7c1c95cfe78feec09676aa10ab705ad15ff75bf75be08682960b --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 14:52:37,232 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 14:52:37,363 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d2adae5-20ee-48a8-95d5-1346568ce139/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-13 14:52:37,378 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 14:52:37,378 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 14:52:37,401 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 14:52:37,401 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 14:52:37,402 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 14:52:37,402 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 14:52:37,402 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 14:52:37,402 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 14:52:37,403 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 14:52:37,403 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 14:52:37,403 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 14:52:37,403 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 14:52:37,403 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 14:52:37,404 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 14:52:37,404 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 14:52:37,404 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 14:52:37,404 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 14:52:37,404 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 14:52:37,404 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 14:52:37,404 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 14:52:37,404 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-13 14:52:37,405 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-13 14:52:37,409 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 14:52:37,409 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-13 14:52:37,409 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 14:52:37,409 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 14:52:37,409 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 14:52:37,409 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 14:52:37,410 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 14:52:37,410 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 14:52:37,410 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 14:52:37,410 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 14:52:37,410 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 14:52:37,410 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 14:52:37,410 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 14:52:37,410 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-13 14:52:37,410 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-13 14:52:37,411 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 14:52:37,411 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 14:52:37,411 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 14:52:37,411 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 14:52:37,411 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_0d2adae5-20ee-48a8-95d5-1346568ce139/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 -> 51f41c82328a7c1c95cfe78feec09676aa10ab705ad15ff75bf75be08682960b [2024-11-13 14:52:37,708 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 14:52:37,721 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 14:52:37,724 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 14:52:37,725 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 14:52:37,726 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 14:52:37,730 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d2adae5-20ee-48a8-95d5-1346568ce139/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-22.i Unable to find full path for "g++" [2024-11-13 14:52:39,728 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 14:52:40,019 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 14:52:40,020 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d2adae5-20ee-48a8-95d5-1346568ce139/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-22.i [2024-11-13 14:52:40,043 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d2adae5-20ee-48a8-95d5-1346568ce139/bin/uautomizer-verify-qhAvR1uOyd/data/6678f71f3/6432ca236f634fdca78ada06ff4bbd9c/FLAG68a3512a6 [2024-11-13 14:52:40,069 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d2adae5-20ee-48a8-95d5-1346568ce139/bin/uautomizer-verify-qhAvR1uOyd/data/6678f71f3/6432ca236f634fdca78ada06ff4bbd9c [2024-11-13 14:52:40,071 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 14:52:40,074 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 14:52:40,076 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 14:52:40,076 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 14:52:40,082 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 14:52:40,083 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 02:52:40" (1/1) ... [2024-11-13 14:52:40,086 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75085a0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:52:40, skipping insertion in model container [2024-11-13 14:52:40,086 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 02:52:40" (1/1) ... [2024-11-13 14:52:40,110 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 14:52:40,294 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_0d2adae5-20ee-48a8-95d5-1346568ce139/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-22.i[913,926] [2024-11-13 14:52:40,376 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 14:52:40,397 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 14:52:40,409 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_0d2adae5-20ee-48a8-95d5-1346568ce139/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-22.i[913,926] [2024-11-13 14:52:40,447 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 14:52:40,465 INFO L204 MainTranslator]: Completed translation [2024-11-13 14:52:40,466 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:52:40 WrapperNode [2024-11-13 14:52:40,466 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 14:52:40,467 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 14:52:40,468 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 14:52:40,468 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 14:52:40,478 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:52:40" (1/1) ... [2024-11-13 14:52:40,494 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:52:40" (1/1) ... [2024-11-13 14:52:40,519 INFO L138 Inliner]: procedures = 27, calls = 22, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 90 [2024-11-13 14:52:40,519 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 14:52:40,520 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 14:52:40,520 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 14:52:40,520 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 14:52:40,533 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:52:40" (1/1) ... [2024-11-13 14:52:40,534 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:52:40" (1/1) ... [2024-11-13 14:52:40,537 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:52:40" (1/1) ... [2024-11-13 14:52:40,550 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-13 14:52:40,550 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:52:40" (1/1) ... [2024-11-13 14:52:40,551 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:52:40" (1/1) ... [2024-11-13 14:52:40,563 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:52:40" (1/1) ... [2024-11-13 14:52:40,566 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:52:40" (1/1) ... [2024-11-13 14:52:40,568 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:52:40" (1/1) ... [2024-11-13 14:52:40,574 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:52:40" (1/1) ... [2024-11-13 14:52:40,576 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 14:52:40,580 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 14:52:40,580 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 14:52:40,581 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 14:52:40,582 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:52:40" (1/1) ... [2024-11-13 14:52:40,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 14:52:40,604 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d2adae5-20ee-48a8-95d5-1346568ce139/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:52:40,617 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d2adae5-20ee-48a8-95d5-1346568ce139/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:52:40,621 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d2adae5-20ee-48a8-95d5-1346568ce139/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:52:40,648 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 14:52:40,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-13 14:52:40,648 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-13 14:52:40,648 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-13 14:52:40,648 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 14:52:40,648 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 14:52:40,733 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 14:52:40,735 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 14:52:42,469 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-13 14:52:42,469 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 14:52:42,480 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 14:52:42,480 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 14:52:42,480 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:52:42 BoogieIcfgContainer [2024-11-13 14:52:42,481 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 14:52:42,484 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 14:52:42,484 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 14:52:42,490 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 14:52:42,490 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 02:52:40" (1/3) ... [2024-11-13 14:52:42,491 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@579e0cc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 02:52:42, skipping insertion in model container [2024-11-13 14:52:42,491 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:52:40" (2/3) ... [2024-11-13 14:52:42,491 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@579e0cc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 02:52:42, skipping insertion in model container [2024-11-13 14:52:42,491 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:52:42" (3/3) ... [2024-11-13 14:52:42,493 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-22.i [2024-11-13 14:52:42,511 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 14:52:42,513 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_normal_file-22.i that has 2 procedures, 41 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-13 14:52:42,570 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 14:52:42,585 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;@609bdc05, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 14:52:42,585 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-13 14:52:42,589 INFO L276 IsEmpty]: Start isEmpty. Operand has 41 states, 29 states have (on average 1.4137931034482758) internal successors, (41), 30 states have internal predecessors, (41), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-13 14:52:42,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-13 14:52:42,598 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:52:42,599 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:42,599 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:52:42,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:52:42,605 INFO L85 PathProgramCache]: Analyzing trace with hash -1365300128, now seen corresponding path program 1 times [2024-11-13 14:52:42,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:52:42,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1778913677] [2024-11-13 14:52:42,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:52:42,626 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:52:42,627 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d2adae5-20ee-48a8-95d5-1346568ce139/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:52:42,633 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d2adae5-20ee-48a8-95d5-1346568ce139/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:52:42,636 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d2adae5-20ee-48a8-95d5-1346568ce139/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:52:43,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:43,151 INFO L255 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-13 14:52:43,170 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:53:34,350 WARN L286 SmtUtils]: Spent 12.80s on a formula simplification that was a NOOP. DAG size: 102 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)