/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --traceabstraction.trace.refinement.strategy FIXED_PREFERENCES --cacsl2boogietranslator.allow.undefined.functions true --traceabstraction.smt.solver External_ModelsAndUnsatCoreMode --traceabstraction.command.for.external.solver 'z3 -smt2 -in SMTLIB2_COMPLIANT=true' -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.factorial4even.c -------------------------------------------------------------------------------- This is Ultimate 0.2.5-dev-b75d321-m [2024-11-04 16:15:51,909 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-04 16:15:51,961 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-11-04 16:15:51,965 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-04 16:15:51,965 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-04 16:15:51,985 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-04 16:15:51,986 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-04 16:15:51,986 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-04 16:15:51,987 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-04 16:15:51,990 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-04 16:15:51,990 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-04 16:15:51,990 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-04 16:15:51,990 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-04 16:15:51,991 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-04 16:15:51,991 INFO L153 SettingsManager]: * Use SBE=true [2024-11-04 16:15:51,991 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-04 16:15:51,991 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-04 16:15:51,992 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-04 16:15:51,992 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-04 16:15:51,992 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-04 16:15:51,992 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-04 16:15:51,992 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-04 16:15:51,992 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-04 16:15:51,993 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-04 16:15:51,993 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-04 16:15:51,993 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-04 16:15:51,993 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-04 16:15:51,993 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-04 16:15:51,993 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-04 16:15:51,993 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-04 16:15:51,994 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-04 16:15:51,994 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-04 16:15:51,994 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-04 16:15:51,994 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-04 16:15:51,994 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-04 16:15:51,994 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-04 16:15:51,994 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-04 16:15:51,995 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-04 16:15:51,995 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-04 16:15:51,995 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-04 16:15:51,995 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-04 16:15:51,996 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.traceabstraction: Trace refinement strategy -> FIXED_PREFERENCES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Allow undefined functions -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMT solver -> External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Command for external solver -> z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-04 16:15:52,180 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-04 16:15:52,197 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-04 16:15:52,200 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-04 16:15:52,200 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-04 16:15:52,201 INFO L274 PluginConnector]: CDTParser initialized [2024-11-04 16:15:52,202 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.factorial4even.c [2024-11-04 16:15:53,419 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-04 16:15:53,575 INFO L384 CDTParser]: Found 1 translation units. [2024-11-04 16:15:53,576 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.factorial4even.c [2024-11-04 16:15:53,582 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e303bd287/89723404663f422e98cd7a3823e91d9e/FLAG28039ca5f [2024-11-04 16:15:53,595 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e303bd287/89723404663f422e98cd7a3823e91d9e [2024-11-04 16:15:53,598 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-04 16:15:53,599 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-04 16:15:53,600 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-04 16:15:53,600 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-04 16:15:53,606 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-04 16:15:53,606 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.11 04:15:53" (1/1) ... [2024-11-04 16:15:53,607 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2663edcf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 04:15:53, skipping insertion in model container [2024-11-04 16:15:53,607 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.11 04:15:53" (1/1) ... [2024-11-04 16:15:53,629 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-04 16:15:53,756 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.factorial4even.c[1439,1452] [2024-11-04 16:15:53,779 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-04 16:15:53,788 INFO L200 MainTranslator]: Completed pre-run [2024-11-04 16:15:53,797 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.factorial4even.c[1439,1452] [2024-11-04 16:15:53,809 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-04 16:15:53,823 INFO L204 MainTranslator]: Completed translation [2024-11-04 16:15:53,824 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 04:15:53 WrapperNode [2024-11-04 16:15:53,824 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-04 16:15:53,825 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-04 16:15:53,825 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-04 16:15:53,825 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-04 16:15:53,830 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 04:15:53" (1/1) ... [2024-11-04 16:15:53,839 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 04:15:53" (1/1) ... [2024-11-04 16:15:53,851 INFO L138 Inliner]: procedures = 17, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 58 [2024-11-04 16:15:53,853 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-04 16:15:53,853 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-04 16:15:53,853 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-04 16:15:53,853 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-04 16:15:53,863 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 04:15:53" (1/1) ... [2024-11-04 16:15:53,863 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 04:15:53" (1/1) ... [2024-11-04 16:15:53,865 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 04:15:53" (1/1) ... [2024-11-04 16:15:53,873 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-04 16:15:53,873 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 04:15:53" (1/1) ... [2024-11-04 16:15:53,873 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 04:15:53" (1/1) ... [2024-11-04 16:15:53,876 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 04:15:53" (1/1) ... [2024-11-04 16:15:53,878 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 04:15:53" (1/1) ... [2024-11-04 16:15:53,879 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 04:15:53" (1/1) ... [2024-11-04 16:15:53,880 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 04:15:53" (1/1) ... [2024-11-04 16:15:53,881 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-04 16:15:53,882 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-04 16:15:53,882 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-04 16:15:53,882 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-04 16:15:53,883 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 04:15:53" (1/1) ... [2024-11-04 16:15:53,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-04 16:15:53,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-04 16:15:53,905 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-04 16:15:53,907 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-04 16:15:53,929 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-04 16:15:53,929 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-04 16:15:53,929 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-04 16:15:53,929 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-04 16:15:53,929 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-04 16:15:53,929 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-04 16:15:53,986 INFO L238 CfgBuilder]: Building ICFG [2024-11-04 16:15:53,987 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-04 16:15:54,136 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2024-11-04 16:15:54,136 INFO L287 CfgBuilder]: Performing block encoding [2024-11-04 16:15:54,148 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-04 16:15:54,149 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-04 16:15:54,149 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.11 04:15:54 BoogieIcfgContainer [2024-11-04 16:15:54,149 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-04 16:15:54,152 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-04 16:15:54,152 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-04 16:15:54,155 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-04 16:15:54,156 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.11 04:15:53" (1/3) ... [2024-11-04 16:15:54,156 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@503652e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.11 04:15:54, skipping insertion in model container [2024-11-04 16:15:54,156 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 04:15:53" (2/3) ... [2024-11-04 16:15:54,157 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@503652e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.11 04:15:54, skipping insertion in model container [2024-11-04 16:15:54,157 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.11 04:15:54" (3/3) ... [2024-11-04 16:15:54,159 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.factorial4even.c [2024-11-04 16:15:54,174 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-04 16:15:54,174 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-04 16:15:54,224 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-04 16:15:54,229 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;@d15d594, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-04 16:15:54,230 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-04 16:15:54,234 INFO L276 IsEmpty]: Start isEmpty. Operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-04 16:15:54,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-04 16:15:54,239 INFO L207 NwaCegarLoop]: Found error trace [2024-11-04 16:15:54,240 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-04 16:15:54,240 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-04 16:15:54,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-04 16:15:54,247 INFO L85 PathProgramCache]: Analyzing trace with hash 1806460890, now seen corresponding path program 1 times [2024-11-04 16:15:54,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-04 16:15:54,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1236962690] [2024-11-04 16:15:54,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-04 16:15:54,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-04 16:15:54,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-04 16:15:54,257 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-04 16:15:54,261 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-04 16:15:54,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-04 16:15:54,337 INFO L255 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-04 16:15:54,345 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-04 16:15:54,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-04 16:15:54,476 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-04 16:15:54,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-04 16:15:54,543 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-04 16:15:54,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1236962690] [2024-11-04 16:15:54,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1236962690] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-04 16:15:54,544 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-04 16:15:54,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 9 [2024-11-04 16:15:54,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623020029] [2024-11-04 16:15:54,546 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-04 16:15:54,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-04 16:15:54,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-04 16:15:54,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-04 16:15:54,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-04 16:15:54,571 INFO L87 Difference]: Start difference. First operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 9 states, 8 states have (on average 1.25) internal successors, (10), 7 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-04 16:15:54,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-04 16:15:54,691 INFO L93 Difference]: Finished difference Result 36 states and 48 transitions. [2024-11-04 16:15:54,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-04 16:15:54,693 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.25) internal successors, (10), 7 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-04 16:15:54,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-04 16:15:54,699 INFO L225 Difference]: With dead ends: 36 [2024-11-04 16:15:54,699 INFO L226 Difference]: Without dead ends: 22 [2024-11-04 16:15:54,703 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-11-04 16:15:54,707 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 6 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-04 16:15:54,708 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 54 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-04 16:15:54,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-11-04 16:15:54,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 19. [2024-11-04 16:15:54,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 14 states have internal predecessors, (14), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-04 16:15:54,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2024-11-04 16:15:54,737 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 7 [2024-11-04 16:15:54,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-04 16:15:54,738 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2024-11-04 16:15:54,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.25) internal successors, (10), 7 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-04 16:15:54,738 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2024-11-04 16:15:54,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-04 16:15:54,739 INFO L207 NwaCegarLoop]: Found error trace [2024-11-04 16:15:54,740 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-04 16:15:54,754 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-04 16:15:54,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-04 16:15:54,944 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-04 16:15:54,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-04 16:15:54,945 INFO L85 PathProgramCache]: Analyzing trace with hash -361639814, now seen corresponding path program 1 times [2024-11-04 16:15:54,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-04 16:15:54,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1185720568] [2024-11-04 16:15:54,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-04 16:15:54,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-04 16:15:54,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-04 16:15:54,947 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-04 16:15:54,948 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-04 16:15:55,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-04 16:15:55,006 INFO L255 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-04 16:15:55,008 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-04 16:15:55,119 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-04 16:15:55,119 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-04 16:15:55,234 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-04 16:15:55,235 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-04 16:15:55,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1185720568] [2024-11-04 16:15:55,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1185720568] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-04 16:15:55,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-04 16:15:55,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 10 [2024-11-04 16:15:55,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543187095] [2024-11-04 16:15:55,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-04 16:15:55,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-04 16:15:55,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-04 16:15:55,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-04 16:15:55,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-11-04 16:15:55,238 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-04 16:15:55,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-04 16:15:55,318 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2024-11-04 16:15:55,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-04 16:15:55,318 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2024-11-04 16:15:55,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-04 16:15:55,319 INFO L225 Difference]: With dead ends: 28 [2024-11-04 16:15:55,319 INFO L226 Difference]: Without dead ends: 26 [2024-11-04 16:15:55,319 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-11-04 16:15:55,320 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 4 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-04 16:15:55,320 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 48 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-04 16:15:55,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-11-04 16:15:55,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2024-11-04 16:15:55,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 18 states have internal predecessors, (18), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-04 16:15:55,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2024-11-04 16:15:55,329 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 13 [2024-11-04 16:15:55,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-04 16:15:55,329 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2024-11-04 16:15:55,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-04 16:15:55,329 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2024-11-04 16:15:55,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-04 16:15:55,330 INFO L207 NwaCegarLoop]: Found error trace [2024-11-04 16:15:55,330 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-04 16:15:55,343 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-04 16:15:55,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-04 16:15:55,531 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-04 16:15:55,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-04 16:15:55,531 INFO L85 PathProgramCache]: Analyzing trace with hash -2143106440, now seen corresponding path program 1 times [2024-11-04 16:15:55,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-04 16:15:55,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [358294409] [2024-11-04 16:15:55,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-04 16:15:55,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-04 16:15:55,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-04 16:15:55,533 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-04 16:15:55,534 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-04 16:15:55,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-04 16:15:55,578 INFO L255 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-04 16:15:55,580 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-04 16:15:55,710 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-04 16:15:55,710 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-04 16:15:55,804 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-04 16:15:55,805 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-04 16:15:55,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [358294409] [2024-11-04 16:15:55,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [358294409] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-04 16:15:55,807 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-04 16:15:55,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 12 [2024-11-04 16:15:55,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031631674] [2024-11-04 16:15:55,808 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-04 16:15:55,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-04 16:15:55,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-04 16:15:55,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-04 16:15:55,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-11-04 16:15:55,809 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand has 12 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-04 16:15:56,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-04 16:15:56,027 INFO L93 Difference]: Finished difference Result 47 states and 53 transitions. [2024-11-04 16:15:56,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-04 16:15:56,028 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 20 [2024-11-04 16:15:56,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-04 16:15:56,029 INFO L225 Difference]: With dead ends: 47 [2024-11-04 16:15:56,029 INFO L226 Difference]: Without dead ends: 45 [2024-11-04 16:15:56,030 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2024-11-04 16:15:56,031 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 15 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-04 16:15:56,031 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 52 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-04 16:15:56,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-11-04 16:15:56,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2024-11-04 16:15:56,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 29 states have internal predecessors, (29), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-04 16:15:56,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2024-11-04 16:15:56,042 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 20 [2024-11-04 16:15:56,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-04 16:15:56,043 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2024-11-04 16:15:56,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-04 16:15:56,043 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2024-11-04 16:15:56,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-04 16:15:56,044 INFO L207 NwaCegarLoop]: Found error trace [2024-11-04 16:15:56,044 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-11-04 16:15:56,058 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-04 16:15:56,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-04 16:15:56,248 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-04 16:15:56,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-04 16:15:56,249 INFO L85 PathProgramCache]: Analyzing trace with hash 2135901336, now seen corresponding path program 2 times [2024-11-04 16:15:56,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-04 16:15:56,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [221820220] [2024-11-04 16:15:56,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-04 16:15:56,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-04 16:15:56,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-04 16:15:56,251 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-04 16:15:56,252 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-04 16:15:56,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-04 16:15:56,305 INFO L255 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-04 16:15:56,307 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-04 16:15:56,474 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-04 16:15:56,474 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-04 16:15:56,591 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-04 16:15:56,592 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-04 16:15:56,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [221820220] [2024-11-04 16:15:56,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [221820220] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-04 16:15:56,592 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-04 16:15:56,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 12 [2024-11-04 16:15:56,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241092925] [2024-11-04 16:15:56,592 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-04 16:15:56,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-04 16:15:56,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-04 16:15:56,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-04 16:15:56,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-11-04 16:15:56,594 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 5 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-04 16:15:56,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-04 16:15:56,781 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2024-11-04 16:15:56,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-04 16:15:56,782 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 5 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 26 [2024-11-04 16:15:56,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-04 16:15:56,784 INFO L225 Difference]: With dead ends: 48 [2024-11-04 16:15:56,784 INFO L226 Difference]: Without dead ends: 46 [2024-11-04 16:15:56,784 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2024-11-04 16:15:56,785 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 7 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-04 16:15:56,786 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 64 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-04 16:15:56,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-11-04 16:15:56,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-11-04 16:15:56,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 31 states have (on average 1.032258064516129) internal successors, (32), 32 states have internal predecessors, (32), 9 states have call successors, (9), 5 states have call predecessors, (9), 5 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-04 16:15:56,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2024-11-04 16:15:56,794 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 26 [2024-11-04 16:15:56,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-04 16:15:56,794 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2024-11-04 16:15:56,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 5 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-04 16:15:56,795 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2024-11-04 16:15:56,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-04 16:15:56,795 INFO L207 NwaCegarLoop]: Found error trace [2024-11-04 16:15:56,796 INFO L215 NwaCegarLoop]: trace histogram [8, 7, 7, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1] [2024-11-04 16:15:56,808 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-04 16:15:56,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-04 16:15:57,000 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-04 16:15:57,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-04 16:15:57,000 INFO L85 PathProgramCache]: Analyzing trace with hash -291480616, now seen corresponding path program 3 times [2024-11-04 16:15:57,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-04 16:15:57,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1244166892] [2024-11-04 16:15:57,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-04 16:15:57,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-04 16:15:57,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-04 16:15:57,002 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-04 16:15:57,003 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-04 16:15:57,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-04 16:15:57,061 INFO L255 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-04 16:15:57,064 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-04 16:15:57,304 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 13 proven. 43 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-04 16:15:57,304 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-04 16:16:03,867 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 14 proven. 27 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-04 16:16:03,869 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-04 16:16:03,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1244166892] [2024-11-04 16:16:03,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1244166892] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-04 16:16:03,870 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-04 16:16:03,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2024-11-04 16:16:03,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673722281] [2024-11-04 16:16:03,870 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-04 16:16:03,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-04 16:16:03,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-04 16:16:03,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-04 16:16:03,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=202, Unknown=1, NotChecked=0, Total=240 [2024-11-04 16:16:03,873 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand has 16 states, 14 states have (on average 2.5) internal successors, (35), 15 states have internal predecessors, (35), 9 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 7 states have call predecessors, (13), 7 states have call successors, (13) [2024-11-04 16:16:06,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-04 16:16:06,839 INFO L93 Difference]: Finished difference Result 56 states and 58 transitions. [2024-11-04 16:16:06,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-04 16:16:06,840 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 2.5) internal successors, (35), 15 states have internal predecessors, (35), 9 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 7 states have call predecessors, (13), 7 states have call successors, (13) Word has length 52 [2024-11-04 16:16:06,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-04 16:16:06,841 INFO L225 Difference]: With dead ends: 56 [2024-11-04 16:16:06,841 INFO L226 Difference]: Without dead ends: 54 [2024-11-04 16:16:06,841 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 87 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=63, Invalid=316, Unknown=1, NotChecked=0, Total=380 [2024-11-04 16:16:06,842 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 3 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-04 16:16:06,842 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 118 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-04 16:16:06,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-11-04 16:16:06,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2024-11-04 16:16:06,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 37 states have (on average 1.027027027027027) internal successors, (38), 38 states have internal predecessors, (38), 9 states have call successors, (9), 7 states have call predecessors, (9), 7 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-04 16:16:06,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 56 transitions. [2024-11-04 16:16:06,852 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 56 transitions. Word has length 52 [2024-11-04 16:16:06,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-04 16:16:06,853 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 56 transitions. [2024-11-04 16:16:06,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 2.5) internal successors, (35), 15 states have internal predecessors, (35), 9 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 7 states have call predecessors, (13), 7 states have call successors, (13) [2024-11-04 16:16:06,853 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 56 transitions. [2024-11-04 16:16:06,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-04 16:16:06,854 INFO L207 NwaCegarLoop]: Found error trace [2024-11-04 16:16:06,854 INFO L215 NwaCegarLoop]: trace histogram [9, 8, 8, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2024-11-04 16:16:06,866 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-04 16:16:07,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-04 16:16:07,056 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-04 16:16:07,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-04 16:16:07,057 INFO L85 PathProgramCache]: Analyzing trace with hash 1952471386, now seen corresponding path program 4 times [2024-11-04 16:16:07,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-04 16:16:07,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2131238788] [2024-11-04 16:16:07,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-04 16:16:07,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-04 16:16:07,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-04 16:16:07,058 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-04 16:16:07,059 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-04 16:16:07,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-04 16:16:07,128 INFO L255 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-04 16:16:07,133 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-04 16:16:10,399 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 15 proven. 60 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2024-11-04 16:16:10,399 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-04 16:16:12,770 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 16 proven. 38 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-04 16:16:12,770 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-04 16:16:12,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2131238788] [2024-11-04 16:16:12,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [2131238788] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-04 16:16:12,771 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-04 16:16:12,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 18 [2024-11-04 16:16:12,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315382097] [2024-11-04 16:16:12,771 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-04 16:16:12,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-04 16:16:12,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-04 16:16:12,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-04 16:16:12,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2024-11-04 16:16:12,773 INFO L87 Difference]: Start difference. First operand 54 states and 56 transitions. Second operand has 18 states, 17 states have (on average 2.3529411764705883) internal successors, (40), 17 states have internal predecessors, (40), 9 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (16), 8 states have call predecessors, (16), 8 states have call successors, (16) [2024-11-04 16:16:18,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-04 16:16:18,785 INFO L93 Difference]: Finished difference Result 88 states and 100 transitions. [2024-11-04 16:16:18,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-04 16:16:18,786 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.3529411764705883) internal successors, (40), 17 states have internal predecessors, (40), 9 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (16), 8 states have call predecessors, (16), 8 states have call successors, (16) Word has length 59 [2024-11-04 16:16:18,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-04 16:16:18,787 INFO L225 Difference]: With dead ends: 88 [2024-11-04 16:16:18,787 INFO L226 Difference]: Without dead ends: 86 [2024-11-04 16:16:18,788 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=220, Invalid=772, Unknown=0, NotChecked=0, Total=992 [2024-11-04 16:16:18,788 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 24 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-04 16:16:18,788 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 128 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-11-04 16:16:18,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-04 16:16:18,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 83. [2024-11-04 16:16:18,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 55 states have (on average 1.018181818181818) internal successors, (56), 56 states have internal predecessors, (56), 19 states have call successors, (19), 8 states have call predecessors, (19), 8 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-04 16:16:18,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 94 transitions. [2024-11-04 16:16:18,806 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 94 transitions. Word has length 59 [2024-11-04 16:16:18,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-04 16:16:18,806 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 94 transitions. [2024-11-04 16:16:18,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.3529411764705883) internal successors, (40), 17 states have internal predecessors, (40), 9 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (16), 8 states have call predecessors, (16), 8 states have call successors, (16) [2024-11-04 16:16:18,807 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 94 transitions. [2024-11-04 16:16:18,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-04 16:16:18,808 INFO L207 NwaCegarLoop]: Found error trace [2024-11-04 16:16:18,808 INFO L215 NwaCegarLoop]: trace histogram [19, 18, 18, 10, 10, 9, 9, 9, 9, 9, 1, 1, 1, 1] [2024-11-04 16:16:18,821 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-04 16:16:19,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-04 16:16:19,009 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-04 16:16:19,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-04 16:16:19,009 INFO L85 PathProgramCache]: Analyzing trace with hash 683247480, now seen corresponding path program 5 times [2024-11-04 16:16:19,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-04 16:16:19,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1005525267] [2024-11-04 16:16:19,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-04 16:16:19,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-04 16:16:19,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-04 16:16:19,011 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-04 16:16:19,012 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-04 16:16:19,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-04 16:16:19,103 INFO L255 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-04 16:16:19,107 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-04 16:16:26,245 INFO L134 CoverageAnalysis]: Checked inductivity of 846 backedges. 35 proven. 250 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2024-11-04 16:16:26,245 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-04 16:16:31,828 INFO L134 CoverageAnalysis]: Checked inductivity of 846 backedges. 36 proven. 198 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-04 16:16:31,828 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-04 16:16:31,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1005525267] [2024-11-04 16:16:31,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1005525267] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-04 16:16:31,829 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-04 16:16:31,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15] total 28 [2024-11-04 16:16:31,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533026162] [2024-11-04 16:16:31,829 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-04 16:16:31,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-04 16:16:31,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-04 16:16:31,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-04 16:16:31,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=610, Unknown=0, NotChecked=0, Total=756 [2024-11-04 16:16:31,831 INFO L87 Difference]: Start difference. First operand 83 states and 94 transitions. Second operand has 28 states, 27 states have (on average 2.5925925925925926) internal successors, (70), 27 states have internal predecessors, (70), 19 states have call successors, (38), 3 states have call predecessors, (38), 2 states have return successors, (36), 18 states have call predecessors, (36), 18 states have call successors, (36) [2024-11-04 16:16:50,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-04 16:16:50,948 INFO L93 Difference]: Finished difference Result 147 states and 180 transitions. [2024-11-04 16:16:50,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2024-11-04 16:16:50,949 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.5925925925925926) internal successors, (70), 27 states have internal predecessors, (70), 19 states have call successors, (38), 3 states have call predecessors, (38), 2 states have return successors, (36), 18 states have call predecessors, (36), 18 states have call successors, (36) Word has length 124 [2024-11-04 16:16:50,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-04 16:16:50,950 INFO L225 Difference]: With dead ends: 147 [2024-11-04 16:16:50,950 INFO L226 Difference]: Without dead ends: 145 [2024-11-04 16:16:50,951 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 630 ImplicationChecksByTransitivity, 17.1s TimeCoverageRelationStatistics Valid=736, Invalid=2686, Unknown=0, NotChecked=0, Total=3422 [2024-11-04 16:16:50,952 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 46 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 834 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 899 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 834 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.7s IncrementalHoareTripleChecker+Time [2024-11-04 16:16:50,952 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 359 Invalid, 899 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 834 Invalid, 0 Unknown, 0 Unchecked, 8.7s Time] [2024-11-04 16:16:50,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2024-11-04 16:16:50,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 142. [2024-11-04 16:16:50,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 91 states have (on average 1.010989010989011) internal successors, (92), 92 states have internal predecessors, (92), 41 states have call successors, (41), 9 states have call predecessors, (41), 9 states have return successors, (41), 40 states have call predecessors, (41), 41 states have call successors, (41) [2024-11-04 16:16:50,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 174 transitions. [2024-11-04 16:16:50,987 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 174 transitions. Word has length 124 [2024-11-04 16:16:50,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-04 16:16:50,988 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 174 transitions. [2024-11-04 16:16:50,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.5925925925925926) internal successors, (70), 27 states have internal predecessors, (70), 19 states have call successors, (38), 3 states have call predecessors, (38), 2 states have return successors, (36), 18 states have call predecessors, (36), 18 states have call successors, (36) [2024-11-04 16:16:50,988 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 174 transitions. [2024-11-04 16:16:50,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-04 16:16:50,990 INFO L207 NwaCegarLoop]: Found error trace [2024-11-04 16:16:50,990 INFO L215 NwaCegarLoop]: trace histogram [29, 28, 28, 15, 15, 14, 14, 14, 14, 14, 1, 1, 1, 1] [2024-11-04 16:16:51,003 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-04 16:16:51,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-04 16:16:51,192 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-04 16:16:51,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-04 16:16:51,192 INFO L85 PathProgramCache]: Analyzing trace with hash 1132989722, now seen corresponding path program 6 times [2024-11-04 16:16:51,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-04 16:16:51,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [751537528] [2024-11-04 16:16:51,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-04 16:16:51,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-04 16:16:51,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-04 16:16:51,194 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-04 16:16:51,196 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-04 16:16:51,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-04 16:16:51,315 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-04 16:16:51,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-04 16:16:51,466 INFO L130 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2024-11-04 16:16:51,466 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-04 16:16:51,467 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-04 16:16:51,484 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-04 16:16:51,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-04 16:16:51,675 INFO L407 BasicCegarLoop]: Path program histogram: [6, 1, 1] [2024-11-04 16:16:51,747 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-04 16:16:51,749 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.11 04:16:51 BoogieIcfgContainer [2024-11-04 16:16:51,749 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-04 16:16:51,750 INFO L158 Benchmark]: Toolchain (without parser) took 58150.58ms. Allocated memory was 343.9MB in the beginning and 468.7MB in the end (delta: 124.8MB). Free memory was 294.3MB in the beginning and 244.1MB in the end (delta: 50.2MB). Peak memory consumption was 176.4MB. Max. memory is 8.0GB. [2024-11-04 16:16:51,750 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 212.9MB. Free memory is still 165.4MB. There was no memory consumed. Max. memory is 8.0GB. [2024-11-04 16:16:51,750 INFO L158 Benchmark]: CACSL2BoogieTranslator took 224.18ms. Allocated memory is still 343.9MB. Free memory was 294.3MB in the beginning and 280.7MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2024-11-04 16:16:51,750 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.11ms. Allocated memory is still 343.9MB. Free memory was 280.7MB in the beginning and 279.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-11-04 16:16:51,753 INFO L158 Benchmark]: Boogie Preprocessor took 28.24ms. Allocated memory is still 343.9MB. Free memory was 279.1MB in the beginning and 277.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-11-04 16:16:51,753 INFO L158 Benchmark]: RCFGBuilder took 267.18ms. Allocated memory is still 343.9MB. Free memory was 277.0MB in the beginning and 264.8MB in the end (delta: 12.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2024-11-04 16:16:51,753 INFO L158 Benchmark]: TraceAbstraction took 57597.47ms. Allocated memory was 343.9MB in the beginning and 468.7MB in the end (delta: 124.8MB). Free memory was 264.0MB in the beginning and 244.1MB in the end (delta: 19.9MB). Peak memory consumption was 146.0MB. Max. memory is 8.0GB. [2024-11-04 16:16:51,754 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.09ms. Allocated memory is still 212.9MB. Free memory is still 165.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 224.18ms. Allocated memory is still 343.9MB. Free memory was 294.3MB in the beginning and 280.7MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 28.11ms. Allocated memory is still 343.9MB. Free memory was 280.7MB in the beginning and 279.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 28.24ms. Allocated memory is still 343.9MB. Free memory was 279.1MB in the beginning and 277.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 267.18ms. Allocated memory is still 343.9MB. Free memory was 277.0MB in the beginning and 264.8MB in the end (delta: 12.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 57597.47ms. Allocated memory was 343.9MB in the beginning and 468.7MB in the end (delta: 124.8MB). Free memory was 264.0MB in the beginning and 244.1MB in the end (delta: 19.9MB). Peak memory consumption was 146.0MB. Max. memory is 8.0GB. * 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: 29]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L34] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 4); [L35] const SORT_1 msb_SORT_1 = (SORT_1)1 << (4 - 1); [L37] const SORT_12 mask_SORT_12 = (SORT_12)-1 >> (sizeof(SORT_12) * 8 - 1); [L38] const SORT_12 msb_SORT_12 = (SORT_12)1 << (1 - 1); [L40] const SORT_1 var_2 = 1; [L41] const SORT_1 var_11 = mask_SORT_1; [L42] const SORT_1 var_16 = 3; [L45] SORT_1 state_3 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L46] SORT_1 state_4 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L48] SORT_1 init_5_arg_1 = var_2; [L49] state_3 = init_5_arg_1 [L50] SORT_1 init_6_arg_1 = var_2; [L51] state_4 = init_6_arg_1 VAL [mask_SORT_12=1, mask_SORT_1=15, state_3=1, state_4=1, var_11=15, var_16=3, var_2=1] [L56] SORT_1 var_13_arg_0 = state_4; [L57] SORT_1 var_13_arg_1 = var_11; [L58] SORT_12 var_13 = var_13_arg_0 == var_13_arg_1; [L59] SORT_12 bad_14_arg_0 = var_13; VAL [bad_14_arg_0=0, mask_SORT_12=1, mask_SORT_1=15, state_3=1, state_4=1, var_11=15, var_16=3, var_2=1] [L60] CALL __VERIFIER_assert(!(bad_14_arg_0)) VAL [\old(cond)=1] [L29] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L60] RET __VERIFIER_assert(!(bad_14_arg_0)) VAL [bad_14_arg_0=0, mask_SORT_12=1, mask_SORT_1=15, state_3=1, state_4=1, var_11=15, var_16=3, var_2=1] [L61] SORT_1 var_17_arg_0 = state_4; [L62] SORT_1 var_17_arg_1 = var_16; [L63] SORT_12 var_17 = var_17_arg_0 > var_17_arg_1; [L64] SORT_1 var_15_arg_0 = state_3; [L65] SORT_12 var_15 = var_15_arg_0 >> 0; [L66] SORT_12 var_18_arg_0 = var_17; [L67] SORT_12 var_18_arg_1 = var_15; [L68] SORT_12 var_18 = var_18_arg_0 & var_18_arg_1; [L69] var_18 = var_18 & mask_SORT_12 [L70] SORT_12 bad_19_arg_0 = var_18; VAL [bad_14_arg_0=0, bad_19_arg_0=0, mask_SORT_12=1, mask_SORT_1=15, state_3=1, state_4=1, var_11=15, var_16=3, var_2=1] [L71] CALL __VERIFIER_assert(!(bad_19_arg_0)) VAL [\old(cond)=1] [L29] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L71] RET __VERIFIER_assert(!(bad_19_arg_0)) VAL [bad_14_arg_0=0, bad_19_arg_0=0, mask_SORT_12=1, mask_SORT_1=15, state_3=1, state_4=1, var_11=15, var_16=3, var_2=1] [L73] SORT_1 var_7_arg_0 = state_4; [L74] SORT_1 var_7_arg_1 = var_2; [L75] SORT_1 var_7 = var_7_arg_0 + var_7_arg_1; [L76] var_7 = var_7 & mask_SORT_1 [L77] SORT_1 next_9_arg_1 = var_7; [L78] SORT_1 var_8_arg_0 = state_3; [L79] SORT_1 var_8_arg_1 = state_4; [L80] SORT_1 var_8 = var_8_arg_0 * var_8_arg_1; [L81] SORT_1 next_10_arg_1 = var_8; [L83] state_4 = next_9_arg_1 [L84] state_3 = next_10_arg_1 [L56] SORT_1 var_13_arg_0 = state_4; [L57] SORT_1 var_13_arg_1 = var_11; [L58] SORT_12 var_13 = var_13_arg_0 == var_13_arg_1; [L59] SORT_12 bad_14_arg_0 = var_13; VAL [bad_14_arg_0=0, mask_SORT_12=1, mask_SORT_1=15, state_3=1, state_4=2, var_11=15, var_16=3, var_2=1] [L60] CALL __VERIFIER_assert(!(bad_14_arg_0)) VAL [\old(cond)=1] [L29] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L60] RET __VERIFIER_assert(!(bad_14_arg_0)) VAL [bad_14_arg_0=0, mask_SORT_12=1, mask_SORT_1=15, state_3=1, state_4=2, var_11=15, var_16=3, var_2=1] [L61] SORT_1 var_17_arg_0 = state_4; [L62] SORT_1 var_17_arg_1 = var_16; [L63] SORT_12 var_17 = var_17_arg_0 > var_17_arg_1; [L64] SORT_1 var_15_arg_0 = state_3; [L65] SORT_12 var_15 = var_15_arg_0 >> 0; [L66] SORT_12 var_18_arg_0 = var_17; [L67] SORT_12 var_18_arg_1 = var_15; [L68] SORT_12 var_18 = var_18_arg_0 & var_18_arg_1; [L69] var_18 = var_18 & mask_SORT_12 [L70] SORT_12 bad_19_arg_0 = var_18; VAL [bad_14_arg_0=0, bad_19_arg_0=0, mask_SORT_12=1, mask_SORT_1=15, state_3=1, state_4=2, var_11=15, var_16=3, var_2=1] [L71] CALL __VERIFIER_assert(!(bad_19_arg_0)) VAL [\old(cond)=1] [L29] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L71] RET __VERIFIER_assert(!(bad_19_arg_0)) VAL [bad_14_arg_0=0, bad_19_arg_0=0, mask_SORT_12=1, mask_SORT_1=15, state_3=1, state_4=2, var_11=15, var_16=3, var_2=1] [L73] SORT_1 var_7_arg_0 = state_4; [L74] SORT_1 var_7_arg_1 = var_2; [L75] SORT_1 var_7 = var_7_arg_0 + var_7_arg_1; [L76] var_7 = var_7 & mask_SORT_1 [L77] SORT_1 next_9_arg_1 = var_7; [L78] SORT_1 var_8_arg_0 = state_3; [L79] SORT_1 var_8_arg_1 = state_4; [L80] SORT_1 var_8 = var_8_arg_0 * var_8_arg_1; [L81] SORT_1 next_10_arg_1 = var_8; [L83] state_4 = next_9_arg_1 [L84] state_3 = next_10_arg_1 [L56] SORT_1 var_13_arg_0 = state_4; [L57] SORT_1 var_13_arg_1 = var_11; [L58] SORT_12 var_13 = var_13_arg_0 == var_13_arg_1; [L59] SORT_12 bad_14_arg_0 = var_13; VAL [bad_14_arg_0=0, mask_SORT_12=1, mask_SORT_1=15, state_3=2, state_4=3, var_11=15, var_16=3, var_2=1] [L60] CALL __VERIFIER_assert(!(bad_14_arg_0)) VAL [\old(cond)=1] [L29] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L60] RET __VERIFIER_assert(!(bad_14_arg_0)) VAL [bad_14_arg_0=0, mask_SORT_12=1, mask_SORT_1=15, state_3=2, state_4=3, var_11=15, var_16=3, var_2=1] [L61] SORT_1 var_17_arg_0 = state_4; [L62] SORT_1 var_17_arg_1 = var_16; [L63] SORT_12 var_17 = var_17_arg_0 > var_17_arg_1; [L64] SORT_1 var_15_arg_0 = state_3; [L65] SORT_12 var_15 = var_15_arg_0 >> 0; [L66] SORT_12 var_18_arg_0 = var_17; [L67] SORT_12 var_18_arg_1 = var_15; [L68] SORT_12 var_18 = var_18_arg_0 & var_18_arg_1; [L69] var_18 = var_18 & mask_SORT_12 [L70] SORT_12 bad_19_arg_0 = var_18; VAL [bad_14_arg_0=0, bad_19_arg_0=0, mask_SORT_12=1, mask_SORT_1=15, state_3=2, state_4=3, var_11=15, var_16=3, var_2=1] [L71] CALL __VERIFIER_assert(!(bad_19_arg_0)) VAL [\old(cond)=1] [L29] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L71] RET __VERIFIER_assert(!(bad_19_arg_0)) VAL [bad_14_arg_0=0, bad_19_arg_0=0, mask_SORT_12=1, mask_SORT_1=15, state_3=2, state_4=3, var_11=15, var_16=3, var_2=1] [L73] SORT_1 var_7_arg_0 = state_4; [L74] SORT_1 var_7_arg_1 = var_2; [L75] SORT_1 var_7 = var_7_arg_0 + var_7_arg_1; [L76] var_7 = var_7 & mask_SORT_1 [L77] SORT_1 next_9_arg_1 = var_7; [L78] SORT_1 var_8_arg_0 = state_3; [L79] SORT_1 var_8_arg_1 = state_4; [L80] SORT_1 var_8 = var_8_arg_0 * var_8_arg_1; [L81] SORT_1 next_10_arg_1 = var_8; [L83] state_4 = next_9_arg_1 [L84] state_3 = next_10_arg_1 [L56] SORT_1 var_13_arg_0 = state_4; [L57] SORT_1 var_13_arg_1 = var_11; [L58] SORT_12 var_13 = var_13_arg_0 == var_13_arg_1; [L59] SORT_12 bad_14_arg_0 = var_13; VAL [bad_14_arg_0=0, mask_SORT_12=1, mask_SORT_1=15, state_3=6, state_4=4, var_11=15, var_16=3, var_2=1] [L60] CALL __VERIFIER_assert(!(bad_14_arg_0)) VAL [\old(cond)=1] [L29] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L60] RET __VERIFIER_assert(!(bad_14_arg_0)) VAL [bad_14_arg_0=0, mask_SORT_12=1, mask_SORT_1=15, state_3=6, state_4=4, var_11=15, var_16=3, var_2=1] [L61] SORT_1 var_17_arg_0 = state_4; [L62] SORT_1 var_17_arg_1 = var_16; [L63] SORT_12 var_17 = var_17_arg_0 > var_17_arg_1; [L64] SORT_1 var_15_arg_0 = state_3; [L65] SORT_12 var_15 = var_15_arg_0 >> 0; [L66] SORT_12 var_18_arg_0 = var_17; [L67] SORT_12 var_18_arg_1 = var_15; [L68] SORT_12 var_18 = var_18_arg_0 & var_18_arg_1; [L69] var_18 = var_18 & mask_SORT_12 [L70] SORT_12 bad_19_arg_0 = var_18; VAL [bad_14_arg_0=0, bad_19_arg_0=0, mask_SORT_12=1, mask_SORT_1=15, state_3=6, state_4=4, var_11=15, var_16=3, var_2=1] [L71] CALL __VERIFIER_assert(!(bad_19_arg_0)) VAL [\old(cond)=1] [L29] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L71] RET __VERIFIER_assert(!(bad_19_arg_0)) VAL [bad_14_arg_0=0, bad_19_arg_0=0, mask_SORT_12=1, mask_SORT_1=15, state_3=6, state_4=4, var_11=15, var_16=3, var_2=1] [L73] SORT_1 var_7_arg_0 = state_4; [L74] SORT_1 var_7_arg_1 = var_2; [L75] SORT_1 var_7 = var_7_arg_0 + var_7_arg_1; [L76] var_7 = var_7 & mask_SORT_1 [L77] SORT_1 next_9_arg_1 = var_7; [L78] SORT_1 var_8_arg_0 = state_3; [L79] SORT_1 var_8_arg_1 = state_4; [L80] SORT_1 var_8 = var_8_arg_0 * var_8_arg_1; [L81] SORT_1 next_10_arg_1 = var_8; [L83] state_4 = next_9_arg_1 [L84] state_3 = next_10_arg_1 [L56] SORT_1 var_13_arg_0 = state_4; [L57] SORT_1 var_13_arg_1 = var_11; [L58] SORT_12 var_13 = var_13_arg_0 == var_13_arg_1; [L59] SORT_12 bad_14_arg_0 = var_13; VAL [bad_14_arg_0=0, mask_SORT_12=1, mask_SORT_1=15, state_3=24, state_4=5, var_11=15, var_16=3, var_2=1] [L60] CALL __VERIFIER_assert(!(bad_14_arg_0)) VAL [\old(cond)=1] [L29] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L60] RET __VERIFIER_assert(!(bad_14_arg_0)) VAL [bad_14_arg_0=0, mask_SORT_12=1, mask_SORT_1=15, state_3=24, state_4=5, var_11=15, var_16=3, var_2=1] [L61] SORT_1 var_17_arg_0 = state_4; [L62] SORT_1 var_17_arg_1 = var_16; [L63] SORT_12 var_17 = var_17_arg_0 > var_17_arg_1; [L64] SORT_1 var_15_arg_0 = state_3; [L65] SORT_12 var_15 = var_15_arg_0 >> 0; [L66] SORT_12 var_18_arg_0 = var_17; [L67] SORT_12 var_18_arg_1 = var_15; [L68] SORT_12 var_18 = var_18_arg_0 & var_18_arg_1; [L69] var_18 = var_18 & mask_SORT_12 [L70] SORT_12 bad_19_arg_0 = var_18; VAL [bad_14_arg_0=0, bad_19_arg_0=0, mask_SORT_12=1, mask_SORT_1=15, state_3=24, state_4=5, var_11=15, var_16=3, var_2=1] [L71] CALL __VERIFIER_assert(!(bad_19_arg_0)) VAL [\old(cond)=1] [L29] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L71] RET __VERIFIER_assert(!(bad_19_arg_0)) VAL [bad_14_arg_0=0, bad_19_arg_0=0, mask_SORT_12=1, mask_SORT_1=15, state_3=24, state_4=5, var_11=15, var_16=3, var_2=1] [L73] SORT_1 var_7_arg_0 = state_4; [L74] SORT_1 var_7_arg_1 = var_2; [L75] SORT_1 var_7 = var_7_arg_0 + var_7_arg_1; [L76] var_7 = var_7 & mask_SORT_1 [L77] SORT_1 next_9_arg_1 = var_7; [L78] SORT_1 var_8_arg_0 = state_3; [L79] SORT_1 var_8_arg_1 = state_4; [L80] SORT_1 var_8 = var_8_arg_0 * var_8_arg_1; [L81] SORT_1 next_10_arg_1 = var_8; [L83] state_4 = next_9_arg_1 [L84] state_3 = next_10_arg_1 [L56] SORT_1 var_13_arg_0 = state_4; [L57] SORT_1 var_13_arg_1 = var_11; [L58] SORT_12 var_13 = var_13_arg_0 == var_13_arg_1; [L59] SORT_12 bad_14_arg_0 = var_13; VAL [bad_14_arg_0=0, mask_SORT_12=1, mask_SORT_1=15, state_3=120, state_4=6, var_11=15, var_16=3, var_2=1] [L60] CALL __VERIFIER_assert(!(bad_14_arg_0)) VAL [\old(cond)=1] [L29] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L60] RET __VERIFIER_assert(!(bad_14_arg_0)) VAL [bad_14_arg_0=0, mask_SORT_12=1, mask_SORT_1=15, state_3=120, state_4=6, var_11=15, var_16=3, var_2=1] [L61] SORT_1 var_17_arg_0 = state_4; [L62] SORT_1 var_17_arg_1 = var_16; [L63] SORT_12 var_17 = var_17_arg_0 > var_17_arg_1; [L64] SORT_1 var_15_arg_0 = state_3; [L65] SORT_12 var_15 = var_15_arg_0 >> 0; [L66] SORT_12 var_18_arg_0 = var_17; [L67] SORT_12 var_18_arg_1 = var_15; [L68] SORT_12 var_18 = var_18_arg_0 & var_18_arg_1; [L69] var_18 = var_18 & mask_SORT_12 [L70] SORT_12 bad_19_arg_0 = var_18; VAL [bad_14_arg_0=0, bad_19_arg_0=0, mask_SORT_12=1, mask_SORT_1=15, state_3=120, state_4=6, var_11=15, var_16=3, var_2=1] [L71] CALL __VERIFIER_assert(!(bad_19_arg_0)) VAL [\old(cond)=1] [L29] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L71] RET __VERIFIER_assert(!(bad_19_arg_0)) VAL [bad_14_arg_0=0, bad_19_arg_0=0, mask_SORT_12=1, mask_SORT_1=15, state_3=120, state_4=6, var_11=15, var_16=3, var_2=1] [L73] SORT_1 var_7_arg_0 = state_4; [L74] SORT_1 var_7_arg_1 = var_2; [L75] SORT_1 var_7 = var_7_arg_0 + var_7_arg_1; [L76] var_7 = var_7 & mask_SORT_1 [L77] SORT_1 next_9_arg_1 = var_7; [L78] SORT_1 var_8_arg_0 = state_3; [L79] SORT_1 var_8_arg_1 = state_4; [L80] SORT_1 var_8 = var_8_arg_0 * var_8_arg_1; [L81] SORT_1 next_10_arg_1 = var_8; [L83] state_4 = next_9_arg_1 [L84] state_3 = next_10_arg_1 [L56] SORT_1 var_13_arg_0 = state_4; [L57] SORT_1 var_13_arg_1 = var_11; [L58] SORT_12 var_13 = var_13_arg_0 == var_13_arg_1; [L59] SORT_12 bad_14_arg_0 = var_13; VAL [bad_14_arg_0=0, mask_SORT_12=1, mask_SORT_1=15, state_3=-48, state_4=7, var_11=15, var_16=3, var_2=1] [L60] CALL __VERIFIER_assert(!(bad_14_arg_0)) VAL [\old(cond)=1] [L29] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L60] RET __VERIFIER_assert(!(bad_14_arg_0)) VAL [bad_14_arg_0=0, mask_SORT_12=1, mask_SORT_1=15, state_3=-48, state_4=7, var_11=15, var_16=3, var_2=1] [L61] SORT_1 var_17_arg_0 = state_4; [L62] SORT_1 var_17_arg_1 = var_16; [L63] SORT_12 var_17 = var_17_arg_0 > var_17_arg_1; [L64] SORT_1 var_15_arg_0 = state_3; [L65] SORT_12 var_15 = var_15_arg_0 >> 0; [L66] SORT_12 var_18_arg_0 = var_17; [L67] SORT_12 var_18_arg_1 = var_15; [L68] SORT_12 var_18 = var_18_arg_0 & var_18_arg_1; [L69] var_18 = var_18 & mask_SORT_12 [L70] SORT_12 bad_19_arg_0 = var_18; VAL [bad_14_arg_0=0, bad_19_arg_0=0, mask_SORT_12=1, mask_SORT_1=15, state_3=-48, state_4=7, var_11=15, var_16=3, var_2=1] [L71] CALL __VERIFIER_assert(!(bad_19_arg_0)) VAL [\old(cond)=1] [L29] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L71] RET __VERIFIER_assert(!(bad_19_arg_0)) VAL [bad_14_arg_0=0, bad_19_arg_0=0, mask_SORT_12=1, mask_SORT_1=15, state_3=-48, state_4=7, var_11=15, var_16=3, var_2=1] [L73] SORT_1 var_7_arg_0 = state_4; [L74] SORT_1 var_7_arg_1 = var_2; [L75] SORT_1 var_7 = var_7_arg_0 + var_7_arg_1; [L76] var_7 = var_7 & mask_SORT_1 [L77] SORT_1 next_9_arg_1 = var_7; [L78] SORT_1 var_8_arg_0 = state_3; [L79] SORT_1 var_8_arg_1 = state_4; [L80] SORT_1 var_8 = var_8_arg_0 * var_8_arg_1; [L81] SORT_1 next_10_arg_1 = var_8; [L83] state_4 = next_9_arg_1 [L84] state_3 = next_10_arg_1 [L56] SORT_1 var_13_arg_0 = state_4; [L57] SORT_1 var_13_arg_1 = var_11; [L58] SORT_12 var_13 = var_13_arg_0 == var_13_arg_1; [L59] SORT_12 bad_14_arg_0 = var_13; VAL [bad_14_arg_0=0, mask_SORT_12=1, mask_SORT_1=15, state_3=-80, state_4=8, var_11=15, var_16=3, var_2=1] [L60] CALL __VERIFIER_assert(!(bad_14_arg_0)) VAL [\old(cond)=1] [L29] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L60] RET __VERIFIER_assert(!(bad_14_arg_0)) VAL [bad_14_arg_0=0, mask_SORT_12=1, mask_SORT_1=15, state_3=-80, state_4=8, var_11=15, var_16=3, var_2=1] [L61] SORT_1 var_17_arg_0 = state_4; [L62] SORT_1 var_17_arg_1 = var_16; [L63] SORT_12 var_17 = var_17_arg_0 > var_17_arg_1; [L64] SORT_1 var_15_arg_0 = state_3; [L65] SORT_12 var_15 = var_15_arg_0 >> 0; [L66] SORT_12 var_18_arg_0 = var_17; [L67] SORT_12 var_18_arg_1 = var_15; [L68] SORT_12 var_18 = var_18_arg_0 & var_18_arg_1; [L69] var_18 = var_18 & mask_SORT_12 [L70] SORT_12 bad_19_arg_0 = var_18; VAL [bad_14_arg_0=0, bad_19_arg_0=0, mask_SORT_12=1, mask_SORT_1=15, state_3=-80, state_4=8, var_11=15, var_16=3, var_2=1] [L71] CALL __VERIFIER_assert(!(bad_19_arg_0)) VAL [\old(cond)=1] [L29] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L71] RET __VERIFIER_assert(!(bad_19_arg_0)) VAL [bad_14_arg_0=0, bad_19_arg_0=0, mask_SORT_12=1, mask_SORT_1=15, state_3=-80, state_4=8, var_11=15, var_16=3, var_2=1] [L73] SORT_1 var_7_arg_0 = state_4; [L74] SORT_1 var_7_arg_1 = var_2; [L75] SORT_1 var_7 = var_7_arg_0 + var_7_arg_1; [L76] var_7 = var_7 & mask_SORT_1 [L77] SORT_1 next_9_arg_1 = var_7; [L78] SORT_1 var_8_arg_0 = state_3; [L79] SORT_1 var_8_arg_1 = state_4; [L80] SORT_1 var_8 = var_8_arg_0 * var_8_arg_1; [L81] SORT_1 next_10_arg_1 = var_8; [L83] state_4 = next_9_arg_1 [L84] state_3 = next_10_arg_1 [L56] SORT_1 var_13_arg_0 = state_4; [L57] SORT_1 var_13_arg_1 = var_11; [L58] SORT_12 var_13 = var_13_arg_0 == var_13_arg_1; [L59] SORT_12 bad_14_arg_0 = var_13; VAL [bad_14_arg_0=0, mask_SORT_12=1, mask_SORT_1=15, state_3=-128, state_4=9, var_11=15, var_16=3, var_2=1] [L60] CALL __VERIFIER_assert(!(bad_14_arg_0)) VAL [\old(cond)=1] [L29] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L60] RET __VERIFIER_assert(!(bad_14_arg_0)) VAL [bad_14_arg_0=0, mask_SORT_12=1, mask_SORT_1=15, state_3=-128, state_4=9, var_11=15, var_16=3, var_2=1] [L61] SORT_1 var_17_arg_0 = state_4; [L62] SORT_1 var_17_arg_1 = var_16; [L63] SORT_12 var_17 = var_17_arg_0 > var_17_arg_1; [L64] SORT_1 var_15_arg_0 = state_3; [L65] SORT_12 var_15 = var_15_arg_0 >> 0; [L66] SORT_12 var_18_arg_0 = var_17; [L67] SORT_12 var_18_arg_1 = var_15; [L68] SORT_12 var_18 = var_18_arg_0 & var_18_arg_1; [L69] var_18 = var_18 & mask_SORT_12 [L70] SORT_12 bad_19_arg_0 = var_18; VAL [bad_14_arg_0=0, bad_19_arg_0=0, mask_SORT_12=1, mask_SORT_1=15, state_3=-128, state_4=9, var_11=15, var_16=3, var_2=1] [L71] CALL __VERIFIER_assert(!(bad_19_arg_0)) VAL [\old(cond)=1] [L29] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L71] RET __VERIFIER_assert(!(bad_19_arg_0)) VAL [bad_14_arg_0=0, bad_19_arg_0=0, mask_SORT_12=1, mask_SORT_1=15, state_3=-128, state_4=9, var_11=15, var_16=3, var_2=1] [L73] SORT_1 var_7_arg_0 = state_4; [L74] SORT_1 var_7_arg_1 = var_2; [L75] SORT_1 var_7 = var_7_arg_0 + var_7_arg_1; [L76] var_7 = var_7 & mask_SORT_1 [L77] SORT_1 next_9_arg_1 = var_7; [L78] SORT_1 var_8_arg_0 = state_3; [L79] SORT_1 var_8_arg_1 = state_4; [L80] SORT_1 var_8 = var_8_arg_0 * var_8_arg_1; [L81] SORT_1 next_10_arg_1 = var_8; [L83] state_4 = next_9_arg_1 [L84] state_3 = next_10_arg_1 [L56] SORT_1 var_13_arg_0 = state_4; [L57] SORT_1 var_13_arg_1 = var_11; [L58] SORT_12 var_13 = var_13_arg_0 == var_13_arg_1; [L59] SORT_12 bad_14_arg_0 = var_13; VAL [bad_14_arg_0=0, mask_SORT_12=1, mask_SORT_1=15, state_3=-128, state_4=10, var_11=15, var_16=3, var_2=1] [L60] CALL __VERIFIER_assert(!(bad_14_arg_0)) VAL [\old(cond)=1] [L29] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L60] RET __VERIFIER_assert(!(bad_14_arg_0)) VAL [bad_14_arg_0=0, mask_SORT_12=1, mask_SORT_1=15, state_3=-128, state_4=10, var_11=15, var_16=3, var_2=1] [L61] SORT_1 var_17_arg_0 = state_4; [L62] SORT_1 var_17_arg_1 = var_16; [L63] SORT_12 var_17 = var_17_arg_0 > var_17_arg_1; [L64] SORT_1 var_15_arg_0 = state_3; [L65] SORT_12 var_15 = var_15_arg_0 >> 0; [L66] SORT_12 var_18_arg_0 = var_17; [L67] SORT_12 var_18_arg_1 = var_15; [L68] SORT_12 var_18 = var_18_arg_0 & var_18_arg_1; [L69] var_18 = var_18 & mask_SORT_12 [L70] SORT_12 bad_19_arg_0 = var_18; VAL [bad_14_arg_0=0, bad_19_arg_0=0, mask_SORT_12=1, mask_SORT_1=15, state_3=-128, state_4=10, var_11=15, var_16=3, var_2=1] [L71] CALL __VERIFIER_assert(!(bad_19_arg_0)) VAL [\old(cond)=1] [L29] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L71] RET __VERIFIER_assert(!(bad_19_arg_0)) VAL [bad_14_arg_0=0, bad_19_arg_0=0, mask_SORT_12=1, mask_SORT_1=15, state_3=-128, state_4=10, var_11=15, var_16=3, var_2=1] [L73] SORT_1 var_7_arg_0 = state_4; [L74] SORT_1 var_7_arg_1 = var_2; [L75] SORT_1 var_7 = var_7_arg_0 + var_7_arg_1; [L76] var_7 = var_7 & mask_SORT_1 [L77] SORT_1 next_9_arg_1 = var_7; [L78] SORT_1 var_8_arg_0 = state_3; [L79] SORT_1 var_8_arg_1 = state_4; [L80] SORT_1 var_8 = var_8_arg_0 * var_8_arg_1; [L81] SORT_1 next_10_arg_1 = var_8; [L83] state_4 = next_9_arg_1 [L84] state_3 = next_10_arg_1 [L56] SORT_1 var_13_arg_0 = state_4; [L57] SORT_1 var_13_arg_1 = var_11; [L58] SORT_12 var_13 = var_13_arg_0 == var_13_arg_1; [L59] SORT_12 bad_14_arg_0 = var_13; VAL [bad_14_arg_0=0, mask_SORT_12=1, mask_SORT_1=15, state_3=0, state_4=11, var_11=15, var_16=3, var_2=1] [L60] CALL __VERIFIER_assert(!(bad_14_arg_0)) VAL [\old(cond)=1] [L29] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L60] RET __VERIFIER_assert(!(bad_14_arg_0)) VAL [bad_14_arg_0=0, mask_SORT_12=1, mask_SORT_1=15, state_3=0, state_4=11, var_11=15, var_16=3, var_2=1] [L61] SORT_1 var_17_arg_0 = state_4; [L62] SORT_1 var_17_arg_1 = var_16; [L63] SORT_12 var_17 = var_17_arg_0 > var_17_arg_1; [L64] SORT_1 var_15_arg_0 = state_3; [L65] SORT_12 var_15 = var_15_arg_0 >> 0; [L66] SORT_12 var_18_arg_0 = var_17; [L67] SORT_12 var_18_arg_1 = var_15; [L68] SORT_12 var_18 = var_18_arg_0 & var_18_arg_1; [L69] var_18 = var_18 & mask_SORT_12 [L70] SORT_12 bad_19_arg_0 = var_18; VAL [bad_14_arg_0=0, bad_19_arg_0=0, mask_SORT_12=1, mask_SORT_1=15, state_3=0, state_4=11, var_11=15, var_16=3, var_2=1] [L71] CALL __VERIFIER_assert(!(bad_19_arg_0)) VAL [\old(cond)=1] [L29] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L71] RET __VERIFIER_assert(!(bad_19_arg_0)) VAL [bad_14_arg_0=0, bad_19_arg_0=0, mask_SORT_12=1, mask_SORT_1=15, state_3=0, state_4=11, var_11=15, var_16=3, var_2=1] [L73] SORT_1 var_7_arg_0 = state_4; [L74] SORT_1 var_7_arg_1 = var_2; [L75] SORT_1 var_7 = var_7_arg_0 + var_7_arg_1; [L76] var_7 = var_7 & mask_SORT_1 [L77] SORT_1 next_9_arg_1 = var_7; [L78] SORT_1 var_8_arg_0 = state_3; [L79] SORT_1 var_8_arg_1 = state_4; [L80] SORT_1 var_8 = var_8_arg_0 * var_8_arg_1; [L81] SORT_1 next_10_arg_1 = var_8; [L83] state_4 = next_9_arg_1 [L84] state_3 = next_10_arg_1 [L56] SORT_1 var_13_arg_0 = state_4; [L57] SORT_1 var_13_arg_1 = var_11; [L58] SORT_12 var_13 = var_13_arg_0 == var_13_arg_1; [L59] SORT_12 bad_14_arg_0 = var_13; VAL [bad_14_arg_0=0, mask_SORT_12=1, mask_SORT_1=15, state_3=0, state_4=12, var_11=15, var_16=3, var_2=1] [L60] CALL __VERIFIER_assert(!(bad_14_arg_0)) VAL [\old(cond)=1] [L29] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L60] RET __VERIFIER_assert(!(bad_14_arg_0)) VAL [bad_14_arg_0=0, mask_SORT_12=1, mask_SORT_1=15, state_3=0, state_4=12, var_11=15, var_16=3, var_2=1] [L61] SORT_1 var_17_arg_0 = state_4; [L62] SORT_1 var_17_arg_1 = var_16; [L63] SORT_12 var_17 = var_17_arg_0 > var_17_arg_1; [L64] SORT_1 var_15_arg_0 = state_3; [L65] SORT_12 var_15 = var_15_arg_0 >> 0; [L66] SORT_12 var_18_arg_0 = var_17; [L67] SORT_12 var_18_arg_1 = var_15; [L68] SORT_12 var_18 = var_18_arg_0 & var_18_arg_1; [L69] var_18 = var_18 & mask_SORT_12 [L70] SORT_12 bad_19_arg_0 = var_18; VAL [bad_14_arg_0=0, bad_19_arg_0=0, mask_SORT_12=1, mask_SORT_1=15, state_3=0, state_4=12, var_11=15, var_16=3, var_2=1] [L71] CALL __VERIFIER_assert(!(bad_19_arg_0)) VAL [\old(cond)=1] [L29] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L71] RET __VERIFIER_assert(!(bad_19_arg_0)) VAL [bad_14_arg_0=0, bad_19_arg_0=0, mask_SORT_12=1, mask_SORT_1=15, state_3=0, state_4=12, var_11=15, var_16=3, var_2=1] [L73] SORT_1 var_7_arg_0 = state_4; [L74] SORT_1 var_7_arg_1 = var_2; [L75] SORT_1 var_7 = var_7_arg_0 + var_7_arg_1; [L76] var_7 = var_7 & mask_SORT_1 [L77] SORT_1 next_9_arg_1 = var_7; [L78] SORT_1 var_8_arg_0 = state_3; [L79] SORT_1 var_8_arg_1 = state_4; [L80] SORT_1 var_8 = var_8_arg_0 * var_8_arg_1; [L81] SORT_1 next_10_arg_1 = var_8; [L83] state_4 = next_9_arg_1 [L84] state_3 = next_10_arg_1 [L56] SORT_1 var_13_arg_0 = state_4; [L57] SORT_1 var_13_arg_1 = var_11; [L58] SORT_12 var_13 = var_13_arg_0 == var_13_arg_1; [L59] SORT_12 bad_14_arg_0 = var_13; VAL [bad_14_arg_0=0, mask_SORT_12=1, mask_SORT_1=15, state_3=0, state_4=13, var_11=15, var_16=3, var_2=1] [L60] CALL __VERIFIER_assert(!(bad_14_arg_0)) VAL [\old(cond)=1] [L29] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L60] RET __VERIFIER_assert(!(bad_14_arg_0)) VAL [bad_14_arg_0=0, mask_SORT_12=1, mask_SORT_1=15, state_3=0, state_4=13, var_11=15, var_16=3, var_2=1] [L61] SORT_1 var_17_arg_0 = state_4; [L62] SORT_1 var_17_arg_1 = var_16; [L63] SORT_12 var_17 = var_17_arg_0 > var_17_arg_1; [L64] SORT_1 var_15_arg_0 = state_3; [L65] SORT_12 var_15 = var_15_arg_0 >> 0; [L66] SORT_12 var_18_arg_0 = var_17; [L67] SORT_12 var_18_arg_1 = var_15; [L68] SORT_12 var_18 = var_18_arg_0 & var_18_arg_1; [L69] var_18 = var_18 & mask_SORT_12 [L70] SORT_12 bad_19_arg_0 = var_18; VAL [bad_14_arg_0=0, bad_19_arg_0=0, mask_SORT_12=1, mask_SORT_1=15, state_3=0, state_4=13, var_11=15, var_16=3, var_2=1] [L71] CALL __VERIFIER_assert(!(bad_19_arg_0)) VAL [\old(cond)=1] [L29] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L71] RET __VERIFIER_assert(!(bad_19_arg_0)) VAL [bad_14_arg_0=0, bad_19_arg_0=0, mask_SORT_12=1, mask_SORT_1=15, state_3=0, state_4=13, var_11=15, var_16=3, var_2=1] [L73] SORT_1 var_7_arg_0 = state_4; [L74] SORT_1 var_7_arg_1 = var_2; [L75] SORT_1 var_7 = var_7_arg_0 + var_7_arg_1; [L76] var_7 = var_7 & mask_SORT_1 [L77] SORT_1 next_9_arg_1 = var_7; [L78] SORT_1 var_8_arg_0 = state_3; [L79] SORT_1 var_8_arg_1 = state_4; [L80] SORT_1 var_8 = var_8_arg_0 * var_8_arg_1; [L81] SORT_1 next_10_arg_1 = var_8; [L83] state_4 = next_9_arg_1 [L84] state_3 = next_10_arg_1 [L56] SORT_1 var_13_arg_0 = state_4; [L57] SORT_1 var_13_arg_1 = var_11; [L58] SORT_12 var_13 = var_13_arg_0 == var_13_arg_1; [L59] SORT_12 bad_14_arg_0 = var_13; VAL [bad_14_arg_0=0, mask_SORT_12=1, mask_SORT_1=15, state_3=0, state_4=14, var_11=15, var_16=3, var_2=1] [L60] CALL __VERIFIER_assert(!(bad_14_arg_0)) VAL [\old(cond)=1] [L29] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L60] RET __VERIFIER_assert(!(bad_14_arg_0)) VAL [bad_14_arg_0=0, mask_SORT_12=1, mask_SORT_1=15, state_3=0, state_4=14, var_11=15, var_16=3, var_2=1] [L61] SORT_1 var_17_arg_0 = state_4; [L62] SORT_1 var_17_arg_1 = var_16; [L63] SORT_12 var_17 = var_17_arg_0 > var_17_arg_1; [L64] SORT_1 var_15_arg_0 = state_3; [L65] SORT_12 var_15 = var_15_arg_0 >> 0; [L66] SORT_12 var_18_arg_0 = var_17; [L67] SORT_12 var_18_arg_1 = var_15; [L68] SORT_12 var_18 = var_18_arg_0 & var_18_arg_1; [L69] var_18 = var_18 & mask_SORT_12 [L70] SORT_12 bad_19_arg_0 = var_18; VAL [bad_14_arg_0=0, bad_19_arg_0=0, mask_SORT_12=1, mask_SORT_1=15, state_3=0, state_4=14, var_11=15, var_16=3, var_2=1] [L71] CALL __VERIFIER_assert(!(bad_19_arg_0)) VAL [\old(cond)=1] [L29] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L71] RET __VERIFIER_assert(!(bad_19_arg_0)) VAL [bad_14_arg_0=0, bad_19_arg_0=0, mask_SORT_12=1, mask_SORT_1=15, state_3=0, state_4=14, var_11=15, var_16=3, var_2=1] [L73] SORT_1 var_7_arg_0 = state_4; [L74] SORT_1 var_7_arg_1 = var_2; [L75] SORT_1 var_7 = var_7_arg_0 + var_7_arg_1; [L76] var_7 = var_7 & mask_SORT_1 [L77] SORT_1 next_9_arg_1 = var_7; [L78] SORT_1 var_8_arg_0 = state_3; [L79] SORT_1 var_8_arg_1 = state_4; [L80] SORT_1 var_8 = var_8_arg_0 * var_8_arg_1; [L81] SORT_1 next_10_arg_1 = var_8; [L83] state_4 = next_9_arg_1 [L84] state_3 = next_10_arg_1 [L56] SORT_1 var_13_arg_0 = state_4; [L57] SORT_1 var_13_arg_1 = var_11; [L58] SORT_12 var_13 = var_13_arg_0 == var_13_arg_1; [L59] SORT_12 bad_14_arg_0 = var_13; VAL [bad_14_arg_0=1, mask_SORT_12=1, mask_SORT_1=15, state_3=0, state_4=15, var_11=15, var_16=3, var_2=1] [L60] CALL __VERIFIER_assert(!(bad_14_arg_0)) VAL [\old(cond)=0] [L29] COND TRUE !(cond) VAL [\old(cond)=0] [L29] reach_error() VAL [\old(cond)=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 16 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 57.5s, OverallIterations: 8, TraceHistogramMax: 29, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 28.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 108 SdHoareTripleChecker+Valid, 14.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 105 mSDsluCounter, 823 SdHoareTripleChecker+Invalid, 13.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 735 mSDsCounter, 128 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1629 IncrementalHoareTripleChecker+Invalid, 1757 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 128 mSolverCounterUnsat, 88 mSDtfsCounter, 1629 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 653 GetRequests, 496 SyntacticMatches, 1 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 862 ImplicationChecksByTransitivity, 30.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=142occurred in iteration=7, InterpolantAutomatonStates: 124, 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, 7 MinimizatonAttempts, 13 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 26.1s InterpolantComputationTime, 490 NumberOfCodeBlocks, 490 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 588 ConstructedInterpolants, 43 QuantifiedInterpolants, 5850 SizeOfPredicates, 51 NumberOfNonLiveVariables, 801 ConjunctsInSsa, 125 ConjunctsInUnsatCore, 14 InterpolantComputations, 3 PerfectInterpolantSequences, 1702/2342 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-04 16:16:51,970 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2024-11-04 16:16:52,020 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...