./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/ps6-ll_unwindbound20.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f 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/nla-digbench-scaling/ps6-ll_unwindbound20.c -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 946e199240c0e980bd422384e40e4d2247ef6b3560471b18ba5a354c3628dba9 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 20:23:06,074 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 20:23:06,146 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 20:23:06,150 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 20:23:06,150 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 20:23:06,171 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 20:23:06,171 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 20:23:06,172 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 20:23:06,172 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 20:23:06,173 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 20:23:06,173 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 20:23:06,173 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 20:23:06,174 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 20:23:06,174 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 20:23:06,175 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 20:23:06,175 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 20:23:06,175 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 20:23:06,176 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 20:23:06,176 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 20:23:06,176 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 20:23:06,177 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 20:23:06,177 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 20:23:06,178 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 20:23:06,178 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 20:23:06,178 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 20:23:06,179 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 20:23:06,179 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 20:23:06,179 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 20:23:06,180 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 20:23:06,180 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 20:23:06,180 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 20:23:06,180 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 20:23:06,181 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 20:23:06,181 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 20:23:06,181 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 20:23:06,182 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 20:23:06,182 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 20:23:06,182 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 20:23:06,182 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 20:23:06,182 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 20:23:06,183 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 20:23:06,183 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 20:23:06,183 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 -> 946e199240c0e980bd422384e40e4d2247ef6b3560471b18ba5a354c3628dba9 [2024-11-11 20:23:06,419 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 20:23:06,443 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 20:23:06,446 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 20:23:06,447 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 20:23:06,448 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 20:23:06,449 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/ps6-ll_unwindbound20.c [2024-11-11 20:23:07,908 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 20:23:08,076 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 20:23:08,077 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/ps6-ll_unwindbound20.c [2024-11-11 20:23:08,084 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9566ba588/8e72971815b24cbab47a6f33d58f7830/FLAGc83727ac0 [2024-11-11 20:23:08,479 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9566ba588/8e72971815b24cbab47a6f33d58f7830 [2024-11-11 20:23:08,481 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 20:23:08,482 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 20:23:08,483 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 20:23:08,484 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 20:23:08,489 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 20:23:08,489 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 08:23:08" (1/1) ... [2024-11-11 20:23:08,490 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43b3e21c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:23:08, skipping insertion in model container [2024-11-11 20:23:08,490 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 08:23:08" (1/1) ... [2024-11-11 20:23:08,509 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 20:23:08,694 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/nla-digbench-scaling/ps6-ll_unwindbound20.c[458,471] [2024-11-11 20:23:08,711 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 20:23:08,726 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 20:23:08,737 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/nla-digbench-scaling/ps6-ll_unwindbound20.c[458,471] [2024-11-11 20:23:08,743 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 20:23:08,756 INFO L204 MainTranslator]: Completed translation [2024-11-11 20:23:08,757 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:23:08 WrapperNode [2024-11-11 20:23:08,757 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 20:23:08,757 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 20:23:08,758 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 20:23:08,758 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 20:23:08,765 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:23:08" (1/1) ... [2024-11-11 20:23:08,770 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:23:08" (1/1) ... [2024-11-11 20:23:08,785 INFO L138 Inliner]: procedures = 14, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 43 [2024-11-11 20:23:08,785 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 20:23:08,786 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 20:23:08,786 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 20:23:08,786 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 20:23:08,795 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:23:08" (1/1) ... [2024-11-11 20:23:08,795 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:23:08" (1/1) ... [2024-11-11 20:23:08,796 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:23:08" (1/1) ... [2024-11-11 20:23:08,808 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-11 20:23:08,808 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:23:08" (1/1) ... [2024-11-11 20:23:08,808 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:23:08" (1/1) ... [2024-11-11 20:23:08,812 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:23:08" (1/1) ... [2024-11-11 20:23:08,816 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:23:08" (1/1) ... [2024-11-11 20:23:08,818 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:23:08" (1/1) ... [2024-11-11 20:23:08,822 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:23:08" (1/1) ... [2024-11-11 20:23:08,825 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 20:23:08,826 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 20:23:08,826 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 20:23:08,827 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 20:23:08,827 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:23:08" (1/1) ... [2024-11-11 20:23:08,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 20:23:08,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:23:08,860 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-11 20:23:08,863 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-11 20:23:08,905 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 20:23:08,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 20:23:08,905 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 20:23:08,905 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 20:23:08,905 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-11 20:23:08,906 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-11 20:23:08,972 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 20:23:08,975 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 20:23:09,114 INFO L? ?]: Removed 7 outVars from TransFormulas that were not future-live. [2024-11-11 20:23:09,114 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 20:23:09,125 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 20:23:09,125 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-11 20:23:09,126 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 08:23:09 BoogieIcfgContainer [2024-11-11 20:23:09,126 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 20:23:09,128 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 20:23:09,128 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 20:23:09,131 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 20:23:09,131 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 08:23:08" (1/3) ... [2024-11-11 20:23:09,132 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44a5568 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 08:23:09, skipping insertion in model container [2024-11-11 20:23:09,132 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:23:08" (2/3) ... [2024-11-11 20:23:09,132 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44a5568 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 08:23:09, skipping insertion in model container [2024-11-11 20:23:09,132 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 08:23:09" (3/3) ... [2024-11-11 20:23:09,133 INFO L112 eAbstractionObserver]: Analyzing ICFG ps6-ll_unwindbound20.c [2024-11-11 20:23:09,145 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 20:23:09,145 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-11 20:23:09,198 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 20:23:09,204 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;@2e6cc9c6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 20:23:09,204 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-11 20:23:09,209 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-11 20:23:09,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-11 20:23:09,215 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:23:09,215 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:23:09,216 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:23:09,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:23:09,220 INFO L85 PathProgramCache]: Analyzing trace with hash -579246775, now seen corresponding path program 1 times [2024-11-11 20:23:09,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:23:09,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153722294] [2024-11-11 20:23:09,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:23:09,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:23:09,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:23:09,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 20:23:09,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:23:09,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153722294] [2024-11-11 20:23:09,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153722294] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:23:09,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:23:09,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 20:23:09,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102051466] [2024-11-11 20:23:09,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:23:09,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-11 20:23:09,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:23:09,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-11 20:23:09,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-11 20:23:09,387 INFO L87 Difference]: Start difference. First operand has 20 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 20:23:09,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:23:09,403 INFO L93 Difference]: Finished difference Result 37 states and 51 transitions. [2024-11-11 20:23:09,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 20:23:09,405 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-11 20:23:09,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:23:09,410 INFO L225 Difference]: With dead ends: 37 [2024-11-11 20:23:09,410 INFO L226 Difference]: Without dead ends: 16 [2024-11-11 20:23:09,413 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 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-11 20:23:09,416 INFO L435 NwaCegarLoop]: 23 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, 23 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-11 20:23:09,417 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:23:09,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2024-11-11 20:23:09,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2024-11-11 20:23:09,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-11 20:23:09,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2024-11-11 20:23:09,448 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 19 transitions. Word has length 9 [2024-11-11 20:23:09,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:23:09,448 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 19 transitions. [2024-11-11 20:23:09,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 20:23:09,449 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2024-11-11 20:23:09,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-11 20:23:09,450 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:23:09,450 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:23:09,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 20:23:09,450 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:23:09,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:23:09,451 INFO L85 PathProgramCache]: Analyzing trace with hash -1986551203, now seen corresponding path program 1 times [2024-11-11 20:23:09,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:23:09,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354721720] [2024-11-11 20:23:09,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:23:09,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:23:09,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:23:09,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 20:23:09,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:23:09,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354721720] [2024-11-11 20:23:09,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354721720] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:23:09,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:23:09,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 20:23:09,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226930355] [2024-11-11 20:23:09,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:23:09,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 20:23:09,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:23:09,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 20:23:09,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 20:23:09,554 INFO L87 Difference]: Start difference. First operand 16 states and 19 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 20:23:09,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:23:09,588 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2024-11-11 20:23:09,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 20:23:09,590 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-11 20:23:09,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:23:09,591 INFO L225 Difference]: With dead ends: 26 [2024-11-11 20:23:09,591 INFO L226 Difference]: Without dead ends: 18 [2024-11-11 20:23:09,591 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 20:23:09,592 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 0 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:23:09,593 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 45 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:23:09,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2024-11-11 20:23:09,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2024-11-11 20:23:09,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 14 states have internal predecessors, (16), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-11 20:23:09,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2024-11-11 20:23:09,602 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 10 [2024-11-11 20:23:09,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:23:09,603 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2024-11-11 20:23:09,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 20:23:09,604 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2024-11-11 20:23:09,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-11 20:23:09,604 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:23:09,605 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:23:09,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-11 20:23:09,606 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:23:09,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:23:09,607 INFO L85 PathProgramCache]: Analyzing trace with hash -1984763743, now seen corresponding path program 1 times [2024-11-11 20:23:09,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:23:09,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517744580] [2024-11-11 20:23:09,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:23:09,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:23:09,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-11 20:23:09,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [438537236] [2024-11-11 20:23:09,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:23:09,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:23:09,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:23:09,653 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-11 20:23:09,655 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-11 20:23:09,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:23:09,728 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-11 20:23:09,735 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:23:09,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 20:23:09,892 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 20:23:09,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:23:09,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517744580] [2024-11-11 20:23:09,893 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-11 20:23:09,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [438537236] [2024-11-11 20:23:09,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [438537236] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:23:09,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:23:09,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 20:23:09,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887837777] [2024-11-11 20:23:09,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:23:09,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 20:23:09,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:23:09,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 20:23:09,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 20:23:09,900 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 20:23:09,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:23:09,964 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2024-11-11 20:23:09,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 20:23:09,965 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-11 20:23:09,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:23:09,966 INFO L225 Difference]: With dead ends: 28 [2024-11-11 20:23:09,966 INFO L226 Difference]: Without dead ends: 24 [2024-11-11 20:23:09,966 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-11 20:23:09,967 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 4 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:23:09,968 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 59 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:23:09,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-11-11 20:23:09,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-11-11 20:23:09,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-11 20:23:09,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2024-11-11 20:23:09,975 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 10 [2024-11-11 20:23:09,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:23:09,975 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2024-11-11 20:23:09,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 20:23:09,975 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2024-11-11 20:23:09,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-11 20:23:09,976 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:23:09,976 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:23:09,995 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-11 20:23:10,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:23:10,181 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:23:10,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:23:10,182 INFO L85 PathProgramCache]: Analyzing trace with hash -69803837, now seen corresponding path program 1 times [2024-11-11 20:23:10,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:23:10,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119642592] [2024-11-11 20:23:10,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:23:10,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:23:10,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:23:10,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:23:10,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:23:10,320 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 20:23:10,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:23:10,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119642592] [2024-11-11 20:23:10,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119642592] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 20:23:10,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2001701617] [2024-11-11 20:23:10,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:23:10,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:23:10,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:23:10,326 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-11 20:23:10,328 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-11 20:23:10,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:23:10,384 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-11 20:23:10,385 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:23:10,419 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 20:23:10,420 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 20:23:10,481 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 20:23:10,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2001701617] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 20:23:10,481 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 20:23:10,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 5] total 8 [2024-11-11 20:23:10,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779261043] [2024-11-11 20:23:10,482 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 20:23:10,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-11 20:23:10,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:23:10,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-11 20:23:10,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-11 20:23:10,484 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-11 20:23:10,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:23:10,561 INFO L93 Difference]: Finished difference Result 58 states and 68 transitions. [2024-11-11 20:23:10,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-11 20:23:10,561 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 18 [2024-11-11 20:23:10,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:23:10,562 INFO L225 Difference]: With dead ends: 58 [2024-11-11 20:23:10,563 INFO L226 Difference]: Without dead ends: 50 [2024-11-11 20:23:10,564 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-11 20:23:10,566 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 23 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:23:10,567 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 67 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:23:10,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-11-11 20:23:10,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 46. [2024-11-11 20:23:10,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 34 states have internal predecessors, (38), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-11 20:23:10,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 55 transitions. [2024-11-11 20:23:10,579 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 55 transitions. Word has length 18 [2024-11-11 20:23:10,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:23:10,580 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 55 transitions. [2024-11-11 20:23:10,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-11 20:23:10,580 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 55 transitions. [2024-11-11 20:23:10,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-11 20:23:10,581 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:23:10,581 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:23:10,596 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-11 20:23:10,783 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,SelfDestructingSolverStorable3 [2024-11-11 20:23:10,784 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:23:10,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:23:10,785 INFO L85 PathProgramCache]: Analyzing trace with hash -68016377, now seen corresponding path program 1 times [2024-11-11 20:23:10,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:23:10,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512650350] [2024-11-11 20:23:10,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:23:10,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:23:10,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-11 20:23:10,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1662545470] [2024-11-11 20:23:10,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:23:10,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:23:10,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:23:10,810 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-11 20:23:10,813 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-11 20:23:10,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:23:10,867 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-11 20:23:10,869 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:23:10,958 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 20:23:10,960 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 20:23:11,061 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-11 20:23:11,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:23:11,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512650350] [2024-11-11 20:23:11,064 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-11 20:23:11,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1662545470] [2024-11-11 20:23:11,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1662545470] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-11 20:23:11,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 20:23:11,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2024-11-11 20:23:11,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526365504] [2024-11-11 20:23:11,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:23:11,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 20:23:11,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:23:11,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 20:23:11,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:23:11,069 INFO L87 Difference]: Start difference. First operand 46 states and 55 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-11 20:23:11,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:23:11,130 INFO L93 Difference]: Finished difference Result 60 states and 68 transitions. [2024-11-11 20:23:11,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 20:23:11,131 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2024-11-11 20:23:11,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:23:11,134 INFO L225 Difference]: With dead ends: 60 [2024-11-11 20:23:11,137 INFO L226 Difference]: Without dead ends: 52 [2024-11-11 20:23:11,138 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-11 20:23:11,139 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 5 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:23:11,139 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 47 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:23:11,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-11-11 20:23:11,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 46. [2024-11-11 20:23:11,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 33 states have (on average 1.121212121212121) internal successors, (37), 35 states have internal predecessors, (37), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-11 20:23:11,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2024-11-11 20:23:11,165 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 52 transitions. Word has length 18 [2024-11-11 20:23:11,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:23:11,166 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 52 transitions. [2024-11-11 20:23:11,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-11 20:23:11,170 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2024-11-11 20:23:11,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-11 20:23:11,171 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:23:11,171 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:23:11,188 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-11 20:23:11,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:23:11,376 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:23:11,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:23:11,376 INFO L85 PathProgramCache]: Analyzing trace with hash 156635680, now seen corresponding path program 1 times [2024-11-11 20:23:11,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:23:11,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503643101] [2024-11-11 20:23:11,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:23:11,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:23:11,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-11 20:23:11,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [824502193] [2024-11-11 20:23:11,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:23:11,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:23:11,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:23:11,417 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 20:23:11,421 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-11 20:23:11,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:23:11,466 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-11 20:23:11,468 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:23:11,565 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-11 20:23:11,565 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 20:23:11,671 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-11 20:23:11,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:23:11,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503643101] [2024-11-11 20:23:11,672 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-11 20:23:11,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [824502193] [2024-11-11 20:23:11,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [824502193] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 20:23:11,672 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-11 20:23:11,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2024-11-11 20:23:11,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066224068] [2024-11-11 20:23:11,672 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-11 20:23:11,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-11 20:23:11,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:23:11,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-11 20:23:11,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-11 20:23:11,674 INFO L87 Difference]: Start difference. First operand 46 states and 52 transitions. Second operand has 10 states, 8 states have (on average 2.875) internal successors, (23), 9 states have internal predecessors, (23), 6 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-11 20:23:11,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:23:11,863 INFO L93 Difference]: Finished difference Result 55 states and 63 transitions. [2024-11-11 20:23:11,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-11 20:23:11,864 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.875) internal successors, (23), 9 states have internal predecessors, (23), 6 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 29 [2024-11-11 20:23:11,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:23:11,865 INFO L225 Difference]: With dead ends: 55 [2024-11-11 20:23:11,867 INFO L226 Difference]: Without dead ends: 46 [2024-11-11 20:23:11,867 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2024-11-11 20:23:11,868 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 1 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 20:23:11,868 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 91 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 20:23:11,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-11-11 20:23:11,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-11-11 20:23:11,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 34 states have (on average 1.0588235294117647) internal successors, (36), 34 states have internal predecessors, (36), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-11 20:23:11,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2024-11-11 20:23:11,891 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 29 [2024-11-11 20:23:11,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:23:11,891 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 49 transitions. [2024-11-11 20:23:11,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 2.875) internal successors, (23), 9 states have internal predecessors, (23), 6 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-11 20:23:11,892 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2024-11-11 20:23:11,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-11 20:23:11,893 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:23:11,893 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:23:11,911 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-11 20:23:12,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:23:12,094 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:23:12,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:23:12,095 INFO L85 PathProgramCache]: Analyzing trace with hash -1854611729, now seen corresponding path program 1 times [2024-11-11 20:23:12,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:23:12,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134930471] [2024-11-11 20:23:12,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:23:12,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:23:12,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:23:12,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:23:12,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:23:12,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-11 20:23:12,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:23:12,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-11 20:23:12,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:23:12,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 20:23:12,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:23:12,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-11 20:23:12,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:23:12,366 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 10 proven. 32 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-11 20:23:12,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:23:12,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134930471] [2024-11-11 20:23:12,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134930471] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 20:23:12,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [414756321] [2024-11-11 20:23:12,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:23:12,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:23:12,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:23:12,369 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 20:23:12,370 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-11 20:23:12,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:23:12,426 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-11 20:23:12,428 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:23:12,486 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 24 proven. 56 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-11 20:23:12,486 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 20:23:12,607 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 10 proven. 32 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-11 20:23:12,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [414756321] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 20:23:12,608 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 20:23:12,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 14 [2024-11-11 20:23:12,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159898591] [2024-11-11 20:23:12,608 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 20:23:12,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-11 20:23:12,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:23:12,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-11 20:23:12,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2024-11-11 20:23:12,610 INFO L87 Difference]: Start difference. First operand 46 states and 49 transitions. Second operand has 14 states, 14 states have (on average 4.0) internal successors, (56), 14 states have internal predecessors, (56), 9 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (14), 9 states have call predecessors, (14), 9 states have call successors, (14) [2024-11-11 20:23:12,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:23:12,850 INFO L93 Difference]: Finished difference Result 132 states and 144 transitions. [2024-11-11 20:23:12,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-11 20:23:12,851 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.0) internal successors, (56), 14 states have internal predecessors, (56), 9 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (14), 9 states have call predecessors, (14), 9 states have call successors, (14) Word has length 47 [2024-11-11 20:23:12,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:23:12,852 INFO L225 Difference]: With dead ends: 132 [2024-11-11 20:23:12,852 INFO L226 Difference]: Without dead ends: 122 [2024-11-11 20:23:12,853 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=184, Invalid=322, Unknown=0, NotChecked=0, Total=506 [2024-11-11 20:23:12,853 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 77 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 20:23:12,854 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 106 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 20:23:12,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-11 20:23:12,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 97. [2024-11-11 20:23:12,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 69 states have (on average 1.1014492753623188) internal successors, (76), 74 states have internal predecessors, (76), 17 states have call successors, (17), 11 states have call predecessors, (17), 10 states have return successors, (16), 11 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-11 20:23:12,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 109 transitions. [2024-11-11 20:23:12,879 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 109 transitions. Word has length 47 [2024-11-11 20:23:12,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:23:12,880 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 109 transitions. [2024-11-11 20:23:12,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.0) internal successors, (56), 14 states have internal predecessors, (56), 9 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (14), 9 states have call predecessors, (14), 9 states have call successors, (14) [2024-11-11 20:23:12,880 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 109 transitions. [2024-11-11 20:23:12,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-11 20:23:12,881 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:23:12,882 INFO L218 NwaCegarLoop]: trace histogram [7, 6, 6, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:23:12,900 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-11 20:23:13,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:23:13,083 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:23:13,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:23:13,083 INFO L85 PathProgramCache]: Analyzing trace with hash 348710830, now seen corresponding path program 2 times [2024-11-11 20:23:13,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:23:13,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096776706] [2024-11-11 20:23:13,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:23:13,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:23:13,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-11 20:23:13,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [433048395] [2024-11-11 20:23:13,123 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-11 20:23:13,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:23:13,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:23:13,126 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 20:23:13,129 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-11 20:23:13,188 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-11 20:23:13,188 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-11 20:23:13,190 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-11 20:23:13,192 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:23:13,429 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 12 proven. 40 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-11 20:23:13,429 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 20:23:13,730 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 12 proven. 40 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-11 20:23:13,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:23:13,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096776706] [2024-11-11 20:23:13,731 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-11 20:23:13,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [433048395] [2024-11-11 20:23:13,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [433048395] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 20:23:13,731 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-11 20:23:13,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 20 [2024-11-11 20:23:13,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863695518] [2024-11-11 20:23:13,731 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-11 20:23:13,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-11 20:23:13,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:23:13,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-11 20:23:13,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=313, Unknown=0, NotChecked=0, Total=380 [2024-11-11 20:23:13,733 INFO L87 Difference]: Start difference. First operand 97 states and 109 transitions. Second operand has 20 states, 18 states have (on average 2.5) internal successors, (45), 18 states have internal predecessors, (45), 12 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-11 20:23:14,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:23:14,206 INFO L93 Difference]: Finished difference Result 103 states and 114 transitions. [2024-11-11 20:23:14,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-11 20:23:14,206 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 2.5) internal successors, (45), 18 states have internal predecessors, (45), 12 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Word has length 53 [2024-11-11 20:23:14,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:23:14,207 INFO L225 Difference]: With dead ends: 103 [2024-11-11 20:23:14,208 INFO L226 Difference]: Without dead ends: 92 [2024-11-11 20:23:14,208 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=167, Invalid=703, Unknown=0, NotChecked=0, Total=870 [2024-11-11 20:23:14,209 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 24 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 20:23:14,209 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 254 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 20:23:14,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-11 20:23:14,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-11-11 20:23:14,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 69 states have (on average 1.0289855072463767) internal successors, (71), 69 states have internal predecessors, (71), 12 states have call successors, (12), 11 states have call predecessors, (12), 10 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-11 20:23:14,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 94 transitions. [2024-11-11 20:23:14,233 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 94 transitions. Word has length 53 [2024-11-11 20:23:14,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:23:14,233 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 94 transitions. [2024-11-11 20:23:14,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 2.5) internal successors, (45), 18 states have internal predecessors, (45), 12 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-11 20:23:14,234 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 94 transitions. [2024-11-11 20:23:14,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-11 20:23:14,236 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:23:14,236 INFO L218 NwaCegarLoop]: trace histogram [12, 11, 11, 10, 10, 10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:23:14,256 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-11 20:23:14,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:23:14,442 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:23:14,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:23:14,443 INFO L85 PathProgramCache]: Analyzing trace with hash -1207691024, now seen corresponding path program 3 times [2024-11-11 20:23:14,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:23:14,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898813952] [2024-11-11 20:23:14,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:23:14,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:23:14,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-11 20:23:14,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [141693090] [2024-11-11 20:23:14,495 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-11 20:23:14,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:23:14,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:23:14,498 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 20:23:14,499 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-11 20:23:14,648 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2024-11-11 20:23:14,648 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-11 20:23:14,655 INFO L256 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 54 conjuncts are in the unsatisfiable core [2024-11-11 20:23:14,659 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:23:14,976 INFO L134 CoverageAnalysis]: Checked inductivity of 422 backedges. 45 proven. 187 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-11 20:23:14,976 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 20:23:23,496 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|))) (or (= (+ |c_ULTIMATE.start_main_~y~0#1| .cse0) (+ |c_ULTIMATE.start_main_~c~0#1| (* |c_ULTIMATE.start_main_~c~0#1| |c_ULTIMATE.start_main_~y~0#1|))) (not (= 0 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 10) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 7) .cse0 (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 6)) 12))))) is different from false [2024-11-11 20:23:35,580 WARN L286 SmtUtils]: Spent 8.00s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-11 20:23:47,605 WARN L286 SmtUtils]: Spent 8.01s 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-11 20:23:55,626 WARN L873 $PredicateComparison]: unable to prove that (or (not (= |c___VERIFIER_assert_#in~cond| 0)) (forall ((|v_ULTIMATE.start_main_~c~0#1_BEFORE_CALL_26| Int) (|v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_39| Int)) (let ((.cse0 (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_39| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_39|))) (or (= (+ |v_ULTIMATE.start_main_~c~0#1_BEFORE_CALL_26| (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_39| |v_ULTIMATE.start_main_~c~0#1_BEFORE_CALL_26|)) (+ |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_39| .cse0)) (= (mod (+ .cse0 (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_39| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_39| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_39| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_39| 7) (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_39| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_39| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_39| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_39| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_39| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_39| 10) (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_39| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_39| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_39| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_39| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_39| 6)) 12) 0))))) is different from true [2024-11-11 20:24:07,650 WARN L286 SmtUtils]: Spent 8.01s 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-11 20:24:23,686 WARN L286 SmtUtils]: Spent 8.01s 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-11 20:24:31,708 WARN L873 $PredicateComparison]: unable to prove that (or (not (= |c___VERIFIER_assert_#in~cond| 0)) (= c___VERIFIER_assert_~cond 0) (forall ((|v_ULTIMATE.start_main_~c~0#1_BEFORE_CALL_26| Int) (|v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_39| Int)) (let ((.cse0 (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_39| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_39|))) (or (= (+ |v_ULTIMATE.start_main_~c~0#1_BEFORE_CALL_26| (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_39| |v_ULTIMATE.start_main_~c~0#1_BEFORE_CALL_26|)) (+ |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_39| .cse0)) (= (mod (+ .cse0 (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_39| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_39| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_39| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_39| 7) (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_39| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_39| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_39| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_39| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_39| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_39| 10) (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_39| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_39| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_39| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_39| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_39| 6)) 12) 0))))) is different from true [2024-11-11 20:24:47,766 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|))) (or (not (= 0 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 10) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 7) .cse0 (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 6)) 12))) (= (+ .cse0 (* |c_ULTIMATE.start_main_~y~0#1| 2)) (+ (* |c_ULTIMATE.start_main_~c~0#1| 2) (* |c_ULTIMATE.start_main_~c~0#1| |c_ULTIMATE.start_main_~y~0#1|))))) is different from false