./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 c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-22.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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.2.5-?-c7c6ca5-m [2024-11-09 01:17:49,929 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 01:17:49,993 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 01:17:50,000 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 01:17:50,002 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 01:17:50,033 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 01:17:50,034 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 01:17:50,035 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 01:17:50,035 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 01:17:50,036 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 01:17:50,037 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 01:17:50,038 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 01:17:50,038 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 01:17:50,039 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 01:17:50,039 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 01:17:50,040 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 01:17:50,040 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 01:17:50,041 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 01:17:50,041 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 01:17:50,041 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 01:17:50,042 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 01:17:50,042 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 01:17:50,043 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 01:17:50,043 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 01:17:50,043 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 01:17:50,044 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 01:17:50,044 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 01:17:50,044 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 01:17:50,045 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 01:17:50,045 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 01:17:50,045 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 01:17:50,046 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 01:17:50,046 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 01:17:50,046 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 01:17:50,046 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 01:17:50,047 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 01:17:50,047 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 01:17:50,047 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 01:17:50,047 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 01:17:50,048 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 01:17:50,048 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 01:17:50,048 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 01:17:50,049 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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-09 01:17:50,297 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 01:17:50,325 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 01:17:50,329 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 01:17:50,330 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 01:17:50,331 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 01:17:50,333 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-22.i [2024-11-09 01:17:51,882 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 01:17:52,102 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 01:17:52,103 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-22.i [2024-11-09 01:17:52,116 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e7c6179f0/3075894a5d724126965025edb3e6e27d/FLAG986c373fe [2024-11-09 01:17:52,130 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e7c6179f0/3075894a5d724126965025edb3e6e27d [2024-11-09 01:17:52,133 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 01:17:52,135 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 01:17:52,137 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 01:17:52,137 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 01:17:52,143 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 01:17:52,144 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:17:52" (1/1) ... [2024-11-09 01:17:52,147 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50a1c95d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:17:52, skipping insertion in model container [2024-11-09 01:17:52,148 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:17:52" (1/1) ... [2024-11-09 01:17:52,175 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 01:17:52,372 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-22.i[913,926] [2024-11-09 01:17:52,425 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:17:52,434 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 01:17:52,444 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-22.i[913,926] [2024-11-09 01:17:52,465 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:17:52,484 INFO L204 MainTranslator]: Completed translation [2024-11-09 01:17:52,485 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:17:52 WrapperNode [2024-11-09 01:17:52,485 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 01:17:52,486 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 01:17:52,486 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 01:17:52,486 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 01:17:52,495 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:17:52" (1/1) ... [2024-11-09 01:17:52,506 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:17:52" (1/1) ... [2024-11-09 01:17:52,556 INFO L138 Inliner]: procedures = 26, calls = 22, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 114 [2024-11-09 01:17:52,561 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 01:17:52,562 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 01:17:52,562 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 01:17:52,562 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 01:17:52,573 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:17:52" (1/1) ... [2024-11-09 01:17:52,574 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:17:52" (1/1) ... [2024-11-09 01:17:52,576 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:17:52" (1/1) ... [2024-11-09 01:17:52,598 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-09 01:17:52,599 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:17:52" (1/1) ... [2024-11-09 01:17:52,599 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:17:52" (1/1) ... [2024-11-09 01:17:52,609 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:17:52" (1/1) ... [2024-11-09 01:17:52,615 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:17:52" (1/1) ... [2024-11-09 01:17:52,621 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:17:52" (1/1) ... [2024-11-09 01:17:52,622 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:17:52" (1/1) ... [2024-11-09 01:17:52,629 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 01:17:52,630 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 01:17:52,633 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 01:17:52,633 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 01:17:52,634 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:17:52" (1/1) ... [2024-11-09 01:17:52,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 01:17:52,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 01:17:52,679 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 01:17:52,683 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 01:17:52,725 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 01:17:52,725 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 01:17:52,725 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 01:17:52,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 01:17:52,725 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 01:17:52,725 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 01:17:52,792 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 01:17:52,794 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 01:17:53,133 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-09 01:17:53,133 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 01:17:53,151 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 01:17:53,152 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 01:17:53,153 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:17:53 BoogieIcfgContainer [2024-11-09 01:17:53,153 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 01:17:53,156 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 01:17:53,157 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 01:17:53,161 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 01:17:53,161 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 01:17:52" (1/3) ... [2024-11-09 01:17:53,162 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@506578ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:17:53, skipping insertion in model container [2024-11-09 01:17:53,162 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:17:52" (2/3) ... [2024-11-09 01:17:53,163 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@506578ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:17:53, skipping insertion in model container [2024-11-09 01:17:53,163 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:17:53" (3/3) ... [2024-11-09 01:17:53,164 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-22.i [2024-11-09 01:17:53,179 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 01:17:53,179 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 01:17:53,231 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 01:17:53,237 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;@2114383d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 01:17:53,237 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 01:17:53,242 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-09 01:17:53,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-09 01:17:53,252 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:17:53,253 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-09 01:17:53,253 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:17:53,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:17:53,259 INFO L85 PathProgramCache]: Analyzing trace with hash -1292848247, now seen corresponding path program 1 times [2024-11-09 01:17:53,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:17:53,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145582966] [2024-11-09 01:17:53,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:17:53,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:17:53,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:17:54,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:17:54,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:17:54,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 01:17:54,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:17:54,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 01:17:54,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:17:54,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 01:17:54,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:17:54,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 01:17:54,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:17:54,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 01:17:54,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:17:54,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-09 01:17:54,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:17:54,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-09 01:17:54,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:17:54,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:17:54,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:17:54,333 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-09 01:17:54,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:17:54,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145582966] [2024-11-09 01:17:54,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145582966] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:17:54,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:17:54,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 01:17:54,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755148908] [2024-11-09 01:17:54,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:17:54,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 01:17:54,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:17:54,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 01:17:54,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:17:54,366 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-09 01:17:54,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:17:54,753 INFO L93 Difference]: Finished difference Result 197 states and 330 transitions. [2024-11-09 01:17:54,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 01:17:54,756 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-09 01:17:54,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:17:54,766 INFO L225 Difference]: With dead ends: 197 [2024-11-09 01:17:54,766 INFO L226 Difference]: Without dead ends: 150 [2024-11-09 01:17:54,770 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-09 01:17:54,773 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 203 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.3s IncrementalHoareTripleChecker+Time [2024-11-09 01:17:54,774 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.3s Time] [2024-11-09 01:17:54,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2024-11-09 01:17:54,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 107. [2024-11-09 01:17:54,827 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-09 01:17:54,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 152 transitions. [2024-11-09 01:17:54,832 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 152 transitions. Word has length 67 [2024-11-09 01:17:54,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:17:54,833 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 152 transitions. [2024-11-09 01:17:54,833 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-09 01:17:54,833 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 152 transitions. [2024-11-09 01:17:54,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-09 01:17:54,836 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:17:54,836 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-09 01:17:54,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 01:17:54,837 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:17:54,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:17:54,838 INFO L85 PathProgramCache]: Analyzing trace with hash 1227111687, now seen corresponding path program 1 times [2024-11-09 01:17:54,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:17:54,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745841913] [2024-11-09 01:17:54,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:17:54,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:17:54,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:17:55,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:17:55,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:17:55,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 01:17:55,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:17:55,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 01:17:55,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:17:55,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 01:17:55,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:17:55,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 01:17:55,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:17:55,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 01:17:55,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:17:55,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-09 01:17:55,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:17:55,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-09 01:17:55,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:17:55,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:17:55,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:17:55,254 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-09 01:17:55,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:17:55,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745841913] [2024-11-09 01:17:55,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745841913] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:17:55,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:17:55,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 01:17:55,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983458460] [2024-11-09 01:17:55,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:17:55,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 01:17:55,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:17:55,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 01:17:55,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:17:55,261 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-09 01:17:55,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:17:55,521 INFO L93 Difference]: Finished difference Result 230 states and 327 transitions. [2024-11-09 01:17:55,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 01:17:55,522 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-09 01:17:55,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:17:55,525 INFO L225 Difference]: With dead ends: 230 [2024-11-09 01:17:55,525 INFO L226 Difference]: Without dead ends: 148 [2024-11-09 01:17:55,526 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-09 01:17:55,527 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 97 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.2s IncrementalHoareTripleChecker+Time [2024-11-09 01:17:55,528 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.2s Time] [2024-11-09 01:17:55,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2024-11-09 01:17:55,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 117. [2024-11-09 01:17:55,557 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-09 01:17:55,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 166 transitions. [2024-11-09 01:17:55,559 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 166 transitions. Word has length 67 [2024-11-09 01:17:55,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:17:55,560 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 166 transitions. [2024-11-09 01:17:55,560 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-09 01:17:55,561 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 166 transitions. [2024-11-09 01:17:55,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-09 01:17:55,562 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:17:55,562 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-09 01:17:55,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 01:17:55,563 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:17:55,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:17:55,564 INFO L85 PathProgramCache]: Analyzing trace with hash 1291650166, now seen corresponding path program 1 times [2024-11-09 01:17:55,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:17:55,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910795899] [2024-11-09 01:17:55,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:17:55,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:17:55,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:17:55,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:17:55,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:17:55,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 01:17:55,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:17:55,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 01:17:55,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:17:55,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 01:17:55,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:17:55,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 01:17:55,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:17:55,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 01:17:55,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:17:55,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-09 01:17:55,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:17:55,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-09 01:17:55,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:17:55,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:17:55,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:17:55,872 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-09 01:17:55,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:17:55,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910795899] [2024-11-09 01:17:55,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910795899] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:17:55,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:17:55,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 01:17:55,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755248805] [2024-11-09 01:17:55,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:17:55,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 01:17:55,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:17:55,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 01:17:55,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:17:55,876 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-09 01:17:56,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:17:56,110 INFO L93 Difference]: Finished difference Result 236 states and 334 transitions. [2024-11-09 01:17:56,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 01:17:56,111 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-09 01:17:56,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:17:56,114 INFO L225 Difference]: With dead ends: 236 [2024-11-09 01:17:56,115 INFO L226 Difference]: Without dead ends: 148 [2024-11-09 01:17:56,116 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-09 01:17:56,119 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 75 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-09 01:17:56,120 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-09 01:17:56,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2024-11-09 01:17:56,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 118. [2024-11-09 01:17:56,141 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-09 01:17:56,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 166 transitions. [2024-11-09 01:17:56,143 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 166 transitions. Word has length 68 [2024-11-09 01:17:56,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:17:56,143 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 166 transitions. [2024-11-09 01:17:56,143 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-09 01:17:56,144 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 166 transitions. [2024-11-09 01:17:56,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-09 01:17:56,145 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:17:56,145 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-09 01:17:56,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 01:17:56,146 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:17:56,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:17:56,146 INFO L85 PathProgramCache]: Analyzing trace with hash -71324776, now seen corresponding path program 1 times [2024-11-09 01:17:56,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:17:56,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077442044] [2024-11-09 01:17:56,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:17:56,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:17:56,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:17:57,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:17:57,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:17:57,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 01:17:57,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:17:57,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 01:17:57,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:17:57,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 01:17:57,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:17:57,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 01:17:57,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:17:57,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 01:17:57,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:17:57,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-09 01:17:57,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:17:57,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-09 01:17:57,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:17:57,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:17:57,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:17:57,094 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-09 01:17:57,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:17:57,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077442044] [2024-11-09 01:17:57,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077442044] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:17:57,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:17:57,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 01:17:57,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524634682] [2024-11-09 01:17:57,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:17:57,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 01:17:57,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:17:57,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 01:17:57,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-09 01:17:57,098 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-09 01:17:57,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:17:57,780 INFO L93 Difference]: Finished difference Result 351 states and 486 transitions. [2024-11-09 01:17:57,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 01:17:57,781 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-09 01:17:57,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:17:57,784 INFO L225 Difference]: With dead ends: 351 [2024-11-09 01:17:57,785 INFO L226 Difference]: Without dead ends: 309 [2024-11-09 01:17:57,786 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2024-11-09 01:17:57,789 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 188 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.4s IncrementalHoareTripleChecker+Time [2024-11-09 01:17:57,790 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.4s Time] [2024-11-09 01:17:57,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2024-11-09 01:17:57,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 236. [2024-11-09 01:17:57,828 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-09 01:17:57,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 334 transitions. [2024-11-09 01:17:57,831 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 334 transitions. Word has length 68 [2024-11-09 01:17:57,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:17:57,831 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 334 transitions. [2024-11-09 01:17:57,831 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-09 01:17:57,832 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 334 transitions. [2024-11-09 01:17:57,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-09 01:17:57,833 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:17:57,833 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-09 01:17:57,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 01:17:57,834 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:17:57,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:17:57,834 INFO L85 PathProgramCache]: Analyzing trace with hash 629739802, now seen corresponding path program 1 times [2024-11-09 01:17:57,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:17:57,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312853228] [2024-11-09 01:17:57,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:17:57,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:17:57,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:17:57,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:17:57,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:17:57,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 01:17:57,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:17:57,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 01:17:57,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:17:57,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 01:17:57,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:17:57,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 01:17:57,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:17:57,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 01:17:57,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:17:57,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-09 01:17:57,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:17:57,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-09 01:17:57,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:17:57,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:17:57,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:17:57,893 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-09 01:17:57,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:17:57,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312853228] [2024-11-09 01:17:57,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312853228] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:17:57,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:17:57,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 01:17:57,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999560256] [2024-11-09 01:17:57,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:17:57,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 01:17:57,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:17:57,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 01:17:57,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 01:17:57,896 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-09 01:17:57,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:17:57,926 INFO L93 Difference]: Finished difference Result 417 states and 591 transitions. [2024-11-09 01:17:57,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 01:17:57,927 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-09 01:17:57,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:17:57,931 INFO L225 Difference]: With dead ends: 417 [2024-11-09 01:17:57,931 INFO L226 Difference]: Without dead ends: 222 [2024-11-09 01:17:57,933 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-09 01:17:57,934 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-09 01:17:57,936 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-09 01:17:57,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2024-11-09 01:17:57,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 156. [2024-11-09 01:17:57,964 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-09 01:17:57,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 216 transitions. [2024-11-09 01:17:57,967 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 216 transitions. Word has length 68 [2024-11-09 01:17:57,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:17:57,967 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 216 transitions. [2024-11-09 01:17:57,967 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-09 01:17:57,968 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 216 transitions. [2024-11-09 01:17:57,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-09 01:17:57,971 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:17:57,972 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-09 01:17:57,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 01:17:57,972 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:17:57,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:17:57,973 INFO L85 PathProgramCache]: Analyzing trace with hash -2130020374, now seen corresponding path program 1 times [2024-11-09 01:17:57,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:17:57,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905675900] [2024-11-09 01:17:57,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:17:57,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:17:58,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 01:17:58,034 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 01:17:58,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 01:17:58,119 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 01:17:58,119 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 01:17:58,120 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 01:17:58,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 01:17:58,125 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-09 01:17:58,183 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 01:17:58,186 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 01:17:58 BoogieIcfgContainer [2024-11-09 01:17:58,186 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 01:17:58,187 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 01:17:58,187 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 01:17:58,187 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 01:17:58,190 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:17:53" (3/4) ... [2024-11-09 01:17:58,192 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 01:17:58,193 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 01:17:58,194 INFO L158 Benchmark]: Toolchain (without parser) took 6059.36ms. Allocated memory was 146.8MB in the beginning and 226.5MB in the end (delta: 79.7MB). Free memory was 73.7MB in the beginning and 177.7MB in the end (delta: -104.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 01:17:58,195 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 146.8MB. Free memory is still 98.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 01:17:58,195 INFO L158 Benchmark]: CACSL2BoogieTranslator took 348.33ms. Allocated memory was 146.8MB in the beginning and 188.7MB in the end (delta: 41.9MB). Free memory was 73.5MB in the beginning and 156.4MB in the end (delta: -82.9MB). Peak memory consumption was 14.0MB. Max. memory is 16.1GB. [2024-11-09 01:17:58,195 INFO L158 Benchmark]: Boogie Procedure Inliner took 74.95ms. Allocated memory is still 188.7MB. Free memory was 156.4MB in the beginning and 153.3MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 01:17:58,196 INFO L158 Benchmark]: Boogie Preprocessor took 67.47ms. Allocated memory is still 188.7MB. Free memory was 153.3MB in the beginning and 150.1MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 01:17:58,196 INFO L158 Benchmark]: RCFGBuilder took 523.07ms. Allocated memory is still 188.7MB. Free memory was 150.1MB in the beginning and 130.2MB in the end (delta: 19.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-09 01:17:58,196 INFO L158 Benchmark]: TraceAbstraction took 5030.27ms. Allocated memory was 188.7MB in the beginning and 226.5MB in the end (delta: 37.7MB). Free memory was 130.2MB in the beginning and 177.7MB in the end (delta: -47.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 01:17:58,197 INFO L158 Benchmark]: Witness Printer took 6.85ms. Allocated memory is still 226.5MB. Free memory is still 177.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 01:17:58,198 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.23ms. Allocated memory is still 146.8MB. Free memory is still 98.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 348.33ms. Allocated memory was 146.8MB in the beginning and 188.7MB in the end (delta: 41.9MB). Free memory was 73.5MB in the beginning and 156.4MB in the end (delta: -82.9MB). Peak memory consumption was 14.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 74.95ms. Allocated memory is still 188.7MB. Free memory was 156.4MB in the beginning and 153.3MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 67.47ms. Allocated memory is still 188.7MB. Free memory was 153.3MB in the beginning and 150.1MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 523.07ms. Allocated memory is still 188.7MB. Free memory was 150.1MB in the beginning and 130.2MB in the end (delta: 19.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 5030.27ms. Allocated memory was 188.7MB in the beginning and 226.5MB in the end (delta: 37.7MB). Free memory was 130.2MB in the beginning and 177.7MB in the end (delta: -47.5MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 6.85ms. Allocated memory is still 226.5MB. Free memory is still 177.7MB. 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 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: 4.9s, OverallIterations: 6, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 576 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 576 mSDsluCounter, 939 SdHoareTripleChecker+Invalid, 0.9s 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.6s 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, 2.5s 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-09 01:17:58,232 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-22.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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.2.5-?-c7c6ca5-m [2024-11-09 01:18:00,454 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 01:18:00,546 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-09 01:18:00,553 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 01:18:00,554 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 01:18:00,577 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 01:18:00,578 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 01:18:00,578 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 01:18:00,579 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 01:18:00,579 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 01:18:00,579 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 01:18:00,580 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 01:18:00,580 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 01:18:00,580 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 01:18:00,581 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 01:18:00,581 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 01:18:00,581 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 01:18:00,582 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 01:18:00,582 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 01:18:00,586 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 01:18:00,587 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 01:18:00,587 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 01:18:00,587 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 01:18:00,588 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 01:18:00,589 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 01:18:00,592 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 01:18:00,592 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 01:18:00,592 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 01:18:00,592 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 01:18:00,593 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 01:18:00,593 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 01:18:00,593 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 01:18:00,593 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 01:18:00,594 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 01:18:00,594 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 01:18:00,594 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 01:18:00,594 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 01:18:00,595 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 01:18:00,595 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 01:18:00,596 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 01:18:00,596 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 01:18:00,596 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 01:18:00,597 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 01:18:00,597 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 01:18:00,597 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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-09 01:18:00,930 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 01:18:00,954 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 01:18:00,957 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 01:18:00,959 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 01:18:00,960 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 01:18:00,962 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-22.i [2024-11-09 01:18:02,571 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 01:18:02,790 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 01:18:02,790 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-22.i [2024-11-09 01:18:02,798 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/802b528da/2051305e5dcf46f0a3d0dd33bee25f8c/FLAG9ad596b04 [2024-11-09 01:18:02,811 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/802b528da/2051305e5dcf46f0a3d0dd33bee25f8c [2024-11-09 01:18:02,813 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 01:18:02,814 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 01:18:02,815 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 01:18:02,815 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 01:18:02,821 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 01:18:02,821 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:18:02" (1/1) ... [2024-11-09 01:18:02,822 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72238770 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:18:02, skipping insertion in model container [2024-11-09 01:18:02,823 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:18:02" (1/1) ... [2024-11-09 01:18:02,851 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 01:18:03,037 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-22.i[913,926] [2024-11-09 01:18:03,097 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:18:03,119 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 01:18:03,145 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-22.i[913,926] [2024-11-09 01:18:03,179 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:18:03,204 INFO L204 MainTranslator]: Completed translation [2024-11-09 01:18:03,204 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:18:03 WrapperNode [2024-11-09 01:18:03,204 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 01:18:03,206 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 01:18:03,206 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 01:18:03,207 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 01:18:03,213 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:18:03" (1/1) ... [2024-11-09 01:18:03,231 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:18:03" (1/1) ... [2024-11-09 01:18:03,265 INFO L138 Inliner]: procedures = 27, calls = 22, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 91 [2024-11-09 01:18:03,268 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 01:18:03,269 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 01:18:03,269 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 01:18:03,269 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 01:18:03,283 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:18:03" (1/1) ... [2024-11-09 01:18:03,284 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:18:03" (1/1) ... [2024-11-09 01:18:03,287 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:18:03" (1/1) ... [2024-11-09 01:18:03,305 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-09 01:18:03,305 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:18:03" (1/1) ... [2024-11-09 01:18:03,306 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:18:03" (1/1) ... [2024-11-09 01:18:03,318 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:18:03" (1/1) ... [2024-11-09 01:18:03,322 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:18:03" (1/1) ... [2024-11-09 01:18:03,327 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:18:03" (1/1) ... [2024-11-09 01:18:03,330 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:18:03" (1/1) ... [2024-11-09 01:18:03,336 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 01:18:03,338 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 01:18:03,338 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 01:18:03,338 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 01:18:03,339 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:18:03" (1/1) ... [2024-11-09 01:18:03,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 01:18:03,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 01:18:03,373 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 01:18:03,377 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 01:18:03,420 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 01:18:03,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-09 01:18:03,421 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 01:18:03,421 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 01:18:03,421 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 01:18:03,423 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 01:18:03,522 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 01:18:03,526 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 01:18:04,826 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-09 01:18:04,827 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 01:18:04,841 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 01:18:04,842 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 01:18:04,846 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:18:04 BoogieIcfgContainer [2024-11-09 01:18:04,846 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 01:18:04,848 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 01:18:04,848 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 01:18:04,851 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 01:18:04,851 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 01:18:02" (1/3) ... [2024-11-09 01:18:04,852 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@271a707 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:18:04, skipping insertion in model container [2024-11-09 01:18:04,852 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:18:03" (2/3) ... [2024-11-09 01:18:04,852 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@271a707 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:18:04, skipping insertion in model container [2024-11-09 01:18:04,853 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:18:04" (3/3) ... [2024-11-09 01:18:04,854 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-22.i [2024-11-09 01:18:04,870 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 01:18:04,870 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 01:18:04,925 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 01:18:04,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;@5c71e29a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 01:18:04,932 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 01:18:04,937 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-09 01:18:04,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-09 01:18:04,951 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:18:04,952 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-09 01:18:04,953 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:18:04,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:18:04,958 INFO L85 PathProgramCache]: Analyzing trace with hash -1139230559, now seen corresponding path program 1 times [2024-11-09 01:18:04,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:18:04,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1932127451] [2024-11-09 01:18:04,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:18:04,970 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-09 01:18:04,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:18:04,973 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-09 01:18:04,974 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-09 01:18:05,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:18:05,315 INFO L255 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-09 01:18:05,327 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:18:48,515 WARN L286 SmtUtils]: Spent 9.63s 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)