./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-59.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-59.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 b76efa245cf05811296f1821b79f17cce14cc81fdc5d172c0831b55020eb32b3 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 07:59:35,215 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 07:59:35,291 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 07:59:35,298 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 07:59:35,299 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 07:59:35,324 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 07:59:35,325 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 07:59:35,325 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 07:59:35,326 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 07:59:35,330 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 07:59:35,330 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 07:59:35,331 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 07:59:35,331 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 07:59:35,331 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 07:59:35,332 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 07:59:35,332 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 07:59:35,332 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 07:59:35,332 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 07:59:35,333 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 07:59:35,333 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 07:59:35,333 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 07:59:35,334 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 07:59:35,334 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 07:59:35,334 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 07:59:35,334 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 07:59:35,335 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 07:59:35,335 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 07:59:35,335 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 07:59:35,335 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 07:59:35,336 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 07:59:35,336 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 07:59:35,336 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 07:59:35,336 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 07:59:35,337 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 07:59:35,337 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 07:59:35,337 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 07:59:35,338 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 07:59:35,338 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 07:59:35,338 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 07:59:35,338 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 07:59:35,339 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 07:59:35,339 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 07:59:35,339 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 -> b76efa245cf05811296f1821b79f17cce14cc81fdc5d172c0831b55020eb32b3 [2024-11-10 07:59:35,624 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 07:59:35,652 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 07:59:35,655 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 07:59:35,656 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 07:59:35,658 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 07:59:35,660 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-59.i [2024-11-10 07:59:37,112 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 07:59:37,394 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 07:59:37,396 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-59.i [2024-11-10 07:59:37,408 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/669477857/3dd116ed250c4c839e0a71bf54659c4c/FLAGc887b40a0 [2024-11-10 07:59:37,698 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/669477857/3dd116ed250c4c839e0a71bf54659c4c [2024-11-10 07:59:37,700 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 07:59:37,702 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 07:59:37,703 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 07:59:37,703 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 07:59:37,708 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 07:59:37,709 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:59:37" (1/1) ... [2024-11-10 07:59:37,709 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@790f5ef9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:59:37, skipping insertion in model container [2024-11-10 07:59:37,710 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:59:37" (1/1) ... [2024-11-10 07:59:37,737 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 07:59:37,916 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-59.i[915,928] [2024-11-10 07:59:37,994 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 07:59:38,003 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 07:59:38,016 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-59.i[915,928] [2024-11-10 07:59:38,048 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 07:59:38,070 INFO L204 MainTranslator]: Completed translation [2024-11-10 07:59:38,071 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:59:38 WrapperNode [2024-11-10 07:59:38,071 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 07:59:38,072 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 07:59:38,073 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 07:59:38,073 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 07:59:38,079 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:59:38" (1/1) ... [2024-11-10 07:59:38,093 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:59:38" (1/1) ... [2024-11-10 07:59:38,136 INFO L138 Inliner]: procedures = 26, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 128 [2024-11-10 07:59:38,137 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 07:59:38,140 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 07:59:38,140 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 07:59:38,140 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 07:59:38,150 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:59:38" (1/1) ... [2024-11-10 07:59:38,150 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:59:38" (1/1) ... [2024-11-10 07:59:38,154 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:59:38" (1/1) ... [2024-11-10 07:59:38,180 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 07:59:38,181 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:59:38" (1/1) ... [2024-11-10 07:59:38,181 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:59:38" (1/1) ... [2024-11-10 07:59:38,191 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:59:38" (1/1) ... [2024-11-10 07:59:38,195 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:59:38" (1/1) ... [2024-11-10 07:59:38,196 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:59:38" (1/1) ... [2024-11-10 07:59:38,201 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:59:38" (1/1) ... [2024-11-10 07:59:38,205 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 07:59:38,206 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 07:59:38,206 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 07:59:38,206 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 07:59:38,207 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:59:38" (1/1) ... [2024-11-10 07:59:38,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 07:59:38,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 07:59:38,240 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 07:59:38,246 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 07:59:38,286 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 07:59:38,287 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 07:59:38,287 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 07:59:38,287 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 07:59:38,288 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 07:59:38,288 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 07:59:38,365 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 07:59:38,367 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 07:59:38,826 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-11-10 07:59:38,827 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 07:59:38,842 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 07:59:38,843 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 07:59:38,843 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:59:38 BoogieIcfgContainer [2024-11-10 07:59:38,844 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 07:59:38,847 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 07:59:38,847 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 07:59:38,850 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 07:59:38,851 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 07:59:37" (1/3) ... [2024-11-10 07:59:38,852 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c34fb5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:59:38, skipping insertion in model container [2024-11-10 07:59:38,852 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:59:38" (2/3) ... [2024-11-10 07:59:38,852 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c34fb5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:59:38, skipping insertion in model container [2024-11-10 07:59:38,852 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:59:38" (3/3) ... [2024-11-10 07:59:38,853 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-while_file-59.i [2024-11-10 07:59:38,873 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 07:59:38,874 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 07:59:38,935 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 07:59:38,942 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;@1464289, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 07:59:38,942 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 07:59:38,947 INFO L276 IsEmpty]: Start isEmpty. Operand has 57 states, 40 states have (on average 1.375) internal successors, (55), 41 states have internal predecessors, (55), 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-11-10 07:59:38,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-10 07:59:38,961 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:59:38,962 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 07:59:38,962 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:59:38,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:59:38,969 INFO L85 PathProgramCache]: Analyzing trace with hash 743751383, now seen corresponding path program 1 times [2024-11-10 07:59:38,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:59:38,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901531766] [2024-11-10 07:59:38,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:59:38,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:59:39,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:59:39,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:59:39,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:59:39,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:59:39,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:59:39,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-10 07:59:39,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:59:39,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:59:39,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:59:39,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 07:59:39,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:59:39,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 07:59:39,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:59:39,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 07:59:39,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:59:39,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 07:59:39,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:59:39,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 07:59:39,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:59:39,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 07:59:39,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:59:39,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 07:59:39,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:59:39,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 07:59:39,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:59:39,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 07:59:39,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:59:39,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 07:59:39,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:59:39,393 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-10 07:59:39,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:59:39,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901531766] [2024-11-10 07:59:39,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901531766] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:59:39,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:59:39,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 07:59:39,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66459990] [2024-11-10 07:59:39,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:59:39,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 07:59:39,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:59:39,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 07:59:39,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 07:59:39,455 INFO L87 Difference]: Start difference. First operand has 57 states, 40 states have (on average 1.375) internal successors, (55), 41 states have internal predecessors, (55), 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 15.0) internal successors, (30), 2 states have internal predecessors, (30), 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-11-10 07:59:39,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:59:39,486 INFO L93 Difference]: Finished difference Result 106 states and 173 transitions. [2024-11-10 07:59:39,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 07:59:39,488 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 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 97 [2024-11-10 07:59:39,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:59:39,496 INFO L225 Difference]: With dead ends: 106 [2024-11-10 07:59:39,497 INFO L226 Difference]: Without dead ends: 52 [2024-11-10 07:59:39,501 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-11-10 07:59:39,506 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 07:59:39,506 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 07:59:39,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-11-10 07:59:39,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2024-11-10 07:59:39,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 36 states have internal predecessors, (47), 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-11-10 07:59:39,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 75 transitions. [2024-11-10 07:59:39,550 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 75 transitions. Word has length 97 [2024-11-10 07:59:39,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:59:39,550 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 75 transitions. [2024-11-10 07:59:39,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 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-11-10 07:59:39,551 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 75 transitions. [2024-11-10 07:59:39,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-10 07:59:39,554 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:59:39,554 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 07:59:39,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 07:59:39,555 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:59:39,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:59:39,555 INFO L85 PathProgramCache]: Analyzing trace with hash 1859539963, now seen corresponding path program 1 times [2024-11-10 07:59:39,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:59:39,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166567306] [2024-11-10 07:59:39,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:59:39,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:59:39,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:59:39,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:59:39,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:59:39,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:59:39,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:59:39,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-10 07:59:39,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:59:39,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:59:39,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:59:39,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 07:59:39,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:59:39,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 07:59:39,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:59:39,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 07:59:40,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:59:40,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 07:59:40,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:59:40,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 07:59:40,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:59:40,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 07:59:40,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:59:40,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 07:59:40,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:59:40,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 07:59:40,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:59:40,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 07:59:40,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:59:40,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 07:59:40,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:59:40,049 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-10 07:59:40,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:59:40,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166567306] [2024-11-10 07:59:40,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166567306] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:59:40,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:59:40,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 07:59:40,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301522472] [2024-11-10 07:59:40,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:59:40,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 07:59:40,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:59:40,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 07:59:40,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 07:59:40,057 INFO L87 Difference]: Start difference. First operand 52 states and 75 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 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-11-10 07:59:40,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:59:40,250 INFO L93 Difference]: Finished difference Result 152 states and 221 transitions. [2024-11-10 07:59:40,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 07:59:40,254 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 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 97 [2024-11-10 07:59:40,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:59:40,260 INFO L225 Difference]: With dead ends: 152 [2024-11-10 07:59:40,260 INFO L226 Difference]: Without dead ends: 103 [2024-11-10 07:59:40,263 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 31 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-11-10 07:59:40,264 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 54 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 07:59:40,264 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 209 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 07:59:40,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-10 07:59:40,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 82. [2024-11-10 07:59:40,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 51 states have (on average 1.2156862745098038) internal successors, (62), 51 states have internal predecessors, (62), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-10 07:59:40,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 118 transitions. [2024-11-10 07:59:40,294 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 118 transitions. Word has length 97 [2024-11-10 07:59:40,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:59:40,295 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 118 transitions. [2024-11-10 07:59:40,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 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-11-10 07:59:40,295 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 118 transitions. [2024-11-10 07:59:40,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-10 07:59:40,298 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:59:40,298 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 07:59:40,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 07:59:40,299 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:59:40,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:59:40,299 INFO L85 PathProgramCache]: Analyzing trace with hash 1659627081, now seen corresponding path program 1 times [2024-11-10 07:59:40,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:59:40,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613831261] [2024-11-10 07:59:40,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:59:40,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:59:40,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:59:40,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:59:40,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:59:40,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:59:40,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:59:40,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-10 07:59:40,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:59:40,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:59:40,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:59:40,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 07:59:40,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:59:40,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 07:59:40,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:59:40,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 07:59:40,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:59:40,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 07:59:40,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:59:40,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 07:59:40,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:59:40,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 07:59:40,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:59:40,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 07:59:40,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:59:40,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 07:59:40,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:59:40,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 07:59:40,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:59:40,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 07:59:40,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:59:40,927 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-10 07:59:40,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:59:40,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613831261] [2024-11-10 07:59:40,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613831261] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:59:40,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:59:40,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 07:59:40,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095028991] [2024-11-10 07:59:40,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:59:40,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 07:59:40,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:59:40,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 07:59:40,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-10 07:59:40,933 INFO L87 Difference]: Start difference. First operand 82 states and 118 transitions. Second operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-10 07:59:41,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:59:41,266 INFO L93 Difference]: Finished difference Result 192 states and 276 transitions. [2024-11-10 07:59:41,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 07:59:41,267 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 98 [2024-11-10 07:59:41,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:59:41,272 INFO L225 Difference]: With dead ends: 192 [2024-11-10 07:59:41,272 INFO L226 Difference]: Without dead ends: 143 [2024-11-10 07:59:41,273 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-11-10 07:59:41,275 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 127 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 07:59:41,276 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 368 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 07:59:41,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-11-10 07:59:41,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 128. [2024-11-10 07:59:41,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 82 states have (on average 1.2439024390243902) internal successors, (102), 82 states have internal predecessors, (102), 42 states have call successors, (42), 3 states have call predecessors, (42), 3 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-10 07:59:41,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 186 transitions. [2024-11-10 07:59:41,313 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 186 transitions. Word has length 98 [2024-11-10 07:59:41,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:59:41,314 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 186 transitions. [2024-11-10 07:59:41,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-10 07:59:41,314 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 186 transitions. [2024-11-10 07:59:41,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-10 07:59:41,315 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:59:41,316 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 07:59:41,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 07:59:41,316 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:59:41,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:59:41,316 INFO L85 PathProgramCache]: Analyzing trace with hash -165108322, now seen corresponding path program 1 times [2024-11-10 07:59:41,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:59:41,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921459394] [2024-11-10 07:59:41,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:59:41,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:59:41,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:59:41,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:59:41,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:59:41,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:59:41,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:59:41,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-10 07:59:41,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:59:41,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:59:41,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:59:41,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 07:59:41,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:59:41,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 07:59:41,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:59:41,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 07:59:41,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:59:41,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 07:59:41,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:59:41,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 07:59:41,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:59:41,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 07:59:41,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:59:41,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 07:59:41,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:59:41,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 07:59:41,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:59:41,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 07:59:41,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:59:41,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 07:59:41,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:59:41,813 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 36 proven. 3 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-11-10 07:59:41,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:59:41,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921459394] [2024-11-10 07:59:41,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921459394] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 07:59:41,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [835347709] [2024-11-10 07:59:41,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:59:41,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 07:59:41,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 07:59:41,817 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-11-10 07:59:41,819 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-11-10 07:59:41,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:59:41,930 INFO L255 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-10 07:59:41,936 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 07:59:42,066 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2024-11-10 07:59:42,067 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 07:59:42,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [835347709] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:59:42,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 07:59:42,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [6] total 10 [2024-11-10 07:59:42,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168635356] [2024-11-10 07:59:42,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:59:42,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 07:59:42,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:59:42,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 07:59:42,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-10 07:59:42,069 INFO L87 Difference]: Start difference. First operand 128 states and 186 transitions. Second operand has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-10 07:59:42,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:59:42,450 INFO L93 Difference]: Finished difference Result 368 states and 506 transitions. [2024-11-10 07:59:42,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-10 07:59:42,451 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) Word has length 99 [2024-11-10 07:59:42,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:59:42,454 INFO L225 Difference]: With dead ends: 368 [2024-11-10 07:59:42,454 INFO L226 Difference]: Without dead ends: 273 [2024-11-10 07:59:42,456 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=126, Invalid=336, Unknown=0, NotChecked=0, Total=462 [2024-11-10 07:59:42,456 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 216 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 07:59:42,457 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 172 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 07:59:42,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2024-11-10 07:59:42,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 166. [2024-11-10 07:59:42,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 114 states have (on average 1.219298245614035) internal successors, (139), 114 states have internal predecessors, (139), 42 states have call successors, (42), 9 states have call predecessors, (42), 9 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-10 07:59:42,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 223 transitions. [2024-11-10 07:59:42,505 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 223 transitions. Word has length 99 [2024-11-10 07:59:42,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:59:42,506 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 223 transitions. [2024-11-10 07:59:42,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-10 07:59:42,507 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 223 transitions. [2024-11-10 07:59:42,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-10 07:59:42,510 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:59:42,510 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 07:59:42,534 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-10 07:59:42,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 07:59:42,712 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:59:42,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:59:42,712 INFO L85 PathProgramCache]: Analyzing trace with hash 1577702013, now seen corresponding path program 1 times [2024-11-10 07:59:42,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:59:42,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057073242] [2024-11-10 07:59:42,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:59:42,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:59:42,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 07:59:42,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1254771163] [2024-11-10 07:59:42,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:59:42,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 07:59:42,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 07:59:42,817 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 07:59:42,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-10 07:59:43,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:59:43,092 INFO L255 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-10 07:59:43,096 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 07:59:44,121 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 133 proven. 81 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2024-11-10 07:59:44,122 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 07:59:52,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:59:52,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057073242] [2024-11-10 07:59:52,080 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-10 07:59:52,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1254771163] [2024-11-10 07:59:52,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1254771163] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 07:59:52,081 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-10 07:59:52,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2024-11-10 07:59:52,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887100901] [2024-11-10 07:59:52,081 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-10 07:59:52,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-10 07:59:52,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:59:52,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-10 07:59:52,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=299, Unknown=0, NotChecked=0, Total=420 [2024-11-10 07:59:52,083 INFO L87 Difference]: Start difference. First operand 166 states and 223 transitions. Second operand has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 12 states have internal predecessors, (44), 4 states have call successors, (14), 4 states have call predecessors, (14), 5 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2024-11-10 07:59:52,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:59:52,788 INFO L93 Difference]: Finished difference Result 326 states and 422 transitions. [2024-11-10 07:59:52,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-10 07:59:52,789 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 12 states have internal predecessors, (44), 4 states have call successors, (14), 4 states have call predecessors, (14), 5 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) Word has length 99 [2024-11-10 07:59:52,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:59:52,792 INFO L225 Difference]: With dead ends: 326 [2024-11-10 07:59:52,792 INFO L226 Difference]: Without dead ends: 201 [2024-11-10 07:59:52,794 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=176, Invalid=424, Unknown=0, NotChecked=0, Total=600 [2024-11-10 07:59:52,795 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 61 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 07:59:52,796 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 393 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 07:59:52,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2024-11-10 07:59:52,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 190. [2024-11-10 07:59:52,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 132 states have (on average 1.1818181818181819) internal successors, (156), 132 states have internal predecessors, (156), 42 states have call successors, (42), 15 states have call predecessors, (42), 15 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-10 07:59:52,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 240 transitions. [2024-11-10 07:59:52,818 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 240 transitions. Word has length 99 [2024-11-10 07:59:52,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:59:52,818 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 240 transitions. [2024-11-10 07:59:52,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 12 states have internal predecessors, (44), 4 states have call successors, (14), 4 states have call predecessors, (14), 5 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2024-11-10 07:59:52,819 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 240 transitions. [2024-11-10 07:59:52,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-10 07:59:52,820 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:59:52,820 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 07:59:52,838 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-10 07:59:53,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 07:59:53,021 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:59:53,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:59:53,022 INFO L85 PathProgramCache]: Analyzing trace with hash 128294685, now seen corresponding path program 1 times [2024-11-10 07:59:53,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:59:53,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538453464] [2024-11-10 07:59:53,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:59:53,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:59:53,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 07:59:53,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1670758532] [2024-11-10 07:59:53,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:59:53,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 07:59:53,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 07:59:53,140 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 07:59:53,142 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-10 07:59:53,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:59:53,487 INFO L255 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-10 07:59:53,491 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 07:59:54,797 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 169 proven. 105 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2024-11-10 07:59:54,798 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 08:00:00,864 WARN L286 SmtUtils]: Spent 5.07s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-10 08:00:20,651 WARN L286 SmtUtils]: Spent 6.87s on a formula simplification that was a NOOP. DAG size: 49 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-10 08:00:41,680 WARN L286 SmtUtils]: Spent 16.03s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-10 08:00:51,596 WARN L286 SmtUtils]: Spent 5.62s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-10 08:00:56,330 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (mod c_~var_1_4~0 256))) (let ((.cse2 (div (mod c_~var_1_6~0 65536) .cse7)) (.cse4 (mod c_~var_1_19~0 4294967296))) (let ((.cse0 (mod (+ .cse7 c_~var_1_7~0) 65536)) (.cse1 (+ .cse4 1)) (.cse6 (mod |c_ULTIMATE.start_step_~stepLocal_2~0#1| 65536)) (.cse5 (+ (mod c_~var_1_7~0 65536) .cse7 1)) (.cse3 (mod (* c_~var_1_19~0 .cse2) 4294967296))) (and (or (< .cse0 .cse1) (not (= (mod (* .cse2 .cse0) 4294967296) .cse0))) (or (not (= .cse3 .cse0)) (< .cse4 .cse0)) (forall ((v_z_9 Int)) (or (not (= (mod (* v_z_9 .cse2) 4294967296) v_z_9)) (< v_z_9 .cse1) (< v_z_9 .cse5) (< .cse6 v_z_9))) (or (< .cse6 .cse3) (< .cse3 .cse5) (< .cse4 .cse3)))))) is different from false