./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/xcsp/AllInterval-010.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/xcsp/AllInterval-010.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 bfe1a42da562b3cff2a3558221569a45820196d22b493b00a35c820fb53c2bd2 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-19 23:05:07,055 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 23:05:07,109 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 23:05:07,115 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 23:05:07,115 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 23:05:07,134 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 23:05:07,134 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 23:05:07,134 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 23:05:07,135 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 23:05:07,136 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 23:05:07,136 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 23:05:07,137 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 23:05:07,137 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 23:05:07,140 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 23:05:07,140 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 23:05:07,140 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 23:05:07,141 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 23:05:07,142 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 23:05:07,142 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 23:05:07,142 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 23:05:07,142 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 23:05:07,142 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 23:05:07,143 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 23:05:07,143 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 23:05:07,143 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 23:05:07,144 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 23:05:07,144 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 23:05:07,144 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 23:05:07,144 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 23:05:07,145 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 23:05:07,145 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 23:05:07,145 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 23:05:07,145 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 23:05:07,146 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 23:05:07,146 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 23:05:07,146 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 23:05:07,146 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 23:05:07,147 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 23:05:07,147 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 23:05:07,147 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 23:05:07,147 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 23:05:07,148 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 23:05:07,148 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 -> bfe1a42da562b3cff2a3558221569a45820196d22b493b00a35c820fb53c2bd2 [2024-11-19 23:05:07,328 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 23:05:07,349 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 23:05:07,351 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 23:05:07,352 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 23:05:07,352 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 23:05:07,353 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/xcsp/AllInterval-010.c [2024-11-19 23:05:08,577 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 23:05:08,729 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 23:05:08,730 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/xcsp/AllInterval-010.c [2024-11-19 23:05:08,745 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59a3b1207/573a700cfe384669bf0fe5f979b1d5a7/FLAGcaff2132c [2024-11-19 23:05:08,759 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59a3b1207/573a700cfe384669bf0fe5f979b1d5a7 [2024-11-19 23:05:08,762 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 23:05:08,763 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 23:05:08,765 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 23:05:08,766 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 23:05:08,770 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 23:05:08,770 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 11:05:08" (1/1) ... [2024-11-19 23:05:08,771 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23a36ed8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:05:08, skipping insertion in model container [2024-11-19 23:05:08,771 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 11:05:08" (1/1) ... [2024-11-19 23:05:08,794 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 23:05:08,979 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/xcsp/AllInterval-010.c[5778,5791] [2024-11-19 23:05:08,986 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 23:05:09,001 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 23:05:09,041 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/xcsp/AllInterval-010.c[5778,5791] [2024-11-19 23:05:09,042 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 23:05:09,055 INFO L204 MainTranslator]: Completed translation [2024-11-19 23:05:09,056 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:05:09 WrapperNode [2024-11-19 23:05:09,056 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 23:05:09,057 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 23:05:09,057 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 23:05:09,057 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 23:05:09,062 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:05:09" (1/1) ... [2024-11-19 23:05:09,072 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:05:09" (1/1) ... [2024-11-19 23:05:09,097 INFO L138 Inliner]: procedures = 13, calls = 135, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 258 [2024-11-19 23:05:09,097 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 23:05:09,098 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 23:05:09,098 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 23:05:09,098 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 23:05:09,121 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:05:09" (1/1) ... [2024-11-19 23:05:09,122 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:05:09" (1/1) ... [2024-11-19 23:05:09,124 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:05:09" (1/1) ... [2024-11-19 23:05:09,134 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-19 23:05:09,139 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:05:09" (1/1) ... [2024-11-19 23:05:09,139 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:05:09" (1/1) ... [2024-11-19 23:05:09,147 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:05:09" (1/1) ... [2024-11-19 23:05:09,153 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:05:09" (1/1) ... [2024-11-19 23:05:09,157 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:05:09" (1/1) ... [2024-11-19 23:05:09,158 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:05:09" (1/1) ... [2024-11-19 23:05:09,159 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 23:05:09,160 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 23:05:09,160 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 23:05:09,160 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 23:05:09,161 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:05:09" (1/1) ... [2024-11-19 23:05:09,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 23:05:09,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 23:05:09,205 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-19 23:05:09,207 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-19 23:05:09,239 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 23:05:09,239 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 23:05:09,240 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 23:05:09,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 23:05:09,240 INFO L130 BoogieDeclarations]: Found specification of procedure assume [2024-11-19 23:05:09,240 INFO L138 BoogieDeclarations]: Found implementation of procedure assume [2024-11-19 23:05:09,296 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 23:05:09,297 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 23:05:09,600 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2024-11-19 23:05:09,600 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 23:05:09,618 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 23:05:09,619 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-19 23:05:09,620 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 11:05:09 BoogieIcfgContainer [2024-11-19 23:05:09,620 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 23:05:09,623 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 23:05:09,623 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 23:05:09,625 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 23:05:09,626 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 11:05:08" (1/3) ... [2024-11-19 23:05:09,626 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11cd9fc8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 11:05:09, skipping insertion in model container [2024-11-19 23:05:09,627 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:05:09" (2/3) ... [2024-11-19 23:05:09,627 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11cd9fc8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 11:05:09, skipping insertion in model container [2024-11-19 23:05:09,627 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 11:05:09" (3/3) ... [2024-11-19 23:05:09,628 INFO L112 eAbstractionObserver]: Analyzing ICFG AllInterval-010.c [2024-11-19 23:05:09,641 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 23:05:09,641 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 23:05:09,701 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 23:05:09,707 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;@307b989f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 23:05:09,708 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 23:05:09,711 INFO L276 IsEmpty]: Start isEmpty. Operand has 167 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 37 states have internal predecessors, (38), 128 states have call successors, (128), 1 states have call predecessors, (128), 1 states have return successors, (128), 128 states have call predecessors, (128), 128 states have call successors, (128) [2024-11-19 23:05:09,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 672 [2024-11-19 23:05:09,750 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 23:05:09,751 INFO L215 NwaCegarLoop]: trace histogram [128, 128, 128, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 23:05:09,751 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 23:05:09,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 23:05:09,756 INFO L85 PathProgramCache]: Analyzing trace with hash 588204487, now seen corresponding path program 1 times [2024-11-19 23:05:09,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 23:05:09,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995309064] [2024-11-19 23:05:09,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 23:05:09,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 23:05:09,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:05:10,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 23:05:10,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:05:10,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-19 23:05:10,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:05:10,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-19 23:05:10,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:05:10,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 23:05:10,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:05:10,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-19 23:05:10,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:05:10,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-19 23:05:10,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:05:10,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-19 23:05:10,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:05:10,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-19 23:05:10,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:05:10,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-19 23:05:10,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:05:10,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-19 23:05:10,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:05:10,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-19 23:05:10,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:05:10,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-19 23:05:10,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:05:10,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-19 23:05:10,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:05:10,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-19 23:05:10,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:05:10,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-19 23:05:10,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:05:10,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-19 23:05:10,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:05:10,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-19 23:05:10,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:05:10,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-19 23:05:10,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:05:10,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-19 23:05:10,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:05:10,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-19 23:05:10,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:05:10,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-19 23:05:10,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:05:10,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-19 23:05:10,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:05:10,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-19 23:05:10,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:05:10,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-19 23:05:10,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:05:10,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-19 23:05:10,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:05:10,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-19 23:05:10,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:05:10,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-19 23:05:10,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:05:10,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-19 23:05:10,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:05:10,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-19 23:05:10,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:05:10,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-19 23:05:10,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:05:10,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-19 23:05:10,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:05:10,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-19 23:05:10,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:05:10,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-11-19 23:05:10,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:05:10,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-11-19 23:05:10,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:05:10,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2024-11-19 23:05:10,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:05:10,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-19 23:05:10,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:05:10,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-11-19 23:05:10,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:05:10,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2024-11-19 23:05:10,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:05:10,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2024-11-19 23:05:10,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:05:10,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2024-11-19 23:05:10,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:05:10,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 221 [2024-11-19 23:05:10,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:05:10,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 226 [2024-11-19 23:05:10,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:05:10,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2024-11-19 23:05:10,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:05:10,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2024-11-19 23:05:10,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:05:10,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2024-11-19 23:05:10,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:05:10,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2024-11-19 23:05:10,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:05:10,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2024-11-19 23:05:10,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:05:10,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 256 [2024-11-19 23:05:10,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:05:10,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 261 [2024-11-19 23:05:10,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:05:10,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 266 [2024-11-19 23:05:10,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:05:10,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2024-11-19 23:05:10,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:05:10,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 276 [2024-11-19 23:05:10,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:05:10,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 281 [2024-11-19 23:05:10,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:05:10,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 286 [2024-11-19 23:05:10,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:05:10,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 291 [2024-11-19 23:05:10,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:05:10,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 296 [2024-11-19 23:05:10,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:05:10,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 301 [2024-11-19 23:05:10,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:05:10,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 306 [2024-11-19 23:05:10,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:05:10,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 311 [2024-11-19 23:05:10,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:05:10,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 316 [2024-11-19 23:05:10,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:05:10,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 321 [2024-11-19 23:05:10,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:05:10,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 326 [2024-11-19 23:05:10,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:05:10,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 331 [2024-11-19 23:05:10,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:05:10,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 336 [2024-11-19 23:05:10,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:05:10,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 341 [2024-11-19 23:05:10,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:05:10,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 346 [2024-11-19 23:05:10,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:05:10,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 351 [2024-11-19 23:05:10,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:05:10,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 356 [2024-11-19 23:05:10,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:05:10,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 361 [2024-11-19 23:05:10,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:05:10,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 366 [2024-11-19 23:05:10,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:05:10,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 371 [2024-11-19 23:05:10,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:05:10,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 376 [2024-11-19 23:05:10,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:05:10,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 381 [2024-11-19 23:05:10,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:05:10,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 386 [2024-11-19 23:05:10,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:05:10,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 391 [2024-11-19 23:05:10,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:05:10,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 396 [2024-11-19 23:05:10,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:05:10,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 401 [2024-11-19 23:05:10,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:05:10,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 406 [2024-11-19 23:05:10,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:05:10,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 411 [2024-11-19 23:05:10,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:05:10,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 416 [2024-11-19 23:05:10,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:05:10,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 421 [2024-11-19 23:05:10,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:05:10,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 426 [2024-11-19 23:05:10,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:05:10,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 431 [2024-11-19 23:05:10,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:05:10,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 436 [2024-11-19 23:05:10,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:05:10,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 441 [2024-11-19 23:05:10,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:05:10,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 446 [2024-11-19 23:05:10,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:05:10,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 451 [2024-11-19 23:05:10,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:05:10,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 456 [2024-11-19 23:05:10,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:05:10,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 461 [2024-11-19 23:05:10,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:05:10,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 466 [2024-11-19 23:05:10,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:05:10,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 471 [2024-11-19 23:05:10,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:05:10,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 476 [2024-11-19 23:05:10,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:05:10,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 481 [2024-11-19 23:05:10,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:05:10,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 486 [2024-11-19 23:05:10,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:05:10,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 491 [2024-11-19 23:05:10,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:05:10,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 496 [2024-11-19 23:05:10,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:05:10,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 501 [2024-11-19 23:05:10,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:05:10,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 506 [2024-11-19 23:05:10,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:05:10,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 511 [2024-11-19 23:05:10,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:05:10,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 516 [2024-11-19 23:05:10,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:05:10,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 521 [2024-11-19 23:05:10,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:05:10,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 526 [2024-11-19 23:05:10,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:05:10,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 531 [2024-11-19 23:05:10,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:05:10,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 536 [2024-11-19 23:05:10,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:05:10,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 541 [2024-11-19 23:05:10,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:05:10,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 546 [2024-11-19 23:05:10,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:05:10,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 551 [2024-11-19 23:05:10,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:05:10,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 556 [2024-11-19 23:05:10,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:05:10,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 561 [2024-11-19 23:05:10,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:05:10,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 566 [2024-11-19 23:05:10,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:05:10,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 571 [2024-11-19 23:05:10,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:05:10,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 576 [2024-11-19 23:05:10,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:05:10,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 581 [2024-11-19 23:05:10,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:05:10,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 586 [2024-11-19 23:05:10,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:05:10,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 591 [2024-11-19 23:05:10,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:05:10,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 596 [2024-11-19 23:05:10,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:05:10,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 601 [2024-11-19 23:05:10,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:05:10,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 606 [2024-11-19 23:05:10,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:05:10,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 611 [2024-11-19 23:05:10,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:05:10,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 617 [2024-11-19 23:05:10,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:05:10,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 623 [2024-11-19 23:05:10,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:05:10,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 629 [2024-11-19 23:05:10,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:05:10,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 635 [2024-11-19 23:05:10,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:05:10,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 641 [2024-11-19 23:05:10,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:05:10,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 647 [2024-11-19 23:05:10,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:05:10,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 653 [2024-11-19 23:05:10,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:05:10,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 659 [2024-11-19 23:05:10,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:05:10,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 665 [2024-11-19 23:05:10,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:05:10,404 INFO L134 CoverageAnalysis]: Checked inductivity of 32512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32512 trivial. 0 not checked. [2024-11-19 23:05:10,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 23:05:10,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995309064] [2024-11-19 23:05:10,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995309064] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 23:05:10,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 23:05:10,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 23:05:10,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877557919] [2024-11-19 23:05:10,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 23:05:10,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 23:05:10,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 23:05:10,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 23:05:10,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 23:05:10,436 INFO L87 Difference]: Start difference. First operand has 167 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 37 states have internal predecessors, (38), 128 states have call successors, (128), 1 states have call predecessors, (128), 1 states have return successors, (128), 128 states have call predecessors, (128), 128 states have call successors, (128) Second operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (128), 1 states have call predecessors, (128), 1 states have return successors, (128), 1 states have call predecessors, (128), 2 states have call successors, (128) [2024-11-19 23:05:10,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 23:05:10,493 INFO L93 Difference]: Finished difference Result 328 states and 710 transitions. [2024-11-19 23:05:10,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 23:05:10,495 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (128), 1 states have call predecessors, (128), 1 states have return successors, (128), 1 states have call predecessors, (128), 2 states have call successors, (128) Word has length 671 [2024-11-19 23:05:10,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 23:05:10,505 INFO L225 Difference]: With dead ends: 328 [2024-11-19 23:05:10,505 INFO L226 Difference]: Without dead ends: 164 [2024-11-19 23:05:10,513 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 386 GetRequests, 386 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-19 23:05:10,517 INFO L432 NwaCegarLoop]: 290 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, 290 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-19 23:05:10,518 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 23:05:10,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2024-11-19 23:05:10,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2024-11-19 23:05:10,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 34 states have (on average 1.0) internal successors, (34), 34 states have internal predecessors, (34), 128 states have call successors, (128), 1 states have call predecessors, (128), 1 states have return successors, (128), 128 states have call predecessors, (128), 128 states have call successors, (128) [2024-11-19 23:05:10,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 290 transitions. [2024-11-19 23:05:10,592 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 290 transitions. Word has length 671 [2024-11-19 23:05:10,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 23:05:10,594 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 290 transitions. [2024-11-19 23:05:10,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (128), 1 states have call predecessors, (128), 1 states have return successors, (128), 1 states have call predecessors, (128), 2 states have call successors, (128) [2024-11-19 23:05:10,594 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 290 transitions. [2024-11-19 23:05:10,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 672 [2024-11-19 23:05:10,605 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 23:05:10,605 INFO L215 NwaCegarLoop]: trace histogram [128, 128, 128, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 23:05:10,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 23:05:10,606 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 23:05:10,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 23:05:10,606 INFO L85 PathProgramCache]: Analyzing trace with hash 354405747, now seen corresponding path program 1 times [2024-11-19 23:05:10,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 23:05:10,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492764323] [2024-11-19 23:05:10,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 23:05:10,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 23:05:13,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 23:05:13,545 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 23:05:15,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 23:05:15,540 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 23:05:15,541 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 23:05:15,542 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-19 23:05:15,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 23:05:15,546 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-19 23:05:15,651 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 23:05:15,653 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 11:05:15 BoogieIcfgContainer [2024-11-19 23:05:15,653 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 23:05:15,653 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 23:05:15,653 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 23:05:15,655 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 23:05:15,656 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 11:05:09" (3/4) ... [2024-11-19 23:05:15,657 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-19 23:05:15,770 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-19 23:05:15,770 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 23:05:15,771 INFO L158 Benchmark]: Toolchain (without parser) took 7007.72ms. Allocated memory was 167.8MB in the beginning and 549.5MB in the end (delta: 381.7MB). Free memory was 98.2MB in the beginning and 305.5MB in the end (delta: -207.3MB). Peak memory consumption was 174.5MB. Max. memory is 16.1GB. [2024-11-19 23:05:15,771 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 167.8MB. Free memory is still 122.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 23:05:15,771 INFO L158 Benchmark]: CACSL2BoogieTranslator took 290.82ms. Allocated memory is still 167.8MB. Free memory was 98.0MB in the beginning and 82.4MB in the end (delta: 15.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-19 23:05:15,771 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.64ms. Allocated memory is still 167.8MB. Free memory was 82.4MB in the beginning and 79.9MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 23:05:15,772 INFO L158 Benchmark]: Boogie Preprocessor took 61.70ms. Allocated memory is still 167.8MB. Free memory was 79.9MB in the beginning and 136.3MB in the end (delta: -56.4MB). Peak memory consumption was 6.9MB. Max. memory is 16.1GB. [2024-11-19 23:05:15,772 INFO L158 Benchmark]: RCFGBuilder took 460.09ms. Allocated memory is still 167.8MB. Free memory was 136.3MB in the beginning and 110.5MB in the end (delta: 25.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-19 23:05:15,772 INFO L158 Benchmark]: TraceAbstraction took 6030.30ms. Allocated memory was 167.8MB in the beginning and 549.5MB in the end (delta: 381.7MB). Free memory was 109.7MB in the beginning and 326.5MB in the end (delta: -216.8MB). Peak memory consumption was 314.5MB. Max. memory is 16.1GB. [2024-11-19 23:05:15,772 INFO L158 Benchmark]: Witness Printer took 116.85ms. Allocated memory is still 549.5MB. Free memory was 326.5MB in the beginning and 305.5MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-19 23:05:15,774 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 167.8MB. Free memory is still 122.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 290.82ms. Allocated memory is still 167.8MB. Free memory was 98.0MB in the beginning and 82.4MB in the end (delta: 15.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.64ms. Allocated memory is still 167.8MB. Free memory was 82.4MB in the beginning and 79.9MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 61.70ms. Allocated memory is still 167.8MB. Free memory was 79.9MB in the beginning and 136.3MB in the end (delta: -56.4MB). Peak memory consumption was 6.9MB. Max. memory is 16.1GB. * RCFGBuilder took 460.09ms. Allocated memory is still 167.8MB. Free memory was 136.3MB in the beginning and 110.5MB in the end (delta: 25.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 6030.30ms. Allocated memory was 167.8MB in the beginning and 549.5MB in the end (delta: 381.7MB). Free memory was 109.7MB in the beginning and 326.5MB in the end (delta: -216.8MB). Peak memory consumption was 314.5MB. Max. memory is 16.1GB. * Witness Printer took 116.85ms. Allocated memory is still 549.5MB. Free memory was 326.5MB in the beginning and 305.5MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 213]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L24] int cond0; [L25] int dummy = 0; [L26] int N; [L27] int var0; [L28] var0 = __VERIFIER_nondet_int() [L29] CALL assume(var0 >= 0) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L29] RET assume(var0 >= 0) VAL [var0=3] [L30] CALL assume(var0 <= 9) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L30] RET assume(var0 <= 9) VAL [var0=3] [L31] int var1; [L32] var1 = __VERIFIER_nondet_int() [L33] CALL assume(var1 >= 0) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L33] RET assume(var1 >= 0) VAL [var0=3, var1=9] [L34] CALL assume(var1 <= 9) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L34] RET assume(var1 <= 9) VAL [var0=3, var1=9] [L35] int var2; [L36] var2 = __VERIFIER_nondet_int() [L37] CALL assume(var2 >= 0) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L37] RET assume(var2 >= 0) VAL [var0=3, var1=9, var2=0] [L38] CALL assume(var2 <= 9) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L38] RET assume(var2 <= 9) VAL [var0=3, var1=9, var2=0] [L39] int var3; [L40] var3 = __VERIFIER_nondet_int() [L41] CALL assume(var3 >= 0) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L41] RET assume(var3 >= 0) VAL [var0=3, var1=9, var2=0, var3=8] [L42] CALL assume(var3 <= 9) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L42] RET assume(var3 <= 9) VAL [var0=3, var1=9, var2=0, var3=8] [L43] int var4; [L44] var4 = __VERIFIER_nondet_int() [L45] CALL assume(var4 >= 0) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L45] RET assume(var4 >= 0) VAL [var0=3, var1=9, var2=0, var3=8, var4=1] [L46] CALL assume(var4 <= 9) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L46] RET assume(var4 <= 9) VAL [var0=3, var1=9, var2=0, var3=8, var4=1] [L47] int var5; [L48] var5 = __VERIFIER_nondet_int() [L49] CALL assume(var5 >= 0) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L49] RET assume(var5 >= 0) VAL [var0=3, var1=9, var2=0, var3=8, var4=1, var5=4] [L50] CALL assume(var5 <= 9) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L50] RET assume(var5 <= 9) VAL [var0=3, var1=9, var2=0, var3=8, var4=1, var5=4] [L51] int var6; [L52] var6 = __VERIFIER_nondet_int() [L53] CALL assume(var6 >= 0) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L53] RET assume(var6 >= 0) VAL [var0=3, var1=9, var2=0, var3=8, var4=1, var5=4, var6=5] [L54] CALL assume(var6 <= 9) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L54] RET assume(var6 <= 9) VAL [var0=3, var1=9, var2=0, var3=8, var4=1, var5=4, var6=5] [L55] int var7; [L56] var7 = __VERIFIER_nondet_int() [L57] CALL assume(var7 >= 0) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L57] RET assume(var7 >= 0) VAL [var0=3, var1=9, var2=0, var3=8, var4=1, var5=4, var6=5, var7=7] [L58] CALL assume(var7 <= 9) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L58] RET assume(var7 <= 9) VAL [var0=3, var1=9, var2=0, var3=8, var4=1, var5=4, var6=5, var7=7] [L59] int var8; [L60] var8 = __VERIFIER_nondet_int() [L61] CALL assume(var8 >= 0) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L61] RET assume(var8 >= 0) VAL [var0=3, var1=9, var2=0, var3=8, var4=1, var5=4, var6=5, var7=7, var8=2] [L62] CALL assume(var8 <= 9) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L62] RET assume(var8 <= 9) VAL [var0=3, var1=9, var2=0, var3=8, var4=1, var5=4, var6=5, var7=7, var8=2] [L63] int var9; [L64] var9 = __VERIFIER_nondet_int() [L65] CALL assume(var9 >= 0) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L65] RET assume(var9 >= 0) VAL [var0=3, var1=9, var2=0, var3=8, var4=1, var5=4, var6=5, var7=7, var8=2, var9=6] [L66] CALL assume(var9 <= 9) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L66] RET assume(var9 <= 9) VAL [var0=3, var1=9, var2=0, var3=8, var4=1, var5=4, var6=5, var7=7, var8=2, var9=6] [L67] int var10; [L68] var10 = __VERIFIER_nondet_int() [L69] CALL assume(var10 >= 1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L69] RET assume(var10 >= 1) VAL [var0=3, var10=6, var1=9, var2=0, var3=8, var4=1, var5=4, var6=5, var7=7, var8=2, var9=6] [L70] CALL assume(var10 <= 9) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L70] RET assume(var10 <= 9) VAL [var0=3, var10=6, var1=9, var2=0, var3=8, var4=1, var5=4, var6=5, var7=7, var8=2, var9=6] [L71] int var11; [L72] var11 = __VERIFIER_nondet_int() [L73] CALL assume(var11 >= 1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L73] RET assume(var11 >= 1) VAL [var0=3, var10=6, var11=9, var1=9, var2=0, var3=8, var4=1, var5=4, var6=5, var7=7, var8=2, var9=6] [L74] CALL assume(var11 <= 9) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L74] RET assume(var11 <= 9) VAL [var0=3, var10=6, var11=9, var1=9, var2=0, var3=8, var4=1, var5=4, var6=5, var7=7, var8=2, var9=6] [L75] int var12; [L76] var12 = __VERIFIER_nondet_int() [L77] CALL assume(var12 >= 1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L77] RET assume(var12 >= 1) VAL [var0=3, var10=6, var11=9, var12=8, var1=9, var2=0, var3=8, var4=1, var5=4, var6=5, var7=7, var8=2, var9=6] [L78] CALL assume(var12 <= 9) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L78] RET assume(var12 <= 9) VAL [var0=3, var10=6, var11=9, var12=8, var1=9, var2=0, var3=8, var4=1, var5=4, var6=5, var7=7, var8=2, var9=6] [L79] int var13; [L80] var13 = __VERIFIER_nondet_int() [L81] CALL assume(var13 >= 1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L81] RET assume(var13 >= 1) VAL [var0=3, var10=6, var11=9, var12=8, var13=7, var1=9, var2=0, var3=8, var4=1, var5=4, var6=5, var7=7, var8=2, var9=6] [L82] CALL assume(var13 <= 9) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L82] RET assume(var13 <= 9) VAL [var0=3, var10=6, var11=9, var12=8, var13=7, var1=9, var2=0, var3=8, var4=1, var5=4, var6=5, var7=7, var8=2, var9=6] [L83] int var14; [L84] var14 = __VERIFIER_nondet_int() [L85] CALL assume(var14 >= 1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L85] RET assume(var14 >= 1) VAL [var0=3, var10=6, var11=9, var12=8, var13=7, var14=3, var1=9, var2=0, var3=8, var4=1, var5=4, var6=5, var7=7, var8=2, var9=6] [L86] CALL assume(var14 <= 9) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L86] RET assume(var14 <= 9) VAL [var0=3, var10=6, var11=9, var12=8, var13=7, var14=3, var1=9, var2=0, var3=8, var4=1, var5=4, var6=5, var7=7, var8=2, var9=6] [L87] int var15; [L88] var15 = __VERIFIER_nondet_int() [L89] CALL assume(var15 >= 1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L89] RET assume(var15 >= 1) VAL [var0=3, var10=6, var11=9, var12=8, var13=7, var14=3, var15=1, var1=9, var2=0, var3=8, var4=1, var5=4, var6=5, var7=7, var8=2, var9=6] [L90] CALL assume(var15 <= 9) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L90] RET assume(var15 <= 9) VAL [var0=3, var10=6, var11=9, var12=8, var13=7, var14=3, var15=1, var1=9, var2=0, var3=8, var4=1, var5=4, var6=5, var7=7, var8=2, var9=6] [L91] int var16; [L92] var16 = __VERIFIER_nondet_int() [L93] CALL assume(var16 >= 1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L93] RET assume(var16 >= 1) VAL [var0=3, var10=6, var11=9, var12=8, var13=7, var14=3, var15=1, var16=2, var1=9, var2=0, var3=8, var4=1, var5=4, var6=5, var7=7, var8=2, var9=6] [L94] CALL assume(var16 <= 9) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L94] RET assume(var16 <= 9) VAL [var0=3, var10=6, var11=9, var12=8, var13=7, var14=3, var15=1, var16=2, var1=9, var2=0, var3=8, var4=1, var5=4, var6=5, var7=7, var8=2, var9=6] [L95] int var17; [L96] var17 = __VERIFIER_nondet_int() [L97] CALL assume(var17 >= 1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L97] RET assume(var17 >= 1) VAL [var0=3, var10=6, var11=9, var12=8, var13=7, var14=3, var15=1, var16=2, var17=5, var1=9, var2=0, var3=8, var4=1, var5=4, var6=5, var7=7, var8=2, var9=6] [L98] CALL assume(var17 <= 9) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L98] RET assume(var17 <= 9) VAL [var0=3, var10=6, var11=9, var12=8, var13=7, var14=3, var15=1, var16=2, var17=5, var1=9, var2=0, var3=8, var4=1, var5=4, var6=5, var7=7, var8=2, var9=6] [L99] int var18; [L100] var18 = __VERIFIER_nondet_int() [L101] CALL assume(var18 >= 1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L101] RET assume(var18 >= 1) VAL [var0=3, var10=6, var11=9, var12=8, var13=7, var14=3, var15=1, var16=2, var17=5, var18=4, var1=9, var2=0, var3=8, var4=1, var5=4, var6=5, var7=7, var8=2, var9=6] [L102] CALL assume(var18 <= 9) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L102] RET assume(var18 <= 9) VAL [var0=3, var10=6, var11=9, var12=8, var13=7, var14=3, var15=1, var16=2, var17=5, var18=4, var1=9, var2=0, var3=8, var4=1, var5=4, var6=5, var7=7, var8=2, var9=6] [L103] int myvar0 = 1; VAL [var0=3, var10=6, var11=9, var12=8, var13=7, var14=3, var15=1, var16=2, var17=5, var18=4, var1=9, var2=0, var3=8, var4=1, var5=4, var6=5, var7=7, var8=2, var9=6] [L104] CALL assume(var0 != var1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L104] RET assume(var0 != var1) VAL [var0=3, var10=6, var11=9, var12=8, var13=7, var14=3, var15=1, var16=2, var17=5, var18=4, var1=9, var2=0, var3=8, var4=1, var5=4, var6=5, var7=7, var8=2, var9=6] [L105] CALL assume(var0 != var2) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L105] RET assume(var0 != var2) VAL [var0=3, var10=6, var11=9, var12=8, var13=7, var14=3, var15=1, var16=2, var17=5, var18=4, var1=9, var2=0, var3=8, var4=1, var5=4, var6=5, var7=7, var8=2, var9=6] [L106] CALL assume(var0 != var3) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L106] RET assume(var0 != var3) VAL [var0=3, var10=6, var11=9, var12=8, var13=7, var14=3, var15=1, var16=2, var17=5, var18=4, var1=9, var2=0, var3=8, var4=1, var5=4, var6=5, var7=7, var8=2, var9=6] [L107] CALL assume(var0 != var4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L107] RET assume(var0 != var4) VAL [var0=3, var10=6, var11=9, var12=8, var13=7, var14=3, var15=1, var16=2, var17=5, var18=4, var1=9, var2=0, var3=8, var4=1, var5=4, var6=5, var7=7, var8=2, var9=6] [L108] CALL assume(var0 != var5) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L108] RET assume(var0 != var5) VAL [var0=3, var10=6, var11=9, var12=8, var13=7, var14=3, var15=1, var16=2, var17=5, var18=4, var1=9, var2=0, var3=8, var4=1, var5=4, var6=5, var7=7, var8=2, var9=6] [L109] CALL assume(var0 != var6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L109] RET assume(var0 != var6) VAL [var0=3, var10=6, var11=9, var12=8, var13=7, var14=3, var15=1, var16=2, var17=5, var18=4, var1=9, var2=0, var3=8, var4=1, var5=4, var6=5, var7=7, var8=2, var9=6] [L110] CALL assume(var0 != var7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L110] RET assume(var0 != var7) VAL [var0=3, var10=6, var11=9, var12=8, var13=7, var14=3, var15=1, var16=2, var17=5, var18=4, var1=9, var2=0, var3=8, var4=1, var5=4, var6=5, var7=7, var8=2, var9=6] [L111] CALL assume(var0 != var8) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L111] RET assume(var0 != var8) VAL [var0=3, var10=6, var11=9, var12=8, var13=7, var14=3, var15=1, var16=2, var17=5, var18=4, var1=9, var2=0, var3=8, var4=1, var5=4, var6=5, var7=7, var8=2, var9=6] [L112] CALL assume(var0 != var9) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L112] RET assume(var0 != var9) VAL [var0=3, var10=6, var11=9, var12=8, var13=7, var14=3, var15=1, var16=2, var17=5, var18=4, var1=9, var2=0, var3=8, var4=1, var5=4, var6=5, var7=7, var8=2, var9=6] [L113] CALL assume(var1 != var2) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L113] RET assume(var1 != var2) VAL [var0=3, var10=6, var11=9, var12=8, var13=7, var14=3, var15=1, var16=2, var17=5, var18=4, var1=9, var2=0, var3=8, var4=1, var5=4, var6=5, var7=7, var8=2, var9=6] [L114] CALL assume(var1 != var3) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L114] RET assume(var1 != var3) VAL [var0=3, var10=6, var11=9, var12=8, var13=7, var14=3, var15=1, var16=2, var17=5, var18=4, var1=9, var2=0, var3=8, var4=1, var5=4, var6=5, var7=7, var8=2, var9=6] [L115] CALL assume(var1 != var4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L115] RET assume(var1 != var4) VAL [var0=3, var10=6, var11=9, var12=8, var13=7, var14=3, var15=1, var16=2, var17=5, var18=4, var1=9, var2=0, var3=8, var4=1, var5=4, var6=5, var7=7, var8=2, var9=6] [L116] CALL assume(var1 != var5) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L116] RET assume(var1 != var5) VAL [var0=3, var10=6, var11=9, var12=8, var13=7, var14=3, var15=1, var16=2, var17=5, var18=4, var1=9, var2=0, var3=8, var4=1, var5=4, var6=5, var7=7, var8=2, var9=6] [L117] CALL assume(var1 != var6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L117] RET assume(var1 != var6) VAL [var0=3, var10=6, var11=9, var12=8, var13=7, var14=3, var15=1, var16=2, var17=5, var18=4, var1=9, var2=0, var3=8, var4=1, var5=4, var6=5, var7=7, var8=2, var9=6] [L118] CALL assume(var1 != var7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L118] RET assume(var1 != var7) VAL [var0=3, var10=6, var11=9, var12=8, var13=7, var14=3, var15=1, var16=2, var17=5, var18=4, var1=9, var2=0, var3=8, var4=1, var5=4, var6=5, var7=7, var8=2, var9=6] [L119] CALL assume(var1 != var8) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L119] RET assume(var1 != var8) VAL [var0=3, var10=6, var11=9, var12=8, var13=7, var14=3, var15=1, var16=2, var17=5, var18=4, var1=9, var2=0, var3=8, var4=1, var5=4, var6=5, var7=7, var8=2, var9=6] [L120] CALL assume(var1 != var9) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L120] RET assume(var1 != var9) VAL [var0=3, var10=6, var11=9, var12=8, var13=7, var14=3, var15=1, var16=2, var17=5, var18=4, var1=9, var2=0, var3=8, var4=1, var5=4, var6=5, var7=7, var8=2, var9=6] [L121] CALL assume(var2 != var3) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L121] RET assume(var2 != var3) VAL [var0=3, var10=6, var11=9, var12=8, var13=7, var14=3, var15=1, var16=2, var17=5, var18=4, var1=9, var2=0, var3=8, var4=1, var5=4, var6=5, var7=7, var8=2, var9=6] [L122] CALL assume(var2 != var4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L122] RET assume(var2 != var4) VAL [var0=3, var10=6, var11=9, var12=8, var13=7, var14=3, var15=1, var16=2, var17=5, var18=4, var1=9, var2=0, var3=8, var4=1, var5=4, var6=5, var7=7, var8=2, var9=6] [L123] CALL assume(var2 != var5) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L123] RET assume(var2 != var5) VAL [var0=3, var10=6, var11=9, var12=8, var13=7, var14=3, var15=1, var16=2, var17=5, var18=4, var1=9, var2=0, var3=8, var4=1, var5=4, var6=5, var7=7, var8=2, var9=6] [L124] CALL assume(var2 != var6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L124] RET assume(var2 != var6) VAL [var0=3, var10=6, var11=9, var12=8, var13=7, var14=3, var15=1, var16=2, var17=5, var18=4, var1=9, var2=0, var3=8, var4=1, var5=4, var6=5, var7=7, var8=2, var9=6] [L125] CALL assume(var2 != var7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L125] RET assume(var2 != var7) VAL [var0=3, var10=6, var11=9, var12=8, var13=7, var14=3, var15=1, var16=2, var17=5, var18=4, var1=9, var2=0, var3=8, var4=1, var5=4, var6=5, var7=7, var8=2, var9=6] [L126] CALL assume(var2 != var8) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L126] RET assume(var2 != var8) VAL [var0=3, var10=6, var11=9, var12=8, var13=7, var14=3, var15=1, var16=2, var17=5, var18=4, var1=9, var2=0, var3=8, var4=1, var5=4, var6=5, var7=7, var8=2, var9=6] [L127] CALL assume(var2 != var9) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L127] RET assume(var2 != var9) VAL [var0=3, var10=6, var11=9, var12=8, var13=7, var14=3, var15=1, var16=2, var17=5, var18=4, var1=9, var2=0, var3=8, var4=1, var5=4, var6=5, var7=7, var8=2, var9=6] [L128] CALL assume(var3 != var4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L128] RET assume(var3 != var4) VAL [var0=3, var10=6, var11=9, var12=8, var13=7, var14=3, var15=1, var16=2, var17=5, var18=4, var1=9, var2=0, var3=8, var4=1, var5=4, var6=5, var7=7, var8=2, var9=6] [L129] CALL assume(var3 != var5) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L129] RET assume(var3 != var5) VAL [var0=3, var10=6, var11=9, var12=8, var13=7, var14=3, var15=1, var16=2, var17=5, var18=4, var1=9, var2=0, var3=8, var4=1, var5=4, var6=5, var7=7, var8=2, var9=6] [L130] CALL assume(var3 != var6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L130] RET assume(var3 != var6) VAL [var0=3, var10=6, var11=9, var12=8, var13=7, var14=3, var15=1, var16=2, var17=5, var18=4, var1=9, var2=0, var3=8, var4=1, var5=4, var6=5, var7=7, var8=2, var9=6] [L131] CALL assume(var3 != var7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L131] RET assume(var3 != var7) VAL [var0=3, var10=6, var11=9, var12=8, var13=7, var14=3, var15=1, var16=2, var17=5, var18=4, var1=9, var2=0, var3=8, var4=1, var5=4, var6=5, var7=7, var8=2, var9=6] [L132] CALL assume(var3 != var8) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L132] RET assume(var3 != var8) VAL [var0=3, var10=6, var11=9, var12=8, var13=7, var14=3, var15=1, var16=2, var17=5, var18=4, var1=9, var2=0, var3=8, var4=1, var5=4, var6=5, var7=7, var8=2, var9=6] [L133] CALL assume(var3 != var9) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L133] RET assume(var3 != var9) VAL [var0=3, var10=6, var11=9, var12=8, var13=7, var14=3, var15=1, var16=2, var17=5, var18=4, var1=9, var2=0, var3=8, var4=1, var5=4, var6=5, var7=7, var8=2, var9=6] [L134] CALL assume(var4 != var5) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L134] RET assume(var4 != var5) VAL [var0=3, var10=6, var11=9, var12=8, var13=7, var14=3, var15=1, var16=2, var17=5, var18=4, var1=9, var2=0, var3=8, var4=1, var5=4, var6=5, var7=7, var8=2, var9=6] [L135] CALL assume(var4 != var6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L135] RET assume(var4 != var6) VAL [var0=3, var10=6, var11=9, var12=8, var13=7, var14=3, var15=1, var16=2, var17=5, var18=4, var1=9, var2=0, var3=8, var4=1, var5=4, var6=5, var7=7, var8=2, var9=6] [L136] CALL assume(var4 != var7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L136] RET assume(var4 != var7) VAL [var0=3, var10=6, var11=9, var12=8, var13=7, var14=3, var15=1, var16=2, var17=5, var18=4, var1=9, var2=0, var3=8, var4=1, var5=4, var6=5, var7=7, var8=2, var9=6] [L137] CALL assume(var4 != var8) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L137] RET assume(var4 != var8) VAL [var0=3, var10=6, var11=9, var12=8, var13=7, var14=3, var15=1, var16=2, var17=5, var18=4, var1=9, var2=0, var3=8, var4=1, var5=4, var6=5, var7=7, var8=2, var9=6] [L138] CALL assume(var4 != var9) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L138] RET assume(var4 != var9) VAL [var0=3, var10=6, var11=9, var12=8, var13=7, var14=3, var15=1, var16=2, var17=5, var18=4, var1=9, var2=0, var3=8, var4=1, var5=4, var6=5, var7=7, var8=2, var9=6] [L139] CALL assume(var5 != var6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L139] RET assume(var5 != var6) VAL [var0=3, var10=6, var11=9, var12=8, var13=7, var14=3, var15=1, var16=2, var17=5, var18=4, var1=9, var2=0, var3=8, var4=1, var5=4, var6=5, var7=7, var8=2, var9=6] [L140] CALL assume(var5 != var7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L140] RET assume(var5 != var7) VAL [var0=3, var10=6, var11=9, var12=8, var13=7, var14=3, var15=1, var16=2, var17=5, var18=4, var1=9, var2=0, var3=8, var4=1, var5=4, var6=5, var7=7, var8=2, var9=6] [L141] CALL assume(var5 != var8) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L141] RET assume(var5 != var8) VAL [var0=3, var10=6, var11=9, var12=8, var13=7, var14=3, var15=1, var16=2, var17=5, var18=4, var1=9, var2=0, var3=8, var4=1, var5=4, var6=5, var7=7, var8=2, var9=6] [L142] CALL assume(var5 != var9) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L142] RET assume(var5 != var9) VAL [var0=3, var10=6, var11=9, var12=8, var13=7, var14=3, var15=1, var16=2, var17=5, var18=4, var1=9, var2=0, var3=8, var4=1, var5=4, var6=5, var7=7, var8=2, var9=6] [L143] CALL assume(var6 != var7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L143] RET assume(var6 != var7) VAL [var0=3, var10=6, var11=9, var12=8, var13=7, var14=3, var15=1, var16=2, var17=5, var18=4, var1=9, var2=0, var3=8, var4=1, var5=4, var6=5, var7=7, var8=2, var9=6] [L144] CALL assume(var6 != var8) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L144] RET assume(var6 != var8) VAL [var0=3, var10=6, var11=9, var12=8, var13=7, var14=3, var15=1, var16=2, var17=5, var18=4, var1=9, var2=0, var3=8, var4=1, var5=4, var6=5, var7=7, var8=2, var9=6] [L145] CALL assume(var6 != var9) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L145] RET assume(var6 != var9) VAL [var0=3, var10=6, var11=9, var12=8, var13=7, var14=3, var15=1, var16=2, var17=5, var18=4, var1=9, var2=0, var3=8, var4=1, var5=4, var6=5, var7=7, var8=2, var9=6] [L146] CALL assume(var7 != var8) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L146] RET assume(var7 != var8) VAL [var0=3, var10=6, var11=9, var12=8, var13=7, var14=3, var15=1, var16=2, var17=5, var18=4, var1=9, var2=0, var3=8, var4=1, var5=4, var6=5, var7=7, var8=2, var9=6] [L147] CALL assume(var7 != var9) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L147] RET assume(var7 != var9) VAL [var0=3, var10=6, var11=9, var12=8, var13=7, var14=3, var15=1, var16=2, var17=5, var18=4, var1=9, var2=0, var3=8, var4=1, var5=4, var6=5, var7=7, var8=2, var9=6] [L148] CALL assume(var8 != var9) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L148] RET assume(var8 != var9) VAL [var0=3, var10=6, var11=9, var12=8, var13=7, var14=3, var15=1, var16=2, var17=5, var18=4, var1=9, var2=0, var3=8, var4=1, var5=4, var6=5, var7=7, var8=2, var9=6] [L149] CALL assume(var10 != var11) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L149] RET assume(var10 != var11) VAL [var0=3, var10=6, var11=9, var12=8, var13=7, var14=3, var15=1, var16=2, var17=5, var18=4, var1=9, var2=0, var3=8, var4=1, var5=4, var6=5, var7=7, var8=2, var9=6] [L150] CALL assume(var10 != var12) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L150] RET assume(var10 != var12) VAL [var0=3, var10=6, var11=9, var12=8, var13=7, var14=3, var15=1, var16=2, var17=5, var18=4, var1=9, var2=0, var3=8, var4=1, var5=4, var6=5, var7=7, var8=2, var9=6] [L151] CALL assume(var10 != var13) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L151] RET assume(var10 != var13) VAL [var0=3, var10=6, var11=9, var12=8, var13=7, var14=3, var15=1, var16=2, var17=5, var18=4, var1=9, var2=0, var3=8, var4=1, var5=4, var6=5, var7=7, var8=2, var9=6] [L152] CALL assume(var10 != var14) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L152] RET assume(var10 != var14) VAL [var0=3, var10=6, var11=9, var12=8, var13=7, var14=3, var15=1, var16=2, var17=5, var18=4, var1=9, var2=0, var3=8, var4=1, var5=4, var6=5, var7=7, var8=2, var9=6] [L153] CALL assume(var10 != var15) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L153] RET assume(var10 != var15) VAL [var0=3, var10=6, var11=9, var12=8, var13=7, var14=3, var15=1, var16=2, var17=5, var18=4, var1=9, var2=0, var3=8, var4=1, var5=4, var6=5, var7=7, var8=2, var9=6] [L154] CALL assume(var10 != var16) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L154] RET assume(var10 != var16) VAL [var0=3, var10=6, var11=9, var12=8, var13=7, var14=3, var15=1, var16=2, var17=5, var18=4, var1=9, var2=0, var3=8, var4=1, var5=4, var6=5, var7=7, var8=2, var9=6] [L155] CALL assume(var10 != var17) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L155] RET assume(var10 != var17) VAL [var0=3, var10=6, var11=9, var12=8, var13=7, var14=3, var15=1, var16=2, var17=5, var18=4, var1=9, var2=0, var3=8, var4=1, var5=4, var6=5, var7=7, var8=2, var9=6] [L156] CALL assume(var10 != var18) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L156] RET assume(var10 != var18) VAL [var0=3, var10=6, var11=9, var12=8, var13=7, var14=3, var15=1, var16=2, var17=5, var18=4, var1=9, var2=0, var3=8, var4=1, var5=4, var6=5, var7=7, var8=2, var9=6] [L157] CALL assume(var11 != var12) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L157] RET assume(var11 != var12) VAL [var0=3, var10=6, var11=9, var12=8, var13=7, var14=3, var15=1, var16=2, var17=5, var18=4, var1=9, var2=0, var3=8, var4=1, var5=4, var6=5, var7=7, var8=2, var9=6] [L158] CALL assume(var11 != var13) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L158] RET assume(var11 != var13) VAL [var0=3, var10=6, var11=9, var12=8, var13=7, var14=3, var15=1, var16=2, var17=5, var18=4, var1=9, var2=0, var3=8, var4=1, var5=4, var6=5, var7=7, var8=2, var9=6] [L159] CALL assume(var11 != var14) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L159] RET assume(var11 != var14) VAL [var0=3, var10=6, var11=9, var12=8, var13=7, var14=3, var15=1, var16=2, var17=5, var18=4, var1=9, var2=0, var3=8, var4=1, var5=4, var6=5, var7=7, var8=2, var9=6] [L160] CALL assume(var11 != var15) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L160] RET assume(var11 != var15) VAL [var0=3, var10=6, var11=9, var12=8, var13=7, var14=3, var15=1, var16=2, var17=5, var18=4, var1=9, var2=0, var3=8, var4=1, var5=4, var6=5, var7=7, var8=2, var9=6] [L161] CALL assume(var11 != var16) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L161] RET assume(var11 != var16) VAL [var0=3, var10=6, var11=9, var12=8, var13=7, var14=3, var15=1, var16=2, var17=5, var18=4, var1=9, var2=0, var3=8, var4=1, var5=4, var6=5, var7=7, var8=2, var9=6] [L162] CALL assume(var11 != var17) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L162] RET assume(var11 != var17) VAL [var0=3, var10=6, var11=9, var12=8, var13=7, var14=3, var15=1, var16=2, var17=5, var18=4, var1=9, var2=0, var3=8, var4=1, var5=4, var6=5, var7=7, var8=2, var9=6] [L163] CALL assume(var11 != var18) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L163] RET assume(var11 != var18) VAL [var0=3, var10=6, var11=9, var12=8, var13=7, var14=3, var15=1, var16=2, var17=5, var18=4, var1=9, var2=0, var3=8, var4=1, var5=4, var6=5, var7=7, var8=2, var9=6] [L164] CALL assume(var12 != var13) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L164] RET assume(var12 != var13) VAL [var0=3, var10=6, var11=9, var12=8, var13=7, var14=3, var15=1, var16=2, var17=5, var18=4, var1=9, var2=0, var3=8, var4=1, var5=4, var6=5, var7=7, var8=2, var9=6] [L165] CALL assume(var12 != var14) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L165] RET assume(var12 != var14) VAL [var0=3, var10=6, var11=9, var12=8, var13=7, var14=3, var15=1, var16=2, var17=5, var18=4, var1=9, var2=0, var3=8, var4=1, var5=4, var6=5, var7=7, var8=2, var9=6] [L166] CALL assume(var12 != var15) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L166] RET assume(var12 != var15) VAL [var0=3, var10=6, var11=9, var12=8, var13=7, var14=3, var15=1, var16=2, var17=5, var18=4, var1=9, var2=0, var3=8, var4=1, var5=4, var6=5, var7=7, var8=2, var9=6] [L167] CALL assume(var12 != var16) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L167] RET assume(var12 != var16) VAL [var0=3, var10=6, var11=9, var12=8, var13=7, var14=3, var15=1, var16=2, var17=5, var18=4, var1=9, var2=0, var3=8, var4=1, var5=4, var6=5, var7=7, var8=2, var9=6] [L168] CALL assume(var12 != var17) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L168] RET assume(var12 != var17) VAL [var0=3, var10=6, var11=9, var12=8, var13=7, var14=3, var15=1, var16=2, var17=5, var18=4, var1=9, var2=0, var3=8, var4=1, var5=4, var6=5, var7=7, var8=2, var9=6] [L169] CALL assume(var12 != var18) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L169] RET assume(var12 != var18) VAL [var0=3, var10=6, var11=9, var12=8, var13=7, var14=3, var15=1, var16=2, var17=5, var18=4, var1=9, var2=0, var3=8, var4=1, var5=4, var6=5, var7=7, var8=2, var9=6] [L170] CALL assume(var13 != var14) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L170] RET assume(var13 != var14) VAL [var0=3, var10=6, var11=9, var12=8, var13=7, var14=3, var15=1, var16=2, var17=5, var18=4, var1=9, var2=0, var3=8, var4=1, var5=4, var6=5, var7=7, var8=2, var9=6] [L171] CALL assume(var13 != var15) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L171] RET assume(var13 != var15) VAL [var0=3, var10=6, var11=9, var12=8, var13=7, var14=3, var15=1, var16=2, var17=5, var18=4, var1=9, var2=0, var3=8, var4=1, var5=4, var6=5, var7=7, var8=2, var9=6] [L172] CALL assume(var13 != var16) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L172] RET assume(var13 != var16) VAL [var0=3, var10=6, var11=9, var12=8, var13=7, var14=3, var15=1, var16=2, var17=5, var18=4, var1=9, var2=0, var3=8, var4=1, var5=4, var6=5, var7=7, var8=2, var9=6] [L173] CALL assume(var13 != var17) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L173] RET assume(var13 != var17) VAL [var0=3, var10=6, var11=9, var12=8, var13=7, var14=3, var15=1, var16=2, var17=5, var18=4, var1=9, var2=0, var3=8, var4=1, var5=4, var6=5, var7=7, var8=2, var9=6] [L174] CALL assume(var13 != var18) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L174] RET assume(var13 != var18) VAL [var0=3, var10=6, var11=9, var12=8, var13=7, var14=3, var15=1, var16=2, var17=5, var18=4, var1=9, var2=0, var3=8, var4=1, var5=4, var6=5, var7=7, var8=2, var9=6] [L175] CALL assume(var14 != var15) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L175] RET assume(var14 != var15) VAL [var0=3, var10=6, var11=9, var12=8, var13=7, var14=3, var15=1, var16=2, var17=5, var18=4, var1=9, var2=0, var3=8, var4=1, var5=4, var6=5, var7=7, var8=2, var9=6] [L176] CALL assume(var14 != var16) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L176] RET assume(var14 != var16) VAL [var0=3, var10=6, var11=9, var12=8, var13=7, var14=3, var15=1, var16=2, var17=5, var18=4, var1=9, var2=0, var3=8, var4=1, var5=4, var6=5, var7=7, var8=2, var9=6] [L177] CALL assume(var14 != var17) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L177] RET assume(var14 != var17) VAL [var0=3, var10=6, var11=9, var12=8, var13=7, var14=3, var15=1, var16=2, var17=5, var18=4, var1=9, var2=0, var3=8, var4=1, var5=4, var6=5, var7=7, var8=2, var9=6] [L178] CALL assume(var14 != var18) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L178] RET assume(var14 != var18) VAL [var0=3, var10=6, var11=9, var12=8, var13=7, var14=3, var15=1, var16=2, var17=5, var18=4, var1=9, var2=0, var3=8, var4=1, var5=4, var6=5, var7=7, var8=2, var9=6] [L179] CALL assume(var15 != var16) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L179] RET assume(var15 != var16) VAL [var0=3, var10=6, var11=9, var12=8, var13=7, var14=3, var15=1, var16=2, var17=5, var18=4, var1=9, var2=0, var3=8, var4=1, var5=4, var6=5, var7=7, var8=2, var9=6] [L180] CALL assume(var15 != var17) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L180] RET assume(var15 != var17) VAL [var0=3, var10=6, var11=9, var12=8, var13=7, var14=3, var15=1, var16=2, var17=5, var18=4, var1=9, var2=0, var3=8, var4=1, var5=4, var6=5, var7=7, var8=2, var9=6] [L181] CALL assume(var15 != var18) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L181] RET assume(var15 != var18) VAL [var0=3, var10=6, var11=9, var12=8, var13=7, var14=3, var15=1, var16=2, var17=5, var18=4, var1=9, var2=0, var3=8, var4=1, var5=4, var6=5, var7=7, var8=2, var9=6] [L182] CALL assume(var16 != var17) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L182] RET assume(var16 != var17) VAL [var0=3, var10=6, var11=9, var12=8, var13=7, var14=3, var15=1, var16=2, var17=5, var18=4, var1=9, var2=0, var3=8, var4=1, var5=4, var6=5, var7=7, var8=2, var9=6] [L183] CALL assume(var16 != var18) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L183] RET assume(var16 != var18) VAL [var0=3, var10=6, var11=9, var12=8, var13=7, var14=3, var15=1, var16=2, var17=5, var18=4, var1=9, var2=0, var3=8, var4=1, var5=4, var6=5, var7=7, var8=2, var9=6] [L184] CALL assume(var17 != var18) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L184] RET assume(var17 != var18) VAL [var0=3, var10=6, var11=9, var12=8, var13=7, var14=3, var15=1, var16=2, var17=5, var18=4, var1=9, var2=0, var3=8, var4=1, var5=4, var6=5, var7=7, var8=2, var9=6] [L185] int var_for_abs; [L186] var_for_abs = var0 - var1 [L187] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [var10=6, var11=9, var12=8, var13=7, var14=3, var15=1, var16=2, var17=5, var18=4, var1=9, var2=0, var3=8, var4=1, var5=4, var6=5, var7=7, var8=2, var9=6, var_for_abs=6] [L188] CALL assume(var10 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L188] RET assume(var10 == var_for_abs) VAL [var10=6, var11=9, var12=8, var13=7, var14=3, var15=1, var16=2, var17=5, var18=4, var1=9, var2=0, var3=8, var4=1, var5=4, var6=5, var7=7, var8=2, var9=6, var_for_abs=6] [L189] var_for_abs = var1 - var2 [L190] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [var10=6, var11=9, var12=8, var13=7, var14=3, var15=1, var16=2, var17=5, var18=4, var2=0, var3=8, var4=1, var5=4, var6=5, var7=7, var8=2, var9=6, var_for_abs=9] [L191] CALL assume(var11 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L191] RET assume(var11 == var_for_abs) VAL [var10=6, var11=9, var12=8, var13=7, var14=3, var15=1, var16=2, var17=5, var18=4, var2=0, var3=8, var4=1, var5=4, var6=5, var7=7, var8=2, var9=6, var_for_abs=9] [L192] var_for_abs = var2 - var3 [L193] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [var10=6, var11=9, var12=8, var13=7, var14=3, var15=1, var16=2, var17=5, var18=4, var3=8, var4=1, var5=4, var6=5, var7=7, var8=2, var9=6, var_for_abs=8] [L194] CALL assume(var12 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L194] RET assume(var12 == var_for_abs) VAL [var10=6, var11=9, var12=8, var13=7, var14=3, var15=1, var16=2, var17=5, var18=4, var3=8, var4=1, var5=4, var6=5, var7=7, var8=2, var9=6, var_for_abs=8] [L195] var_for_abs = var3 - var4 [L196] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [var10=6, var11=9, var12=8, var13=7, var14=3, var15=1, var16=2, var17=5, var18=4, var4=1, var5=4, var6=5, var7=7, var8=2, var9=6, var_for_abs=7] [L197] CALL assume(var13 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L197] RET assume(var13 == var_for_abs) VAL [var10=6, var11=9, var12=8, var13=7, var14=3, var15=1, var16=2, var17=5, var18=4, var4=1, var5=4, var6=5, var7=7, var8=2, var9=6, var_for_abs=7] [L198] var_for_abs = var4 - var5 [L199] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [var10=6, var11=9, var12=8, var13=7, var14=3, var15=1, var16=2, var17=5, var18=4, var5=4, var6=5, var7=7, var8=2, var9=6, var_for_abs=3] [L200] CALL assume(var14 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L200] RET assume(var14 == var_for_abs) VAL [var10=6, var11=9, var12=8, var13=7, var14=3, var15=1, var16=2, var17=5, var18=4, var5=4, var6=5, var7=7, var8=2, var9=6, var_for_abs=3] [L201] var_for_abs = var5 - var6 [L202] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [var10=6, var11=9, var12=8, var13=7, var14=3, var15=1, var16=2, var17=5, var18=4, var6=5, var7=7, var8=2, var9=6, var_for_abs=1] [L203] CALL assume(var15 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L203] RET assume(var15 == var_for_abs) VAL [var10=6, var11=9, var12=8, var13=7, var14=3, var15=1, var16=2, var17=5, var18=4, var6=5, var7=7, var8=2, var9=6, var_for_abs=1] [L204] var_for_abs = var6 - var7 [L205] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [var10=6, var11=9, var12=8, var13=7, var14=3, var15=1, var16=2, var17=5, var18=4, var7=7, var8=2, var9=6, var_for_abs=2] [L206] CALL assume(var16 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L206] RET assume(var16 == var_for_abs) VAL [var10=6, var11=9, var12=8, var13=7, var14=3, var15=1, var16=2, var17=5, var18=4, var7=7, var8=2, var9=6, var_for_abs=2] [L207] var_for_abs = var7 - var8 [L208] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [var10=6, var11=9, var12=8, var13=7, var14=3, var15=1, var16=2, var17=5, var18=4, var8=2, var9=6, var_for_abs=5] [L209] CALL assume(var17 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L209] RET assume(var17 == var_for_abs) VAL [var10=6, var11=9, var12=8, var13=7, var14=3, var15=1, var16=2, var17=5, var18=4, var8=2, var9=6, var_for_abs=5] [L210] var_for_abs = var8 - var9 [L211] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [var10=6, var11=9, var12=8, var13=7, var14=3, var15=1, var16=2, var17=5, var18=4, var_for_abs=4] [L212] CALL assume(var18 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L212] RET assume(var18 == var_for_abs) VAL [var10=6, var11=9, var12=8, var13=7, var14=3, var15=1, var16=2, var17=5, var18=4, var_for_abs=4] [L213] reach_error() VAL [var10=6, var11=9, var12=8, var13=7, var14=3, var15=1, var16=2, var17=5, var18=4, var_for_abs=4] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 167 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.9s, OverallIterations: 2, TraceHistogramMax: 128, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 290 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 290 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 386 GetRequests, 386 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=167occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 2.9s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 1342 NumberOfCodeBlocks, 1342 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 670 ConstructedInterpolants, 0 QuantifiedInterpolants, 670 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 32512/32512 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-19 23:05:15,797 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE