./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-68.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-68.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 d607f3879345041e6460d015c785fbf73afb45a0aff70b1106cf7b1382739630 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 04:32:26,830 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 04:32:26,924 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 04:32:26,933 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 04:32:26,933 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 04:32:26,958 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 04:32:26,959 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 04:32:26,959 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 04:32:26,960 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 04:32:26,960 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 04:32:26,961 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 04:32:26,961 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 04:32:26,962 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 04:32:26,962 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 04:32:26,962 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 04:32:26,963 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 04:32:26,963 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 04:32:26,963 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 04:32:26,964 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 04:32:26,964 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 04:32:26,964 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 04:32:26,967 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 04:32:26,967 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 04:32:26,968 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 04:32:26,968 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 04:32:26,968 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 04:32:26,968 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 04:32:26,969 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 04:32:26,969 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 04:32:26,969 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 04:32:26,970 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 04:32:26,970 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 04:32:26,974 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 04:32:26,974 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 04:32:26,975 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 04:32:26,975 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 04:32:26,976 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 04:32:26,976 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 04:32:26,976 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 04:32:26,977 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 04:32:26,977 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 04:32:26,977 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 04:32:26,978 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 -> d607f3879345041e6460d015c785fbf73afb45a0aff70b1106cf7b1382739630 [2024-10-13 04:32:27,260 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 04:32:27,287 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 04:32:27,291 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 04:32:27,292 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 04:32:27,293 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 04:32:27,295 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-68.i [2024-10-13 04:32:28,827 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 04:32:29,056 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 04:32:29,056 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-68.i [2024-10-13 04:32:29,067 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab0573eb6/1e3f7f7b6dc14dc09e4a216f91c743f8/FLAG9a6a67952 [2024-10-13 04:32:29,084 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab0573eb6/1e3f7f7b6dc14dc09e4a216f91c743f8 [2024-10-13 04:32:29,088 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 04:32:29,089 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 04:32:29,092 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 04:32:29,093 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 04:32:29,098 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 04:32:29,099 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 04:32:29" (1/1) ... [2024-10-13 04:32:29,100 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5cf87bf2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:32:29, skipping insertion in model container [2024-10-13 04:32:29,100 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 04:32:29" (1/1) ... [2024-10-13 04:32:29,134 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 04:32:29,320 WARN L248 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_loopvsstraightlinecode_50-1loop_file-68.i[915,928] [2024-10-13 04:32:29,381 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 04:32:29,392 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 04:32:29,404 WARN L248 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_loopvsstraightlinecode_50-1loop_file-68.i[915,928] [2024-10-13 04:32:29,433 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 04:32:29,453 INFO L204 MainTranslator]: Completed translation [2024-10-13 04:32:29,454 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:32:29 WrapperNode [2024-10-13 04:32:29,454 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 04:32:29,455 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 04:32:29,455 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 04:32:29,455 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 04:32:29,463 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:32:29" (1/1) ... [2024-10-13 04:32:29,474 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:32:29" (1/1) ... [2024-10-13 04:32:29,509 INFO L138 Inliner]: procedures = 26, calls = 23, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 138 [2024-10-13 04:32:29,510 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 04:32:29,510 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 04:32:29,510 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 04:32:29,511 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 04:32:29,527 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:32:29" (1/1) ... [2024-10-13 04:32:29,527 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:32:29" (1/1) ... [2024-10-13 04:32:29,530 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:32:29" (1/1) ... [2024-10-13 04:32:29,558 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-10-13 04:32:29,561 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:32:29" (1/1) ... [2024-10-13 04:32:29,561 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:32:29" (1/1) ... [2024-10-13 04:32:29,570 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:32:29" (1/1) ... [2024-10-13 04:32:29,574 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:32:29" (1/1) ... [2024-10-13 04:32:29,576 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:32:29" (1/1) ... [2024-10-13 04:32:29,578 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:32:29" (1/1) ... [2024-10-13 04:32:29,582 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 04:32:29,583 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 04:32:29,583 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 04:32:29,583 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 04:32:29,584 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:32:29" (1/1) ... [2024-10-13 04:32:29,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 04:32:29,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 04:32:29,623 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-10-13 04:32:29,630 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-10-13 04:32:29,682 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 04:32:29,683 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 04:32:29,684 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 04:32:29,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 04:32:29,684 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 04:32:29,684 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 04:32:29,771 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 04:32:29,774 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 04:32:30,187 INFO L? ?]: Removed 27 outVars from TransFormulas that were not future-live. [2024-10-13 04:32:30,188 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 04:32:30,237 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 04:32:30,238 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 04:32:30,239 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:32:30 BoogieIcfgContainer [2024-10-13 04:32:30,239 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 04:32:30,241 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 04:32:30,241 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 04:32:30,245 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 04:32:30,246 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 04:32:29" (1/3) ... [2024-10-13 04:32:30,247 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18a12984 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 04:32:30, skipping insertion in model container [2024-10-13 04:32:30,248 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:32:29" (2/3) ... [2024-10-13 04:32:30,249 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18a12984 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 04:32:30, skipping insertion in model container [2024-10-13 04:32:30,249 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:32:30" (3/3) ... [2024-10-13 04:32:30,250 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-68.i [2024-10-13 04:32:30,268 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 04:32:30,268 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 04:32:30,338 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 04:32:30,346 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;@502df1c6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 04:32:30,347 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 04:32:30,353 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 39 states have (on average 1.5384615384615385) internal successors, (60), 40 states have internal predecessors, (60), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-13 04:32:30,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-13 04:32:30,368 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:32:30,369 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 04:32:30,370 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:32:30,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:32:30,379 INFO L85 PathProgramCache]: Analyzing trace with hash -1899716515, now seen corresponding path program 1 times [2024-10-13 04:32:30,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:32:30,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757901287] [2024-10-13 04:32:30,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:32:30,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:32:30,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:32:30,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:32:30,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:32:30,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 04:32:30,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:32:30,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 04:32:30,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:32:30,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 04:32:30,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:32:30,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 04:32:30,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:32:30,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 04:32:30,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:32:30,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 04:32:30,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:32:30,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 04:32:30,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:32:30,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 04:32:30,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:32:30,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 04:32:30,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:32:30,756 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-10-13 04:32:30,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:32:30,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757901287] [2024-10-13 04:32:30,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757901287] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:32:30,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:32:30,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 04:32:30,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849896955] [2024-10-13 04:32:30,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:32:30,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 04:32:30,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:32:30,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 04:32:30,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 04:32:30,803 INFO L87 Difference]: Start difference. First operand has 52 states, 39 states have (on average 1.5384615384615385) internal successors, (60), 40 states have internal predecessors, (60), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-13 04:32:30,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:32:30,848 INFO L93 Difference]: Finished difference Result 101 states and 167 transitions. [2024-10-13 04:32:30,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 04:32:30,851 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) Word has length 74 [2024-10-13 04:32:30,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:32:30,862 INFO L225 Difference]: With dead ends: 101 [2024-10-13 04:32:30,863 INFO L226 Difference]: Without dead ends: 48 [2024-10-13 04:32:30,867 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 04:32:30,873 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 04:32:30,875 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 68 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 04:32:30,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-10-13 04:32:30,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2024-10-13 04:32:30,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 36 states have internal predecessors, (51), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-13 04:32:30,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 71 transitions. [2024-10-13 04:32:30,922 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 71 transitions. Word has length 74 [2024-10-13 04:32:30,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:32:30,922 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 71 transitions. [2024-10-13 04:32:30,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-13 04:32:30,923 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 71 transitions. [2024-10-13 04:32:30,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-13 04:32:30,926 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:32:30,926 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 04:32:30,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 04:32:30,927 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:32:30,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:32:30,928 INFO L85 PathProgramCache]: Analyzing trace with hash 531190745, now seen corresponding path program 1 times [2024-10-13 04:32:30,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:32:30,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805916400] [2024-10-13 04:32:30,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:32:30,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:32:30,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:32:31,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:32:31,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:32:31,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 04:32:31,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:32:31,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 04:32:31,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:32:31,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 04:32:31,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:32:31,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 04:32:31,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:32:31,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 04:32:31,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:32:31,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 04:32:31,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:32:31,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 04:32:31,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:32:31,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 04:32:31,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:32:31,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 04:32:31,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:32:31,409 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-10-13 04:32:31,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:32:31,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805916400] [2024-10-13 04:32:31,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805916400] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:32:31,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:32:31,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 04:32:31,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917460630] [2024-10-13 04:32:31,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:32:31,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 04:32:31,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:32:31,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 04:32:31,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 04:32:31,417 INFO L87 Difference]: Start difference. First operand 48 states and 71 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-10-13 04:32:31,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:32:31,535 INFO L93 Difference]: Finished difference Result 95 states and 141 transitions. [2024-10-13 04:32:31,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 04:32:31,537 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 74 [2024-10-13 04:32:31,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:32:31,539 INFO L225 Difference]: With dead ends: 95 [2024-10-13 04:32:31,539 INFO L226 Difference]: Without dead ends: 48 [2024-10-13 04:32:31,539 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 04:32:31,542 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 63 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 04:32:31,544 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 93 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 04:32:31,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-10-13 04:32:31,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2024-10-13 04:32:31,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 36 states have (on average 1.3888888888888888) internal successors, (50), 36 states have internal predecessors, (50), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-13 04:32:31,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 70 transitions. [2024-10-13 04:32:31,560 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 70 transitions. Word has length 74 [2024-10-13 04:32:31,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:32:31,563 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 70 transitions. [2024-10-13 04:32:31,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-10-13 04:32:31,564 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 70 transitions. [2024-10-13 04:32:31,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-13 04:32:31,567 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:32:31,567 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 04:32:31,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 04:32:31,569 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:32:31,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:32:31,570 INFO L85 PathProgramCache]: Analyzing trace with hash 345360559, now seen corresponding path program 1 times [2024-10-13 04:32:31,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:32:31,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700177352] [2024-10-13 04:32:31,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:32:31,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:32:31,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:32:32,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:32:32,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:32:32,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 04:32:32,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:32:32,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 04:32:32,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:32:32,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 04:32:32,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:32:32,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 04:32:32,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:32:32,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 04:32:32,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:32:32,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 04:32:32,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:32:32,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 04:32:32,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:32:32,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 04:32:32,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:32:32,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 04:32:32,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:32:32,602 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-10-13 04:32:32,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:32:32,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700177352] [2024-10-13 04:32:32,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700177352] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:32:32,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:32:32,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 04:32:32,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791653147] [2024-10-13 04:32:32,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:32:32,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 04:32:32,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:32:32,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 04:32:32,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-13 04:32:32,609 INFO L87 Difference]: Start difference. First operand 48 states and 70 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-10-13 04:32:33,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:32:33,196 INFO L93 Difference]: Finished difference Result 210 states and 300 transitions. [2024-10-13 04:32:33,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 04:32:33,197 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 75 [2024-10-13 04:32:33,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:32:33,200 INFO L225 Difference]: With dead ends: 210 [2024-10-13 04:32:33,200 INFO L226 Difference]: Without dead ends: 163 [2024-10-13 04:32:33,201 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2024-10-13 04:32:33,205 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 202 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 04:32:33,209 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 371 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 04:32:33,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2024-10-13 04:32:33,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 112. [2024-10-13 04:32:33,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 79 states have (on average 1.2911392405063291) internal successors, (102), 80 states have internal predecessors, (102), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-13 04:32:33,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 158 transitions. [2024-10-13 04:32:33,244 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 158 transitions. Word has length 75 [2024-10-13 04:32:33,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:32:33,245 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 158 transitions. [2024-10-13 04:32:33,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-10-13 04:32:33,245 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 158 transitions. [2024-10-13 04:32:33,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-13 04:32:33,248 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:32:33,248 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 04:32:33,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 04:32:33,249 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:32:33,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:32:33,250 INFO L85 PathProgramCache]: Analyzing trace with hash 215618304, now seen corresponding path program 1 times [2024-10-13 04:32:33,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:32:33,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42297349] [2024-10-13 04:32:33,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:32:33,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:32:33,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:32:33,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:32:33,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:32:33,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 04:32:33,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:32:33,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 04:32:33,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:32:33,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 04:32:33,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:32:33,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 04:32:33,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:32:33,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 04:32:33,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:32:33,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 04:32:33,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:32:33,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 04:32:33,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:32:33,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 04:32:33,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:32:33,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 04:32:33,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:32:33,660 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-10-13 04:32:33,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:32:33,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42297349] [2024-10-13 04:32:33,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42297349] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:32:33,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:32:33,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 04:32:33,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226870321] [2024-10-13 04:32:33,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:32:33,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 04:32:33,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:32:33,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 04:32:33,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-13 04:32:33,664 INFO L87 Difference]: Start difference. First operand 112 states and 158 transitions. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-10-13 04:32:34,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:32:34,097 INFO L93 Difference]: Finished difference Result 229 states and 324 transitions. [2024-10-13 04:32:34,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 04:32:34,097 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 76 [2024-10-13 04:32:34,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:32:34,101 INFO L225 Difference]: With dead ends: 229 [2024-10-13 04:32:34,101 INFO L226 Difference]: Without dead ends: 182 [2024-10-13 04:32:34,105 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2024-10-13 04:32:34,106 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 191 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 04:32:34,109 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 323 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 04:32:34,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2024-10-13 04:32:34,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 128. [2024-10-13 04:32:34,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 95 states have (on average 1.2947368421052632) internal successors, (123), 96 states have internal predecessors, (123), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-13 04:32:34,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 179 transitions. [2024-10-13 04:32:34,145 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 179 transitions. Word has length 76 [2024-10-13 04:32:34,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:32:34,146 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 179 transitions. [2024-10-13 04:32:34,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-10-13 04:32:34,146 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 179 transitions. [2024-10-13 04:32:34,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-13 04:32:34,147 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:32:34,147 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 04:32:34,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 04:32:34,148 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:32:34,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:32:34,148 INFO L85 PathProgramCache]: Analyzing trace with hash -805450050, now seen corresponding path program 1 times [2024-10-13 04:32:34,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:32:34,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781938240] [2024-10-13 04:32:34,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:32:34,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:32:34,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 04:32:34,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1734560329] [2024-10-13 04:32:34,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:32:34,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 04:32:34,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 04:32:34,223 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 04:32:34,231 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-13 04:32:34,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 04:32:34,498 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 04:32:34,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 04:32:34,599 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 04:32:34,599 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 04:32:34,600 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 04:32:34,620 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-13 04:32:34,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 04:32:34,810 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-10-13 04:32:34,892 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 04:32:34,897 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 04:32:34 BoogieIcfgContainer [2024-10-13 04:32:34,899 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 04:32:34,899 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 04:32:34,900 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 04:32:34,900 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 04:32:34,900 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:32:30" (3/4) ... [2024-10-13 04:32:34,902 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 04:32:34,903 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 04:32:34,904 INFO L158 Benchmark]: Toolchain (without parser) took 5814.32ms. Allocated memory was 138.4MB in the beginning and 205.5MB in the end (delta: 67.1MB). Free memory was 85.0MB in the beginning and 116.5MB in the end (delta: -31.5MB). Peak memory consumption was 35.9MB. Max. memory is 16.1GB. [2024-10-13 04:32:34,904 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 138.4MB. Free memory is still 99.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 04:32:34,904 INFO L158 Benchmark]: CACSL2BoogieTranslator took 361.78ms. Allocated memory is still 138.4MB. Free memory was 85.0MB in the beginning and 69.9MB in the end (delta: 15.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-13 04:32:34,904 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.65ms. Allocated memory is still 138.4MB. Free memory was 69.9MB in the beginning and 66.5MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 04:32:34,905 INFO L158 Benchmark]: Boogie Preprocessor took 71.65ms. Allocated memory is still 138.4MB. Free memory was 66.5MB in the beginning and 61.9MB in the end (delta: 4.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-13 04:32:34,905 INFO L158 Benchmark]: RCFGBuilder took 656.41ms. Allocated memory is still 138.4MB. Free memory was 61.9MB in the beginning and 90.3MB in the end (delta: -28.4MB). Peak memory consumption was 9.0MB. Max. memory is 16.1GB. [2024-10-13 04:32:34,905 INFO L158 Benchmark]: TraceAbstraction took 4658.03ms. Allocated memory was 138.4MB in the beginning and 205.5MB in the end (delta: 67.1MB). Free memory was 89.6MB in the beginning and 117.6MB in the end (delta: -27.9MB). Peak memory consumption was 41.6MB. Max. memory is 16.1GB. [2024-10-13 04:32:34,905 INFO L158 Benchmark]: Witness Printer took 3.84ms. Allocated memory is still 205.5MB. Free memory was 117.6MB in the beginning and 116.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 04:32:34,907 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.17ms. Allocated memory is still 138.4MB. Free memory is still 99.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 361.78ms. Allocated memory is still 138.4MB. Free memory was 85.0MB in the beginning and 69.9MB in the end (delta: 15.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.65ms. Allocated memory is still 138.4MB. Free memory was 69.9MB in the beginning and 66.5MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 71.65ms. Allocated memory is still 138.4MB. Free memory was 66.5MB in the beginning and 61.9MB in the end (delta: 4.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 656.41ms. Allocated memory is still 138.4MB. Free memory was 61.9MB in the beginning and 90.3MB in the end (delta: -28.4MB). Peak memory consumption was 9.0MB. Max. memory is 16.1GB. * TraceAbstraction took 4658.03ms. Allocated memory was 138.4MB in the beginning and 205.5MB in the end (delta: 67.1MB). Free memory was 89.6MB in the beginning and 117.6MB in the end (delta: -27.9MB). Peak memory consumption was 41.6MB. Max. memory is 16.1GB. * Witness Printer took 3.84ms. Allocated memory is still 205.5MB. Free memory was 117.6MB in the beginning and 116.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 114, overapproximation of someBinaryFLOATComparisonOperation at line 114, overapproximation of bitwiseOr at line 114. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] unsigned char var_1_5 = 0; [L24] unsigned char var_1_6 = 0; [L25] unsigned char var_1_7 = 1; [L26] unsigned char var_1_8 = 32; [L27] double var_1_9 = 4.6; [L28] double var_1_10 = 9.25; [L29] double var_1_11 = 1.25; [L30] unsigned char var_1_12 = 100; [L31] unsigned char var_1_13 = 64; [L32] unsigned char var_1_14 = 0; [L33] float var_1_15 = 7.5; [L34] signed long int var_1_16 = 0; [L35] double last_1_var_1_9 = 4.6; [L36] unsigned char last_1_var_1_12 = 100; [L37] unsigned char last_1_var_1_14 = 0; [L38] signed long int last_1_var_1_16 = 0; [L118] isInitial = 1 [L119] FCALL initially() [L120] int k_loop; [L121] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L121] COND TRUE k_loop < 1 [L122] CALL updateLastVariables() [L108] last_1_var_1_9 = var_1_9 [L109] last_1_var_1_12 = var_1_12 [L110] last_1_var_1_14 = var_1_14 [L111] last_1_var_1_16 = var_1_16 [L122] RET updateLastVariables() [L123] CALL updateVariables() [L91] var_1_5 = __VERIFIER_nondet_uchar() [L92] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L92] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L93] CALL assume_abort_if_not(var_1_5 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L93] RET assume_abort_if_not(var_1_5 <= 0) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L94] var_1_7 = __VERIFIER_nondet_uchar() [L95] CALL assume_abort_if_not(var_1_7 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L95] RET assume_abort_if_not(var_1_7 >= 1) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L96] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L96] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L97] var_1_8 = __VERIFIER_nondet_uchar() [L98] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_9=23/5] [L98] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_9=23/5] [L99] CALL assume_abort_if_not(var_1_8 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_9=23/5] [L99] RET assume_abort_if_not(var_1_8 <= 255) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_9=23/5] [L100] CALL assume_abort_if_not(var_1_8 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=101, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=101, var_1_9=23/5] [L100] RET assume_abort_if_not(var_1_8 != 0) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=101, var_1_9=23/5] [L101] var_1_10 = __VERIFIER_nondet_double() [L102] CALL assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=101, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=101, var_1_9=23/5] [L102] RET assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=101, var_1_9=23/5] [L103] var_1_13 = __VERIFIER_nondet_uchar() [L104] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=101, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=101, var_1_9=23/5] [L104] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=101, var_1_9=23/5] [L105] CALL assume_abort_if_not(var_1_13 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=101, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=101, var_1_9=23/5] [L105] RET assume_abort_if_not(var_1_13 <= 254) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=101, var_1_9=23/5] [L123] RET updateVariables() [L124] CALL step() [L42] signed long int stepLocal_4 = last_1_var_1_16; VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=101, var_1_9=23/5] [L43] COND FALSE !(\read(last_1_var_1_14)) [L54] var_1_12 = var_1_13 VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=101, var_1_9=23/5] [L56] var_1_16 = last_1_var_1_12 [L57] unsigned long int stepLocal_6 = var_1_13 % (5u + 256u); [L58] signed long int stepLocal_5 = var_1_13 + 16; VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, stepLocal_5=16, stepLocal_6=0, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=100, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=101, var_1_9=23/5] [L59] COND TRUE stepLocal_6 <= var_1_16 VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, stepLocal_5=16, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=100, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=101, var_1_9=23/5] [L60] COND FALSE !(stepLocal_5 >= var_1_16) [L63] var_1_14 = var_1_7 VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=15/2, var_1_16=100, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=101, var_1_9=23/5] [L66] unsigned char stepLocal_0 = var_1_12; VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_0=0, stepLocal_4=0, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=15/2, var_1_16=100, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=101, var_1_9=23/5] [L67] EXPR var_1_12 ^ var_1_12 VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_0=0, stepLocal_4=0, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=15/2, var_1_16=100, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=101, var_1_9=23/5] [L67] COND TRUE stepLocal_0 <= (var_1_12 ^ var_1_12) [L68] var_1_1 = (! var_1_5) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=15/2, var_1_16=100, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=101, var_1_9=23/5] [L72] unsigned char stepLocal_2 = var_1_12 < (var_1_16 / var_1_8); [L73] signed long int stepLocal_1 = var_1_16; VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_1=100, stepLocal_2=0, stepLocal_4=0, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=15/2, var_1_16=100, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=101, var_1_9=23/5] [L74] COND FALSE !(-256 >= stepLocal_1) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_2=0, stepLocal_4=0, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=15/2, var_1_16=100, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=101, var_1_9=23/5] [L77] COND FALSE !(stepLocal_2 || ((var_1_5 && var_1_7) && var_1_1)) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=15/2, var_1_16=100, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=101, var_1_9=23/5] [L81] unsigned char stepLocal_3 = ! var_1_5; VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_3=1, stepLocal_4=0, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=15/2, var_1_16=100, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=101, var_1_9=23/5] [L82] COND TRUE (var_1_7 && var_1_14) || stepLocal_3 [L83] var_1_11 = var_1_10 VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, var_1_10=2, var_1_11=2, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=15/2, var_1_16=100, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=101, var_1_9=23/5] [L85] var_1_15 = var_1_10 VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, var_1_10=2, var_1_11=2, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=2, var_1_16=100, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=101, var_1_9=23/5] [L86] COND TRUE ((((((((var_1_16) < (var_1_12)) ? (var_1_16) : (var_1_12)))) > (var_1_12)) ? (((((var_1_16) < (var_1_12)) ? (var_1_16) : (var_1_12)))) : (var_1_12))) <= (50 * var_1_8) [L87] var_1_9 = var_1_10 VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, var_1_10=2, var_1_11=2, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=2, var_1_16=100, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=101, var_1_9=2] [L124] RET step() [L125] CALL, EXPR property() [L114] EXPR var_1_12 ^ var_1_12 VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=2, var_1_11=2, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=2, var_1_16=100, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=101, var_1_9=2] [L114-L115] return ((((((((var_1_12 <= (var_1_12 ^ var_1_12)) ? (var_1_1 == ((unsigned char) (! var_1_5))) : (var_1_1 == ((unsigned char) (! var_1_5)))) && ((-256 >= var_1_16) ? (var_1_6 == ((unsigned char) (var_1_1 || var_1_7))) : (((var_1_12 < (var_1_16 / var_1_8)) || ((var_1_5 && var_1_7) && var_1_1)) ? (var_1_6 == ((unsigned char) var_1_7)) : 1))) && ((((((((((var_1_16) < (var_1_12)) ? (var_1_16) : (var_1_12)))) > (var_1_12)) ? (((((var_1_16) < (var_1_12)) ? (var_1_16) : (var_1_12)))) : (var_1_12))) <= (50 * var_1_8)) ? (var_1_9 == ((double) var_1_10)) : 1)) && (((var_1_7 && var_1_14) || (! var_1_5)) ? (var_1_11 == ((double) var_1_10)) : 1)) && (last_1_var_1_14 ? ((var_1_10 >= (- last_1_var_1_9)) ? ((var_1_8 != last_1_var_1_16) ? (var_1_12 == ((unsigned char) var_1_13)) : (var_1_12 == ((unsigned char) 50))) : (var_1_12 == ((unsigned char) var_1_13))) : (var_1_12 == ((unsigned char) var_1_13)))) && (((var_1_13 % (5u + 256u)) <= var_1_16) ? (((var_1_13 + 16) >= var_1_16) ? (var_1_14 == ((unsigned char) var_1_7)) : (var_1_14 == ((unsigned char) var_1_7))) : 1)) && (var_1_15 == ((float) var_1_10))) && (var_1_16 == ((signed long int) last_1_var_1_12)) ; [L125] RET, EXPR property() [L125] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=2, var_1_11=2, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=2, var_1_16=100, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=101, var_1_9=2] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=2, var_1_11=2, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=2, var_1_16=100, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=101, var_1_9=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 52 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.5s, OverallIterations: 5, TraceHistogramMax: 10, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 456 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 456 mSDsluCounter, 855 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 590 mSDsCounter, 145 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 459 IncrementalHoareTripleChecker+Invalid, 604 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 145 mSolverCounterUnsat, 265 mSDtfsCounter, 459 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 127 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=128occurred in iteration=4, InterpolantAutomatonStates: 24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 105 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 451 NumberOfCodeBlocks, 451 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 295 ConstructedInterpolants, 0 QuantifiedInterpolants, 809 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 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-10-13 04:32:34,946 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, 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/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-68.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 d607f3879345041e6460d015c785fbf73afb45a0aff70b1106cf7b1382739630 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 04:32:37,232 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 04:32:37,313 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-13 04:32:37,319 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 04:32:37,320 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 04:32:37,359 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 04:32:37,360 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 04:32:37,360 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 04:32:37,361 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 04:32:37,361 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 04:32:37,361 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 04:32:37,362 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 04:32:37,363 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 04:32:37,363 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 04:32:37,364 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 04:32:37,364 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 04:32:37,364 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 04:32:37,365 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 04:32:37,365 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 04:32:37,365 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 04:32:37,366 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 04:32:37,368 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 04:32:37,368 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 04:32:37,368 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 04:32:37,369 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 04:32:37,369 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 04:32:37,369 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 04:32:37,370 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 04:32:37,370 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 04:32:37,371 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 04:32:37,371 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 04:32:37,371 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 04:32:37,372 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 04:32:37,372 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 04:32:37,372 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 04:32:37,373 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 04:32:37,373 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 04:32:37,373 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 04:32:37,374 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 04:32:37,374 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 04:32:37,374 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 04:32:37,376 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 04:32:37,377 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 04:32:37,377 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 04:32:37,377 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 04:32:37,377 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 -> d607f3879345041e6460d015c785fbf73afb45a0aff70b1106cf7b1382739630 [2024-10-13 04:32:37,740 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 04:32:37,765 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 04:32:37,769 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 04:32:37,770 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 04:32:37,771 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 04:32:37,774 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-68.i [2024-10-13 04:32:39,366 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 04:32:39,591 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 04:32:39,592 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-68.i [2024-10-13 04:32:39,602 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e2758582/8fe999e340774549b8f61a7ba8600ae8/FLAG7c12f5fcc [2024-10-13 04:32:39,614 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e2758582/8fe999e340774549b8f61a7ba8600ae8 [2024-10-13 04:32:39,617 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 04:32:39,618 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 04:32:39,619 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 04:32:39,619 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 04:32:39,624 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 04:32:39,625 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 04:32:39" (1/1) ... [2024-10-13 04:32:39,626 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74f1385b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:32:39, skipping insertion in model container [2024-10-13 04:32:39,626 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 04:32:39" (1/1) ... [2024-10-13 04:32:39,657 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 04:32:39,842 WARN L248 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_loopvsstraightlinecode_50-1loop_file-68.i[915,928] [2024-10-13 04:32:39,930 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 04:32:39,949 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 04:32:39,963 WARN L248 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_loopvsstraightlinecode_50-1loop_file-68.i[915,928] [2024-10-13 04:32:39,999 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 04:32:40,022 INFO L204 MainTranslator]: Completed translation [2024-10-13 04:32:40,023 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:32:40 WrapperNode [2024-10-13 04:32:40,023 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 04:32:40,024 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 04:32:40,024 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 04:32:40,024 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 04:32:40,032 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:32:40" (1/1) ... [2024-10-13 04:32:40,049 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:32:40" (1/1) ... [2024-10-13 04:32:40,080 INFO L138 Inliner]: procedures = 27, calls = 23, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 116 [2024-10-13 04:32:40,080 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 04:32:40,081 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 04:32:40,085 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 04:32:40,085 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 04:32:40,100 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:32:40" (1/1) ... [2024-10-13 04:32:40,100 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:32:40" (1/1) ... [2024-10-13 04:32:40,106 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:32:40" (1/1) ... [2024-10-13 04:32:40,127 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-10-13 04:32:40,127 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:32:40" (1/1) ... [2024-10-13 04:32:40,127 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:32:40" (1/1) ... [2024-10-13 04:32:40,139 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:32:40" (1/1) ... [2024-10-13 04:32:40,146 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:32:40" (1/1) ... [2024-10-13 04:32:40,149 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:32:40" (1/1) ... [2024-10-13 04:32:40,151 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:32:40" (1/1) ... [2024-10-13 04:32:40,158 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 04:32:40,159 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 04:32:40,159 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 04:32:40,159 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 04:32:40,160 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:32:40" (1/1) ... [2024-10-13 04:32:40,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 04:32:40,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 04:32:40,194 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-10-13 04:32:40,197 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-10-13 04:32:40,245 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 04:32:40,245 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 04:32:40,246 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 04:32:40,246 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 04:32:40,246 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 04:32:40,246 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 04:32:40,340 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 04:32:40,342 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 04:32:40,971 INFO L? ?]: Removed 23 outVars from TransFormulas that were not future-live. [2024-10-13 04:32:40,971 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 04:32:41,013 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 04:32:41,014 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 04:32:41,015 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:32:41 BoogieIcfgContainer [2024-10-13 04:32:41,015 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 04:32:41,017 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 04:32:41,018 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 04:32:41,021 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 04:32:41,022 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 04:32:39" (1/3) ... [2024-10-13 04:32:41,023 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@aac4344 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 04:32:41, skipping insertion in model container [2024-10-13 04:32:41,023 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:32:40" (2/3) ... [2024-10-13 04:32:41,023 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@aac4344 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 04:32:41, skipping insertion in model container [2024-10-13 04:32:41,024 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:32:41" (3/3) ... [2024-10-13 04:32:41,025 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-68.i [2024-10-13 04:32:41,041 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 04:32:41,041 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 04:32:41,097 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 04:32:41,104 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;@2bee2803, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 04:32:41,104 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 04:32:41,109 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 30 states have (on average 1.5) internal successors, (45), 31 states have internal predecessors, (45), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-13 04:32:41,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-13 04:32:41,119 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:32:41,120 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 04:32:41,120 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:32:41,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:32:41,127 INFO L85 PathProgramCache]: Analyzing trace with hash -2084244309, now seen corresponding path program 1 times [2024-10-13 04:32:41,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 04:32:41,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [44214718] [2024-10-13 04:32:41,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:32:41,145 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-10-13 04:32:41,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 04:32:41,148 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-10-13 04:32:41,149 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-10-13 04:32:41,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:32:41,353 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-13 04:32:41,360 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 04:32:41,388 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2024-10-13 04:32:41,388 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 04:32:41,389 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 04:32:41,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [44214718] [2024-10-13 04:32:41,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [44214718] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:32:41,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:32:41,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 04:32:41,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557283110] [2024-10-13 04:32:41,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:32:41,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 04:32:41,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 04:32:41,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 04:32:41,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 04:32:41,433 INFO L87 Difference]: Start difference. First operand has 43 states, 30 states have (on average 1.5) internal successors, (45), 31 states have internal predecessors, (45), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-13 04:32:41,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:32:41,647 INFO L93 Difference]: Finished difference Result 85 states and 139 transitions. [2024-10-13 04:32:41,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 04:32:41,650 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 71 [2024-10-13 04:32:41,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:32:41,655 INFO L225 Difference]: With dead ends: 85 [2024-10-13 04:32:41,656 INFO L226 Difference]: Without dead ends: 41 [2024-10-13 04:32:41,658 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 04:32:41,661 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 04:32:41,662 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 57 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 04:32:41,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-10-13 04:32:41,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-10-13 04:32:41,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 29 states have internal predecessors, (40), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-13 04:32:41,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 60 transitions. [2024-10-13 04:32:41,696 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 60 transitions. Word has length 71 [2024-10-13 04:32:41,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:32:41,697 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 60 transitions. [2024-10-13 04:32:41,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-13 04:32:41,697 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 60 transitions. [2024-10-13 04:32:41,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-13 04:32:41,702 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:32:41,703 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 04:32:41,713 INFO L552 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)] Ended with exit code 0 [2024-10-13 04:32:41,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /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 [2024-10-13 04:32:41,904 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:32:41,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:32:41,905 INFO L85 PathProgramCache]: Analyzing trace with hash 245191343, now seen corresponding path program 1 times [2024-10-13 04:32:41,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 04:32:41,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2046556112] [2024-10-13 04:32:41,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:32:41,906 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-10-13 04:32:41,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 04:32:41,908 INFO L229 MonitoredProcess]: Starting monitored process 3 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-10-13 04:32:41,909 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 (3)] Waiting until timeout for monitored process [2024-10-13 04:32:42,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:32:42,086 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-13 04:32:42,091 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 04:32:42,483 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-10-13 04:32:42,484 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 04:32:42,484 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 04:32:42,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2046556112] [2024-10-13 04:32:42,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2046556112] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:32:42,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:32:42,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 04:32:42,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935927457] [2024-10-13 04:32:42,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:32:42,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 04:32:42,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 04:32:42,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 04:32:42,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-13 04:32:42,492 INFO L87 Difference]: Start difference. First operand 41 states and 60 transitions. Second operand has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-10-13 04:32:43,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:32:43,724 INFO L93 Difference]: Finished difference Result 177 states and 258 transitions. [2024-10-13 04:32:43,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 04:32:43,725 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 71 [2024-10-13 04:32:43,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:32:43,727 INFO L225 Difference]: With dead ends: 177 [2024-10-13 04:32:43,727 INFO L226 Difference]: Without dead ends: 137 [2024-10-13 04:32:43,728 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-10-13 04:32:43,731 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 128 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-13 04:32:43,731 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 265 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-13 04:32:43,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-10-13 04:32:43,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 68. [2024-10-13 04:32:43,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 45 states have (on average 1.3333333333333333) internal successors, (60), 45 states have internal predecessors, (60), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-13 04:32:43,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 100 transitions. [2024-10-13 04:32:43,765 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 100 transitions. Word has length 71 [2024-10-13 04:32:43,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:32:43,766 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 100 transitions. [2024-10-13 04:32:43,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-10-13 04:32:43,766 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 100 transitions. [2024-10-13 04:32:43,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-13 04:32:43,768 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:32:43,768 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 04:32:43,777 INFO L552 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 (3)] Ended with exit code 0 [2024-10-13 04:32:43,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /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 [2024-10-13 04:32:43,969 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:32:43,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:32:43,970 INFO L85 PathProgramCache]: Analyzing trace with hash -147835667, now seen corresponding path program 1 times [2024-10-13 04:32:43,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 04:32:43,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1501910138] [2024-10-13 04:32:43,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:32:43,971 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-10-13 04:32:43,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 04:32:43,973 INFO L229 MonitoredProcess]: Starting monitored process 4 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-10-13 04:32:43,975 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 (4)] Waiting until timeout for monitored process [2024-10-13 04:32:44,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:32:44,095 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 04:32:44,098 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 04:32:44,182 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-10-13 04:32:44,182 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 04:32:44,183 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 04:32:44,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1501910138] [2024-10-13 04:32:44,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1501910138] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:32:44,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:32:44,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 04:32:44,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989283452] [2024-10-13 04:32:44,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:32:44,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 04:32:44,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 04:32:44,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 04:32:44,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 04:32:44,186 INFO L87 Difference]: Start difference. First operand 68 states and 100 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-10-13 04:32:44,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:32:44,589 INFO L93 Difference]: Finished difference Result 108 states and 159 transitions. [2024-10-13 04:32:44,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 04:32:44,590 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 71 [2024-10-13 04:32:44,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:32:44,592 INFO L225 Difference]: With dead ends: 108 [2024-10-13 04:32:44,592 INFO L226 Difference]: Without dead ends: 68 [2024-10-13 04:32:44,592 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 04:32:44,594 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 54 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 04:32:44,594 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 93 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 04:32:44,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-10-13 04:32:44,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2024-10-13 04:32:44,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 45 states have (on average 1.3111111111111111) internal successors, (59), 45 states have internal predecessors, (59), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-13 04:32:44,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 99 transitions. [2024-10-13 04:32:44,609 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 99 transitions. Word has length 71 [2024-10-13 04:32:44,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:32:44,610 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 99 transitions. [2024-10-13 04:32:44,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-10-13 04:32:44,610 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 99 transitions. [2024-10-13 04:32:44,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-13 04:32:44,611 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:32:44,611 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 04:32:44,621 INFO L552 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 (4)] Ended with exit code 0 [2024-10-13 04:32:44,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /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 [2024-10-13 04:32:44,812 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:32:44,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:32:44,813 INFO L85 PathProgramCache]: Analyzing trace with hash -770723378, now seen corresponding path program 1 times [2024-10-13 04:32:44,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 04:32:44,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1870959091] [2024-10-13 04:32:44,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:32:44,814 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-10-13 04:32:44,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 04:32:44,817 INFO L229 MonitoredProcess]: Starting monitored process 5 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-10-13 04:32:44,820 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 (5)] Waiting until timeout for monitored process [2024-10-13 04:32:44,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:32:44,967 INFO L255 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-13 04:32:44,971 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 04:32:45,770 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 109 proven. 30 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2024-10-13 04:32:45,771 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 04:32:47,166 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 04:32:47,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1870959091] [2024-10-13 04:32:47,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1870959091] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 04:32:47,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [539542576] [2024-10-13 04:32:47,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:32:47,168 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-13 04:32:47,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-13 04:32:47,174 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-13 04:32:47,178 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2024-10-13 04:32:47,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:32:47,708 INFO L255 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-13 04:32:47,713 INFO L278 TraceCheckSpWp]: Computing forward predicates...