/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 true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-3.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-15 20:42:07,878 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-15 20:42:07,951 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-15 20:42:07,955 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-15 20:42:07,956 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-15 20:42:07,978 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-15 20:42:07,978 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-15 20:42:07,978 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-15 20:42:07,979 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-15 20:42:07,982 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-15 20:42:07,982 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-15 20:42:07,983 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-15 20:42:07,983 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-15 20:42:07,984 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-15 20:42:07,984 INFO L153 SettingsManager]: * Use SBE=true [2023-12-15 20:42:07,984 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-15 20:42:07,984 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-15 20:42:07,985 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-15 20:42:07,985 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-15 20:42:07,986 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-15 20:42:07,986 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-15 20:42:07,986 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-15 20:42:07,986 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-15 20:42:07,986 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-15 20:42:07,987 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-15 20:42:07,987 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-15 20:42:07,987 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-15 20:42:07,987 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-15 20:42:07,987 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-15 20:42:07,988 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-15 20:42:07,988 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-15 20:42:07,988 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-15 20:42:07,989 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 20:42:07,989 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-15 20:42:07,989 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-15 20:42:07,989 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-15 20:42:07,989 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-15 20:42:07,989 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-15 20:42:07,989 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-15 20:42:07,989 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-15 20:42:07,989 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-15 20:42:07,990 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-15 20:42:07,990 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-15 20:42:07,990 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 -> true [2023-12-15 20:42:08,162 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-15 20:42:08,177 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-15 20:42:08,179 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-15 20:42:08,181 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-15 20:42:08,181 INFO L274 PluginConnector]: CDTParser initialized [2023-12-15 20:42:08,182 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-3.i [2023-12-15 20:42:09,317 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-15 20:42:09,474 INFO L384 CDTParser]: Found 1 translation units. [2023-12-15 20:42:09,474 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-3.i [2023-12-15 20:42:09,486 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/475c95580/7fb45b39a4ac42aa966556e05bed663b/FLAGae198d71e [2023-12-15 20:42:09,497 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/475c95580/7fb45b39a4ac42aa966556e05bed663b [2023-12-15 20:42:09,499 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-15 20:42:09,500 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-15 20:42:09,501 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-15 20:42:09,501 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-15 20:42:09,515 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-15 20:42:09,516 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 08:42:09" (1/1) ... [2023-12-15 20:42:09,516 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10bb8d4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:42:09, skipping insertion in model container [2023-12-15 20:42:09,516 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 08:42:09" (1/1) ... [2023-12-15 20:42:09,539 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-15 20:42:09,634 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_no-floats_file-3.i[915,928] [2023-12-15 20:42:09,673 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 20:42:09,687 INFO L202 MainTranslator]: Completed pre-run [2023-12-15 20:42:09,695 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_no-floats_file-3.i[915,928] [2023-12-15 20:42:09,715 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 20:42:09,740 INFO L206 MainTranslator]: Completed translation [2023-12-15 20:42:09,740 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:42:09 WrapperNode [2023-12-15 20:42:09,740 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-15 20:42:09,741 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-15 20:42:09,741 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-15 20:42:09,741 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-15 20:42:09,746 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:42:09" (1/1) ... [2023-12-15 20:42:09,765 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:42:09" (1/1) ... [2023-12-15 20:42:09,791 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 124 [2023-12-15 20:42:09,792 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-15 20:42:09,792 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-15 20:42:09,792 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-15 20:42:09,792 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-15 20:42:09,809 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:42:09" (1/1) ... [2023-12-15 20:42:09,809 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:42:09" (1/1) ... [2023-12-15 20:42:09,820 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:42:09" (1/1) ... [2023-12-15 20:42:09,830 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-15 20:42:09,830 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:42:09" (1/1) ... [2023-12-15 20:42:09,830 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:42:09" (1/1) ... [2023-12-15 20:42:09,834 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:42:09" (1/1) ... [2023-12-15 20:42:09,845 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:42:09" (1/1) ... [2023-12-15 20:42:09,846 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:42:09" (1/1) ... [2023-12-15 20:42:09,847 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:42:09" (1/1) ... [2023-12-15 20:42:09,848 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-15 20:42:09,849 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-15 20:42:09,849 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-15 20:42:09,849 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-15 20:42:09,850 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:42:09" (1/1) ... [2023-12-15 20:42:09,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 20:42:09,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 20:42:09,879 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-15 20:42:09,887 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-15 20:42:09,902 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-15 20:42:09,903 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-15 20:42:09,903 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-15 20:42:09,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-15 20:42:09,903 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-15 20:42:09,904 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-15 20:42:09,971 INFO L241 CfgBuilder]: Building ICFG [2023-12-15 20:42:09,972 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-15 20:42:10,150 INFO L282 CfgBuilder]: Performing block encoding [2023-12-15 20:42:10,173 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-15 20:42:10,174 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-15 20:42:10,174 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 08:42:10 BoogieIcfgContainer [2023-12-15 20:42:10,174 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-15 20:42:10,176 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-15 20:42:10,176 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-15 20:42:10,178 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-15 20:42:10,178 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.12 08:42:09" (1/3) ... [2023-12-15 20:42:10,178 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44d0c7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 08:42:10, skipping insertion in model container [2023-12-15 20:42:10,178 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:42:09" (2/3) ... [2023-12-15 20:42:10,179 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44d0c7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 08:42:10, skipping insertion in model container [2023-12-15 20:42:10,179 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 08:42:10" (3/3) ... [2023-12-15 20:42:10,180 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-3.i [2023-12-15 20:42:10,191 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-15 20:42:10,191 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-15 20:42:10,233 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-15 20:42:10,238 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;@683c5130, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-15 20:42:10,239 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-15 20:42:10,241 INFO L276 IsEmpty]: Start isEmpty. Operand has 50 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 28 states have internal predecessors, (38), 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-15 20:42:10,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-12-15 20:42:10,250 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:42:10,251 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-15 20:42:10,251 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:42:10,255 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:42:10,255 INFO L85 PathProgramCache]: Analyzing trace with hash 1621476614, now seen corresponding path program 1 times [2023-12-15 20:42:10,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:42:10,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418687912] [2023-12-15 20:42:10,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:42:10,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:42:10,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:10,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:42:10,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:10,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:42:10,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:10,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:42:10,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:10,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:42:10,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:10,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:42:10,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:10,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 20:42:10,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:10,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 20:42:10,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:10,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-15 20:42:10,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:10,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 20:42:10,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:10,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-15 20:42:10,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:10,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-15 20:42:10,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:10,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 20:42:10,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:10,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 20:42:10,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:10,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-15 20:42:10,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:10,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-15 20:42:10,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:10,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-15 20:42:10,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:10,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-15 20:42:10,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:10,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-15 20:42:10,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:10,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-15 20:42:10,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:10,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-12-15 20:42:10,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:10,592 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-15 20:42:10,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:42:10,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418687912] [2023-12-15 20:42:10,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418687912] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:42:10,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:42:10,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-15 20:42:10,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956964301] [2023-12-15 20:42:10,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:42:10,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-15 20:42:10,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:42:10,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-15 20:42:10,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-15 20:42:10,622 INFO L87 Difference]: Start difference. First operand has 50 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 28 states have internal predecessors, (38), 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-15 20:42:10,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:42:10,648 INFO L93 Difference]: Finished difference Result 97 states and 174 transitions. [2023-12-15 20:42:10,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-15 20:42:10,650 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-15 20:42:10,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:42:10,655 INFO L225 Difference]: With dead ends: 97 [2023-12-15 20:42:10,655 INFO L226 Difference]: Without dead ends: 48 [2023-12-15 20:42:10,657 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-15 20:42:10,660 INFO L413 NwaCegarLoop]: 70 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, 70 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-15 20:42:10,660 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 70 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 20:42:10,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2023-12-15 20:42:10,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2023-12-15 20:42:10,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 states have internal predecessors, (33), 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-15 20:42:10,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 73 transitions. [2023-12-15 20:42:10,696 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 73 transitions. Word has length 120 [2023-12-15 20:42:10,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:42:10,697 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 73 transitions. [2023-12-15 20:42:10,697 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-15 20:42:10,697 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 73 transitions. [2023-12-15 20:42:10,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-12-15 20:42:10,701 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:42:10,701 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-15 20:42:10,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-15 20:42:10,702 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:42:10,702 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:42:10,703 INFO L85 PathProgramCache]: Analyzing trace with hash -732484346, now seen corresponding path program 1 times [2023-12-15 20:42:10,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:42:10,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4524496] [2023-12-15 20:42:10,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:42:10,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:42:10,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:10,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:42:10,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:11,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:42:11,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:11,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:42:11,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:11,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:42:11,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:11,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:42:11,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:11,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 20:42:11,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:11,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 20:42:11,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:11,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-15 20:42:11,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:11,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 20:42:11,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:11,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-15 20:42:11,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:11,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-15 20:42:11,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:11,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 20:42:11,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:11,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 20:42:11,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:11,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-15 20:42:11,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:11,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-15 20:42:11,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:11,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-15 20:42:11,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:11,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-15 20:42:11,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:11,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-15 20:42:11,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:11,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-15 20:42:11,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:11,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-12-15 20:42:11,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:11,112 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-15 20:42:11,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:42:11,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4524496] [2023-12-15 20:42:11,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4524496] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:42:11,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:42:11,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 20:42:11,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011222871] [2023-12-15 20:42:11,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:42:11,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 20:42:11,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:42:11,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 20:42:11,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 20:42:11,121 INFO L87 Difference]: Start difference. First operand 48 states and 73 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (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-15 20:42:11,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:42:11,174 INFO L93 Difference]: Finished difference Result 142 states and 217 transitions. [2023-12-15 20:42:11,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 20:42:11,190 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (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-15 20:42:11,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:42:11,193 INFO L225 Difference]: With dead ends: 142 [2023-12-15 20:42:11,193 INFO L226 Difference]: Without dead ends: 95 [2023-12-15 20:42:11,194 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 20:42:11,195 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 35 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 20:42:11,195 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 135 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 20:42:11,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2023-12-15 20:42:11,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 92. [2023-12-15 20:42:11,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 49 states have (on average 1.2448979591836735) internal successors, (61), 49 states have internal predecessors, (61), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2023-12-15 20:42:11,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 141 transitions. [2023-12-15 20:42:11,269 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 141 transitions. Word has length 120 [2023-12-15 20:42:11,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:42:11,269 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 141 transitions. [2023-12-15 20:42:11,269 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (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-15 20:42:11,269 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 141 transitions. [2023-12-15 20:42:11,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-12-15 20:42:11,272 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:42:11,272 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-15 20:42:11,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-15 20:42:11,272 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:42:11,273 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:42:11,273 INFO L85 PathProgramCache]: Analyzing trace with hash -730637304, now seen corresponding path program 1 times [2023-12-15 20:42:11,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:42:11,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756881346] [2023-12-15 20:42:11,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:42:11,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:42:11,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:11,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:42:11,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:11,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:42:11,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:11,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:42:11,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:11,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:42:11,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:11,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:42:11,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:11,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 20:42:11,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:11,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 20:42:11,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:11,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-15 20:42:11,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:11,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 20:42:11,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:11,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-15 20:42:11,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:11,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-15 20:42:11,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:11,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 20:42:11,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:11,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 20:42:11,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:11,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-15 20:42:11,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:11,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-15 20:42:11,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:11,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-15 20:42:11,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:11,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-15 20:42:11,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:11,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-15 20:42:11,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:11,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-15 20:42:11,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:11,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-12-15 20:42:11,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:11,642 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 3 proven. 54 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2023-12-15 20:42:11,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:42:11,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756881346] [2023-12-15 20:42:11,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756881346] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 20:42:11,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1029829605] [2023-12-15 20:42:11,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:42:11,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 20:42:11,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 20:42:11,646 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 20:42:11,692 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-15 20:42:11,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:11,750 INFO L262 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-15 20:42:11,760 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 20:42:11,998 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 93 proven. 54 refuted. 0 times theorem prover too weak. 613 trivial. 0 not checked. [2023-12-15 20:42:11,998 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 20:42:12,162 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 3 proven. 54 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2023-12-15 20:42:12,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1029829605] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-15 20:42:12,163 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-15 20:42:12,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2023-12-15 20:42:12,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860156172] [2023-12-15 20:42:12,163 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-15 20:42:12,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-15 20:42:12,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:42:12,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-15 20:42:12,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-15 20:42:12,165 INFO L87 Difference]: Start difference. First operand 92 states and 141 transitions. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (38), 2 states have call predecessors, (38), 4 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39) [2023-12-15 20:42:12,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:42:12,340 INFO L93 Difference]: Finished difference Result 199 states and 295 transitions. [2023-12-15 20:42:12,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-15 20:42:12,340 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (38), 2 states have call predecessors, (38), 4 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39) Word has length 120 [2023-12-15 20:42:12,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:42:12,346 INFO L225 Difference]: With dead ends: 199 [2023-12-15 20:42:12,346 INFO L226 Difference]: Without dead ends: 108 [2023-12-15 20:42:12,350 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 275 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2023-12-15 20:42:12,352 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 17 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 20:42:12,352 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 96 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 20:42:12,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2023-12-15 20:42:12,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 100. [2023-12-15 20:42:12,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 55 states have (on average 1.1818181818181819) internal successors, (65), 55 states have internal predecessors, (65), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2023-12-15 20:42:12,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 145 transitions. [2023-12-15 20:42:12,375 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 145 transitions. Word has length 120 [2023-12-15 20:42:12,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:42:12,376 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 145 transitions. [2023-12-15 20:42:12,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (38), 2 states have call predecessors, (38), 4 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39) [2023-12-15 20:42:12,376 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 145 transitions. [2023-12-15 20:42:12,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-12-15 20:42:12,385 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:42:12,385 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-15 20:42:12,391 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-12-15 20:42:12,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 20:42:12,591 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:42:12,592 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:42:12,592 INFO L85 PathProgramCache]: Analyzing trace with hash -730577722, now seen corresponding path program 1 times [2023-12-15 20:42:12,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:42:12,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136871905] [2023-12-15 20:42:12,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:42:12,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:42:12,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:15,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:42:15,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:15,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:42:15,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:15,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:42:15,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:15,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:42:15,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:15,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:42:15,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:15,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 20:42:15,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:15,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 20:42:15,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:15,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-15 20:42:15,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:15,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 20:42:15,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:15,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-15 20:42:15,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:15,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-15 20:42:15,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:15,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 20:42:15,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:15,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 20:42:15,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:15,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-15 20:42:15,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:15,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-15 20:42:15,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:15,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-15 20:42:15,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:15,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-15 20:42:15,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:15,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-15 20:42:15,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:15,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-15 20:42:15,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:15,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-12-15 20:42:15,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:15,829 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-15 20:42:15,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:42:15,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136871905] [2023-12-15 20:42:15,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136871905] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:42:15,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:42:15,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-15 20:42:15,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941049913] [2023-12-15 20:42:15,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:42:15,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-15 20:42:15,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:42:15,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-15 20:42:15,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-15 20:42:15,831 INFO L87 Difference]: Start difference. First operand 100 states and 145 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 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-15 20:42:15,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:42:15,979 INFO L93 Difference]: Finished difference Result 123 states and 171 transitions. [2023-12-15 20:42:15,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-15 20:42:15,980 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 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-15 20:42:15,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:42:15,981 INFO L225 Difference]: With dead ends: 123 [2023-12-15 20:42:15,981 INFO L226 Difference]: Without dead ends: 121 [2023-12-15 20:42:15,981 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2023-12-15 20:42:15,982 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 30 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 20:42:15,982 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 195 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 20:42:15,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2023-12-15 20:42:15,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 104. [2023-12-15 20:42:15,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 59 states have (on average 1.1694915254237288) internal successors, (69), 59 states have internal predecessors, (69), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2023-12-15 20:42:15,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 149 transitions. [2023-12-15 20:42:15,997 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 149 transitions. Word has length 120 [2023-12-15 20:42:15,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:42:15,997 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 149 transitions. [2023-12-15 20:42:15,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 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-15 20:42:15,997 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 149 transitions. [2023-12-15 20:42:15,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-12-15 20:42:15,998 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:42:15,998 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-15 20:42:15,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-15 20:42:15,999 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:42:15,999 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:42:15,999 INFO L85 PathProgramCache]: Analyzing trace with hash -7674365, now seen corresponding path program 1 times [2023-12-15 20:42:15,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:42:15,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173382466] [2023-12-15 20:42:15,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:42:15,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:42:16,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:16,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:42:16,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:16,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:42:16,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:16,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:42:16,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:16,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:42:16,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:16,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:42:16,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:16,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 20:42:16,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:16,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 20:42:16,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:16,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-15 20:42:16,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:16,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 20:42:16,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:16,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-15 20:42:16,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:16,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-15 20:42:16,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:16,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 20:42:16,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:16,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 20:42:16,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:16,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-15 20:42:16,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:16,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-15 20:42:16,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:16,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-15 20:42:16,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:16,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-15 20:42:16,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:16,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-15 20:42:16,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:16,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-15 20:42:16,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:16,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-12-15 20:42:16,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:16,823 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-15 20:42:16,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:42:16,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173382466] [2023-12-15 20:42:16,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173382466] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:42:16,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:42:16,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-15 20:42:16,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118152144] [2023-12-15 20:42:16,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:42:16,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-15 20:42:16,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:42:16,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-15 20:42:16,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-12-15 20:42:16,825 INFO L87 Difference]: Start difference. First operand 104 states and 149 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 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-15 20:42:16,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:42:16,967 INFO L93 Difference]: Finished difference Result 133 states and 181 transitions. [2023-12-15 20:42:16,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-15 20:42:16,968 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 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-15 20:42:16,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:42:16,969 INFO L225 Difference]: With dead ends: 133 [2023-12-15 20:42:16,969 INFO L226 Difference]: Without dead ends: 131 [2023-12-15 20:42:16,969 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2023-12-15 20:42:16,970 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 36 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 20:42:16,970 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 319 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 20:42:16,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2023-12-15 20:42:16,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 105. [2023-12-15 20:42:16,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 60 states have (on average 1.1833333333333333) internal successors, (71), 60 states have internal predecessors, (71), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2023-12-15 20:42:16,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 151 transitions. [2023-12-15 20:42:16,982 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 151 transitions. Word has length 121 [2023-12-15 20:42:16,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:42:16,983 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 151 transitions. [2023-12-15 20:42:16,983 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 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-15 20:42:16,983 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 151 transitions. [2023-12-15 20:42:16,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-12-15 20:42:16,984 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:42:16,984 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-15 20:42:16,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-15 20:42:16,984 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:42:16,984 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:42:16,984 INFO L85 PathProgramCache]: Analyzing trace with hash -5827323, now seen corresponding path program 1 times [2023-12-15 20:42:16,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:42:16,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245153505] [2023-12-15 20:42:16,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:42:16,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:42:17,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:18,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:42:18,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:18,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:42:18,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:18,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:42:18,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:18,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:42:18,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:18,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:42:18,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:18,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 20:42:18,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:18,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 20:42:18,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:18,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-15 20:42:18,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:18,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 20:42:18,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:18,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-15 20:42:18,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:18,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-15 20:42:18,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:18,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 20:42:18,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:18,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 20:42:18,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:18,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-15 20:42:18,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:18,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-15 20:42:18,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:18,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-15 20:42:18,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:18,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-15 20:42:18,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:18,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-15 20:42:18,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:18,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-15 20:42:18,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:18,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-12-15 20:42:18,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:18,306 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-15 20:42:18,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:42:18,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245153505] [2023-12-15 20:42:18,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245153505] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:42:18,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:42:18,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-15 20:42:18,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930533882] [2023-12-15 20:42:18,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:42:18,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-15 20:42:18,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:42:18,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-15 20:42:18,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-12-15 20:42:18,308 INFO L87 Difference]: Start difference. First operand 105 states and 151 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 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-15 20:42:18,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:42:18,457 INFO L93 Difference]: Finished difference Result 131 states and 179 transitions. [2023-12-15 20:42:18,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-15 20:42:18,457 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 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-15 20:42:18,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:42:18,458 INFO L225 Difference]: With dead ends: 131 [2023-12-15 20:42:18,458 INFO L226 Difference]: Without dead ends: 129 [2023-12-15 20:42:18,458 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2023-12-15 20:42:18,459 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 31 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 20:42:18,459 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 303 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 20:42:18,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2023-12-15 20:42:18,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 104. [2023-12-15 20:42:18,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 59 states have (on average 1.1694915254237288) internal successors, (69), 59 states have internal predecessors, (69), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2023-12-15 20:42:18,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 149 transitions. [2023-12-15 20:42:18,470 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 149 transitions. Word has length 121 [2023-12-15 20:42:18,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:42:18,471 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 149 transitions. [2023-12-15 20:42:18,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 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-15 20:42:18,471 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 149 transitions. [2023-12-15 20:42:18,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-12-15 20:42:18,472 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:42:18,472 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-15 20:42:18,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-15 20:42:18,472 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:42:18,472 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:42:18,472 INFO L85 PathProgramCache]: Analyzing trace with hash 49583937, now seen corresponding path program 1 times [2023-12-15 20:42:18,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:42:18,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376286424] [2023-12-15 20:42:18,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:42:18,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:42:18,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:19,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:42:19,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:19,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:42:19,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:19,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:42:19,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:19,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:42:19,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:19,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:42:19,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:19,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 20:42:19,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:19,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 20:42:19,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:19,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-15 20:42:19,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:19,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 20:42:19,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:19,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-15 20:42:19,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:19,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-15 20:42:19,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:19,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 20:42:19,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:19,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 20:42:19,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:19,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-15 20:42:19,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:19,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-15 20:42:19,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:19,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-15 20:42:19,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:19,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-15 20:42:19,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:19,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-15 20:42:19,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:19,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-15 20:42:19,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:19,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-12-15 20:42:19,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:19,070 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-15 20:42:19,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:42:19,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376286424] [2023-12-15 20:42:19,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376286424] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:42:19,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:42:19,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-15 20:42:19,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461094624] [2023-12-15 20:42:19,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:42:19,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-15 20:42:19,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:42:19,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-15 20:42:19,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-12-15 20:42:19,072 INFO L87 Difference]: Start difference. First operand 104 states and 149 transitions. Second operand has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 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-15 20:42:19,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:42:19,282 INFO L93 Difference]: Finished difference Result 130 states and 178 transitions. [2023-12-15 20:42:19,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-15 20:42:19,283 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 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-15 20:42:19,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:42:19,284 INFO L225 Difference]: With dead ends: 130 [2023-12-15 20:42:19,284 INFO L226 Difference]: Without dead ends: 128 [2023-12-15 20:42:19,284 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2023-12-15 20:42:19,285 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 42 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 20:42:19,285 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 363 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 20:42:19,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2023-12-15 20:42:19,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 104. [2023-12-15 20:42:19,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 59 states have (on average 1.1694915254237288) internal successors, (69), 59 states have internal predecessors, (69), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2023-12-15 20:42:19,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 149 transitions. [2023-12-15 20:42:19,298 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 149 transitions. Word has length 121 [2023-12-15 20:42:19,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:42:19,298 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 149 transitions. [2023-12-15 20:42:19,298 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 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-15 20:42:19,298 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 149 transitions. [2023-12-15 20:42:19,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-12-15 20:42:19,299 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:42:19,299 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-15 20:42:19,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-15 20:42:19,300 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:42:19,300 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:42:19,300 INFO L85 PathProgramCache]: Analyzing trace with hash 51430979, now seen corresponding path program 1 times [2023-12-15 20:42:19,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:42:19,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228196301] [2023-12-15 20:42:19,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:42:19,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:42:19,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:21,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:42:21,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:21,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:42:21,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:21,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:42:21,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:21,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:42:21,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:21,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:42:21,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:21,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 20:42:21,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:21,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 20:42:21,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:21,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-15 20:42:21,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:21,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 20:42:21,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:21,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-15 20:42:21,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:21,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-15 20:42:21,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:21,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 20:42:21,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:21,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 20:42:21,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:21,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-15 20:42:21,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:21,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-15 20:42:21,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:21,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-15 20:42:21,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:21,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-15 20:42:21,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:21,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-15 20:42:21,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:21,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-15 20:42:21,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:21,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-12-15 20:42:21,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:21,477 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-15 20:42:21,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:42:21,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228196301] [2023-12-15 20:42:21,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228196301] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:42:21,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:42:21,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-15 20:42:21,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099933847] [2023-12-15 20:42:21,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:42:21,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-15 20:42:21,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:42:21,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-15 20:42:21,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-12-15 20:42:21,479 INFO L87 Difference]: Start difference. First operand 104 states and 149 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-15 20:42:21,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:42:21,824 INFO L93 Difference]: Finished difference Result 136 states and 187 transitions. [2023-12-15 20:42:21,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-15 20:42:21,824 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-15 20:42:21,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:42:21,825 INFO L225 Difference]: With dead ends: 136 [2023-12-15 20:42:21,825 INFO L226 Difference]: Without dead ends: 134 [2023-12-15 20:42:21,825 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2023-12-15 20:42:21,826 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 19 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-15 20:42:21,826 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 419 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-15 20:42:21,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2023-12-15 20:42:21,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 109. [2023-12-15 20:42:21,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 64 states have (on average 1.203125) internal successors, (77), 64 states have internal predecessors, (77), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2023-12-15 20:42:21,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 157 transitions. [2023-12-15 20:42:21,835 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 157 transitions. Word has length 121 [2023-12-15 20:42:21,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:42:21,835 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 157 transitions. [2023-12-15 20:42:21,836 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-15 20:42:21,836 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 157 transitions. [2023-12-15 20:42:21,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2023-12-15 20:42:21,836 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:42:21,836 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, 1] [2023-12-15 20:42:21,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-15 20:42:21,837 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:42:21,837 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:42:21,837 INFO L85 PathProgramCache]: Analyzing trace with hash -2022577265, now seen corresponding path program 1 times [2023-12-15 20:42:21,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:42:21,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289313992] [2023-12-15 20:42:21,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:42:21,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:42:21,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:21,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:42:21,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:21,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:42:21,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:21,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:42:21,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:21,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:42:21,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:21,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:42:21,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:21,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 20:42:21,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:21,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 20:42:21,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:21,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-15 20:42:21,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:21,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 20:42:21,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:21,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-15 20:42:21,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:21,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-15 20:42:21,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:21,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 20:42:21,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:21,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 20:42:21,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:21,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-15 20:42:21,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:21,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-15 20:42:21,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:21,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-15 20:42:21,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:21,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-15 20:42:21,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:21,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-15 20:42:21,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:21,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-15 20:42:21,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:21,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-12-15 20:42:21,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:21,935 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-15 20:42:21,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:42:21,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289313992] [2023-12-15 20:42:21,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289313992] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:42:21,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:42:21,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-15 20:42:21,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493173376] [2023-12-15 20:42:21,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:42:21,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-15 20:42:21,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:42:21,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-15 20:42:21,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-15 20:42:21,937 INFO L87 Difference]: Start difference. First operand 109 states and 157 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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-15 20:42:22,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:42:22,003 INFO L93 Difference]: Finished difference Result 221 states and 317 transitions. [2023-12-15 20:42:22,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-15 20:42:22,003 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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 122 [2023-12-15 20:42:22,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:42:22,006 INFO L225 Difference]: With dead ends: 221 [2023-12-15 20:42:22,006 INFO L226 Difference]: Without dead ends: 113 [2023-12-15 20:42:22,007 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-15 20:42:22,008 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 43 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 20:42:22,009 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 195 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 20:42:22,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2023-12-15 20:42:22,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 106. [2023-12-15 20:42:22,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 61 states have (on average 1.1639344262295082) internal successors, (71), 61 states have internal predecessors, (71), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2023-12-15 20:42:22,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 151 transitions. [2023-12-15 20:42:22,020 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 151 transitions. Word has length 122 [2023-12-15 20:42:22,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:42:22,020 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 151 transitions. [2023-12-15 20:42:22,020 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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-15 20:42:22,020 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 151 transitions. [2023-12-15 20:42:22,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2023-12-15 20:42:22,022 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:42:22,023 INFO L195 NwaCegarLoop]: trace histogram [40, 40, 40, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 20:42:22,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-15 20:42:22,023 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:42:22,023 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:42:22,023 INFO L85 PathProgramCache]: Analyzing trace with hash 1353636519, now seen corresponding path program 1 times [2023-12-15 20:42:22,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:42:22,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995680230] [2023-12-15 20:42:22,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:42:22,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:42:22,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:23,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:42:23,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:23,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:42:23,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:23,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:42:23,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:23,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:42:23,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:23,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:42:23,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:23,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 20:42:23,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:23,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 20:42:23,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:23,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-15 20:42:23,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:23,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 20:42:23,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:23,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-15 20:42:23,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:23,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-15 20:42:23,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:23,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 20:42:23,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:23,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 20:42:23,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:23,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-15 20:42:23,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:23,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-15 20:42:23,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:23,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-15 20:42:23,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:23,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-15 20:42:23,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:23,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-15 20:42:23,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:23,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-15 20:42:23,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:23,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-12-15 20:42:23,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:23,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-12-15 20:42:23,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:23,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2023-12-15 20:42:23,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:23,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2023-12-15 20:42:23,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:23,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2023-12-15 20:42:23,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:23,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2023-12-15 20:42:23,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:23,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2023-12-15 20:42:23,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:23,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2023-12-15 20:42:23,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:23,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2023-12-15 20:42:23,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:23,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2023-12-15 20:42:23,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:23,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2023-12-15 20:42:23,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:23,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2023-12-15 20:42:23,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:23,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2023-12-15 20:42:23,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:23,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2023-12-15 20:42:23,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:23,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2023-12-15 20:42:23,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:23,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2023-12-15 20:42:23,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:23,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2023-12-15 20:42:23,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:23,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2023-12-15 20:42:23,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:23,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2023-12-15 20:42:23,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:23,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 221 [2023-12-15 20:42:23,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:23,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 226 [2023-12-15 20:42:23,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:23,366 INFO L134 CoverageAnalysis]: Checked inductivity of 3159 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3153 trivial. 0 not checked. [2023-12-15 20:42:23,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:42:23,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995680230] [2023-12-15 20:42:23,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995680230] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:42:23,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:42:23,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-15 20:42:23,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161195479] [2023-12-15 20:42:23,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:42:23,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-15 20:42:23,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:42:23,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-15 20:42:23,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-12-15 20:42:23,367 INFO L87 Difference]: Start difference. First operand 106 states and 151 transitions. Second operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 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-15 20:42:23,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:42:23,570 INFO L93 Difference]: Finished difference Result 134 states and 183 transitions. [2023-12-15 20:42:23,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-15 20:42:23,570 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 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 242 [2023-12-15 20:42:23,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:42:23,571 INFO L225 Difference]: With dead ends: 134 [2023-12-15 20:42:23,571 INFO L226 Difference]: Without dead ends: 0 [2023-12-15 20:42:23,571 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2023-12-15 20:42:23,572 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 40 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 20:42:23,572 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 340 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 20:42:23,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-15 20:42:23,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-15 20:42:23,572 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-15 20:42:23,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-15 20:42:23,573 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 242 [2023-12-15 20:42:23,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:42:23,573 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-15 20:42:23,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 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-15 20:42:23,573 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-15 20:42:23,573 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-15 20:42:23,575 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-15 20:42:23,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-15 20:42:23,576 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-15 20:42:23,718 INFO L899 garLoopResultBuilder]: For program point L93(line 93) no Hoare annotation was computed. [2023-12-15 20:42:23,719 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-12-15 20:42:23,719 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2023-12-15 20:42:23,719 INFO L899 garLoopResultBuilder]: For program point L19-3(line 19) no Hoare annotation was computed. [2023-12-15 20:42:23,719 INFO L895 garLoopResultBuilder]: At program point L77(line 77) the Hoare annotation is: (= (* 256 (div ~var_1_4~0 256)) ~var_1_4~0) [2023-12-15 20:42:23,719 INFO L895 garLoopResultBuilder]: At program point L77-1(line 77) the Hoare annotation is: (= (* 256 (div ~var_1_4~0 256)) ~var_1_4~0) [2023-12-15 20:42:23,719 INFO L899 garLoopResultBuilder]: For program point L69(line 69) no Hoare annotation was computed. [2023-12-15 20:42:23,719 INFO L895 garLoopResultBuilder]: At program point L86(line 86) the Hoare annotation is: (= (* 256 (div ~var_1_4~0 256)) ~var_1_4~0) [2023-12-15 20:42:23,719 INFO L895 garLoopResultBuilder]: At program point L86-1(line 86) the Hoare annotation is: (= (* 256 (div ~var_1_4~0 256)) ~var_1_4~0) [2023-12-15 20:42:23,719 INFO L899 garLoopResultBuilder]: For program point L78(line 78) no Hoare annotation was computed. [2023-12-15 20:42:23,719 INFO L895 garLoopResultBuilder]: At program point L95(line 95) the Hoare annotation is: (= (* 256 (div ~var_1_4~0 256)) ~var_1_4~0) [2023-12-15 20:42:23,719 INFO L895 garLoopResultBuilder]: At program point L95-1(line 95) the Hoare annotation is: (= (* 256 (div ~var_1_4~0 256)) ~var_1_4~0) [2023-12-15 20:42:23,719 INFO L899 garLoopResultBuilder]: For program point L87(line 87) no Hoare annotation was computed. [2023-12-15 20:42:23,719 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-15 20:42:23,720 INFO L895 garLoopResultBuilder]: At program point L71(line 71) the Hoare annotation is: (= (* 256 (div ~var_1_4~0 256)) ~var_1_4~0) [2023-12-15 20:42:23,720 INFO L895 garLoopResultBuilder]: At program point L71-1(line 71) the Hoare annotation is: (= (* 256 (div ~var_1_4~0 256)) ~var_1_4~0) [2023-12-15 20:42:23,720 INFO L899 garLoopResultBuilder]: For program point L96(lines 66 97) no Hoare annotation was computed. [2023-12-15 20:42:23,720 INFO L899 garLoopResultBuilder]: For program point L55-1(lines 39 65) no Hoare annotation was computed. [2023-12-15 20:42:23,720 INFO L895 garLoopResultBuilder]: At program point L80(line 80) the Hoare annotation is: (= (* 256 (div ~var_1_4~0 256)) ~var_1_4~0) [2023-12-15 20:42:23,720 INFO L895 garLoopResultBuilder]: At program point L80-1(line 80) the Hoare annotation is: (= (* 256 (div ~var_1_4~0 256)) ~var_1_4~0) [2023-12-15 20:42:23,720 INFO L899 garLoopResultBuilder]: For program point L72(line 72) no Hoare annotation was computed. [2023-12-15 20:42:23,720 INFO L899 garLoopResultBuilder]: For program point L39(lines 39 65) no Hoare annotation was computed. [2023-12-15 20:42:23,720 INFO L895 garLoopResultBuilder]: At program point L89(line 89) the Hoare annotation is: (= (* 256 (div ~var_1_4~0 256)) ~var_1_4~0) [2023-12-15 20:42:23,720 INFO L895 garLoopResultBuilder]: At program point L89-1(line 89) the Hoare annotation is: (= (* 256 (div ~var_1_4~0 256)) ~var_1_4~0) [2023-12-15 20:42:23,720 INFO L899 garLoopResultBuilder]: For program point L81(line 81) no Hoare annotation was computed. [2023-12-15 20:42:23,720 INFO L899 garLoopResultBuilder]: For program point L48(lines 48 54) no Hoare annotation was computed. [2023-12-15 20:42:23,720 INFO L899 garLoopResultBuilder]: For program point L48-1(lines 39 65) no Hoare annotation was computed. [2023-12-15 20:42:23,720 INFO L899 garLoopResultBuilder]: For program point L90(line 90) no Hoare annotation was computed. [2023-12-15 20:42:23,720 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-12-15 20:42:23,720 INFO L899 garLoopResultBuilder]: For program point L49(lines 49 53) no Hoare annotation was computed. [2023-12-15 20:42:23,720 INFO L895 garLoopResultBuilder]: At program point L74(line 74) the Hoare annotation is: (= (* 256 (div ~var_1_4~0 256)) ~var_1_4~0) [2023-12-15 20:42:23,720 INFO L895 garLoopResultBuilder]: At program point L74-1(line 74) the Hoare annotation is: (= (* 256 (div ~var_1_4~0 256)) ~var_1_4~0) [2023-12-15 20:42:23,720 INFO L899 garLoopResultBuilder]: For program point L41(lines 41 45) no Hoare annotation was computed. [2023-12-15 20:42:23,721 INFO L899 garLoopResultBuilder]: For program point L41-1(lines 41 45) no Hoare annotation was computed. [2023-12-15 20:42:23,721 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-15 20:42:23,721 INFO L895 garLoopResultBuilder]: At program point L83(line 83) the Hoare annotation is: (= (* 256 (div ~var_1_4~0 256)) ~var_1_4~0) [2023-12-15 20:42:23,721 INFO L895 garLoopResultBuilder]: At program point L83-1(line 83) the Hoare annotation is: (= (* 256 (div ~var_1_4~0 256)) ~var_1_4~0) [2023-12-15 20:42:23,721 INFO L899 garLoopResultBuilder]: For program point L75(line 75) no Hoare annotation was computed. [2023-12-15 20:42:23,721 INFO L899 garLoopResultBuilder]: For program point L42(lines 42 44) no Hoare annotation was computed. [2023-12-15 20:42:23,721 INFO L895 garLoopResultBuilder]: At program point L108-2(lines 108 114) the Hoare annotation is: (= (* 256 (div ~var_1_4~0 256)) ~var_1_4~0) [2023-12-15 20:42:23,721 INFO L899 garLoopResultBuilder]: For program point L108-3(lines 108 114) no Hoare annotation was computed. [2023-12-15 20:42:23,721 INFO L895 garLoopResultBuilder]: At program point L92(line 92) the Hoare annotation is: (= (* 256 (div ~var_1_4~0 256)) ~var_1_4~0) [2023-12-15 20:42:23,721 INFO L895 garLoopResultBuilder]: At program point L92-1(line 92) the Hoare annotation is: (= (* 256 (div ~var_1_4~0 256)) ~var_1_4~0) [2023-12-15 20:42:23,721 INFO L899 garLoopResultBuilder]: For program point L84(line 84) no Hoare annotation was computed. [2023-12-15 20:42:23,721 INFO L902 garLoopResultBuilder]: At program point L68(line 68) the Hoare annotation is: true [2023-12-15 20:42:23,721 INFO L902 garLoopResultBuilder]: At program point L68-1(line 68) the Hoare annotation is: true [2023-12-15 20:42:23,721 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 20) the Hoare annotation is: true [2023-12-15 20:42:23,721 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-12-15 20:42:23,721 INFO L899 garLoopResultBuilder]: For program point L20-2(line 20) no Hoare annotation was computed. [2023-12-15 20:42:23,721 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(line 20) no Hoare annotation was computed. [2023-12-15 20:42:23,723 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 20:42:23,724 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-15 20:42:23,730 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.12 08:42:23 BoogieIcfgContainer [2023-12-15 20:42:23,731 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-15 20:42:23,731 INFO L158 Benchmark]: Toolchain (without parser) took 14231.17ms. Allocated memory was 328.2MB in the beginning and 878.7MB in the end (delta: 550.5MB). Free memory was 285.6MB in the beginning and 407.0MB in the end (delta: -121.4MB). Peak memory consumption was 429.7MB. Max. memory is 8.0GB. [2023-12-15 20:42:23,731 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 189.8MB. Free memory was 135.7MB in the beginning and 135.5MB in the end (delta: 164.4kB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-15 20:42:23,731 INFO L158 Benchmark]: CACSL2BoogieTranslator took 240.05ms. Allocated memory is still 328.2MB. Free memory was 285.6MB in the beginning and 272.5MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-15 20:42:23,731 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.62ms. Allocated memory is still 328.2MB. Free memory was 272.5MB in the beginning and 270.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-15 20:42:23,731 INFO L158 Benchmark]: Boogie Preprocessor took 56.36ms. Allocated memory is still 328.2MB. Free memory was 270.4MB in the beginning and 267.2MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-15 20:42:23,732 INFO L158 Benchmark]: RCFGBuilder took 324.95ms. Allocated memory is still 328.2MB. Free memory was 267.2MB in the beginning and 249.4MB in the end (delta: 17.8MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2023-12-15 20:42:23,732 INFO L158 Benchmark]: TraceAbstraction took 13554.93ms. Allocated memory was 328.2MB in the beginning and 878.7MB in the end (delta: 550.5MB). Free memory was 248.9MB in the beginning and 407.0MB in the end (delta: -158.1MB). Peak memory consumption was 393.0MB. Max. memory is 8.0GB. [2023-12-15 20:42:23,733 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.12ms. Allocated memory is still 189.8MB. Free memory was 135.7MB in the beginning and 135.5MB in the end (delta: 164.4kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 240.05ms. Allocated memory is still 328.2MB. Free memory was 285.6MB in the beginning and 272.5MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 50.62ms. Allocated memory is still 328.2MB. Free memory was 272.5MB in the beginning and 270.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 56.36ms. Allocated memory is still 328.2MB. Free memory was 270.4MB in the beginning and 267.2MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 324.95ms. Allocated memory is still 328.2MB. Free memory was 267.2MB in the beginning and 249.4MB in the end (delta: 17.8MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * TraceAbstraction took 13554.93ms. Allocated memory was 328.2MB in the beginning and 878.7MB in the end (delta: 550.5MB). Free memory was 248.9MB in the beginning and 407.0MB in the end (delta: -158.1MB). Peak memory consumption was 393.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - 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, 50 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 13.5s, OverallIterations: 10, TraceHistogramMax: 40, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 293 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 293 mSDsluCounter, 2435 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1729 mSDsCounter, 81 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 892 IncrementalHoareTripleChecker+Invalid, 973 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 81 mSolverCounterUnsat, 706 mSDtfsCounter, 892 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 799 GetRequests, 721 SyntacticMatches, 2 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=109occurred in iteration=8, InterpolantAutomatonStates: 89, 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, 135 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 22 LocationsWithAnnotation, 185 PreInvPairs, 233 NumberOfFragments, 136 HoareAnnotationTreeSize, 185 FormulaSimplifications, 92055 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 22 FormulaSimplificationsInter, 638 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 10.7s InterpolantComputationTime, 1448 NumberOfCodeBlocks, 1448 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1556 ConstructedInterpolants, 0 QuantifiedInterpolants, 4106 SizeOfPredicates, 3 NumberOfNonLiveVariables, 277 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 12 InterpolantComputations, 9 PerfectInterpolantSequences, 11357/11519 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: 108]: Loop Invariant Derived loop invariant: ((256 * (var_1_4 / 256)) == var_1_4) RESULT: Ultimate proved your program to be correct! [2023-12-15 20:42:23,745 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...