/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_floatingpointinfluence_has-floats_file-90.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 03:33:15,158 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 03:33:15,229 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:33:15,234 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 03:33:15,235 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 03:33:15,259 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 03:33:15,260 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 03:33:15,260 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 03:33:15,261 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 03:33:15,263 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 03:33:15,264 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 03:33:15,264 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 03:33:15,265 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 03:33:15,265 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 03:33:15,266 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 03:33:15,266 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 03:33:15,266 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 03:33:15,266 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 03:33:15,266 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-16 03:33:15,266 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 03:33:15,267 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 03:33:15,267 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 03:33:15,268 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 03:33:15,268 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 03:33:15,268 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 03:33:15,268 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 03:33:15,268 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 03:33:15,268 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 03:33:15,269 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 03:33:15,269 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 03:33:15,270 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 03:33:15,270 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 03:33:15,270 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 03:33:15,270 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 03:33:15,270 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 03:33:15,270 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 03:33:15,270 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-16 03:33:15,270 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-16 03:33:15,271 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 03:33:15,271 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 03:33:15,271 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 03:33:15,271 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 03:33:15,271 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 03:33:15,271 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:33:15,466 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 03:33:15,485 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 03:33:15,487 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 03:33:15,488 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 03:33:15,488 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 03:33:15,489 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-90.i [2023-12-16 03:33:16,583 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 03:33:16,829 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 03:33:16,830 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-90.i [2023-12-16 03:33:16,843 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/241654c0d/0d58995598624b0fbea9b5635e83e085/FLAGec56e2473 [2023-12-16 03:33:16,858 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/241654c0d/0d58995598624b0fbea9b5635e83e085 [2023-12-16 03:33:16,860 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 03:33:16,861 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 03:33:16,862 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 03:33:16,862 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 03:33:16,867 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 03:33:16,868 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 03:33:16" (1/1) ... [2023-12-16 03:33:16,868 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42ea762e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:33:16, skipping insertion in model container [2023-12-16 03:33:16,869 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 03:33:16" (1/1) ... [2023-12-16 03:33:16,886 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 03:33:16,981 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_floatingpointinfluence_has-floats_file-90.i[917,930] [2023-12-16 03:33:17,014 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 03:33:17,022 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 03:33:17,031 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_floatingpointinfluence_has-floats_file-90.i[917,930] [2023-12-16 03:33:17,047 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 03:33:17,060 INFO L206 MainTranslator]: Completed translation [2023-12-16 03:33:17,061 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:33:17 WrapperNode [2023-12-16 03:33:17,061 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 03:33:17,062 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 03:33:17,062 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 03:33:17,062 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 03:33:17,067 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:33:17" (1/1) ... [2023-12-16 03:33:17,073 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:33:17" (1/1) ... [2023-12-16 03:33:17,099 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 127 [2023-12-16 03:33:17,100 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 03:33:17,100 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 03:33:17,100 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 03:33:17,101 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 03:33:17,111 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:33:17" (1/1) ... [2023-12-16 03:33:17,111 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:33:17" (1/1) ... [2023-12-16 03:33:17,113 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:33:17" (1/1) ... [2023-12-16 03:33:17,122 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:33:17,122 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:33:17" (1/1) ... [2023-12-16 03:33:17,122 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:33:17" (1/1) ... [2023-12-16 03:33:17,125 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:33:17" (1/1) ... [2023-12-16 03:33:17,127 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:33:17" (1/1) ... [2023-12-16 03:33:17,129 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:33:17" (1/1) ... [2023-12-16 03:33:17,130 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:33:17" (1/1) ... [2023-12-16 03:33:17,132 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 03:33:17,134 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 03:33:17,134 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 03:33:17,134 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 03:33:17,135 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:33:17" (1/1) ... [2023-12-16 03:33:17,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 03:33:17,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 03:33:17,202 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:33:17,233 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:33:17,243 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 03:33:17,244 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-16 03:33:17,244 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-16 03:33:17,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-16 03:33:17,244 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 03:33:17,244 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 03:33:17,337 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 03:33:17,339 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 03:33:17,577 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 03:33:17,617 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 03:33:17,617 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-16 03:33:17,618 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 03:33:17 BoogieIcfgContainer [2023-12-16 03:33:17,618 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 03:33:17,620 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 03:33:17,620 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 03:33:17,622 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 03:33:17,622 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 03:33:16" (1/3) ... [2023-12-16 03:33:17,623 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62957f93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 03:33:17, skipping insertion in model container [2023-12-16 03:33:17,623 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:33:17" (2/3) ... [2023-12-16 03:33:17,624 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62957f93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 03:33:17, skipping insertion in model container [2023-12-16 03:33:17,624 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 03:33:17" (3/3) ... [2023-12-16 03:33:17,624 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-90.i [2023-12-16 03:33:17,636 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 03:33:17,636 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 03:33:17,673 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 03:33:17,677 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;@63b279c2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 03:33:17,678 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 03:33:17,682 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 29 states have internal predecessors, (40), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-16 03:33:17,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-12-16 03:33:17,714 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 03:33:17,715 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:17,715 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 03:33:17,735 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 03:33:17,736 INFO L85 PathProgramCache]: Analyzing trace with hash 1356584365, now seen corresponding path program 1 times [2023-12-16 03:33:17,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 03:33:17,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742022004] [2023-12-16 03:33:17,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 03:33:17,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 03:33:17,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:17,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 03:33:18,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:18,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-16 03:33:18,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:18,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-16 03:33:18,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:18,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-16 03:33:18,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:18,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-16 03:33:18,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:18,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 03:33:18,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:18,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 03:33:18,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:18,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-16 03:33:18,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:18,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-16 03:33:18,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:18,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-16 03:33:18,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:18,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-16 03:33:18,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:18,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 03:33:18,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:18,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 03:33:18,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:18,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-16 03:33:18,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:18,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-16 03:33:18,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:18,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-16 03:33:18,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:18,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-16 03:33:18,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:18,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-16 03:33:18,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:18,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-16 03:33:18,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:18,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-12-16 03:33:18,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:18,126 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-16 03:33:18,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 03:33:18,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742022004] [2023-12-16 03:33:18,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742022004] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 03:33:18,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 03:33:18,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 03:33:18,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693778981] [2023-12-16 03:33:18,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 03:33:18,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-16 03:33:18,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 03:33:18,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-16 03:33:18,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 03:33:18,157 INFO L87 Difference]: Start difference. First operand has 51 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 29 states have internal predecessors, (40), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2023-12-16 03:33:18,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 03:33:18,201 INFO L93 Difference]: Finished difference Result 99 states and 178 transitions. [2023-12-16 03:33:18,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-16 03:33:18,204 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 120 [2023-12-16 03:33:18,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 03:33:18,212 INFO L225 Difference]: With dead ends: 99 [2023-12-16 03:33:18,212 INFO L226 Difference]: Without dead ends: 49 [2023-12-16 03:33:18,215 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 62 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:33:18,219 INFO L413 NwaCegarLoop]: 72 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, 72 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:33:18,220 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 72 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 03:33:18,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2023-12-16 03:33:18,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2023-12-16 03:33:18,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 27 states have internal predecessors, (35), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-16 03:33:18,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 75 transitions. [2023-12-16 03:33:18,252 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 75 transitions. Word has length 120 [2023-12-16 03:33:18,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 03:33:18,253 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 75 transitions. [2023-12-16 03:33:18,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2023-12-16 03:33:18,253 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 75 transitions. [2023-12-16 03:33:18,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-12-16 03:33:18,258 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 03:33:18,258 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:18,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-16 03:33:18,259 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 03:33:18,259 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 03:33:18,260 INFO L85 PathProgramCache]: Analyzing trace with hash -997376595, now seen corresponding path program 1 times [2023-12-16 03:33:18,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 03:33:18,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572515085] [2023-12-16 03:33:18,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 03:33:18,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 03:33:18,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:21,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 03:33:21,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:21,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-16 03:33:21,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:21,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-16 03:33:21,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:21,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-16 03:33:21,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:21,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-16 03:33:21,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:21,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 03:33:21,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:21,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 03:33:21,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:21,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-16 03:33:21,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:21,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-16 03:33:21,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:21,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-16 03:33:21,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:21,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-16 03:33:21,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:21,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 03:33:21,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:21,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 03:33:21,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:21,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-16 03:33:21,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:21,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-16 03:33:21,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:21,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-16 03:33:21,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:21,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-16 03:33:21,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:21,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-16 03:33:21,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:21,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-16 03:33:21,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:21,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-12-16 03:33:21,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:21,924 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-16 03:33:21,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 03:33:21,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572515085] [2023-12-16 03:33:21,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572515085] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 03:33:21,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 03:33:21,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-16 03:33:21,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142555389] [2023-12-16 03:33:21,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 03:33:21,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 03:33:21,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 03:33:21,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 03:33:21,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2023-12-16 03:33:21,931 INFO L87 Difference]: Start difference. First operand 49 states and 75 transitions. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-16 03:33:22,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 03:33:22,531 INFO L93 Difference]: Finished difference Result 95 states and 132 transitions. [2023-12-16 03:33:22,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-16 03:33:22,532 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 120 [2023-12-16 03:33:22,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 03:33:22,533 INFO L225 Difference]: With dead ends: 95 [2023-12-16 03:33:22,534 INFO L226 Difference]: Without dead ends: 93 [2023-12-16 03:33:22,534 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2023-12-16 03:33:22,535 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 87 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-16 03:33:22,535 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 304 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-16 03:33:22,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2023-12-16 03:33:22,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 82. [2023-12-16 03:33:22,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 48 states have (on average 1.25) internal successors, (60), 49 states have internal predecessors, (60), 30 states have call successors, (30), 3 states have call predecessors, (30), 3 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2023-12-16 03:33:22,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 120 transitions. [2023-12-16 03:33:22,550 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 120 transitions. Word has length 120 [2023-12-16 03:33:22,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 03:33:22,551 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 120 transitions. [2023-12-16 03:33:22,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-16 03:33:22,551 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 120 transitions. [2023-12-16 03:33:22,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-12-16 03:33:22,552 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 03:33:22,552 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:22,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-16 03:33:22,553 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 03:33:22,553 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 03:33:22,553 INFO L85 PathProgramCache]: Analyzing trace with hash -997317013, now seen corresponding path program 1 times [2023-12-16 03:33:22,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 03:33:22,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893446643] [2023-12-16 03:33:22,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 03:33:22,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 03:33:22,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:23,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 03:33:23,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:23,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-16 03:33:23,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:23,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-16 03:33:23,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:23,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-16 03:33:23,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:23,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-16 03:33:23,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:23,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 03:33:23,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:23,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 03:33:23,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:23,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-16 03:33:23,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:23,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-16 03:33:23,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:23,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-16 03:33:23,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:23,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-16 03:33:23,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:23,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 03:33:23,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:23,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 03:33:23,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:23,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-16 03:33:23,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:23,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-16 03:33:23,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:23,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-16 03:33:23,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:23,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-16 03:33:23,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:23,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-16 03:33:23,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:23,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-16 03:33:23,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:23,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-12-16 03:33:23,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:23,847 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-16 03:33:23,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 03:33:23,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893446643] [2023-12-16 03:33:23,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893446643] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 03:33:23,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 03:33:23,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-16 03:33:23,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407602751] [2023-12-16 03:33:23,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 03:33:23,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 03:33:23,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 03:33:23,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 03:33:23,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2023-12-16 03:33:23,852 INFO L87 Difference]: Start difference. First operand 82 states and 120 transitions. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-16 03:33:24,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 03:33:24,351 INFO L93 Difference]: Finished difference Result 93 states and 130 transitions. [2023-12-16 03:33:24,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-16 03:33:24,352 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 120 [2023-12-16 03:33:24,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 03:33:24,353 INFO L225 Difference]: With dead ends: 93 [2023-12-16 03:33:24,353 INFO L226 Difference]: Without dead ends: 91 [2023-12-16 03:33:24,353 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2023-12-16 03:33:24,354 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 84 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-16 03:33:24,354 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 311 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-16 03:33:24,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2023-12-16 03:33:24,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 82. [2023-12-16 03:33:24,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 48 states have (on average 1.25) internal successors, (60), 49 states have internal predecessors, (60), 30 states have call successors, (30), 3 states have call predecessors, (30), 3 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2023-12-16 03:33:24,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 120 transitions. [2023-12-16 03:33:24,371 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 120 transitions. Word has length 120 [2023-12-16 03:33:24,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 03:33:24,372 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 120 transitions. [2023-12-16 03:33:24,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-16 03:33:24,372 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 120 transitions. [2023-12-16 03:33:24,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-12-16 03:33:24,377 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 03:33:24,379 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:24,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-16 03:33:24,379 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 03:33:24,379 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 03:33:24,379 INFO L85 PathProgramCache]: Analyzing trace with hash -1054634897, now seen corresponding path program 1 times [2023-12-16 03:33:24,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 03:33:24,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076615681] [2023-12-16 03:33:24,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 03:33:24,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 03:33:24,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:27,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 03:33:27,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:27,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-16 03:33:27,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:27,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-16 03:33:27,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:27,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-16 03:33:27,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:27,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-16 03:33:27,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:27,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 03:33:27,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:27,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 03:33:27,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:27,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-16 03:33:27,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:27,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-16 03:33:27,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:27,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-16 03:33:27,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:27,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-16 03:33:27,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:27,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 03:33:27,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:27,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 03:33:27,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:27,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-16 03:33:27,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:27,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-16 03:33:27,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:27,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-16 03:33:27,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:27,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-16 03:33:27,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:27,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-16 03:33:27,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:27,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-16 03:33:27,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:27,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-12-16 03:33:27,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:27,044 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-16 03:33:27,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 03:33:27,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076615681] [2023-12-16 03:33:27,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076615681] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 03:33:27,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 03:33:27,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-16 03:33:27,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355792182] [2023-12-16 03:33:27,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 03:33:27,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 03:33:27,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 03:33:27,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 03:33:27,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2023-12-16 03:33:27,046 INFO L87 Difference]: Start difference. First operand 82 states and 120 transitions. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-16 03:33:27,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 03:33:27,517 INFO L93 Difference]: Finished difference Result 123 states and 169 transitions. [2023-12-16 03:33:27,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-16 03:33:27,517 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 120 [2023-12-16 03:33:27,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 03:33:27,519 INFO L225 Difference]: With dead ends: 123 [2023-12-16 03:33:27,519 INFO L226 Difference]: Without dead ends: 121 [2023-12-16 03:33:27,520 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2023-12-16 03:33:27,520 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 90 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 03:33:27,520 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 247 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 03:33:27,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2023-12-16 03:33:27,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 106. [2023-12-16 03:33:27,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 62 states have (on average 1.2096774193548387) internal successors, (75), 64 states have internal predecessors, (75), 38 states have call successors, (38), 5 states have call predecessors, (38), 5 states have return successors, (38), 36 states have call predecessors, (38), 38 states have call successors, (38) [2023-12-16 03:33:27,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 151 transitions. [2023-12-16 03:33:27,556 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 151 transitions. Word has length 120 [2023-12-16 03:33:27,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 03:33:27,556 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 151 transitions. [2023-12-16 03:33:27,556 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-16 03:33:27,556 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 151 transitions. [2023-12-16 03:33:27,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-12-16 03:33:27,557 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 03:33:27,557 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:27,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-16 03:33:27,558 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 03:33:27,558 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 03:33:27,558 INFO L85 PathProgramCache]: Analyzing trace with hash -1054575315, now seen corresponding path program 1 times [2023-12-16 03:33:27,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 03:33:27,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43691568] [2023-12-16 03:33:27,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 03:33:27,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 03:33:27,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:29,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 03:33:29,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:29,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-16 03:33:29,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:29,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-16 03:33:29,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:29,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-16 03:33:29,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:29,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-16 03:33:29,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:29,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 03:33:29,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:29,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 03:33:29,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:29,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-16 03:33:29,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:29,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-16 03:33:29,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:29,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-16 03:33:29,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:29,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-16 03:33:29,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:29,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 03:33:29,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:29,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 03:33:29,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:29,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-16 03:33:29,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:29,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-16 03:33:29,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:29,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-16 03:33:29,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:29,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-16 03:33:29,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:29,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-16 03:33:29,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:29,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-16 03:33:29,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:29,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-12-16 03:33:29,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:29,197 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-16 03:33:29,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 03:33:29,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43691568] [2023-12-16 03:33:29,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43691568] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 03:33:29,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 03:33:29,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-16 03:33:29,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144599479] [2023-12-16 03:33:29,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 03:33:29,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 03:33:29,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 03:33:29,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 03:33:29,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2023-12-16 03:33:29,200 INFO L87 Difference]: Start difference. First operand 106 states and 151 transitions. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-16 03:33:30,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 03:33:30,096 INFO L93 Difference]: Finished difference Result 115 states and 159 transitions. [2023-12-16 03:33:30,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-16 03:33:30,096 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 120 [2023-12-16 03:33:30,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 03:33:30,098 INFO L225 Difference]: With dead ends: 115 [2023-12-16 03:33:30,098 INFO L226 Difference]: Without dead ends: 113 [2023-12-16 03:33:30,098 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2023-12-16 03:33:30,099 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 84 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-16 03:33:30,099 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 280 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-16 03:33:30,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2023-12-16 03:33:30,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 102. [2023-12-16 03:33:30,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 58 states have (on average 1.1896551724137931) internal successors, (69), 60 states have internal predecessors, (69), 38 states have call successors, (38), 5 states have call predecessors, (38), 5 states have return successors, (38), 36 states have call predecessors, (38), 38 states have call successors, (38) [2023-12-16 03:33:30,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 145 transitions. [2023-12-16 03:33:30,119 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 145 transitions. Word has length 120 [2023-12-16 03:33:30,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 03:33:30,121 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 145 transitions. [2023-12-16 03:33:30,121 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-16 03:33:30,121 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 145 transitions. [2023-12-16 03:33:30,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-12-16 03:33:30,121 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 03:33:30,122 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:30,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-16 03:33:30,122 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 03:33:30,122 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 03:33:30,122 INFO L85 PathProgramCache]: Analyzing trace with hash 1148591013, now seen corresponding path program 1 times [2023-12-16 03:33:30,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 03:33:30,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130641338] [2023-12-16 03:33:30,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 03:33:30,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 03:33:30,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:33,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 03:33:33,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:33,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-16 03:33:33,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:33,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-16 03:33:33,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:33,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-16 03:33:33,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:33,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-16 03:33:33,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:33,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 03:33:33,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:33,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 03:33:33,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:33,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-16 03:33:33,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:33,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-16 03:33:33,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:33,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-16 03:33:33,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:33,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-16 03:33:33,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:33,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 03:33:33,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:33,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 03:33:33,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:33,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-16 03:33:33,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:33,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-16 03:33:33,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:33,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-16 03:33:33,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:33,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-16 03:33:33,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:33,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-16 03:33:33,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:33,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-16 03:33:33,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:33,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-12-16 03:33:33,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:33,230 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-16 03:33:33,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 03:33:33,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130641338] [2023-12-16 03:33:33,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130641338] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 03:33:33,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 03:33:33,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-16 03:33:33,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439876454] [2023-12-16 03:33:33,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 03:33:33,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-16 03:33:33,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 03:33:33,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-16 03:33:33,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2023-12-16 03:33:33,232 INFO L87 Difference]: Start difference. First operand 102 states and 145 transitions. Second operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-16 03:33:34,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 03:33:34,315 INFO L93 Difference]: Finished difference Result 148 states and 201 transitions. [2023-12-16 03:33:34,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-16 03:33:34,316 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 121 [2023-12-16 03:33:34,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 03:33:34,317 INFO L225 Difference]: With dead ends: 148 [2023-12-16 03:33:34,317 INFO L226 Difference]: Without dead ends: 146 [2023-12-16 03:33:34,317 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2023-12-16 03:33:34,318 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 120 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-16 03:33:34,318 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 331 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-16 03:33:34,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2023-12-16 03:33:34,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 65. [2023-12-16 03:33:34,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 41 states have (on average 1.2926829268292683) internal successors, (53), 41 states have internal predecessors, (53), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-16 03:33:34,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 93 transitions. [2023-12-16 03:33:34,329 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 93 transitions. Word has length 121 [2023-12-16 03:33:34,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 03:33:34,329 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 93 transitions. [2023-12-16 03:33:34,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-16 03:33:34,330 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 93 transitions. [2023-12-16 03:33:34,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-12-16 03:33:34,330 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 03:33:34,330 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:34,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-16 03:33:34,331 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 03:33:34,331 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 03:33:34,331 INFO L85 PathProgramCache]: Analyzing trace with hash 1091392293, now seen corresponding path program 1 times [2023-12-16 03:33:34,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 03:33:34,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444913683] [2023-12-16 03:33:34,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 03:33:34,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 03:33:34,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:35,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 03:33:35,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:35,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-16 03:33:35,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:35,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-16 03:33:35,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:35,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-16 03:33:35,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:35,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-16 03:33:35,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:35,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 03:33:35,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:35,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 03:33:35,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:35,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-16 03:33:35,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:35,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-16 03:33:35,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:35,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-16 03:33:35,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:35,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-16 03:33:35,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:35,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 03:33:35,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:35,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 03:33:35,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:35,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-16 03:33:35,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:35,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-16 03:33:35,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:35,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-16 03:33:35,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:35,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-16 03:33:35,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:35,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-16 03:33:35,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:35,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-16 03:33:35,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:35,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-12-16 03:33:35,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:35,735 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-16 03:33:35,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 03:33:35,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444913683] [2023-12-16 03:33:35,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444913683] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 03:33:35,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 03:33:35,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-16 03:33:35,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125007250] [2023-12-16 03:33:35,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 03:33:35,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-16 03:33:35,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 03:33:35,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-16 03:33:35,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2023-12-16 03:33:35,737 INFO L87 Difference]: Start difference. First operand 65 states and 93 transitions. Second operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-16 03:33:36,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 03:33:36,800 INFO L93 Difference]: Finished difference Result 126 states and 171 transitions. [2023-12-16 03:33:36,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-16 03:33:36,801 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 121 [2023-12-16 03:33:36,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 03:33:36,802 INFO L225 Difference]: With dead ends: 126 [2023-12-16 03:33:36,802 INFO L226 Difference]: Without dead ends: 124 [2023-12-16 03:33:36,802 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=108, Invalid=198, Unknown=0, NotChecked=0, Total=306 [2023-12-16 03:33:36,805 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 119 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-16 03:33:36,805 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 314 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-16 03:33:36,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2023-12-16 03:33:36,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 64. [2023-12-16 03:33:36,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 40 states have (on average 1.275) internal successors, (51), 40 states have internal predecessors, (51), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-16 03:33:36,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 91 transitions. [2023-12-16 03:33:36,825 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 91 transitions. Word has length 121 [2023-12-16 03:33:36,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 03:33:36,827 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 91 transitions. [2023-12-16 03:33:36,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-16 03:33:36,827 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 91 transitions. [2023-12-16 03:33:36,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-12-16 03:33:36,828 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 03:33:36,828 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:36,828 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-16 03:33:36,828 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 03:33:36,829 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 03:33:36,829 INFO L85 PathProgramCache]: Analyzing trace with hash -1371368921, now seen corresponding path program 1 times [2023-12-16 03:33:36,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 03:33:36,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615924326] [2023-12-16 03:33:36,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 03:33:36,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 03:33:36,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:39,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 03:33:39,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:39,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-16 03:33:39,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:39,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-16 03:33:39,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:39,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-16 03:33:39,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:39,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-16 03:33:39,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:39,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 03:33:39,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:39,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 03:33:39,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:39,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-16 03:33:39,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:39,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-16 03:33:39,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:39,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-16 03:33:39,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:39,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-16 03:33:39,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:39,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 03:33:39,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:39,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 03:33:39,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:39,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-16 03:33:39,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:39,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-16 03:33:39,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:39,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-16 03:33:39,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:39,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-16 03:33:39,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:39,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-16 03:33:39,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:39,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-16 03:33:39,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:39,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-12-16 03:33:39,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:39,268 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-16 03:33:39,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 03:33:39,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615924326] [2023-12-16 03:33:39,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615924326] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 03:33:39,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 03:33:39,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-16 03:33:39,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436137443] [2023-12-16 03:33:39,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 03:33:39,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-16 03:33:39,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 03:33:39,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-16 03:33:39,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2023-12-16 03:33:39,270 INFO L87 Difference]: Start difference. First operand 64 states and 91 transitions. Second operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-16 03:33:39,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 03:33:39,751 INFO L93 Difference]: Finished difference Result 129 states and 174 transitions. [2023-12-16 03:33:39,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-16 03:33:39,752 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 121 [2023-12-16 03:33:39,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 03:33:39,753 INFO L225 Difference]: With dead ends: 129 [2023-12-16 03:33:39,753 INFO L226 Difference]: Without dead ends: 127 [2023-12-16 03:33:39,753 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2023-12-16 03:33:39,754 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 145 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 03:33:39,754 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 251 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 03:33:39,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2023-12-16 03:33:39,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 62. [2023-12-16 03:33:39,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 38 states have (on average 1.263157894736842) internal successors, (48), 38 states have internal predecessors, (48), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-16 03:33:39,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 88 transitions. [2023-12-16 03:33:39,765 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 88 transitions. Word has length 121 [2023-12-16 03:33:39,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 03:33:39,765 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 88 transitions. [2023-12-16 03:33:39,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-16 03:33:39,765 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 88 transitions. [2023-12-16 03:33:39,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-12-16 03:33:39,766 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 03:33:39,766 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:39,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-16 03:33:39,766 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 03:33:39,767 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 03:33:39,767 INFO L85 PathProgramCache]: Analyzing trace with hash -1371309339, now seen corresponding path program 1 times [2023-12-16 03:33:39,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 03:33:39,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264506587] [2023-12-16 03:33:39,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 03:33:39,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 03:33:39,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:41,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 03:33:41,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:41,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-16 03:33:41,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:41,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-16 03:33:41,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:41,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-16 03:33:41,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:41,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-16 03:33:41,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:41,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 03:33:41,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:41,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 03:33:41,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:41,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-16 03:33:41,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:41,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-16 03:33:41,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:41,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-16 03:33:41,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:41,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-16 03:33:41,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:41,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 03:33:41,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:41,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 03:33:41,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:41,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-16 03:33:41,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:41,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-16 03:33:41,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:41,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-16 03:33:41,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:41,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-16 03:33:41,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:41,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-16 03:33:41,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:41,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-16 03:33:41,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:41,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-12-16 03:33:41,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:41,092 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-16 03:33:41,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 03:33:41,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264506587] [2023-12-16 03:33:41,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264506587] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 03:33:41,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 03:33:41,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-16 03:33:41,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433655712] [2023-12-16 03:33:41,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 03:33:41,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-16 03:33:41,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 03:33:41,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-16 03:33:41,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2023-12-16 03:33:41,097 INFO L87 Difference]: Start difference. First operand 62 states and 88 transitions. Second operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-16 03:33:41,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 03:33:41,617 INFO L93 Difference]: Finished difference Result 125 states and 170 transitions. [2023-12-16 03:33:41,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-16 03:33:41,618 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 121 [2023-12-16 03:33:41,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 03:33:41,619 INFO L225 Difference]: With dead ends: 125 [2023-12-16 03:33:41,619 INFO L226 Difference]: Without dead ends: 123 [2023-12-16 03:33:41,619 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2023-12-16 03:33:41,619 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 131 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-16 03:33:41,619 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 252 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-16 03:33:41,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2023-12-16 03:33:41,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 62. [2023-12-16 03:33:41,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 38 states have (on average 1.263157894736842) internal successors, (48), 38 states have internal predecessors, (48), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-16 03:33:41,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 88 transitions. [2023-12-16 03:33:41,631 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 88 transitions. Word has length 121 [2023-12-16 03:33:41,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 03:33:41,634 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 88 transitions. [2023-12-16 03:33:41,634 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-16 03:33:41,634 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 88 transitions. [2023-12-16 03:33:41,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-12-16 03:33:41,635 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 03:33:41,636 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:41,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-16 03:33:41,636 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 03:33:41,636 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 03:33:41,636 INFO L85 PathProgramCache]: Analyzing trace with hash -1428567641, now seen corresponding path program 1 times [2023-12-16 03:33:41,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 03:33:41,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763484969] [2023-12-16 03:33:41,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 03:33:41,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 03:33:41,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:42,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 03:33:42,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:42,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-16 03:33:42,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:42,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-16 03:33:42,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:42,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-16 03:33:42,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:42,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-16 03:33:42,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:42,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 03:33:42,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:42,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 03:33:42,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:42,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-16 03:33:42,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:42,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-16 03:33:42,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:42,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-16 03:33:42,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:42,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-16 03:33:42,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:42,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 03:33:42,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:42,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 03:33:42,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:42,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-16 03:33:42,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:42,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-16 03:33:42,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:42,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-16 03:33:42,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:42,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-16 03:33:42,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:42,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-16 03:33:42,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:42,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-16 03:33:42,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:42,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-12-16 03:33:42,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:33:42,827 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-16 03:33:42,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 03:33:42,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763484969] [2023-12-16 03:33:42,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763484969] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 03:33:42,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 03:33:42,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-16 03:33:42,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779876307] [2023-12-16 03:33:42,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 03:33:42,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-16 03:33:42,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 03:33:42,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-16 03:33:42,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2023-12-16 03:33:42,830 INFO L87 Difference]: Start difference. First operand 62 states and 88 transitions. Second operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-16 03:33:43,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 03:33:43,670 INFO L93 Difference]: Finished difference Result 119 states and 163 transitions. [2023-12-16 03:33:43,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-16 03:33:43,674 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 121 [2023-12-16 03:33:43,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 03:33:43,674 INFO L225 Difference]: With dead ends: 119 [2023-12-16 03:33:43,674 INFO L226 Difference]: Without dead ends: 0 [2023-12-16 03:33:43,675 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2023-12-16 03:33:43,675 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 104 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-16 03:33:43,675 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 321 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-16 03:33:43,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-16 03:33:43,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-16 03:33:43,676 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:33:43,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-16 03:33:43,676 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 121 [2023-12-16 03:33:43,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 03:33:43,676 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-16 03:33:43,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-16 03:33:43,676 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-16 03:33:43,676 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-16 03:33:43,678 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 03:33:43,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-16 03:33:43,680 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-16 03:33:44,850 INFO L902 garLoopResultBuilder]: At program point L93(line 93) the Hoare annotation is: true [2023-12-16 03:33:44,851 INFO L902 garLoopResultBuilder]: At program point L93-1(line 93) the Hoare annotation is: true [2023-12-16 03:33:44,851 INFO L899 garLoopResultBuilder]: For program point L85(line 85) no Hoare annotation was computed. [2023-12-16 03:33:44,851 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-12-16 03:33:44,851 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2023-12-16 03:33:44,851 INFO L899 garLoopResultBuilder]: For program point L19-3(line 19) no Hoare annotation was computed. [2023-12-16 03:33:44,851 INFO L902 garLoopResultBuilder]: At program point L102(line 102) the Hoare annotation is: true [2023-12-16 03:33:44,851 INFO L902 garLoopResultBuilder]: At program point L102-1(line 102) the Hoare annotation is: true [2023-12-16 03:33:44,851 INFO L899 garLoopResultBuilder]: For program point L69(lines 69 71) no Hoare annotation was computed. [2023-12-16 03:33:44,851 INFO L899 garLoopResultBuilder]: For program point L94(line 94) no Hoare annotation was computed. [2023-12-16 03:33:44,851 INFO L895 garLoopResultBuilder]: At program point L78(line 78) the Hoare annotation is: (= (+ ~var_1_8~0 (* (div ~var_1_6~0 4294967296) 4294967296)) (+ (* (div ~var_1_8~0 4294967296) 4294967296) ~var_1_6~0)) [2023-12-16 03:33:44,851 INFO L895 garLoopResultBuilder]: At program point L78-1(line 78) the Hoare annotation is: (= (+ ~var_1_8~0 (* (div ~var_1_6~0 4294967296) 4294967296)) (+ (* (div ~var_1_8~0 4294967296) 4294967296) ~var_1_6~0)) [2023-12-16 03:33:44,851 INFO L899 garLoopResultBuilder]: For program point L45(lines 45 57) no Hoare annotation was computed. [2023-12-16 03:33:44,851 INFO L899 garLoopResultBuilder]: For program point L45-1(lines 42 72) no Hoare annotation was computed. [2023-12-16 03:33:44,851 INFO L899 garLoopResultBuilder]: For program point L103(lines 73 104) no Hoare annotation was computed. [2023-12-16 03:33:44,852 INFO L895 garLoopResultBuilder]: At program point L87(line 87) the Hoare annotation is: (= (+ ~var_1_8~0 (* (div ~var_1_6~0 4294967296) 4294967296)) (+ (* (div ~var_1_8~0 4294967296) 4294967296) ~var_1_6~0)) [2023-12-16 03:33:44,852 INFO L895 garLoopResultBuilder]: At program point L87-1(line 87) the Hoare annotation is: (= (+ ~var_1_8~0 (* (div ~var_1_6~0 4294967296) 4294967296)) (+ (* (div ~var_1_8~0 4294967296) 4294967296) ~var_1_6~0)) [2023-12-16 03:33:44,852 INFO L899 garLoopResultBuilder]: For program point L79(line 79) no Hoare annotation was computed. [2023-12-16 03:33:44,852 INFO L899 garLoopResultBuilder]: For program point L46(lines 46 54) no Hoare annotation was computed. [2023-12-16 03:33:44,852 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-16 03:33:44,852 INFO L902 garLoopResultBuilder]: At program point L96(line 96) the Hoare annotation is: true [2023-12-16 03:33:44,852 INFO L902 garLoopResultBuilder]: At program point L96-1(line 96) the Hoare annotation is: true [2023-12-16 03:33:44,852 INFO L899 garLoopResultBuilder]: For program point L63-1(lines 63 67) no Hoare annotation was computed. [2023-12-16 03:33:44,852 INFO L899 garLoopResultBuilder]: For program point L88(line 88) no Hoare annotation was computed. [2023-12-16 03:33:44,852 INFO L899 garLoopResultBuilder]: For program point L47(lines 47 51) no Hoare annotation was computed. [2023-12-16 03:33:44,852 INFO L899 garLoopResultBuilder]: For program point L97(line 97) no Hoare annotation was computed. [2023-12-16 03:33:44,852 INFO L895 garLoopResultBuilder]: At program point L81(line 81) the Hoare annotation is: (= (+ ~var_1_8~0 (* (div ~var_1_6~0 4294967296) 4294967296)) (+ (* (div ~var_1_8~0 4294967296) 4294967296) ~var_1_6~0)) [2023-12-16 03:33:44,852 INFO L895 garLoopResultBuilder]: At program point L81-1(line 81) the Hoare annotation is: (= (+ ~var_1_8~0 (* (div ~var_1_6~0 4294967296) 4294967296)) (+ (* (div ~var_1_8~0 4294967296) 4294967296) ~var_1_6~0)) [2023-12-16 03:33:44,852 INFO L902 garLoopResultBuilder]: At program point L90(line 90) the Hoare annotation is: true [2023-12-16 03:33:44,852 INFO L902 garLoopResultBuilder]: At program point L90-1(line 90) the Hoare annotation is: true [2023-12-16 03:33:44,852 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-12-16 03:33:44,852 INFO L899 garLoopResultBuilder]: For program point L82(line 82) no Hoare annotation was computed. [2023-12-16 03:33:44,852 INFO L902 garLoopResultBuilder]: At program point L99(line 99) the Hoare annotation is: true [2023-12-16 03:33:44,852 INFO L902 garLoopResultBuilder]: At program point L99-1(line 99) the Hoare annotation is: true [2023-12-16 03:33:44,852 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-16 03:33:44,853 INFO L899 garLoopResultBuilder]: For program point L91(line 91) no Hoare annotation was computed. [2023-12-16 03:33:44,853 INFO L899 garLoopResultBuilder]: For program point L58(lines 42 72) no Hoare annotation was computed. [2023-12-16 03:33:44,853 INFO L895 garLoopResultBuilder]: At program point L75(line 75) the Hoare annotation is: (= (+ ~var_1_8~0 (* (div ~var_1_6~0 4294967296) 4294967296)) (+ (* (div ~var_1_8~0 4294967296) 4294967296) ~var_1_6~0)) [2023-12-16 03:33:44,853 INFO L895 garLoopResultBuilder]: At program point L75-1(line 75) the Hoare annotation is: (= (+ ~var_1_8~0 (* (div ~var_1_6~0 4294967296) 4294967296)) (+ (* (div ~var_1_8~0 4294967296) 4294967296) ~var_1_6~0)) [2023-12-16 03:33:44,853 INFO L899 garLoopResultBuilder]: For program point L42(lines 42 72) no Hoare annotation was computed. [2023-12-16 03:33:44,853 INFO L899 garLoopResultBuilder]: For program point L100(line 100) no Hoare annotation was computed. [2023-12-16 03:33:44,853 INFO L899 garLoopResultBuilder]: For program point L59(lines 59 61) no Hoare annotation was computed. [2023-12-16 03:33:44,853 INFO L895 garLoopResultBuilder]: At program point L84(line 84) the Hoare annotation is: (= (+ ~var_1_8~0 (* (div ~var_1_6~0 4294967296) 4294967296)) (+ (* (div ~var_1_8~0 4294967296) 4294967296) ~var_1_6~0)) [2023-12-16 03:33:44,853 INFO L895 garLoopResultBuilder]: At program point L84-1(line 84) the Hoare annotation is: (= (+ ~var_1_8~0 (* (div ~var_1_6~0 4294967296) 4294967296)) (+ (* (div ~var_1_8~0 4294967296) 4294967296) ~var_1_6~0)) [2023-12-16 03:33:44,853 INFO L895 garLoopResultBuilder]: At program point L117-2(lines 117 123) the Hoare annotation is: (= (+ ~var_1_8~0 (* (div ~var_1_6~0 4294967296) 4294967296)) (+ (* (div ~var_1_8~0 4294967296) 4294967296) ~var_1_6~0)) [2023-12-16 03:33:44,853 INFO L899 garLoopResultBuilder]: For program point L117-3(lines 117 123) no Hoare annotation was computed. [2023-12-16 03:33:44,853 INFO L899 garLoopResultBuilder]: For program point L76(line 76) no Hoare annotation was computed. [2023-12-16 03:33:44,853 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 20) the Hoare annotation is: true [2023-12-16 03:33:44,853 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-12-16 03:33:44,853 INFO L899 garLoopResultBuilder]: For program point L20-2(line 20) no Hoare annotation was computed. [2023-12-16 03:33:44,853 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(line 20) no Hoare annotation was computed. [2023-12-16 03:33:44,855 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 03:33:44,865 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 03:33:44,885 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 03:33:44 BoogieIcfgContainer [2023-12-16 03:33:44,885 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 03:33:44,886 INFO L158 Benchmark]: Toolchain (without parser) took 28024.52ms. Allocated memory was 398.5MB in the beginning and 833.6MB in the end (delta: 435.2MB). Free memory was 352.2MB in the beginning and 343.4MB in the end (delta: 8.9MB). Peak memory consumption was 491.3MB. Max. memory is 8.0GB. [2023-12-16 03:33:44,886 INFO L158 Benchmark]: CDTParser took 0.99ms. Allocated memory is still 245.4MB. Free memory was 194.4MB in the beginning and 194.2MB in the end (delta: 172.0kB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 03:33:44,886 INFO L158 Benchmark]: CACSL2BoogieTranslator took 199.21ms. Allocated memory is still 398.5MB. Free memory was 352.2MB in the beginning and 339.3MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-16 03:33:44,886 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.95ms. Allocated memory is still 398.5MB. Free memory was 339.3MB in the beginning and 337.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-16 03:33:44,886 INFO L158 Benchmark]: Boogie Preprocessor took 31.29ms. Allocated memory is still 398.5MB. Free memory was 337.2MB in the beginning and 334.4MB in the end (delta: 2.8MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-16 03:33:44,887 INFO L158 Benchmark]: RCFGBuilder took 484.12ms. Allocated memory is still 398.5MB. Free memory was 334.4MB in the beginning and 315.9MB in the end (delta: 18.5MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2023-12-16 03:33:44,900 INFO L158 Benchmark]: TraceAbstraction took 27265.90ms. Allocated memory was 398.5MB in the beginning and 833.6MB in the end (delta: 435.2MB). Free memory was 315.2MB in the beginning and 343.4MB in the end (delta: -28.2MB). Peak memory consumption was 454.6MB. Max. memory is 8.0GB. [2023-12-16 03:33:44,901 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.99ms. Allocated memory is still 245.4MB. Free memory was 194.4MB in the beginning and 194.2MB in the end (delta: 172.0kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 199.21ms. Allocated memory is still 398.5MB. Free memory was 352.2MB in the beginning and 339.3MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 37.95ms. Allocated memory is still 398.5MB. Free memory was 339.3MB in the beginning and 337.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 31.29ms. Allocated memory is still 398.5MB. Free memory was 337.2MB in the beginning and 334.4MB in the end (delta: 2.8MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 484.12ms. Allocated memory is still 398.5MB. Free memory was 334.4MB in the beginning and 315.9MB in the end (delta: 18.5MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * TraceAbstraction took 27265.90ms. Allocated memory was 398.5MB in the beginning and 833.6MB in the end (delta: 435.2MB). Free memory was 315.2MB in the beginning and 343.4MB in the end (delta: -28.2MB). Peak memory consumption was 454.6MB. 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, 51 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 27.2s, OverallIterations: 10, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 6.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 964 SdHoareTripleChecker+Valid, 3.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 964 mSDsluCounter, 2683 SdHoareTripleChecker+Invalid, 3.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1748 mSDsCounter, 147 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1719 IncrementalHoareTripleChecker+Invalid, 1866 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 147 mSolverCounterUnsat, 935 mSDtfsCounter, 1719 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 562 GetRequests, 459 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 6.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=106occurred in iteration=4, InterpolantAutomatonStates: 108, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 313 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 22 LocationsWithAnnotation, 79 PreInvPairs, 122 NumberOfFragments, 176 HoareAnnotationTreeSize, 79 FormulaSimplifications, 21337882 FormulaSimplificationTreeSizeReduction, 1.0s HoareSimplificationTime, 22 FormulaSimplificationsInter, 39099 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 18.6s InterpolantComputationTime, 1205 NumberOfCodeBlocks, 1205 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1195 ConstructedInterpolants, 0 QuantifiedInterpolants, 9268 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 7600/7600 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: 117]: Loop Invariant Derived loop invariant: ((var_1_8 + ((var_1_6 / 4294967296) * 4294967296)) == (((var_1_8 / 4294967296) * 4294967296) + var_1_6)) RESULT: Ultimate proved your program to be correct! [2023-12-16 03:33:44,950 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...