/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation false -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-22.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 03:46:18,845 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 03:46:18,924 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-16 03:46:18,930 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 03:46:18,930 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 03:46:18,955 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 03:46:18,955 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 03:46:18,956 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 03:46:18,956 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 03:46:18,956 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 03:46:18,957 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 03:46:18,957 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 03:46:18,958 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 03:46:18,958 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 03:46:18,958 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 03:46:18,959 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 03:46:18,959 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 03:46:18,959 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 03:46:18,960 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-16 03:46:18,960 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 03:46:18,960 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 03:46:18,961 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 03:46:18,961 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 03:46:18,961 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 03:46:18,961 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 03:46:18,962 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 03:46:18,962 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 03:46:18,962 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 03:46:18,962 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 03:46:18,963 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 03:46:18,963 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 03:46:18,963 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 03:46:18,963 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 03:46:18,964 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 03:46:18,964 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 03:46:18,964 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 03:46:18,965 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-16 03:46:18,965 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-16 03:46:18,965 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 03:46:18,965 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 03:46:18,966 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 03:46:18,968 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 03:46:18,968 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 03:46:18,969 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Use bitabs translation -> false [2023-12-16 03:46:19,186 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 03:46:19,205 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 03:46:19,207 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 03:46:19,209 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 03:46:19,209 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 03:46:19,210 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-22.i [2023-12-16 03:46:20,382 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 03:46:20,552 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 03:46:20,553 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-22.i [2023-12-16 03:46:20,562 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38d462594/d64aacc581eb4a2aabb8f588c2c555e2/FLAG303b7873d [2023-12-16 03:46:20,579 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38d462594/d64aacc581eb4a2aabb8f588c2c555e2 [2023-12-16 03:46:20,581 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 03:46:20,582 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 03:46:20,584 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 03:46:20,584 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 03:46:20,588 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 03:46:20,588 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 03:46:20" (1/1) ... [2023-12-16 03:46:20,589 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a928f31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:46:20, skipping insertion in model container [2023-12-16 03:46:20,589 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 03:46:20" (1/1) ... [2023-12-16 03:46:20,618 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 03:46:20,768 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-22.i[915,928] [2023-12-16 03:46:20,811 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 03:46:20,820 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 03:46:20,837 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-22.i[915,928] [2023-12-16 03:46:20,850 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 03:46:20,863 INFO L206 MainTranslator]: Completed translation [2023-12-16 03:46:20,863 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:46:20 WrapperNode [2023-12-16 03:46:20,863 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 03:46:20,864 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 03:46:20,864 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 03:46:20,864 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 03:46:20,870 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:46:20" (1/1) ... [2023-12-16 03:46:20,888 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:46:20" (1/1) ... [2023-12-16 03:46:20,914 INFO L138 Inliner]: procedures = 26, calls = 20, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 95 [2023-12-16 03:46:20,915 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 03:46:20,916 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 03:46:20,916 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 03:46:20,916 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 03:46:20,925 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:46:20" (1/1) ... [2023-12-16 03:46:20,926 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:46:20" (1/1) ... [2023-12-16 03:46:20,928 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:46:20" (1/1) ... [2023-12-16 03:46:20,946 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]. [2023-12-16 03:46:20,947 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:46:20" (1/1) ... [2023-12-16 03:46:20,947 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:46:20" (1/1) ... [2023-12-16 03:46:20,951 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:46:20" (1/1) ... [2023-12-16 03:46:20,955 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:46:20" (1/1) ... [2023-12-16 03:46:20,957 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:46:20" (1/1) ... [2023-12-16 03:46:20,958 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:46:20" (1/1) ... [2023-12-16 03:46:20,974 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 03:46:20,975 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 03:46:20,975 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 03:46:20,975 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 03:46:20,976 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:46:20" (1/1) ... [2023-12-16 03:46:20,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 03:46:20,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 03:46:21,004 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) [2023-12-16 03:46:21,029 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 [2023-12-16 03:46:21,035 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 03:46:21,035 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-16 03:46:21,035 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-16 03:46:21,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-16 03:46:21,036 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 03:46:21,036 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 03:46:21,104 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 03:46:21,108 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 03:46:21,317 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 03:46:21,348 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 03:46:21,348 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-16 03:46:21,349 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 03:46:21 BoogieIcfgContainer [2023-12-16 03:46:21,349 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 03:46:21,351 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 03:46:21,351 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 03:46:21,353 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 03:46:21,353 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 03:46:20" (1/3) ... [2023-12-16 03:46:21,354 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4718180c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 03:46:21, skipping insertion in model container [2023-12-16 03:46:21,354 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:46:20" (2/3) ... [2023-12-16 03:46:21,354 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4718180c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 03:46:21, skipping insertion in model container [2023-12-16 03:46:21,355 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 03:46:21" (3/3) ... [2023-12-16 03:46:21,356 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-22.i [2023-12-16 03:46:21,367 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 03:46:21,368 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 03:46:21,404 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 03:46:21,409 INFO L357 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, mHoare=true, 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;@51dac336, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 03:46:21,410 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 03:46:21,413 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 25 states have (on average 1.48) internal successors, (37), 26 states have internal predecessors, (37), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-12-16 03:46:21,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-12-16 03:46:21,422 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 03:46:21,423 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 03:46:21,423 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 03:46:21,432 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 03:46:21,433 INFO L85 PathProgramCache]: Analyzing trace with hash 1786329062, now seen corresponding path program 1 times [2023-12-16 03:46:21,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 03:46:21,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580351767] [2023-12-16 03:46:21,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 03:46:21,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 03:46:21,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:21,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 03:46:21,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:21,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-16 03:46:21,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:21,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-16 03:46:21,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:21,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-16 03:46:21,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:21,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-16 03:46:21,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:21,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-16 03:46:21,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:21,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-16 03:46:21,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:21,670 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2023-12-16 03:46:21,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 03:46:21,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580351767] [2023-12-16 03:46:21,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580351767] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 03:46:21,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 03:46:21,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 03:46:21,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87565994] [2023-12-16 03:46:21,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 03:46:21,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-16 03:46:21,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 03:46:21,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-16 03:46:21,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 03:46:21,702 INFO L87 Difference]: Start difference. First operand has 35 states, 25 states have (on average 1.48) internal successors, (37), 26 states have internal predecessors, (37), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-16 03:46:21,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 03:46:21,725 INFO L93 Difference]: Finished difference Result 67 states and 107 transitions. [2023-12-16 03:46:21,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-16 03:46:21,730 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) Word has length 53 [2023-12-16 03:46:21,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 03:46:21,735 INFO L225 Difference]: With dead ends: 67 [2023-12-16 03:46:21,735 INFO L226 Difference]: Without dead ends: 33 [2023-12-16 03:46:21,738 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 03:46:21,741 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 03:46:21,742 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 42 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 03:46:21,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2023-12-16 03:46:21,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2023-12-16 03:46:21,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 24 states have internal predecessors, (31), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-12-16 03:46:21,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 45 transitions. [2023-12-16 03:46:21,769 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 45 transitions. Word has length 53 [2023-12-16 03:46:21,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 03:46:21,770 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 45 transitions. [2023-12-16 03:46:21,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-16 03:46:21,770 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 45 transitions. [2023-12-16 03:46:21,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-12-16 03:46:21,772 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 03:46:21,772 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 03:46:21,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-16 03:46:21,773 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 03:46:21,773 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 03:46:21,774 INFO L85 PathProgramCache]: Analyzing trace with hash -256998870, now seen corresponding path program 1 times [2023-12-16 03:46:21,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 03:46:21,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681294041] [2023-12-16 03:46:21,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 03:46:21,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 03:46:21,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:22,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 03:46:22,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:22,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-16 03:46:22,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:22,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-16 03:46:22,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:22,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-16 03:46:22,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:22,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-16 03:46:22,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:22,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-16 03:46:22,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:22,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-16 03:46:22,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:22,397 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2023-12-16 03:46:22,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 03:46:22,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681294041] [2023-12-16 03:46:22,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681294041] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 03:46:22,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 03:46:22,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 03:46:22,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531085477] [2023-12-16 03:46:22,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 03:46:22,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 03:46:22,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 03:46:22,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 03:46:22,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 03:46:22,407 INFO L87 Difference]: Start difference. First operand 33 states and 45 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-16 03:46:22,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 03:46:22,573 INFO L93 Difference]: Finished difference Result 100 states and 137 transitions. [2023-12-16 03:46:22,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 03:46:22,574 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 53 [2023-12-16 03:46:22,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 03:46:22,580 INFO L225 Difference]: With dead ends: 100 [2023-12-16 03:46:22,580 INFO L226 Difference]: Without dead ends: 68 [2023-12-16 03:46:22,581 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-16 03:46:22,583 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 39 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 03:46:22,583 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 111 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 03:46:22,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2023-12-16 03:46:22,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 51. [2023-12-16 03:46:22,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 34 states have internal predecessors, (41), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2023-12-16 03:46:22,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 69 transitions. [2023-12-16 03:46:22,621 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 69 transitions. Word has length 53 [2023-12-16 03:46:22,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 03:46:22,622 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 69 transitions. [2023-12-16 03:46:22,622 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-16 03:46:22,622 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 69 transitions. [2023-12-16 03:46:22,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-12-16 03:46:22,626 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 03:46:22,626 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 03:46:22,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-16 03:46:22,627 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 03:46:22,627 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 03:46:22,628 INFO L85 PathProgramCache]: Analyzing trace with hash -349270160, now seen corresponding path program 1 times [2023-12-16 03:46:22,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 03:46:22,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585773835] [2023-12-16 03:46:22,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 03:46:22,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 03:46:22,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:23,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 03:46:23,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:23,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-16 03:46:23,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:23,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-16 03:46:23,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:23,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-16 03:46:23,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:23,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-16 03:46:23,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:23,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-16 03:46:23,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:23,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-16 03:46:23,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:23,929 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2023-12-16 03:46:23,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 03:46:23,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585773835] [2023-12-16 03:46:23,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585773835] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 03:46:23,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 03:46:23,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-16 03:46:23,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716031255] [2023-12-16 03:46:23,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 03:46:23,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-16 03:46:23,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 03:46:23,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-16 03:46:23,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2023-12-16 03:46:23,934 INFO L87 Difference]: Start difference. First operand 51 states and 69 transitions. Second operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-16 03:46:24,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 03:46:24,314 INFO L93 Difference]: Finished difference Result 146 states and 195 transitions. [2023-12-16 03:46:24,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-16 03:46:24,315 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 54 [2023-12-16 03:46:24,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 03:46:24,319 INFO L225 Difference]: With dead ends: 146 [2023-12-16 03:46:24,319 INFO L226 Difference]: Without dead ends: 144 [2023-12-16 03:46:24,322 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2023-12-16 03:46:24,324 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 116 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 03:46:24,325 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 342 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 03:46:24,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2023-12-16 03:46:24,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 113. [2023-12-16 03:46:24,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 80 states have (on average 1.2625) internal successors, (101), 80 states have internal predecessors, (101), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2023-12-16 03:46:24,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 157 transitions. [2023-12-16 03:46:24,364 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 157 transitions. Word has length 54 [2023-12-16 03:46:24,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 03:46:24,365 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 157 transitions. [2023-12-16 03:46:24,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-16 03:46:24,365 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 157 transitions. [2023-12-16 03:46:24,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-12-16 03:46:24,368 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 03:46:24,368 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 03:46:24,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-16 03:46:24,368 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 03:46:24,369 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 03:46:24,369 INFO L85 PathProgramCache]: Analyzing trace with hash -349210578, now seen corresponding path program 1 times [2023-12-16 03:46:24,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 03:46:24,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530007903] [2023-12-16 03:46:24,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 03:46:24,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 03:46:24,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:25,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 03:46:25,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:25,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-16 03:46:25,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:25,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-16 03:46:25,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:25,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-16 03:46:25,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:25,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-16 03:46:25,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:25,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-16 03:46:25,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:25,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-16 03:46:25,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:25,610 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2023-12-16 03:46:25,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 03:46:25,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530007903] [2023-12-16 03:46:25,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530007903] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 03:46:25,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 03:46:25,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-16 03:46:25,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079910009] [2023-12-16 03:46:25,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 03:46:25,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 03:46:25,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 03:46:25,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 03:46:25,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-12-16 03:46:25,613 INFO L87 Difference]: Start difference. First operand 113 states and 157 transitions. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-16 03:46:25,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 03:46:25,958 INFO L93 Difference]: Finished difference Result 332 states and 456 transitions. [2023-12-16 03:46:25,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-16 03:46:25,959 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 54 [2023-12-16 03:46:25,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 03:46:25,960 INFO L225 Difference]: With dead ends: 332 [2023-12-16 03:46:25,961 INFO L226 Difference]: Without dead ends: 238 [2023-12-16 03:46:25,961 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2023-12-16 03:46:25,962 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 153 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 03:46:25,963 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 219 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 03:46:25,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2023-12-16 03:46:25,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 172. [2023-12-16 03:46:25,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 123 states have (on average 1.2520325203252032) internal successors, (154), 123 states have internal predecessors, (154), 42 states have call successors, (42), 6 states have call predecessors, (42), 6 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2023-12-16 03:46:25,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 238 transitions. [2023-12-16 03:46:25,986 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 238 transitions. Word has length 54 [2023-12-16 03:46:25,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 03:46:25,987 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 238 transitions. [2023-12-16 03:46:25,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-16 03:46:25,987 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 238 transitions. [2023-12-16 03:46:25,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-12-16 03:46:25,988 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 03:46:25,988 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 03:46:25,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-16 03:46:25,988 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 03:46:25,989 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 03:46:25,989 INFO L85 PathProgramCache]: Analyzing trace with hash 351794418, now seen corresponding path program 1 times [2023-12-16 03:46:25,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 03:46:25,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8259686] [2023-12-16 03:46:25,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 03:46:25,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 03:46:25,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:26,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 03:46:26,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:26,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-16 03:46:26,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:26,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-16 03:46:26,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:26,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-16 03:46:26,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:26,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-16 03:46:26,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:26,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-16 03:46:26,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:26,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-16 03:46:26,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:26,043 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2023-12-16 03:46:26,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 03:46:26,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8259686] [2023-12-16 03:46:26,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8259686] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 03:46:26,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 03:46:26,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 03:46:26,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023054135] [2023-12-16 03:46:26,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 03:46:26,046 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 03:46:26,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 03:46:26,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 03:46:26,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 03:46:26,048 INFO L87 Difference]: Start difference. First operand 172 states and 238 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-16 03:46:26,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 03:46:26,078 INFO L93 Difference]: Finished difference Result 296 states and 409 transitions. [2023-12-16 03:46:26,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 03:46:26,079 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 54 [2023-12-16 03:46:26,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 03:46:26,080 INFO L225 Difference]: With dead ends: 296 [2023-12-16 03:46:26,080 INFO L226 Difference]: Without dead ends: 202 [2023-12-16 03:46:26,081 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 03:46:26,082 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 15 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 03:46:26,082 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 83 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 03:46:26,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2023-12-16 03:46:26,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 180. [2023-12-16 03:46:26,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 131 states have (on average 1.2366412213740459) internal successors, (162), 131 states have internal predecessors, (162), 42 states have call successors, (42), 6 states have call predecessors, (42), 6 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2023-12-16 03:46:26,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 246 transitions. [2023-12-16 03:46:26,115 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 246 transitions. Word has length 54 [2023-12-16 03:46:26,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 03:46:26,117 INFO L495 AbstractCegarLoop]: Abstraction has 180 states and 246 transitions. [2023-12-16 03:46:26,118 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-16 03:46:26,118 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 246 transitions. [2023-12-16 03:46:26,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-12-16 03:46:26,120 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 03:46:26,121 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 03:46:26,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-16 03:46:26,121 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 03:46:26,121 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 03:46:26,121 INFO L85 PathProgramCache]: Analyzing trace with hash 1057511054, now seen corresponding path program 1 times [2023-12-16 03:46:26,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 03:46:26,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347073167] [2023-12-16 03:46:26,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 03:46:26,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 03:46:26,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:26,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 03:46:26,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:26,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-16 03:46:26,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:26,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-16 03:46:26,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:26,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-16 03:46:26,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:26,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-16 03:46:26,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:26,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-16 03:46:26,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:26,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-16 03:46:26,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:26,609 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2023-12-16 03:46:26,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 03:46:26,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347073167] [2023-12-16 03:46:26,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347073167] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 03:46:26,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 03:46:26,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 03:46:26,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579080637] [2023-12-16 03:46:26,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 03:46:26,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 03:46:26,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 03:46:26,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 03:46:26,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-16 03:46:26,611 INFO L87 Difference]: Start difference. First operand 180 states and 246 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-16 03:46:26,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 03:46:26,758 INFO L93 Difference]: Finished difference Result 256 states and 350 transitions. [2023-12-16 03:46:26,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-16 03:46:26,758 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 55 [2023-12-16 03:46:26,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 03:46:26,760 INFO L225 Difference]: With dead ends: 256 [2023-12-16 03:46:26,760 INFO L226 Difference]: Without dead ends: 254 [2023-12-16 03:46:26,761 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-12-16 03:46:26,761 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 49 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 03:46:26,761 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 257 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 03:46:26,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2023-12-16 03:46:26,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 244. [2023-12-16 03:46:26,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 179 states have (on average 1.2402234636871508) internal successors, (222), 179 states have internal predecessors, (222), 56 states have call successors, (56), 8 states have call predecessors, (56), 8 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2023-12-16 03:46:26,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 334 transitions. [2023-12-16 03:46:26,786 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 334 transitions. Word has length 55 [2023-12-16 03:46:26,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 03:46:26,786 INFO L495 AbstractCegarLoop]: Abstraction has 244 states and 334 transitions. [2023-12-16 03:46:26,787 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-16 03:46:26,787 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 334 transitions. [2023-12-16 03:46:26,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-12-16 03:46:26,787 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 03:46:26,788 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 03:46:26,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-16 03:46:26,788 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 03:46:26,788 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 03:46:26,788 INFO L85 PathProgramCache]: Analyzing trace with hash 1057570636, now seen corresponding path program 1 times [2023-12-16 03:46:26,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 03:46:26,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156974060] [2023-12-16 03:46:26,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 03:46:26,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 03:46:26,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:27,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 03:46:27,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:27,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-16 03:46:27,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:27,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-16 03:46:27,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:27,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-16 03:46:27,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:27,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-16 03:46:27,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:27,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-16 03:46:27,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:27,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-16 03:46:27,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:27,561 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2023-12-16 03:46:27,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 03:46:27,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156974060] [2023-12-16 03:46:27,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156974060] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 03:46:27,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 03:46:27,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 03:46:27,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874175484] [2023-12-16 03:46:27,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 03:46:27,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 03:46:27,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 03:46:27,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 03:46:27,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-16 03:46:27,565 INFO L87 Difference]: Start difference. First operand 244 states and 334 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-16 03:46:27,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 03:46:27,802 INFO L93 Difference]: Finished difference Result 367 states and 495 transitions. [2023-12-16 03:46:27,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 03:46:27,803 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 55 [2023-12-16 03:46:27,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 03:46:27,805 INFO L225 Difference]: With dead ends: 367 [2023-12-16 03:46:27,805 INFO L226 Difference]: Without dead ends: 301 [2023-12-16 03:46:27,806 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-12-16 03:46:27,806 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 41 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 03:46:27,807 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 151 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 03:46:27,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2023-12-16 03:46:27,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 258. [2023-12-16 03:46:27,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 193 states have (on average 1.2487046632124352) internal successors, (241), 193 states have internal predecessors, (241), 56 states have call successors, (56), 8 states have call predecessors, (56), 8 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2023-12-16 03:46:27,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 353 transitions. [2023-12-16 03:46:27,844 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 353 transitions. Word has length 55 [2023-12-16 03:46:27,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 03:46:27,845 INFO L495 AbstractCegarLoop]: Abstraction has 258 states and 353 transitions. [2023-12-16 03:46:27,845 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-16 03:46:27,845 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 353 transitions. [2023-12-16 03:46:27,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-12-16 03:46:27,847 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 03:46:27,847 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 03:46:27,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-16 03:46:27,848 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 03:46:27,848 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 03:46:27,848 INFO L85 PathProgramCache]: Analyzing trace with hash 1737629006, now seen corresponding path program 1 times [2023-12-16 03:46:27,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 03:46:27,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734750195] [2023-12-16 03:46:27,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 03:46:27,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 03:46:27,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:27,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 03:46:27,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:27,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-16 03:46:27,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:27,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-16 03:46:27,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:27,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-16 03:46:27,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:27,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-16 03:46:27,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:27,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-16 03:46:27,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:27,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-16 03:46:27,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:27,902 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2023-12-16 03:46:27,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 03:46:27,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734750195] [2023-12-16 03:46:27,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734750195] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 03:46:27,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 03:46:27,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 03:46:27,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199599477] [2023-12-16 03:46:27,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 03:46:27,903 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 03:46:27,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 03:46:27,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 03:46:27,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 03:46:27,904 INFO L87 Difference]: Start difference. First operand 258 states and 353 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-16 03:46:27,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 03:46:27,942 INFO L93 Difference]: Finished difference Result 369 states and 503 transitions. [2023-12-16 03:46:27,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 03:46:27,942 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 55 [2023-12-16 03:46:27,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 03:46:27,944 INFO L225 Difference]: With dead ends: 369 [2023-12-16 03:46:27,944 INFO L226 Difference]: Without dead ends: 130 [2023-12-16 03:46:27,945 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 03:46:27,946 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 6 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 03:46:27,946 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 64 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 03:46:27,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2023-12-16 03:46:27,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 121. [2023-12-16 03:46:27,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 88 states have (on average 1.1704545454545454) internal successors, (103), 88 states have internal predecessors, (103), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2023-12-16 03:46:27,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 159 transitions. [2023-12-16 03:46:27,970 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 159 transitions. Word has length 55 [2023-12-16 03:46:27,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 03:46:27,970 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 159 transitions. [2023-12-16 03:46:27,971 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-16 03:46:27,971 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 159 transitions. [2023-12-16 03:46:27,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2023-12-16 03:46:27,973 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 03:46:27,973 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 03:46:27,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-16 03:46:27,974 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 03:46:27,974 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 03:46:27,974 INFO L85 PathProgramCache]: Analyzing trace with hash -449390043, now seen corresponding path program 1 times [2023-12-16 03:46:27,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 03:46:27,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655327963] [2023-12-16 03:46:27,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 03:46:27,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 03:46:28,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:28,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 03:46:28,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:28,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-16 03:46:28,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:28,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-16 03:46:28,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:28,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-16 03:46:28,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:28,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-16 03:46:28,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:28,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-16 03:46:28,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:28,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-16 03:46:28,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:28,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-12-16 03:46:28,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:28,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-12-16 03:46:28,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:28,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-12-16 03:46:28,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:28,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-16 03:46:28,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:28,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-16 03:46:28,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:28,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-16 03:46:28,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:28,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-16 03:46:28,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:28,830 INFO L134 CoverageAnalysis]: Checked inductivity of 387 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2023-12-16 03:46:28,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 03:46:28,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655327963] [2023-12-16 03:46:28,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655327963] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 03:46:28,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 03:46:28,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-16 03:46:28,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021369547] [2023-12-16 03:46:28,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 03:46:28,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 03:46:28,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 03:46:28,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 03:46:28,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-12-16 03:46:28,833 INFO L87 Difference]: Start difference. First operand 121 states and 159 transitions. Second operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-16 03:46:29,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 03:46:29,138 INFO L93 Difference]: Finished difference Result 169 states and 218 transitions. [2023-12-16 03:46:29,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-16 03:46:29,139 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 106 [2023-12-16 03:46:29,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 03:46:29,141 INFO L225 Difference]: With dead ends: 169 [2023-12-16 03:46:29,141 INFO L226 Difference]: Without dead ends: 167 [2023-12-16 03:46:29,141 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2023-12-16 03:46:29,143 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 85 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 03:46:29,143 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 298 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 03:46:29,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2023-12-16 03:46:29,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 128. [2023-12-16 03:46:29,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 95 states have (on average 1.1789473684210525) internal successors, (112), 95 states have internal predecessors, (112), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2023-12-16 03:46:29,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 168 transitions. [2023-12-16 03:46:29,161 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 168 transitions. Word has length 106 [2023-12-16 03:46:29,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 03:46:29,162 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 168 transitions. [2023-12-16 03:46:29,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-16 03:46:29,162 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 168 transitions. [2023-12-16 03:46:29,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2023-12-16 03:46:29,163 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 03:46:29,163 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 03:46:29,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-16 03:46:29,164 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 03:46:29,164 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 03:46:29,164 INFO L85 PathProgramCache]: Analyzing trace with hash -449330461, now seen corresponding path program 1 times [2023-12-16 03:46:29,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 03:46:29,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817969382] [2023-12-16 03:46:29,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 03:46:29,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 03:46:29,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:30,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 03:46:30,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:30,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-16 03:46:30,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:30,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-16 03:46:30,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:30,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-16 03:46:30,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:30,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-16 03:46:30,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:30,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-16 03:46:30,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:30,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-16 03:46:30,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:30,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-12-16 03:46:30,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:30,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-12-16 03:46:30,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:30,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-12-16 03:46:30,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:30,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-16 03:46:30,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:30,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-16 03:46:30,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:30,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-16 03:46:30,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:30,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-16 03:46:30,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:30,329 INFO L134 CoverageAnalysis]: Checked inductivity of 387 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2023-12-16 03:46:30,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 03:46:30,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817969382] [2023-12-16 03:46:30,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817969382] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 03:46:30,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 03:46:30,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 03:46:30,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032506046] [2023-12-16 03:46:30,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 03:46:30,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 03:46:30,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 03:46:30,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 03:46:30,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 03:46:30,331 INFO L87 Difference]: Start difference. First operand 128 states and 168 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-16 03:46:30,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 03:46:30,585 INFO L93 Difference]: Finished difference Result 191 states and 247 transitions. [2023-12-16 03:46:30,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 03:46:30,585 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 106 [2023-12-16 03:46:30,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 03:46:30,586 INFO L225 Difference]: With dead ends: 191 [2023-12-16 03:46:30,586 INFO L226 Difference]: Without dead ends: 142 [2023-12-16 03:46:30,587 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-16 03:46:30,587 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 19 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 03:46:30,587 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 145 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 03:46:30,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2023-12-16 03:46:30,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 128. [2023-12-16 03:46:30,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 95 states have (on average 1.168421052631579) internal successors, (111), 95 states have internal predecessors, (111), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2023-12-16 03:46:30,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 167 transitions. [2023-12-16 03:46:30,602 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 167 transitions. Word has length 106 [2023-12-16 03:46:30,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 03:46:30,603 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 167 transitions. [2023-12-16 03:46:30,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-16 03:46:30,603 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 167 transitions. [2023-12-16 03:46:30,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-12-16 03:46:30,604 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 03:46:30,605 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 03:46:30,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-16 03:46:30,605 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 03:46:30,605 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 03:46:30,605 INFO L85 PathProgramCache]: Analyzing trace with hash 1990596539, now seen corresponding path program 1 times [2023-12-16 03:46:30,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 03:46:30,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122884891] [2023-12-16 03:46:30,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 03:46:30,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 03:46:30,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:32,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 03:46:32,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:32,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-16 03:46:32,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:32,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-16 03:46:32,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:32,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-16 03:46:32,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:32,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-16 03:46:32,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:32,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-16 03:46:32,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:32,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-16 03:46:32,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:32,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-12-16 03:46:32,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:32,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-12-16 03:46:32,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:32,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-12-16 03:46:32,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:32,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-16 03:46:32,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:32,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-16 03:46:32,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:32,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-16 03:46:32,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:32,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-16 03:46:32,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:32,933 INFO L134 CoverageAnalysis]: Checked inductivity of 387 backedges. 14 proven. 9 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-16 03:46:32,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 03:46:32,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122884891] [2023-12-16 03:46:32,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122884891] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 03:46:32,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1095348273] [2023-12-16 03:46:32,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 03:46:32,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 03:46:32,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 03:46:32,937 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) [2023-12-16 03:46:32,960 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-16 03:46:33,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:33,764 INFO L262 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 54 conjunts are in the unsatisfiable core [2023-12-16 03:46:33,774 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 03:46:34,765 INFO L134 CoverageAnalysis]: Checked inductivity of 387 backedges. 243 proven. 60 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2023-12-16 03:46:34,767 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 03:46:35,289 INFO L134 CoverageAnalysis]: Checked inductivity of 387 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2023-12-16 03:46:35,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1095348273] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-16 03:46:35,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-12-16 03:46:35,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [16, 21] total 35 [2023-12-16 03:46:35,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007663166] [2023-12-16 03:46:35,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 03:46:35,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-16 03:46:35,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 03:46:35,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-16 03:46:35,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=1028, Unknown=0, NotChecked=0, Total=1190 [2023-12-16 03:46:35,292 INFO L87 Difference]: Start difference. First operand 128 states and 167 transitions. Second operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-16 03:46:36,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 03:46:36,005 INFO L93 Difference]: Finished difference Result 180 states and 225 transitions. [2023-12-16 03:46:36,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-16 03:46:36,006 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 107 [2023-12-16 03:46:36,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 03:46:36,007 INFO L225 Difference]: With dead ends: 180 [2023-12-16 03:46:36,007 INFO L226 Difference]: Without dead ends: 178 [2023-12-16 03:46:36,008 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 226 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 420 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=195, Invalid=1287, Unknown=0, NotChecked=0, Total=1482 [2023-12-16 03:46:36,009 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 81 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 03:46:36,009 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 254 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 03:46:36,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2023-12-16 03:46:36,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 160. [2023-12-16 03:46:36,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 116 states have (on average 1.146551724137931) internal successors, (133), 117 states have internal predecessors, (133), 35 states have call successors, (35), 8 states have call predecessors, (35), 8 states have return successors, (35), 34 states have call predecessors, (35), 35 states have call successors, (35) [2023-12-16 03:46:36,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 203 transitions. [2023-12-16 03:46:36,030 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 203 transitions. Word has length 107 [2023-12-16 03:46:36,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 03:46:36,030 INFO L495 AbstractCegarLoop]: Abstraction has 160 states and 203 transitions. [2023-12-16 03:46:36,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-16 03:46:36,031 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 203 transitions. [2023-12-16 03:46:36,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-12-16 03:46:36,032 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 03:46:36,032 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 03:46:36,040 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-16 03:46:36,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-12-16 03:46:36,239 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 03:46:36,240 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 03:46:36,240 INFO L85 PathProgramCache]: Analyzing trace with hash 853187529, now seen corresponding path program 1 times [2023-12-16 03:46:36,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 03:46:36,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57040757] [2023-12-16 03:46:36,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 03:46:36,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 03:46:36,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:37,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 03:46:37,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:37,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-16 03:46:37,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:37,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-16 03:46:37,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:37,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-16 03:46:37,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:37,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-16 03:46:37,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:37,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-16 03:46:37,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:37,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-16 03:46:37,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:37,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-12-16 03:46:37,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:37,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-12-16 03:46:37,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:37,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-12-16 03:46:37,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:37,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-16 03:46:37,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:37,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-16 03:46:37,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:37,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-16 03:46:37,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:37,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-16 03:46:37,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:37,138 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 11 proven. 13 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-16 03:46:37,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 03:46:37,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57040757] [2023-12-16 03:46:37,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57040757] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 03:46:37,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [922426567] [2023-12-16 03:46:37,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 03:46:37,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 03:46:37,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 03:46:37,140 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) [2023-12-16 03:46:37,153 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-16 03:46:37,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:37,401 INFO L262 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 33 conjunts are in the unsatisfiable core [2023-12-16 03:46:37,405 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 03:46:40,166 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 190 proven. 48 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2023-12-16 03:46:40,166 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 03:46:43,538 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 19 proven. 5 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-16 03:46:43,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [922426567] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 03:46:43,538 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-16 03:46:43,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13, 11] total 28 [2023-12-16 03:46:43,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240771096] [2023-12-16 03:46:43,539 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-16 03:46:43,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-12-16 03:46:43,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 03:46:43,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-12-16 03:46:43,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=640, Unknown=0, NotChecked=0, Total=756 [2023-12-16 03:46:43,541 INFO L87 Difference]: Start difference. First operand 160 states and 203 transitions. Second operand has 28 states, 28 states have (on average 4.035714285714286) internal successors, (113), 28 states have internal predecessors, (113), 5 states have call successors, (35), 2 states have call predecessors, (35), 3 states have return successors, (36), 5 states have call predecessors, (36), 5 states have call successors, (36) [2023-12-16 03:46:46,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 03:46:46,616 INFO L93 Difference]: Finished difference Result 503 states and 624 transitions. [2023-12-16 03:46:46,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2023-12-16 03:46:46,617 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 4.035714285714286) internal successors, (113), 28 states have internal predecessors, (113), 5 states have call successors, (35), 2 states have call predecessors, (35), 3 states have return successors, (36), 5 states have call predecessors, (36), 5 states have call successors, (36) Word has length 108 [2023-12-16 03:46:46,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 03:46:46,621 INFO L225 Difference]: With dead ends: 503 [2023-12-16 03:46:46,621 INFO L226 Difference]: Without dead ends: 397 [2023-12-16 03:46:46,624 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 233 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2542 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1352, Invalid=7204, Unknown=0, NotChecked=0, Total=8556 [2023-12-16 03:46:46,624 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 500 mSDsluCounter, 698 mSDsCounter, 0 mSdLazyCounter, 1516 mSolverCounterSat, 307 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 507 SdHoareTripleChecker+Valid, 770 SdHoareTripleChecker+Invalid, 1823 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 307 IncrementalHoareTripleChecker+Valid, 1516 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-12-16 03:46:46,624 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [507 Valid, 770 Invalid, 1823 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [307 Valid, 1516 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-12-16 03:46:46,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2023-12-16 03:46:46,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 244. [2023-12-16 03:46:46,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 173 states have (on average 1.1040462427745665) internal successors, (191), 175 states have internal predecessors, (191), 56 states have call successors, (56), 14 states have call predecessors, (56), 14 states have return successors, (56), 54 states have call predecessors, (56), 56 states have call successors, (56) [2023-12-16 03:46:46,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 303 transitions. [2023-12-16 03:46:46,703 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 303 transitions. Word has length 108 [2023-12-16 03:46:46,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 03:46:46,703 INFO L495 AbstractCegarLoop]: Abstraction has 244 states and 303 transitions. [2023-12-16 03:46:46,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 4.035714285714286) internal successors, (113), 28 states have internal predecessors, (113), 5 states have call successors, (35), 2 states have call predecessors, (35), 3 states have return successors, (36), 5 states have call predecessors, (36), 5 states have call successors, (36) [2023-12-16 03:46:46,704 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 303 transitions. [2023-12-16 03:46:46,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-12-16 03:46:46,705 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 03:46:46,705 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 03:46:46,715 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-12-16 03:46:46,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-12-16 03:46:46,915 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 03:46:46,916 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 03:46:46,916 INFO L85 PathProgramCache]: Analyzing trace with hash -669020363, now seen corresponding path program 1 times [2023-12-16 03:46:46,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 03:46:46,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380469508] [2023-12-16 03:46:46,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 03:46:46,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 03:46:46,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:47,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 03:46:47,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:47,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-16 03:46:47,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:47,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-16 03:46:47,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:47,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-16 03:46:47,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:47,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-16 03:46:47,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:47,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-16 03:46:47,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:47,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-16 03:46:47,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:47,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 03:46:47,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:47,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-12-16 03:46:47,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:47,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-12-16 03:46:47,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:47,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-12-16 03:46:47,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:47,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-12-16 03:46:47,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:47,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-16 03:46:47,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:47,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-16 03:46:47,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:47,747 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2023-12-16 03:46:47,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 03:46:47,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380469508] [2023-12-16 03:46:47,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380469508] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 03:46:47,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 03:46:47,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 03:46:47,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394484411] [2023-12-16 03:46:47,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 03:46:47,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 03:46:47,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 03:46:47,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 03:46:47,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-16 03:46:47,749 INFO L87 Difference]: Start difference. First operand 244 states and 303 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-16 03:46:47,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 03:46:47,852 INFO L93 Difference]: Finished difference Result 430 states and 535 transitions. [2023-12-16 03:46:47,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 03:46:47,853 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 108 [2023-12-16 03:46:47,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 03:46:47,854 INFO L225 Difference]: With dead ends: 430 [2023-12-16 03:46:47,854 INFO L226 Difference]: Without dead ends: 242 [2023-12-16 03:46:47,855 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-12-16 03:46:47,856 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 27 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 03:46:47,856 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 121 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 03:46:47,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2023-12-16 03:46:47,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2023-12-16 03:46:47,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 171 states have (on average 1.0935672514619883) internal successors, (187), 173 states have internal predecessors, (187), 56 states have call successors, (56), 14 states have call predecessors, (56), 14 states have return successors, (56), 54 states have call predecessors, (56), 56 states have call successors, (56) [2023-12-16 03:46:47,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 299 transitions. [2023-12-16 03:46:47,887 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 299 transitions. Word has length 108 [2023-12-16 03:46:47,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 03:46:47,887 INFO L495 AbstractCegarLoop]: Abstraction has 242 states and 299 transitions. [2023-12-16 03:46:47,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-16 03:46:47,888 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 299 transitions. [2023-12-16 03:46:47,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2023-12-16 03:46:47,890 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 03:46:47,890 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 03:46:47,890 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-16 03:46:47,890 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 03:46:47,891 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 03:46:47,891 INFO L85 PathProgramCache]: Analyzing trace with hash 1695739328, now seen corresponding path program 1 times [2023-12-16 03:46:47,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 03:46:47,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732119353] [2023-12-16 03:46:47,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 03:46:47,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 03:46:47,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:49,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 03:46:49,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:49,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-16 03:46:49,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:49,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-16 03:46:49,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:49,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-16 03:46:49,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:49,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-16 03:46:49,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:49,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-16 03:46:49,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:49,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-16 03:46:49,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:49,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-12-16 03:46:49,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:49,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-12-16 03:46:49,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:49,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-12-16 03:46:49,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:49,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-16 03:46:49,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:49,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-16 03:46:49,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:49,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-16 03:46:49,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:49,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-16 03:46:49,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:49,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-16 03:46:49,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:49,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-12-16 03:46:49,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:49,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2023-12-16 03:46:49,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:49,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2023-12-16 03:46:49,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:49,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2023-12-16 03:46:49,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:49,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2023-12-16 03:46:49,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:49,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2023-12-16 03:46:49,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:49,444 INFO L134 CoverageAnalysis]: Checked inductivity of 911 backedges. 19 proven. 52 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2023-12-16 03:46:49,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 03:46:49,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732119353] [2023-12-16 03:46:49,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732119353] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 03:46:49,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1317927903] [2023-12-16 03:46:49,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 03:46:49,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 03:46:49,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 03:46:49,449 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) [2023-12-16 03:46:49,451 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-16 03:46:49,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:49,589 INFO L262 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 38 conjunts are in the unsatisfiable core [2023-12-16 03:46:49,594 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 03:46:52,298 INFO L134 CoverageAnalysis]: Checked inductivity of 911 backedges. 472 proven. 73 refuted. 0 times theorem prover too weak. 366 trivial. 0 not checked. [2023-12-16 03:46:52,299 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 03:46:55,656 INFO L134 CoverageAnalysis]: Checked inductivity of 911 backedges. 99 proven. 18 refuted. 0 times theorem prover too weak. 794 trivial. 0 not checked. [2023-12-16 03:46:55,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1317927903] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 03:46:55,657 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-16 03:46:55,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 14] total 40 [2023-12-16 03:46:55,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500860595] [2023-12-16 03:46:55,657 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-16 03:46:55,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2023-12-16 03:46:55,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 03:46:55,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2023-12-16 03:46:55,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=285, Invalid=1275, Unknown=0, NotChecked=0, Total=1560 [2023-12-16 03:46:55,660 INFO L87 Difference]: Start difference. First operand 242 states and 299 transitions. Second operand has 40 states, 40 states have (on average 3.75) internal successors, (150), 40 states have internal predecessors, (150), 8 states have call successors, (42), 3 states have call predecessors, (42), 6 states have return successors, (43), 8 states have call predecessors, (43), 8 states have call successors, (43) [2023-12-16 03:47:01,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 03:47:01,671 INFO L93 Difference]: Finished difference Result 687 states and 832 transitions. [2023-12-16 03:47:01,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2023-12-16 03:47:01,672 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 3.75) internal successors, (150), 40 states have internal predecessors, (150), 8 states have call successors, (42), 3 states have call predecessors, (42), 6 states have return successors, (43), 8 states have call predecessors, (43), 8 states have call successors, (43) Word has length 160 [2023-12-16 03:47:01,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 03:47:01,672 INFO L225 Difference]: With dead ends: 687 [2023-12-16 03:47:01,672 INFO L226 Difference]: Without dead ends: 0 [2023-12-16 03:47:01,678 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 460 GetRequests, 354 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3462 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=2131, Invalid=9425, Unknown=0, NotChecked=0, Total=11556 [2023-12-16 03:47:01,678 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 626 mSDsluCounter, 628 mSDsCounter, 0 mSdLazyCounter, 1937 mSolverCounterSat, 398 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 626 SdHoareTripleChecker+Valid, 690 SdHoareTripleChecker+Invalid, 2335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 398 IncrementalHoareTripleChecker+Valid, 1937 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-12-16 03:47:01,678 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [626 Valid, 690 Invalid, 2335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [398 Valid, 1937 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2023-12-16 03:47:01,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-16 03:47:01,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-16 03:47:01,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 03:47:01,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-16 03:47:01,679 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 160 [2023-12-16 03:47:01,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 03:47:01,680 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-16 03:47:01,680 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 3.75) internal successors, (150), 40 states have internal predecessors, (150), 8 states have call successors, (42), 3 states have call predecessors, (42), 6 states have return successors, (43), 8 states have call predecessors, (43), 8 states have call successors, (43) [2023-12-16 03:47:01,680 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-16 03:47:01,680 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-16 03:47:01,683 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 03:47:01,690 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-12-16 03:47:01,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 03:47:01,890 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-16 03:47:05,709 INFO L899 garLoopResultBuilder]: For program point L64(line 64) no Hoare annotation was computed. [2023-12-16 03:47:05,710 INFO L899 garLoopResultBuilder]: For program point L52(lines 52 56) no Hoare annotation was computed. [2023-12-16 03:47:05,710 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-12-16 03:47:05,710 INFO L899 garLoopResultBuilder]: For program point L52-2(lines 35 60) no Hoare annotation was computed. [2023-12-16 03:47:05,710 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2023-12-16 03:47:05,710 INFO L899 garLoopResultBuilder]: For program point L19-3(line 19) no Hoare annotation was computed. [2023-12-16 03:47:05,710 INFO L899 garLoopResultBuilder]: For program point L44(lines 44 50) no Hoare annotation was computed. [2023-12-16 03:47:05,710 INFO L895 garLoopResultBuilder]: At program point L73(line 73) the Hoare annotation is: (or (let ((.cse0 (mod ~var_1_1~0 4294967296))) (and (let ((.cse1 (mod ~var_1_5~0 65536))) (or (= .cse0 .cse1) (< ~var_1_1~0 .cse1))) (or (not |ULTIMATE.start_property_#t~short11#1|) (= (mod ~var_1_11~0 4294967296) .cse0)) (let ((.cse2 (mod ~last_1_var_1_5~0 65536))) (or (< ~var_1_1~0 .cse2) (= .cse0 .cse2))) (or (and (<= (+ ~var_1_1~0 17) 0) (<= 0 (+ ~var_1_1~0 32768))) (and (<= (+ ~var_1_1~0 1) 0) (<= 0 (+ 16 ~var_1_1~0))) (and (<= ~var_1_1~0 32767) (<= 0 ~var_1_1~0))))) (and (< ~last_1_var_1_11~0 9) (< 0 (+ (div ~last_1_var_1_11~0 4294967296) 1)) (= (+ 5 ~var_1_1~0) 0) (= 256 ~var_1_5~0) (= 8 ~var_1_11~0) (= 256 ~last_1_var_1_5~0))) [2023-12-16 03:47:05,711 INFO L899 garLoopResultBuilder]: For program point L73-1(lines 61 74) no Hoare annotation was computed. [2023-12-16 03:47:05,711 INFO L895 garLoopResultBuilder]: At program point L69(line 69) the Hoare annotation is: (or (let ((.cse0 (mod ~var_1_1~0 4294967296))) (and (let ((.cse1 (mod ~var_1_5~0 65536))) (or (= .cse0 .cse1) (< ~var_1_1~0 .cse1))) (or (not |ULTIMATE.start_property_#t~short11#1|) (= (mod ~var_1_11~0 4294967296) .cse0)) (let ((.cse2 (mod ~last_1_var_1_5~0 65536))) (or (< ~var_1_1~0 .cse2) (= .cse0 .cse2))) (or (and (<= (+ ~var_1_1~0 17) 0) (<= 0 (+ ~var_1_1~0 32768))) (and (<= (+ ~var_1_1~0 1) 0) (<= 0 (+ 16 ~var_1_1~0))) (and (<= ~var_1_1~0 32767) (<= 0 ~var_1_1~0))))) (and (< ~last_1_var_1_11~0 9) (< 0 (+ (div ~last_1_var_1_11~0 4294967296) 1)) (= (+ 5 ~var_1_1~0) 0) (= 256 ~var_1_5~0) (= 8 ~var_1_11~0) (= 256 ~last_1_var_1_5~0))) [2023-12-16 03:47:05,711 INFO L899 garLoopResultBuilder]: For program point L69-1(line 69) no Hoare annotation was computed. [2023-12-16 03:47:05,711 INFO L899 garLoopResultBuilder]: For program point L36(lines 36 42) no Hoare annotation was computed. [2023-12-16 03:47:05,711 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-12-16 03:47:05,711 INFO L895 garLoopResultBuilder]: At program point L86-2(lines 86 92) the Hoare annotation is: (let ((.cse4 (mod ~var_1_5~0 65536)) (.cse3 (mod ~var_1_1~0 4294967296)) (.cse7 (mod ~last_1_var_1_5~0 65536))) (let ((.cse2 (mod (+ 65528 ~var_1_6~0) 65536)) (.cse1 (mod ~var_1_6~0 65536)) (.cse0 (div ~last_1_var_1_11~0 4294967296)) (.cse11 (or (< ~var_1_1~0 .cse7) (= .cse3 .cse7))) (.cse5 (< ~var_1_1~0 .cse4)) (.cse12 (or (and (<= (+ ~var_1_1~0 17) 0) (<= 0 (+ ~var_1_1~0 32768))) (and (<= (+ ~var_1_1~0 1) 0) (<= 0 (+ 16 ~var_1_1~0))) (and (<= ~var_1_1~0 32767) (<= 0 ~var_1_1~0))))) (or (and (< ~last_1_var_1_11~0 9) (< 0 (+ .cse0 1)) (<= 264 .cse1) (= (+ 5 ~var_1_1~0) 0) (= (* 256 (div ~var_1_4~0 256)) ~var_1_4~0) (= 256 ~var_1_5~0) (= 8 ~var_1_11~0) (= 256 ~last_1_var_1_5~0) (not (= .cse2 256))) (and (or (= .cse3 .cse4) .cse5) (let ((.cse10 (= (mod ~var_1_4~0 256) 0))) (let ((.cse6 (not .cse10))) (or (let ((.cse9 (+ 65536 ~var_1_1~0)) (.cse8 (mod (+ 65520 ~last_1_var_1_5~0) 65536))) (and .cse6 (not (= .cse7 ~var_1_1~0)) (not (= .cse8 ~var_1_1~0)) (not (= .cse9 .cse7)) (not (= .cse9 .cse8)))) (and .cse6 (not (= (mod ~var_1_1~0 65536) .cse4))) (and (or (and (not (= .cse2 .cse4)) (<= (+ .cse7 8) .cse1)) (and (not (= .cse7 .cse4)) (<= .cse1 (+ 7 .cse7)))) .cse10)))) (not |ULTIMATE.start_property_#t~short11#1|) (not (= (+ (* 65536 (div ~last_1_var_1_5~0 65536)) ~last_1_var_1_11~0) (+ ~last_1_var_1_5~0 (* .cse0 4294967296)))) .cse11 .cse12) (let ((.cse13 (mod ~var_1_11~0 4294967296))) (and .cse11 (or (= .cse13 .cse4) .cse5) .cse12 (= .cse13 .cse3)))))) [2023-12-16 03:47:05,712 INFO L899 garLoopResultBuilder]: For program point L86-3(lines 86 92) no Hoare annotation was computed. [2023-12-16 03:47:05,712 INFO L895 garLoopResultBuilder]: At program point L66(line 66) the Hoare annotation is: (or (let ((.cse0 (mod ~var_1_1~0 4294967296))) (and (let ((.cse1 (mod ~var_1_5~0 65536))) (or (= .cse0 .cse1) (< ~var_1_1~0 .cse1))) (or (not |ULTIMATE.start_property_#t~short11#1|) (= (mod ~var_1_11~0 4294967296) .cse0)) (let ((.cse2 (mod ~last_1_var_1_5~0 65536))) (or (< ~var_1_1~0 .cse2) (= .cse0 .cse2))) (or (and (<= (+ ~var_1_1~0 17) 0) (<= 0 (+ ~var_1_1~0 32768))) (and (<= (+ ~var_1_1~0 1) 0) (<= 0 (+ 16 ~var_1_1~0))) (and (<= ~var_1_1~0 32767) (<= 0 ~var_1_1~0))))) (and (< ~last_1_var_1_11~0 9) (< 0 (+ (div ~last_1_var_1_11~0 4294967296) 1)) (= (+ 5 ~var_1_1~0) 0) (= 256 ~var_1_5~0) (= 8 ~var_1_11~0) (= 256 ~last_1_var_1_5~0))) [2023-12-16 03:47:05,712 INFO L895 garLoopResultBuilder]: At program point L66-1(line 66) the Hoare annotation is: (or (let ((.cse0 (mod ~var_1_1~0 4294967296))) (and (let ((.cse1 (mod ~var_1_5~0 65536))) (or (= .cse0 .cse1) (< ~var_1_1~0 .cse1))) (or (not |ULTIMATE.start_property_#t~short11#1|) (= (mod ~var_1_11~0 4294967296) .cse0)) (let ((.cse2 (mod ~last_1_var_1_5~0 65536))) (or (< ~var_1_1~0 .cse2) (= .cse0 .cse2))) (or (and (<= (+ ~var_1_1~0 17) 0) (<= 0 (+ ~var_1_1~0 32768))) (and (<= (+ ~var_1_1~0 1) 0) (<= 0 (+ 16 ~var_1_1~0))) (and (<= ~var_1_1~0 32767) (<= 0 ~var_1_1~0))))) (and (< ~last_1_var_1_11~0 9) (< 0 (+ (div ~last_1_var_1_11~0 4294967296) 1)) (= (+ 5 ~var_1_1~0) 0) (= 256 ~var_1_5~0) (= 8 ~var_1_11~0) (= 256 ~last_1_var_1_5~0))) [2023-12-16 03:47:05,712 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-16 03:47:05,712 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-16 03:47:05,712 INFO L895 garLoopResultBuilder]: At program point L71(line 71) the Hoare annotation is: (or (let ((.cse0 (mod ~var_1_1~0 4294967296))) (and (let ((.cse1 (mod ~var_1_5~0 65536))) (or (= .cse0 .cse1) (< ~var_1_1~0 .cse1))) (or (not |ULTIMATE.start_property_#t~short11#1|) (= (mod ~var_1_11~0 4294967296) .cse0)) (let ((.cse2 (mod ~last_1_var_1_5~0 65536))) (or (< ~var_1_1~0 .cse2) (= .cse0 .cse2))) (or (and (<= (+ ~var_1_1~0 17) 0) (<= 0 (+ ~var_1_1~0 32768))) (and (<= (+ ~var_1_1~0 1) 0) (<= 0 (+ 16 ~var_1_1~0))) (and (<= ~var_1_1~0 32767) (<= 0 ~var_1_1~0))))) (and (< ~last_1_var_1_11~0 9) (< 0 (+ (div ~last_1_var_1_11~0 4294967296) 1)) (= (+ 5 ~var_1_1~0) 0) (= 256 ~var_1_5~0) (= 8 ~var_1_11~0) (= 256 ~last_1_var_1_5~0))) [2023-12-16 03:47:05,712 INFO L899 garLoopResultBuilder]: For program point L71-1(line 71) no Hoare annotation was computed. [2023-12-16 03:47:05,712 INFO L899 garLoopResultBuilder]: For program point L67(line 67) no Hoare annotation was computed. [2023-12-16 03:47:05,713 INFO L895 garLoopResultBuilder]: At program point L63(line 63) the Hoare annotation is: (or (let ((.cse0 (mod ~var_1_1~0 4294967296))) (and (let ((.cse1 (mod ~var_1_5~0 65536))) (or (= .cse0 .cse1) (< ~var_1_1~0 .cse1))) (or (not |ULTIMATE.start_property_#t~short11#1|) (= (mod ~var_1_11~0 4294967296) .cse0)) (let ((.cse2 (mod ~last_1_var_1_5~0 65536))) (or (< ~var_1_1~0 .cse2) (= .cse0 .cse2))) (or (and (<= (+ ~var_1_1~0 17) 0) (<= 0 (+ ~var_1_1~0 32768))) (and (<= (+ ~var_1_1~0 1) 0) (<= 0 (+ 16 ~var_1_1~0))) (and (<= ~var_1_1~0 32767) (<= 0 ~var_1_1~0))))) (and (< ~last_1_var_1_11~0 9) (< 0 (+ (div ~last_1_var_1_11~0 4294967296) 1)) (= (+ 5 ~var_1_1~0) 0) (= 256 ~var_1_5~0) (= 8 ~var_1_11~0) (= 256 ~last_1_var_1_5~0))) [2023-12-16 03:47:05,713 INFO L895 garLoopResultBuilder]: At program point L63-1(line 63) the Hoare annotation is: (or (let ((.cse0 (mod ~var_1_1~0 4294967296))) (and (let ((.cse1 (mod ~var_1_5~0 65536))) (or (= .cse0 .cse1) (< ~var_1_1~0 .cse1))) (or (not |ULTIMATE.start_property_#t~short11#1|) (= (mod ~var_1_11~0 4294967296) .cse0)) (let ((.cse2 (mod ~last_1_var_1_5~0 65536))) (or (< ~var_1_1~0 .cse2) (= .cse0 .cse2))) (or (and (<= (+ ~var_1_1~0 17) 0) (<= 0 (+ ~var_1_1~0 32768))) (and (<= (+ ~var_1_1~0 1) 0) (<= 0 (+ 16 ~var_1_1~0))) (and (<= ~var_1_1~0 32767) (<= 0 ~var_1_1~0))))) (and (< ~last_1_var_1_11~0 9) (< 0 (+ (div ~last_1_var_1_11~0 4294967296) 1)) (= (+ 5 ~var_1_1~0) 0) (= 256 ~var_1_5~0) (= 8 ~var_1_11~0) (= 256 ~last_1_var_1_5~0))) [2023-12-16 03:47:05,713 INFO L899 garLoopResultBuilder]: For program point L80(line 80) no Hoare annotation was computed. [2023-12-16 03:47:05,713 INFO L899 garLoopResultBuilder]: For program point L47(lines 47 49) no Hoare annotation was computed. [2023-12-16 03:47:05,713 INFO L899 garLoopResultBuilder]: For program point L80-2(line 80) no Hoare annotation was computed. [2023-12-16 03:47:05,713 INFO L899 garLoopResultBuilder]: For program point L47-2(lines 44 50) no Hoare annotation was computed. [2023-12-16 03:47:05,713 INFO L899 garLoopResultBuilder]: For program point L39(lines 39 41) no Hoare annotation was computed. [2023-12-16 03:47:05,713 INFO L899 garLoopResultBuilder]: For program point L39-2(lines 36 42) no Hoare annotation was computed. [2023-12-16 03:47:05,713 INFO L899 garLoopResultBuilder]: For program point L35(lines 35 60) no Hoare annotation was computed. [2023-12-16 03:47:05,713 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 20) the Hoare annotation is: true [2023-12-16 03:47:05,713 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-12-16 03:47:05,714 INFO L899 garLoopResultBuilder]: For program point L20-2(line 20) no Hoare annotation was computed. [2023-12-16 03:47:05,714 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(line 20) no Hoare annotation was computed. [2023-12-16 03:47:05,716 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 03:47:05,718 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 03:47:05,742 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 03:47:05 BoogieIcfgContainer [2023-12-16 03:47:05,742 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 03:47:05,743 INFO L158 Benchmark]: Toolchain (without parser) took 45160.64ms. Allocated memory was 284.2MB in the beginning and 792.7MB in the end (delta: 508.6MB). Free memory was 235.9MB in the beginning and 733.9MB in the end (delta: -498.0MB). Peak memory consumption was 461.0MB. Max. memory is 8.0GB. [2023-12-16 03:47:05,743 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 190.8MB. Free memory is still 142.9MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 03:47:05,743 INFO L158 Benchmark]: CACSL2BoogieTranslator took 279.76ms. Allocated memory is still 284.2MB. Free memory was 235.4MB in the beginning and 223.2MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-16 03:47:05,743 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.77ms. Allocated memory is still 284.2MB. Free memory was 223.2MB in the beginning and 220.7MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-16 03:47:05,744 INFO L158 Benchmark]: Boogie Preprocessor took 58.58ms. Allocated memory is still 284.2MB. Free memory was 220.7MB in the beginning and 217.6MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-16 03:47:05,744 INFO L158 Benchmark]: RCFGBuilder took 374.25ms. Allocated memory is still 284.2MB. Free memory was 217.6MB in the beginning and 201.3MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2023-12-16 03:47:05,744 INFO L158 Benchmark]: TraceAbstraction took 44391.63ms. Allocated memory was 284.2MB in the beginning and 792.7MB in the end (delta: 508.6MB). Free memory was 200.8MB in the beginning and 733.9MB in the end (delta: -533.1MB). Peak memory consumption was 426.4MB. Max. memory is 8.0GB. [2023-12-16 03:47:05,745 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.13ms. Allocated memory is still 190.8MB. Free memory is still 142.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 279.76ms. Allocated memory is still 284.2MB. Free memory was 235.4MB in the beginning and 223.2MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 50.77ms. Allocated memory is still 284.2MB. Free memory was 223.2MB in the beginning and 220.7MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 58.58ms. Allocated memory is still 284.2MB. Free memory was 220.7MB in the beginning and 217.6MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 374.25ms. Allocated memory is still 284.2MB. Free memory was 217.6MB in the beginning and 201.3MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * TraceAbstraction took 44391.63ms. Allocated memory was 284.2MB in the beginning and 792.7MB in the end (delta: 508.6MB). Free memory was 200.8MB in the beginning and 733.9MB in the end (delta: -533.1MB). Peak memory consumption was 426.4MB. 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 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 35 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 44.3s, OverallIterations: 14, TraceHistogramMax: 21, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 12.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 3.8s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1764 SdHoareTripleChecker+Valid, 4.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1757 mSDsluCounter, 3547 SdHoareTripleChecker+Invalid, 3.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2834 mSDsCounter, 857 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4518 IncrementalHoareTripleChecker+Invalid, 5375 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 857 mSolverCounterUnsat, 713 mSDtfsCounter, 4518 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1344 GetRequests, 1047 SyntacticMatches, 0 SemanticMatches, 297 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6487 ImplicationChecksByTransitivity, 9.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=258occurred in iteration=7, InterpolantAutomatonStates: 228, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 14 MinimizatonAttempts, 422 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 332 PreInvPairs, 441 NumberOfFragments, 937 HoareAnnotationTreeSize, 332 FormulaSimplifications, 8232 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 9 FormulaSimplificationsInter, 21466 FormulaSimplificationTreeSizeReductionInter, 3.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 25.3s InterpolantComputationTime, 1503 NumberOfCodeBlocks, 1503 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1858 ConstructedInterpolants, 0 QuantifiedInterpolants, 15604 SizeOfPredicates, 68 NumberOfNonLiveVariables, 888 ConjunctsInSsa, 125 ConjunctsInUnsatCore, 20 InterpolantComputations, 12 PerfectInterpolantSequences, 6614/6892 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 86]: Loop Invariant Derived loop invariant: (((((((((((last_1_var_1_11 < 9) && (0 < ((last_1_var_1_11 / 4294967296) + 1))) && (264 <= (var_1_6 % 65536))) && ((5 + var_1_1) == 0)) && ((256 * (var_1_4 / 256)) == var_1_4)) && (256 == var_1_5)) && (8 == var_1_11)) && (256 == last_1_var_1_5)) && !((((65528 + var_1_6) % 65536) == 256))) || (((((((var_1_1 % 4294967296) == (var_1_5 % 65536)) || (var_1_1 < (var_1_5 % 65536))) && ((((((!(((var_1_4 % 256) == 0)) && !(((last_1_var_1_5 % 65536) == var_1_1))) && !((((65520 + last_1_var_1_5) % 65536) == var_1_1))) && !(((65536 + var_1_1) == (last_1_var_1_5 % 65536)))) && !(((65536 + var_1_1) == ((65520 + last_1_var_1_5) % 65536)))) || (!(((var_1_4 % 256) == 0)) && !(((var_1_1 % 65536) == (var_1_5 % 65536))))) || (((!((((65528 + var_1_6) % 65536) == (var_1_5 % 65536))) && (((last_1_var_1_5 % 65536) + 8) <= (var_1_6 % 65536))) || (!(((last_1_var_1_5 % 65536) == (var_1_5 % 65536))) && ((var_1_6 % 65536) <= (7 + (last_1_var_1_5 % 65536))))) && ((var_1_4 % 256) == 0)))) && !((((65536 * (last_1_var_1_5 / 65536)) + last_1_var_1_11) == (last_1_var_1_5 + ((last_1_var_1_11 / 4294967296) * 4294967296))))) && ((var_1_1 < (last_1_var_1_5 % 65536)) || ((var_1_1 % 4294967296) == (last_1_var_1_5 % 65536)))) && (((((var_1_1 + 17) <= 0) && (0 <= (var_1_1 + 32768))) || (((var_1_1 + 1) <= 0) && (0 <= (16 + var_1_1)))) || ((var_1_1 <= 32767) && (0 <= var_1_1))))) || (((((var_1_1 < (last_1_var_1_5 % 65536)) || ((var_1_1 % 4294967296) == (last_1_var_1_5 % 65536))) && (((var_1_11 % 4294967296) == (var_1_5 % 65536)) || (var_1_1 < (var_1_5 % 65536)))) && (((((var_1_1 + 17) <= 0) && (0 <= (var_1_1 + 32768))) || (((var_1_1 + 1) <= 0) && (0 <= (16 + var_1_1)))) || ((var_1_1 <= 32767) && (0 <= var_1_1)))) && ((var_1_11 % 4294967296) == (var_1_1 % 4294967296)))) RESULT: Ultimate proved your program to be correct! [2023-12-16 03:47:05,770 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...