./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_variablewrapping_normal_file-87.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_variablewrapping_normal_file-87.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 975e7a512573a7b5f734f37b11f2c36f58bfc514f64305cf0e6b7c9bb2881005 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 05:52:04,373 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 05:52:04,441 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 05:52:04,446 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 05:52:04,447 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 05:52:04,475 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 05:52:04,476 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 05:52:04,477 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 05:52:04,477 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 05:52:04,478 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 05:52:04,478 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 05:52:04,478 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 05:52:04,479 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 05:52:04,479 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 05:52:04,479 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 05:52:04,481 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 05:52:04,481 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 05:52:04,481 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 05:52:04,482 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 05:52:04,482 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 05:52:04,482 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 05:52:04,485 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 05:52:04,486 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 05:52:04,486 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 05:52:04,486 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 05:52:04,486 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 05:52:04,486 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 05:52:04,487 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 05:52:04,487 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 05:52:04,487 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 05:52:04,487 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 05:52:04,487 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 05:52:04,487 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 05:52:04,488 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 05:52:04,488 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 05:52:04,488 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 05:52:04,488 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 05:52:04,488 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 05:52:04,488 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 05:52:04,488 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 05:52:04,488 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 05:52:04,489 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 05:52:04,489 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 -> 975e7a512573a7b5f734f37b11f2c36f58bfc514f64305cf0e6b7c9bb2881005 [2024-10-13 05:52:04,690 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 05:52:04,710 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 05:52:04,713 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 05:52:04,714 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 05:52:04,714 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 05:52:04,715 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-87.i [2024-10-13 05:52:05,945 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 05:52:06,112 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 05:52:06,112 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-87.i [2024-10-13 05:52:06,121 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3b438c42/625f19c052b443a69d370d9f633902c0/FLAG1e566a30a [2024-10-13 05:52:06,515 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3b438c42/625f19c052b443a69d370d9f633902c0 [2024-10-13 05:52:06,517 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 05:52:06,518 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 05:52:06,519 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 05:52:06,519 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 05:52:06,524 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 05:52:06,525 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 05:52:06" (1/1) ... [2024-10-13 05:52:06,526 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f2ae1f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:52:06, skipping insertion in model container [2024-10-13 05:52:06,526 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 05:52:06" (1/1) ... [2024-10-13 05:52:06,548 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 05:52:06,699 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_variablewrapping_normal_file-87.i[913,926] [2024-10-13 05:52:06,727 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 05:52:06,735 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 05:52:06,745 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_variablewrapping_normal_file-87.i[913,926] [2024-10-13 05:52:06,760 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 05:52:06,773 INFO L204 MainTranslator]: Completed translation [2024-10-13 05:52:06,774 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:52:06 WrapperNode [2024-10-13 05:52:06,774 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 05:52:06,775 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 05:52:06,775 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 05:52:06,775 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 05:52:06,781 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:52:06" (1/1) ... [2024-10-13 05:52:06,787 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:52:06" (1/1) ... [2024-10-13 05:52:06,804 INFO L138 Inliner]: procedures = 26, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 105 [2024-10-13 05:52:06,804 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 05:52:06,805 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 05:52:06,805 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 05:52:06,805 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 05:52:06,813 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:52:06" (1/1) ... [2024-10-13 05:52:06,813 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:52:06" (1/1) ... [2024-10-13 05:52:06,815 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:52:06" (1/1) ... [2024-10-13 05:52:06,832 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 05:52:06,832 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:52:06" (1/1) ... [2024-10-13 05:52:06,833 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:52:06" (1/1) ... [2024-10-13 05:52:06,835 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:52:06" (1/1) ... [2024-10-13 05:52:06,838 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:52:06" (1/1) ... [2024-10-13 05:52:06,839 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:52:06" (1/1) ... [2024-10-13 05:52:06,840 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:52:06" (1/1) ... [2024-10-13 05:52:06,841 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 05:52:06,842 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 05:52:06,842 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 05:52:06,842 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 05:52:06,843 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:52:06" (1/1) ... [2024-10-13 05:52:06,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 05:52:06,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 05:52:06,879 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 05:52:06,882 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 05:52:06,920 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 05:52:06,920 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 05:52:06,920 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 05:52:06,920 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 05:52:06,920 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 05:52:06,920 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 05:52:06,972 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 05:52:06,974 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 05:52:07,145 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-10-13 05:52:07,145 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 05:52:07,178 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 05:52:07,178 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 05:52:07,178 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:52:07 BoogieIcfgContainer [2024-10-13 05:52:07,178 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 05:52:07,180 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 05:52:07,181 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 05:52:07,184 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 05:52:07,185 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 05:52:06" (1/3) ... [2024-10-13 05:52:07,185 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@257895fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 05:52:07, skipping insertion in model container [2024-10-13 05:52:07,186 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:52:06" (2/3) ... [2024-10-13 05:52:07,186 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@257895fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 05:52:07, skipping insertion in model container [2024-10-13 05:52:07,186 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:52:07" (3/3) ... [2024-10-13 05:52:07,188 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-87.i [2024-10-13 05:52:07,203 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 05:52:07,203 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 05:52:07,251 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 05:52:07,256 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;@2140ca50, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 05:52:07,257 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 05:52:07,260 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 23 states have (on average 1.434782608695652) internal successors, (33), 24 states have internal predecessors, (33), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-13 05:52:07,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-13 05:52:07,268 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:52:07,269 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:52:07,269 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:52:07,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:52:07,274 INFO L85 PathProgramCache]: Analyzing trace with hash -799221477, now seen corresponding path program 1 times [2024-10-13 05:52:07,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:52:07,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387007298] [2024-10-13 05:52:07,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:52:07,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:52:07,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:07,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:52:07,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:07,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 05:52:07,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:07,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 05:52:07,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:07,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 05:52:07,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:07,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 05:52:07,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:07,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 05:52:07,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:07,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 05:52:07,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:07,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 05:52:07,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:07,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 05:52:07,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:07,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 05:52:07,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:07,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 05:52:07,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:07,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 05:52:07,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:07,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 05:52:07,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:07,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 05:52:07,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:07,596 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-13 05:52:07,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:52:07,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387007298] [2024-10-13 05:52:07,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387007298] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:52:07,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:52:07,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 05:52:07,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097184031] [2024-10-13 05:52:07,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:52:07,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 05:52:07,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:52:07,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 05:52:07,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 05:52:07,631 INFO L87 Difference]: Start difference. First operand has 40 states, 23 states have (on average 1.434782608695652) internal successors, (33), 24 states have internal predecessors, (33), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-13 05:52:07,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:52:07,677 INFO L93 Difference]: Finished difference Result 77 states and 134 transitions. [2024-10-13 05:52:07,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 05:52:07,680 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 86 [2024-10-13 05:52:07,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:52:07,684 INFO L225 Difference]: With dead ends: 77 [2024-10-13 05:52:07,685 INFO L226 Difference]: Without dead ends: 38 [2024-10-13 05:52:07,689 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 44 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 05:52:07,693 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 05:52:07,694 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 53 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 05:52:07,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-10-13 05:52:07,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-10-13 05:52:07,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 22 states have internal predecessors, (28), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-13 05:52:07,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 56 transitions. [2024-10-13 05:52:07,769 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 56 transitions. Word has length 86 [2024-10-13 05:52:07,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:52:07,770 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 56 transitions. [2024-10-13 05:52:07,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-13 05:52:07,771 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 56 transitions. [2024-10-13 05:52:07,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-13 05:52:07,774 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:52:07,774 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:52:07,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 05:52:07,775 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:52:07,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:52:07,775 INFO L85 PathProgramCache]: Analyzing trace with hash -660680101, now seen corresponding path program 1 times [2024-10-13 05:52:07,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:52:07,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699065539] [2024-10-13 05:52:07,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:52:07,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:52:07,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:53,214 WARN L286 SmtUtils]: Spent 26.11s on a formula simplification. DAG size of input: 202 DAG size of output: 190 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-13 05:52:53,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:52:53,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:53,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 05:52:53,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:53,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 05:52:53,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:53,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 05:52:53,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:53,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 05:52:53,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:53,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 05:52:53,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:53,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 05:52:53,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:53,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 05:52:53,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:53,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 05:52:53,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:53,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 05:52:53,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:53,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 05:52:53,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:53,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 05:52:53,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:53,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 05:52:53,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:53,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 05:52:53,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:52:53,271 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-13 05:52:53,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:52:53,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699065539] [2024-10-13 05:52:53,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699065539] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:52:53,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:52:53,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 05:52:53,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786612541] [2024-10-13 05:52:53,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:52:53,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 05:52:53,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:52:53,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 05:52:53,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-10-13 05:52:53,275 INFO L87 Difference]: Start difference. First operand 38 states and 56 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-13 05:52:54,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:52:54,878 INFO L93 Difference]: Finished difference Result 69 states and 96 transitions. [2024-10-13 05:52:54,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 05:52:54,879 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 86 [2024-10-13 05:52:54,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:52:54,880 INFO L225 Difference]: With dead ends: 69 [2024-10-13 05:52:54,880 INFO L226 Difference]: Without dead ends: 67 [2024-10-13 05:52:54,880 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 27.9s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-10-13 05:52:54,881 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 62 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-13 05:52:54,882 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 223 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-13 05:52:54,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-10-13 05:52:54,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 58. [2024-10-13 05:52:54,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 34 states have internal predecessors, (41), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-13 05:52:54,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 85 transitions. [2024-10-13 05:52:54,895 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 85 transitions. Word has length 86 [2024-10-13 05:52:54,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:52:54,895 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 85 transitions. [2024-10-13 05:52:54,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-13 05:52:54,895 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 85 transitions. [2024-10-13 05:52:54,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-10-13 05:52:54,897 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:52:54,897 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:52:54,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 05:52:54,897 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:52:54,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:52:54,898 INFO L85 PathProgramCache]: Analyzing trace with hash 984364393, now seen corresponding path program 1 times [2024-10-13 05:52:54,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:52:54,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324427775] [2024-10-13 05:52:54,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:52:54,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:52:54,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:53:46,759 WARN L286 SmtUtils]: Spent 17.69s on a formula simplification. DAG size of input: 205 DAG size of output: 193 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-13 05:53:46,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:53:46,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:53:46,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 05:53:46,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:53:46,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 05:53:46,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:53:46,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 05:53:46,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:53:46,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 05:53:46,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:53:46,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 05:53:46,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:53:46,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 05:53:46,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:53:46,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 05:53:46,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:53:46,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 05:53:46,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:53:46,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 05:53:46,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:53:46,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 05:53:46,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:53:46,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 05:53:46,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:53:46,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 05:53:46,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:53:46,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 05:53:46,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:53:46,802 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-13 05:53:46,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:53:46,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324427775] [2024-10-13 05:53:46,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324427775] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:53:46,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:53:46,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-13 05:53:46,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538857351] [2024-10-13 05:53:46,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:53:46,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 05:53:46,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:53:46,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 05:53:46,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-10-13 05:53:46,805 INFO L87 Difference]: Start difference. First operand 58 states and 85 transitions. Second operand has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14)