./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-34.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 803cd42f 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 ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-34.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 5d5e6a48faf77affdea7472a901365f0e051dda2e417ea5311d5eeddd5db501f --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 10:50:07,819 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 10:50:07,866 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-22 10:50:07,870 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 10:50:07,872 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 10:50:07,891 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 10:50:07,892 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 10:50:07,893 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 10:50:07,893 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 10:50:07,893 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 10:50:07,894 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 10:50:07,894 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 10:50:07,894 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 10:50:07,894 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 10:50:07,895 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 10:50:07,895 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 10:50:07,895 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 10:50:07,896 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 10:50:07,898 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 10:50:07,898 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 10:50:07,898 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 10:50:07,899 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 10:50:07,899 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 10:50:07,899 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 10:50:07,900 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 10:50:07,900 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 10:50:07,900 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 10:50:07,900 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 10:50:07,901 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 10:50:07,901 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 10:50:07,901 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 10:50:07,901 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 10:50:07,902 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 10:50:07,902 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 10:50:07,902 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 10:50:07,902 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-22 10:50:07,903 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-22 10:50:07,903 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-22 10:50:07,903 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 10:50:07,903 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 10:50:07,903 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 10:50:07,904 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 10:50:07,904 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 -> 5d5e6a48faf77affdea7472a901365f0e051dda2e417ea5311d5eeddd5db501f [2024-11-22 10:50:08,096 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 10:50:08,118 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 10:50:08,121 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 10:50:08,122 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 10:50:08,123 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 10:50:08,123 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-34.i [2024-11-22 10:50:09,336 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 10:50:09,480 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 10:50:09,481 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-34.i [2024-11-22 10:50:09,487 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08c92213a/be839b66eaac455ab0e529f69f31ee31/FLAG974bdbc53 [2024-11-22 10:50:09,498 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08c92213a/be839b66eaac455ab0e529f69f31ee31 [2024-11-22 10:50:09,500 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 10:50:09,501 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 10:50:09,502 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 10:50:09,502 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 10:50:09,506 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 10:50:09,506 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:50:09" (1/1) ... [2024-11-22 10:50:09,507 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51574be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:50:09, skipping insertion in model container [2024-11-22 10:50:09,507 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:50:09" (1/1) ... [2024-11-22 10:50:09,525 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 10:50:09,671 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_25-while_file-34.i[915,928] [2024-11-22 10:50:09,703 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 10:50:09,715 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 10:50:09,726 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_25-while_file-34.i[915,928] [2024-11-22 10:50:09,741 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 10:50:09,785 INFO L204 MainTranslator]: Completed translation [2024-11-22 10:50:09,786 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:50:09 WrapperNode [2024-11-22 10:50:09,786 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 10:50:09,787 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 10:50:09,787 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 10:50:09,787 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 10:50:09,798 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:50:09" (1/1) ... [2024-11-22 10:50:09,830 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:50:09" (1/1) ... [2024-11-22 10:50:09,850 INFO L138 Inliner]: procedures = 26, calls = 22, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 88 [2024-11-22 10:50:09,851 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 10:50:09,851 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 10:50:09,851 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 10:50:09,851 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 10:50:09,860 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:50:09" (1/1) ... [2024-11-22 10:50:09,860 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:50:09" (1/1) ... [2024-11-22 10:50:09,862 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:50:09" (1/1) ... [2024-11-22 10:50:09,878 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-22 10:50:09,879 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:50:09" (1/1) ... [2024-11-22 10:50:09,879 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:50:09" (1/1) ... [2024-11-22 10:50:09,882 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:50:09" (1/1) ... [2024-11-22 10:50:09,885 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:50:09" (1/1) ... [2024-11-22 10:50:09,886 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:50:09" (1/1) ... [2024-11-22 10:50:09,886 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:50:09" (1/1) ... [2024-11-22 10:50:09,888 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 10:50:09,893 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 10:50:09,893 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 10:50:09,893 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 10:50:09,894 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:50:09" (1/1) ... [2024-11-22 10:50:09,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 10:50:09,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 10:50:09,931 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-22 10:50:09,937 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-22 10:50:09,973 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 10:50:09,973 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-22 10:50:09,974 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-22 10:50:09,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-22 10:50:09,974 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 10:50:09,974 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 10:50:10,036 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 10:50:10,039 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 10:50:10,194 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-22 10:50:10,195 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 10:50:10,206 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 10:50:10,206 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-22 10:50:10,206 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:50:10 BoogieIcfgContainer [2024-11-22 10:50:10,207 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 10:50:10,209 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 10:50:10,209 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 10:50:10,212 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 10:50:10,212 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 10:50:09" (1/3) ... [2024-11-22 10:50:10,213 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43bd6105 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 10:50:10, skipping insertion in model container [2024-11-22 10:50:10,213 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:50:09" (2/3) ... [2024-11-22 10:50:10,214 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43bd6105 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 10:50:10, skipping insertion in model container [2024-11-22 10:50:10,214 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:50:10" (3/3) ... [2024-11-22 10:50:10,215 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-34.i [2024-11-22 10:50:10,228 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 10:50:10,228 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-22 10:50:10,290 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 10:50:10,295 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;@75e158e4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 10:50:10,296 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-22 10:50:10,299 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 28 states have internal predecessors, (37), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-22 10:50:10,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-22 10:50:10,308 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:50:10,309 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 10:50:10,309 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:50:10,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:50:10,314 INFO L85 PathProgramCache]: Analyzing trace with hash 857054501, now seen corresponding path program 1 times [2024-11-22 10:50:10,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 10:50:10,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828278959] [2024-11-22 10:50:10,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:50:10,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 10:50:10,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:50:10,552 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2024-11-22 10:50:10,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 10:50:10,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828278959] [2024-11-22 10:50:10,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828278959] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 10:50:10,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [945016536] [2024-11-22 10:50:10,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:50:10,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 10:50:10,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 10:50:10,561 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-22 10:50:10,563 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-22 10:50:10,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:50:10,665 INFO L255 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-22 10:50:10,671 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 10:50:10,687 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2024-11-22 10:50:10,688 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 10:50:10,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [945016536] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 10:50:10,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 10:50:10,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-22 10:50:10,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299904794] [2024-11-22 10:50:10,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 10:50:10,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-22 10:50:10,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 10:50:10,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-22 10:50:10,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 10:50:10,718 INFO L87 Difference]: Start difference. First operand has 39 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 28 states have internal predecessors, (37), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-22 10:50:10,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 10:50:10,738 INFO L93 Difference]: Finished difference Result 71 states and 113 transitions. [2024-11-22 10:50:10,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-22 10:50:10,741 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 63 [2024-11-22 10:50:10,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 10:50:10,748 INFO L225 Difference]: With dead ends: 71 [2024-11-22 10:50:10,748 INFO L226 Difference]: Without dead ends: 35 [2024-11-22 10:50:10,751 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 64 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-22 10:50:10,754 INFO L432 NwaCegarLoop]: 48 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, 48 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-22 10:50:10,755 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 10:50:10,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-11-22 10:50:10,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-11-22 10:50:10,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 24 states have (on average 1.25) internal successors, (30), 24 states have internal predecessors, (30), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-22 10:50:10,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 48 transitions. [2024-11-22 10:50:10,788 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 48 transitions. Word has length 63 [2024-11-22 10:50:10,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 10:50:10,788 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 48 transitions. [2024-11-22 10:50:10,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-22 10:50:10,788 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 48 transitions. [2024-11-22 10:50:10,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-22 10:50:10,790 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:50:10,790 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 10:50:10,804 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-22 10:50:10,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-22 10:50:10,991 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:50:10,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:50:10,992 INFO L85 PathProgramCache]: Analyzing trace with hash -2129341725, now seen corresponding path program 1 times [2024-11-22 10:50:10,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 10:50:10,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703061063] [2024-11-22 10:50:10,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:50:10,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 10:50:11,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:50:12,710 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-22 10:50:12,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 10:50:12,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703061063] [2024-11-22 10:50:12,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703061063] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 10:50:12,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 10:50:12,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-22 10:50:12,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020833232] [2024-11-22 10:50:12,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 10:50:12,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-22 10:50:12,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 10:50:12,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-22 10:50:12,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-22 10:50:12,716 INFO L87 Difference]: Start difference. First operand 35 states and 48 transitions. Second operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-22 10:50:13,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 10:50:13,002 INFO L93 Difference]: Finished difference Result 94 states and 124 transitions. [2024-11-22 10:50:13,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-22 10:50:13,003 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 63 [2024-11-22 10:50:13,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 10:50:13,007 INFO L225 Difference]: With dead ends: 94 [2024-11-22 10:50:13,008 INFO L226 Difference]: Without dead ends: 92 [2024-11-22 10:50:13,008 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2024-11-22 10:50:13,010 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 61 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 10:50:13,010 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 202 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 10:50:13,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-22 10:50:13,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 71. [2024-11-22 10:50:13,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 50 states have (on average 1.28) internal successors, (64), 50 states have internal predecessors, (64), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-22 10:50:13,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 100 transitions. [2024-11-22 10:50:13,033 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 100 transitions. Word has length 63 [2024-11-22 10:50:13,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 10:50:13,033 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 100 transitions. [2024-11-22 10:50:13,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-22 10:50:13,034 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 100 transitions. [2024-11-22 10:50:13,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-22 10:50:13,036 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:50:13,036 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 10:50:13,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-22 10:50:13,037 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:50:13,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:50:13,038 INFO L85 PathProgramCache]: Analyzing trace with hash -2127494683, now seen corresponding path program 1 times [2024-11-22 10:50:13,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 10:50:13,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704162750] [2024-11-22 10:50:13,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:50:13,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 10:50:13,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:50:14,152 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-22 10:50:14,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 10:50:14,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704162750] [2024-11-22 10:50:14,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704162750] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 10:50:14,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 10:50:14,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-22 10:50:14,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139108553] [2024-11-22 10:50:14,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 10:50:14,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-22 10:50:14,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 10:50:14,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-22 10:50:14,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-22 10:50:14,155 INFO L87 Difference]: Start difference. First operand 71 states and 100 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-22 10:50:14,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 10:50:14,439 INFO L93 Difference]: Finished difference Result 234 states and 315 transitions. [2024-11-22 10:50:14,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-22 10:50:14,440 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 63 [2024-11-22 10:50:14,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 10:50:14,441 INFO L225 Difference]: With dead ends: 234 [2024-11-22 10:50:14,441 INFO L226 Difference]: Without dead ends: 166 [2024-11-22 10:50:14,442 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-11-22 10:50:14,443 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 72 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 10:50:14,443 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 308 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 10:50:14,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2024-11-22 10:50:14,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 140. [2024-11-22 10:50:14,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 95 states have (on average 1.168421052631579) internal successors, (111), 95 states have internal predecessors, (111), 36 states have call successors, (36), 8 states have call predecessors, (36), 8 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-22 10:50:14,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 183 transitions. [2024-11-22 10:50:14,468 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 183 transitions. Word has length 63 [2024-11-22 10:50:14,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 10:50:14,472 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 183 transitions. [2024-11-22 10:50:14,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-22 10:50:14,472 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 183 transitions. [2024-11-22 10:50:14,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-22 10:50:14,474 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:50:14,474 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 10:50:14,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-22 10:50:14,474 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:50:14,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:50:14,474 INFO L85 PathProgramCache]: Analyzing trace with hash -615999721, now seen corresponding path program 1 times [2024-11-22 10:50:14,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 10:50:14,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154181550] [2024-11-22 10:50:14,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:50:14,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 10:50:14,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:50:14,591 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-22 10:50:14,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 10:50:14,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154181550] [2024-11-22 10:50:14,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154181550] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 10:50:14,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 10:50:14,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 10:50:14,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230600821] [2024-11-22 10:50:14,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 10:50:14,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 10:50:14,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 10:50:14,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 10:50:14,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 10:50:14,596 INFO L87 Difference]: Start difference. First operand 140 states and 183 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-22 10:50:14,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 10:50:14,696 INFO L93 Difference]: Finished difference Result 367 states and 486 transitions. [2024-11-22 10:50:14,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 10:50:14,697 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 64 [2024-11-22 10:50:14,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 10:50:14,699 INFO L225 Difference]: With dead ends: 367 [2024-11-22 10:50:14,700 INFO L226 Difference]: Without dead ends: 230 [2024-11-22 10:50:14,701 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-22 10:50:14,705 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 55 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 10:50:14,707 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 137 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 10:50:14,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2024-11-22 10:50:14,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 186. [2024-11-22 10:50:14,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 121 states have (on average 1.1487603305785123) internal successors, (139), 123 states have internal predecessors, (139), 54 states have call successors, (54), 10 states have call predecessors, (54), 10 states have return successors, (54), 52 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-22 10:50:14,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 247 transitions. [2024-11-22 10:50:14,754 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 247 transitions. Word has length 64 [2024-11-22 10:50:14,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 10:50:14,754 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 247 transitions. [2024-11-22 10:50:14,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-22 10:50:14,755 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 247 transitions. [2024-11-22 10:50:14,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-22 10:50:14,755 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:50:14,756 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 10:50:14,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-22 10:50:14,756 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:50:14,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:50:14,756 INFO L85 PathProgramCache]: Analyzing trace with hash -356597792, now seen corresponding path program 1 times [2024-11-22 10:50:14,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 10:50:14,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228254215] [2024-11-22 10:50:14,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:50:14,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 10:50:14,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:50:16,110 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-22 10:50:16,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 10:50:16,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228254215] [2024-11-22 10:50:16,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228254215] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 10:50:16,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 10:50:16,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-22 10:50:16,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103450643] [2024-11-22 10:50:16,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 10:50:16,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-22 10:50:16,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 10:50:16,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-22 10:50:16,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-22 10:50:16,113 INFO L87 Difference]: Start difference. First operand 186 states and 247 transitions. Second operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-22 10:50:16,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 10:50:16,340 INFO L93 Difference]: Finished difference Result 319 states and 419 transitions. [2024-11-22 10:50:16,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-22 10:50:16,340 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 64 [2024-11-22 10:50:16,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 10:50:16,343 INFO L225 Difference]: With dead ends: 319 [2024-11-22 10:50:16,343 INFO L226 Difference]: Without dead ends: 228 [2024-11-22 10:50:16,344 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2024-11-22 10:50:16,345 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 33 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 10:50:16,345 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 237 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 10:50:16,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2024-11-22 10:50:16,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 192. [2024-11-22 10:50:16,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 127 states have (on average 1.1574803149606299) internal successors, (147), 129 states have internal predecessors, (147), 54 states have call successors, (54), 10 states have call predecessors, (54), 10 states have return successors, (54), 52 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-22 10:50:16,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 255 transitions. [2024-11-22 10:50:16,376 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 255 transitions. Word has length 64 [2024-11-22 10:50:16,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 10:50:16,376 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 255 transitions. [2024-11-22 10:50:16,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-22 10:50:16,376 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 255 transitions. [2024-11-22 10:50:16,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-22 10:50:16,377 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:50:16,377 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 10:50:16,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-22 10:50:16,378 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:50:16,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:50:16,380 INFO L85 PathProgramCache]: Analyzing trace with hash -299339490, now seen corresponding path program 1 times [2024-11-22 10:50:16,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 10:50:16,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087214513] [2024-11-22 10:50:16,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:50:16,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 10:50:16,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:50:16,564 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-11-22 10:50:16,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 10:50:16,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087214513] [2024-11-22 10:50:16,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087214513] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 10:50:16,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1561844093] [2024-11-22 10:50:16,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:50:16,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 10:50:16,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 10:50:16,571 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-22 10:50:16,572 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-22 10:50:16,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:50:16,644 INFO L255 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-22 10:50:16,648 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 10:50:16,718 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 80 proven. 12 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-11-22 10:50:16,719 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 10:50:16,835 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-11-22 10:50:16,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1561844093] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 10:50:16,836 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 10:50:16,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2024-11-22 10:50:16,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898727296] [2024-11-22 10:50:16,836 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 10:50:16,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-22 10:50:16,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 10:50:16,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-22 10:50:16,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-22 10:50:16,838 INFO L87 Difference]: Start difference. First operand 192 states and 255 transitions. Second operand has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 2 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-22 10:50:16,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 10:50:16,988 INFO L93 Difference]: Finished difference Result 309 states and 398 transitions. [2024-11-22 10:50:16,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-22 10:50:16,989 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 2 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 64 [2024-11-22 10:50:16,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 10:50:16,991 INFO L225 Difference]: With dead ends: 309 [2024-11-22 10:50:16,991 INFO L226 Difference]: Without dead ends: 120 [2024-11-22 10:50:16,992 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 125 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2024-11-22 10:50:16,993 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 88 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 10:50:16,993 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 72 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 10:50:16,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-11-22 10:50:17,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 108. [2024-11-22 10:50:17,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 72 states have (on average 1.0833333333333333) internal successors, (78), 73 states have internal predecessors, (78), 27 states have call successors, (27), 8 states have call predecessors, (27), 8 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-22 10:50:17,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 132 transitions. [2024-11-22 10:50:17,010 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 132 transitions. Word has length 64 [2024-11-22 10:50:17,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 10:50:17,010 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 132 transitions. [2024-11-22 10:50:17,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 2 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-22 10:50:17,011 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 132 transitions. [2024-11-22 10:50:17,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-22 10:50:17,012 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:50:17,013 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 10:50:17,024 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-22 10:50:17,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-22 10:50:17,214 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:50:17,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:50:17,215 INFO L85 PathProgramCache]: Analyzing trace with hash 319681300, now seen corresponding path program 1 times [2024-11-22 10:50:17,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 10:50:17,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014051583] [2024-11-22 10:50:17,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:50:17,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 10:50:17,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:50:17,483 INFO L134 CoverageAnalysis]: Checked inductivity of 635 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-22 10:50:17,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 10:50:17,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014051583] [2024-11-22 10:50:17,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014051583] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 10:50:17,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 10:50:17,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 10:50:17,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389835999] [2024-11-22 10:50:17,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 10:50:17,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 10:50:17,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 10:50:17,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 10:50:17,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-22 10:50:17,486 INFO L87 Difference]: Start difference. First operand 108 states and 132 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-22 10:50:17,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 10:50:17,604 INFO L93 Difference]: Finished difference Result 221 states and 267 transitions. [2024-11-22 10:50:17,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 10:50:17,605 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 124 [2024-11-22 10:50:17,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 10:50:17,608 INFO L225 Difference]: With dead ends: 221 [2024-11-22 10:50:17,609 INFO L226 Difference]: Without dead ends: 116 [2024-11-22 10:50:17,609 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-22 10:50:17,610 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 45 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 10:50:17,612 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 56 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 10:50:17,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-22 10:50:17,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 99. [2024-11-22 10:50:17,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 69 states have (on average 1.0724637681159421) internal successors, (74), 70 states have internal predecessors, (74), 21 states have call successors, (21), 8 states have call predecessors, (21), 8 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-22 10:50:17,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 116 transitions. [2024-11-22 10:50:17,635 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 116 transitions. Word has length 124 [2024-11-22 10:50:17,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 10:50:17,636 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 116 transitions. [2024-11-22 10:50:17,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-22 10:50:17,636 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 116 transitions. [2024-11-22 10:50:17,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-22 10:50:17,641 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:50:17,641 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 10:50:17,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-22 10:50:17,641 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:50:17,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:50:17,642 INFO L85 PathProgramCache]: Analyzing trace with hash -489665326, now seen corresponding path program 1 times [2024-11-22 10:50:17,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 10:50:17,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338951126] [2024-11-22 10:50:17,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:50:17,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 10:50:17,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:50:19,005 INFO L134 CoverageAnalysis]: Checked inductivity of 635 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 629 trivial. 0 not checked. [2024-11-22 10:50:19,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 10:50:19,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338951126] [2024-11-22 10:50:19,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338951126] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 10:50:19,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1233439696] [2024-11-22 10:50:19,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:50:19,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 10:50:19,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 10:50:19,009 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-22 10:50:19,012 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-22 10:50:19,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:50:19,078 INFO L255 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-22 10:50:19,090 INFO L278 TraceCheckSpWp]: Computing forward predicates...