/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-55.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-15 20:43:22,453 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-15 20:43:22,535 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:43:22,541 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-15 20:43:22,541 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-15 20:43:22,569 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-15 20:43:22,569 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-15 20:43:22,570 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-15 20:43:22,570 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-15 20:43:22,574 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-15 20:43:22,574 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-15 20:43:22,574 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-15 20:43:22,575 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-15 20:43:22,576 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-15 20:43:22,576 INFO L153 SettingsManager]: * Use SBE=true [2023-12-15 20:43:22,576 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-15 20:43:22,577 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-15 20:43:22,577 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-15 20:43:22,577 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-15 20:43:22,578 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-15 20:43:22,578 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-15 20:43:22,579 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-15 20:43:22,579 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-15 20:43:22,579 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-15 20:43:22,579 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-15 20:43:22,580 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-15 20:43:22,580 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-15 20:43:22,580 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-15 20:43:22,581 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-15 20:43:22,581 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-15 20:43:22,582 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-15 20:43:22,582 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-15 20:43:22,582 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 20:43:22,582 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-15 20:43:22,582 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-15 20:43:22,583 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-15 20:43:22,583 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-15 20:43:22,583 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-15 20:43:22,583 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-15 20:43:22,583 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-15 20:43:22,583 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-15 20:43:22,584 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-15 20:43:22,584 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-15 20:43:22,584 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:43:22,786 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-15 20:43:22,806 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-15 20:43:22,808 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-15 20:43:22,809 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-15 20:43:22,809 INFO L274 PluginConnector]: CDTParser initialized [2023-12-15 20:43:22,810 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-55.i [2023-12-15 20:43:23,867 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-15 20:43:24,034 INFO L384 CDTParser]: Found 1 translation units. [2023-12-15 20:43:24,035 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-55.i [2023-12-15 20:43:24,042 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e7c1cb6f/71c389f0fcc14d258ead906068681805/FLAG10370d81b [2023-12-15 20:43:24,057 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e7c1cb6f/71c389f0fcc14d258ead906068681805 [2023-12-15 20:43:24,059 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-15 20:43:24,060 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-15 20:43:24,062 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-15 20:43:24,063 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-15 20:43:24,066 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-15 20:43:24,066 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 08:43:24" (1/1) ... [2023-12-15 20:43:24,067 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49bf1cb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:43:24, skipping insertion in model container [2023-12-15 20:43:24,067 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 08:43:24" (1/1) ... [2023-12-15 20:43:24,093 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-15 20:43:24,213 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-55.i[916,929] [2023-12-15 20:43:24,242 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 20:43:24,251 INFO L202 MainTranslator]: Completed pre-run [2023-12-15 20:43:24,268 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-55.i[916,929] [2023-12-15 20:43:24,283 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 20:43:24,297 INFO L206 MainTranslator]: Completed translation [2023-12-15 20:43:24,297 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:43:24 WrapperNode [2023-12-15 20:43:24,297 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-15 20:43:24,298 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-15 20:43:24,298 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-15 20:43:24,298 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-15 20:43:24,304 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:43:24" (1/1) ... [2023-12-15 20:43:24,310 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:43:24" (1/1) ... [2023-12-15 20:43:24,339 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 147 [2023-12-15 20:43:24,339 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-15 20:43:24,352 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-15 20:43:24,353 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-15 20:43:24,353 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-15 20:43:24,362 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:43:24" (1/1) ... [2023-12-15 20:43:24,362 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:43:24" (1/1) ... [2023-12-15 20:43:24,374 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:43:24" (1/1) ... [2023-12-15 20:43:24,387 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:43:24,387 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:43:24" (1/1) ... [2023-12-15 20:43:24,388 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:43:24" (1/1) ... [2023-12-15 20:43:24,404 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:43:24" (1/1) ... [2023-12-15 20:43:24,407 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:43:24" (1/1) ... [2023-12-15 20:43:24,408 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:43:24" (1/1) ... [2023-12-15 20:43:24,409 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:43:24" (1/1) ... [2023-12-15 20:43:24,411 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-15 20:43:24,412 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-15 20:43:24,412 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-15 20:43:24,412 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-15 20:43:24,413 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:43:24" (1/1) ... [2023-12-15 20:43:24,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 20:43:24,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 20:43:24,477 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:43:24,497 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:43:24,502 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-15 20:43:24,502 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-15 20:43:24,502 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-15 20:43:24,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-15 20:43:24,503 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-15 20:43:24,503 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-15 20:43:24,567 INFO L241 CfgBuilder]: Building ICFG [2023-12-15 20:43:24,568 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-15 20:43:24,827 INFO L282 CfgBuilder]: Performing block encoding [2023-12-15 20:43:24,859 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-15 20:43:24,860 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-15 20:43:24,860 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 08:43:24 BoogieIcfgContainer [2023-12-15 20:43:24,860 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-15 20:43:24,862 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-15 20:43:24,862 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-15 20:43:24,864 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-15 20:43:24,864 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.12 08:43:24" (1/3) ... [2023-12-15 20:43:24,865 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32cee123 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 08:43:24, skipping insertion in model container [2023-12-15 20:43:24,865 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:43:24" (2/3) ... [2023-12-15 20:43:24,865 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32cee123 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 08:43:24, skipping insertion in model container [2023-12-15 20:43:24,865 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 08:43:24" (3/3) ... [2023-12-15 20:43:24,866 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-55.i [2023-12-15 20:43:24,880 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-15 20:43:24,881 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-15 20:43:24,926 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-15 20:43:24,932 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;@78b0360e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-15 20:43:24,932 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-15 20:43:24,936 INFO L276 IsEmpty]: Start isEmpty. Operand has 56 states, 37 states have (on average 1.4864864864864864) internal successors, (55), 38 states have internal predecessors, (55), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-15 20:43:24,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2023-12-15 20:43:24,945 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:43:24,945 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:24,946 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:43:24,954 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:43:24,954 INFO L85 PathProgramCache]: Analyzing trace with hash -1069761762, now seen corresponding path program 1 times [2023-12-15 20:43:24,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:43:24,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575529376] [2023-12-15 20:43:24,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:43:24,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:43:25,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:25,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:43:25,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:25,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:43:25,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:25,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:43:25,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:25,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:43:25,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:25,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:43:25,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:25,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 20:43:25,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:25,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 20:43:25,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:25,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-15 20:43:25,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:25,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 20:43:25,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:25,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-15 20:43:25,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:25,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-15 20:43:25,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:25,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 20:43:25,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:25,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 20:43:25,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:25,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-15 20:43:25,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:25,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-15 20:43:25,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:25,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-15 20:43:25,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:25,342 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-15 20:43:25,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:43:25,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575529376] [2023-12-15 20:43:25,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575529376] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:43:25,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:43:25,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-15 20:43:25,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298141130] [2023-12-15 20:43:25,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:43:25,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-15 20:43:25,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:43:25,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-15 20:43:25,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-15 20:43:25,389 INFO L87 Difference]: Start difference. First operand has 56 states, 37 states have (on average 1.4864864864864864) internal successors, (55), 38 states have internal predecessors, (55), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2023-12-15 20:43:25,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:43:25,449 INFO L93 Difference]: Finished difference Result 109 states and 188 transitions. [2023-12-15 20:43:25,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-15 20:43:25,453 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 102 [2023-12-15 20:43:25,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:43:25,461 INFO L225 Difference]: With dead ends: 109 [2023-12-15 20:43:25,461 INFO L226 Difference]: Without dead ends: 54 [2023-12-15 20:43:25,465 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 50 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:43:25,469 INFO L413 NwaCegarLoop]: 79 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, 79 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:43:25,471 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 79 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 20:43:25,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2023-12-15 20:43:25,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2023-12-15 20:43:25,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 36 states have (on average 1.3888888888888888) internal successors, (50), 36 states have internal predecessors, (50), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-15 20:43:25,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 82 transitions. [2023-12-15 20:43:25,522 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 82 transitions. Word has length 102 [2023-12-15 20:43:25,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:43:25,523 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 82 transitions. [2023-12-15 20:43:25,523 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2023-12-15 20:43:25,524 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 82 transitions. [2023-12-15 20:43:25,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2023-12-15 20:43:25,529 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:43:25,529 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:25,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-15 20:43:25,530 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:43:25,530 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:43:25,530 INFO L85 PathProgramCache]: Analyzing trace with hash 1715067678, now seen corresponding path program 1 times [2023-12-15 20:43:25,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:43:25,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990826911] [2023-12-15 20:43:25,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:43:25,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:43:25,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:25,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:43:25,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:25,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:43:25,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:25,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:43:25,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:25,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:43:25,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:25,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:43:25,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:25,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 20:43:25,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:25,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 20:43:25,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:25,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-15 20:43:25,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:25,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 20:43:25,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:25,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-15 20:43:25,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:25,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-15 20:43:25,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:25,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 20:43:25,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:25,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 20:43:25,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:25,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-15 20:43:25,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:25,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-15 20:43:25,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:25,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-15 20:43:25,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:25,774 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-15 20:43:25,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:43:25,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990826911] [2023-12-15 20:43:25,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990826911] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:43:25,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:43:25,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 20:43:25,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935514536] [2023-12-15 20:43:25,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:43:25,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 20:43:25,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:43:25,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 20:43:25,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 20:43:25,777 INFO L87 Difference]: Start difference. First operand 54 states and 82 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-15 20:43:25,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:43:25,813 INFO L93 Difference]: Finished difference Result 129 states and 195 transitions. [2023-12-15 20:43:25,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 20:43:25,814 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 102 [2023-12-15 20:43:25,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:43:25,815 INFO L225 Difference]: With dead ends: 129 [2023-12-15 20:43:25,815 INFO L226 Difference]: Without dead ends: 76 [2023-12-15 20:43:25,816 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 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:43:25,817 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 30 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 20:43:25,817 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 150 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 20:43:25,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2023-12-15 20:43:25,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 55. [2023-12-15 20:43:25,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 37 states have internal predecessors, (51), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-15 20:43:25,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 83 transitions. [2023-12-15 20:43:25,835 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 83 transitions. Word has length 102 [2023-12-15 20:43:25,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:43:25,836 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 83 transitions. [2023-12-15 20:43:25,836 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-15 20:43:25,836 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 83 transitions. [2023-12-15 20:43:25,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2023-12-15 20:43:25,838 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:43:25,838 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:25,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-15 20:43:25,838 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:43:25,838 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:43:25,839 INFO L85 PathProgramCache]: Analyzing trace with hash -1878835040, now seen corresponding path program 1 times [2023-12-15 20:43:25,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:43:25,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218069964] [2023-12-15 20:43:25,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:43:25,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:43:25,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:25,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:43:25,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:25,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:43:25,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:25,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:43:25,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:25,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:43:25,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:25,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:43:25,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:25,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 20:43:25,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:25,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 20:43:25,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:25,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-15 20:43:25,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:25,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 20:43:25,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:25,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-15 20:43:25,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:25,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-15 20:43:25,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:25,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 20:43:25,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:25,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 20:43:25,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:25,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-15 20:43:26,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:26,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-15 20:43:26,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:26,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-15 20:43:26,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:26,014 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-15 20:43:26,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:43:26,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218069964] [2023-12-15 20:43:26,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218069964] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:43:26,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:43:26,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 20:43:26,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952224496] [2023-12-15 20:43:26,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:43:26,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 20:43:26,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:43:26,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 20:43:26,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 20:43:26,022 INFO L87 Difference]: Start difference. First operand 55 states and 83 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-15 20:43:26,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:43:26,077 INFO L93 Difference]: Finished difference Result 109 states and 165 transitions. [2023-12-15 20:43:26,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 20:43:26,078 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 102 [2023-12-15 20:43:26,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:43:26,081 INFO L225 Difference]: With dead ends: 109 [2023-12-15 20:43:26,081 INFO L226 Difference]: Without dead ends: 55 [2023-12-15 20:43:26,082 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 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:43:26,084 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 4 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 20:43:26,085 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 132 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 20:43:26,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2023-12-15 20:43:26,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2023-12-15 20:43:26,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 37 states have (on average 1.3513513513513513) internal successors, (50), 37 states have internal predecessors, (50), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-15 20:43:26,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 82 transitions. [2023-12-15 20:43:26,095 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 82 transitions. Word has length 102 [2023-12-15 20:43:26,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:43:26,096 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 82 transitions. [2023-12-15 20:43:26,096 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-15 20:43:26,096 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 82 transitions. [2023-12-15 20:43:26,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-12-15 20:43:26,097 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:43:26,097 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:26,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-15 20:43:26,098 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:43:26,098 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:43:26,098 INFO L85 PathProgramCache]: Analyzing trace with hash 1785126821, now seen corresponding path program 1 times [2023-12-15 20:43:26,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:43:26,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957841601] [2023-12-15 20:43:26,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:43:26,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:43:26,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:26,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:43:26,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:26,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:43:26,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:26,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:43:26,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:26,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:43:26,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:26,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:43:26,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:26,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 20:43:26,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:26,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 20:43:26,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:26,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-15 20:43:26,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:26,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 20:43:26,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:26,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-15 20:43:26,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:26,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-15 20:43:26,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:26,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 20:43:26,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:26,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 20:43:26,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:26,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-15 20:43:26,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:26,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-15 20:43:26,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:26,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-15 20:43:26,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:26,608 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-15 20:43:26,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:43:26,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957841601] [2023-12-15 20:43:26,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957841601] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:43:26,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:43:26,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-15 20:43:26,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465220352] [2023-12-15 20:43:26,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:43:26,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 20:43:26,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:43:26,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 20:43:26,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-15 20:43:26,610 INFO L87 Difference]: Start difference. First operand 55 states and 82 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-15 20:43:26,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:43:26,702 INFO L93 Difference]: Finished difference Result 131 states and 193 transitions. [2023-12-15 20:43:26,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-15 20:43:26,703 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 104 [2023-12-15 20:43:26,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:43:26,707 INFO L225 Difference]: With dead ends: 131 [2023-12-15 20:43:26,707 INFO L226 Difference]: Without dead ends: 77 [2023-12-15 20:43:26,708 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-15 20:43:26,709 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 57 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 20:43:26,709 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 183 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 20:43:26,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2023-12-15 20:43:26,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 65. [2023-12-15 20:43:26,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 47 states have (on average 1.3617021276595744) internal successors, (64), 47 states have internal predecessors, (64), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-15 20:43:26,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 96 transitions. [2023-12-15 20:43:26,716 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 96 transitions. Word has length 104 [2023-12-15 20:43:26,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:43:26,717 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 96 transitions. [2023-12-15 20:43:26,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-15 20:43:26,717 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 96 transitions. [2023-12-15 20:43:26,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-12-15 20:43:26,722 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:43:26,722 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:26,722 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-15 20:43:26,722 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:43:26,722 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:43:26,723 INFO L85 PathProgramCache]: Analyzing trace with hash -1595104073, now seen corresponding path program 1 times [2023-12-15 20:43:26,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:43:26,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928339393] [2023-12-15 20:43:26,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:43:26,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:43:26,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:26,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:43:26,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:26,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:43:26,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:26,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:43:26,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:26,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:43:26,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:26,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:43:26,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:26,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 20:43:26,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:26,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 20:43:26,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:26,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-15 20:43:26,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:26,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 20:43:26,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:26,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-15 20:43:26,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:26,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-15 20:43:26,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:26,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 20:43:26,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:26,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 20:43:26,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:26,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-15 20:43:26,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:26,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-15 20:43:26,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:26,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-15 20:43:26,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:26,903 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-15 20:43:26,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:43:26,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928339393] [2023-12-15 20:43:26,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928339393] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:43:26,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:43:26,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 20:43:26,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898697050] [2023-12-15 20:43:26,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:43:26,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 20:43:26,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:43:26,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 20:43:26,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 20:43:26,906 INFO L87 Difference]: Start difference. First operand 65 states and 96 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-15 20:43:26,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:43:26,959 INFO L93 Difference]: Finished difference Result 182 states and 271 transitions. [2023-12-15 20:43:26,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 20:43:26,960 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 105 [2023-12-15 20:43:26,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:43:26,962 INFO L225 Difference]: With dead ends: 182 [2023-12-15 20:43:26,962 INFO L226 Difference]: Without dead ends: 118 [2023-12-15 20:43:26,963 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 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:43:26,964 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 44 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 20:43:26,965 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 146 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 20:43:26,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2023-12-15 20:43:26,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 115. [2023-12-15 20:43:26,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 80 states have (on average 1.3125) internal successors, (105), 80 states have internal predecessors, (105), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2023-12-15 20:43:26,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 169 transitions. [2023-12-15 20:43:26,995 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 169 transitions. Word has length 105 [2023-12-15 20:43:26,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:43:26,997 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 169 transitions. [2023-12-15 20:43:26,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-15 20:43:26,997 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 169 transitions. [2023-12-15 20:43:26,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-12-15 20:43:26,998 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:43:26,998 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:26,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-15 20:43:26,998 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:43:26,999 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:43:26,999 INFO L85 PathProgramCache]: Analyzing trace with hash -213981125, now seen corresponding path program 1 times [2023-12-15 20:43:26,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:43:26,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79192828] [2023-12-15 20:43:26,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:43:26,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:43:27,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:27,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:43:27,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:27,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:43:27,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:27,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:43:27,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:27,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:43:27,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:27,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:43:27,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:27,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 20:43:27,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:27,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 20:43:27,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:27,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-15 20:43:27,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:27,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 20:43:27,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:27,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-15 20:43:27,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:27,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-15 20:43:27,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:27,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 20:43:27,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:27,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 20:43:27,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:27,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-15 20:43:27,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:27,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-15 20:43:27,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:27,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-15 20:43:27,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:27,847 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-15 20:43:27,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:43:27,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79192828] [2023-12-15 20:43:27,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79192828] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:43:27,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:43:27,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-15 20:43:27,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046192773] [2023-12-15 20:43:27,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:43:27,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-15 20:43:27,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:43:27,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-15 20:43:27,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-12-15 20:43:27,849 INFO L87 Difference]: Start difference. First operand 115 states and 169 transitions. Second operand has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2023-12-15 20:43:28,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:43:28,316 INFO L93 Difference]: Finished difference Result 403 states and 581 transitions. [2023-12-15 20:43:28,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-15 20:43:28,317 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 105 [2023-12-15 20:43:28,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:43:28,318 INFO L225 Difference]: With dead ends: 403 [2023-12-15 20:43:28,318 INFO L226 Difference]: Without dead ends: 289 [2023-12-15 20:43:28,319 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=201, Unknown=0, NotChecked=0, Total=306 [2023-12-15 20:43:28,319 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 218 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-15 20:43:28,320 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 423 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-15 20:43:28,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2023-12-15 20:43:28,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 219. [2023-12-15 20:43:28,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 150 states have (on average 1.28) internal successors, (192), 150 states have internal predecessors, (192), 64 states have call successors, (64), 4 states have call predecessors, (64), 4 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2023-12-15 20:43:28,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 320 transitions. [2023-12-15 20:43:28,335 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 320 transitions. Word has length 105 [2023-12-15 20:43:28,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:43:28,335 INFO L495 AbstractCegarLoop]: Abstraction has 219 states and 320 transitions. [2023-12-15 20:43:28,336 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2023-12-15 20:43:28,336 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 320 transitions. [2023-12-15 20:43:28,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-12-15 20:43:28,337 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:43:28,337 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:28,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-15 20:43:28,337 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:43:28,338 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:43:28,338 INFO L85 PathProgramCache]: Analyzing trace with hash -123214019, now seen corresponding path program 1 times [2023-12-15 20:43:28,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:43:28,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112679420] [2023-12-15 20:43:28,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:43:28,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:43:28,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:28,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:43:28,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:28,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:43:28,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:28,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:43:28,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:28,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:43:28,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:28,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:43:28,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:28,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 20:43:28,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:28,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 20:43:28,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:28,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-15 20:43:28,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:28,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 20:43:28,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:28,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-15 20:43:28,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:28,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-15 20:43:28,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:28,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 20:43:28,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:28,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 20:43:28,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:28,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-15 20:43:28,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:28,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-15 20:43:28,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:28,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-15 20:43:28,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:28,425 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-15 20:43:28,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:43:28,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112679420] [2023-12-15 20:43:28,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112679420] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:43:28,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:43:28,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 20:43:28,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498175826] [2023-12-15 20:43:28,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:43:28,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 20:43:28,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:43:28,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 20:43:28,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 20:43:28,427 INFO L87 Difference]: Start difference. First operand 219 states and 320 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-15 20:43:28,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:43:28,462 INFO L93 Difference]: Finished difference Result 439 states and 641 transitions. [2023-12-15 20:43:28,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 20:43:28,463 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 107 [2023-12-15 20:43:28,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:43:28,466 INFO L225 Difference]: With dead ends: 439 [2023-12-15 20:43:28,466 INFO L226 Difference]: Without dead ends: 221 [2023-12-15 20:43:28,467 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 35 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:43:28,469 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 5 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 20:43:28,469 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 132 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 20:43:28,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2023-12-15 20:43:28,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 219. [2023-12-15 20:43:28,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 150 states have (on average 1.2533333333333334) internal successors, (188), 150 states have internal predecessors, (188), 64 states have call successors, (64), 4 states have call predecessors, (64), 4 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2023-12-15 20:43:28,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 316 transitions. [2023-12-15 20:43:28,493 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 316 transitions. Word has length 107 [2023-12-15 20:43:28,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:43:28,494 INFO L495 AbstractCegarLoop]: Abstraction has 219 states and 316 transitions. [2023-12-15 20:43:28,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-15 20:43:28,494 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 316 transitions. [2023-12-15 20:43:28,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-12-15 20:43:28,495 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:43:28,495 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:28,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-15 20:43:28,496 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:43:28,496 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:43:28,496 INFO L85 PathProgramCache]: Analyzing trace with hash -2139734824, now seen corresponding path program 1 times [2023-12-15 20:43:28,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:43:28,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093214175] [2023-12-15 20:43:28,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:43:28,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:43:28,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:28,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:43:28,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:28,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:43:28,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:28,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:43:28,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:28,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:43:28,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:28,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:43:28,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:28,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 20:43:28,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:28,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 20:43:28,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:28,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-15 20:43:28,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:28,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 20:43:28,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:28,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-15 20:43:28,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:28,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-15 20:43:28,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:28,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 20:43:28,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:28,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 20:43:28,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:28,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-15 20:43:28,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:28,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-15 20:43:28,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:28,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-15 20:43:28,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:28,699 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-15 20:43:28,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:43:28,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093214175] [2023-12-15 20:43:28,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093214175] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:43:28,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:43:28,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-15 20:43:28,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476214473] [2023-12-15 20:43:28,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:43:28,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-15 20:43:28,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:43:28,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-15 20:43:28,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-12-15 20:43:28,701 INFO L87 Difference]: Start difference. First operand 219 states and 316 transitions. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-15 20:43:28,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:43:28,904 INFO L93 Difference]: Finished difference Result 494 states and 692 transitions. [2023-12-15 20:43:28,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-15 20:43:28,905 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), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 109 [2023-12-15 20:43:28,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:43:28,907 INFO L225 Difference]: With dead ends: 494 [2023-12-15 20:43:28,907 INFO L226 Difference]: Without dead ends: 368 [2023-12-15 20:43:28,908 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-12-15 20:43:28,910 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 126 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 20:43:28,910 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 327 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 20:43:28,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2023-12-15 20:43:28,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 268. [2023-12-15 20:43:28,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 182 states have (on average 1.2362637362637363) internal successors, (225), 182 states have internal predecessors, (225), 80 states have call successors, (80), 5 states have call predecessors, (80), 5 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) [2023-12-15 20:43:28,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 385 transitions. [2023-12-15 20:43:28,934 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 385 transitions. Word has length 109 [2023-12-15 20:43:28,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:43:28,934 INFO L495 AbstractCegarLoop]: Abstraction has 268 states and 385 transitions. [2023-12-15 20:43:28,935 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), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-15 20:43:28,935 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 385 transitions. [2023-12-15 20:43:28,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-12-15 20:43:28,935 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:43:28,936 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:28,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-15 20:43:28,936 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:43:28,936 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:43:28,936 INFO L85 PathProgramCache]: Analyzing trace with hash 123046868, now seen corresponding path program 1 times [2023-12-15 20:43:28,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:43:28,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636137371] [2023-12-15 20:43:28,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:43:28,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:43:28,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:28,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:43:28,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:28,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:43:28,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:28,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:43:28,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:28,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:43:28,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:28,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:43:28,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:28,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 20:43:29,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:29,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 20:43:29,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:29,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-15 20:43:29,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:29,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 20:43:29,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:29,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-15 20:43:29,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:29,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-15 20:43:29,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:29,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 20:43:29,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:29,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 20:43:29,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:29,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-15 20:43:29,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:29,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-15 20:43:29,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:29,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-15 20:43:29,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:29,018 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-15 20:43:29,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:43:29,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636137371] [2023-12-15 20:43:29,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636137371] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:43:29,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:43:29,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 20:43:29,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003175981] [2023-12-15 20:43:29,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:43:29,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 20:43:29,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:43:29,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 20:43:29,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 20:43:29,020 INFO L87 Difference]: Start difference. First operand 268 states and 385 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-15 20:43:29,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:43:29,082 INFO L93 Difference]: Finished difference Result 496 states and 722 transitions. [2023-12-15 20:43:29,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 20:43:29,083 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 109 [2023-12-15 20:43:29,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:43:29,085 INFO L225 Difference]: With dead ends: 496 [2023-12-15 20:43:29,085 INFO L226 Difference]: Without dead ends: 376 [2023-12-15 20:43:29,086 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 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:43:29,088 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 64 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 20:43:29,088 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 130 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 20:43:29,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2023-12-15 20:43:29,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 256. [2023-12-15 20:43:29,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 170 states have (on average 1.2411764705882353) internal successors, (211), 170 states have internal predecessors, (211), 80 states have call successors, (80), 5 states have call predecessors, (80), 5 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) [2023-12-15 20:43:29,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 371 transitions. [2023-12-15 20:43:29,120 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 371 transitions. Word has length 109 [2023-12-15 20:43:29,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:43:29,120 INFO L495 AbstractCegarLoop]: Abstraction has 256 states and 371 transitions. [2023-12-15 20:43:29,121 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-15 20:43:29,121 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 371 transitions. [2023-12-15 20:43:29,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-12-15 20:43:29,122 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:43:29,122 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:29,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-15 20:43:29,122 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:43:29,123 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:43:29,123 INFO L85 PathProgramCache]: Analyzing trace with hash -629041456, now seen corresponding path program 1 times [2023-12-15 20:43:29,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:43:29,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653715038] [2023-12-15 20:43:29,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:43:29,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:43:29,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:30,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:43:30,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:30,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:43:30,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:30,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:43:30,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:30,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:43:30,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:30,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:43:30,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:30,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 20:43:30,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:30,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 20:43:30,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:30,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-15 20:43:30,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:30,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 20:43:30,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:30,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-15 20:43:30,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:30,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-15 20:43:30,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:30,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 20:43:30,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:30,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 20:43:30,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:30,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-15 20:43:30,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:30,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-15 20:43:30,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:30,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-15 20:43:30,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:30,999 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 36 proven. 9 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2023-12-15 20:43:31,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:43:31,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653715038] [2023-12-15 20:43:31,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653715038] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 20:43:31,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [809384200] [2023-12-15 20:43:31,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:43:31,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 20:43:31,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 20:43:31,017 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:43:31,044 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:43:31,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:31,190 INFO L262 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 31 conjunts are in the unsatisfiable core [2023-12-15 20:43:31,198 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 20:43:32,171 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 171 proven. 51 refuted. 0 times theorem prover too weak. 258 trivial. 0 not checked. [2023-12-15 20:43:32,171 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 20:43:33,024 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 36 proven. 9 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2023-12-15 20:43:33,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [809384200] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-15 20:43:33,025 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-15 20:43:33,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 22 [2023-12-15 20:43:33,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102924054] [2023-12-15 20:43:33,025 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-15 20:43:33,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-12-15 20:43:33,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:43:33,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-12-15 20:43:33,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=363, Unknown=0, NotChecked=0, Total=462 [2023-12-15 20:43:33,027 INFO L87 Difference]: Start difference. First operand 256 states and 371 transitions. Second operand has 22 states, 22 states have (on average 3.409090909090909) internal successors, (75), 22 states have internal predecessors, (75), 3 states have call successors, (22), 2 states have call predecessors, (22), 4 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2023-12-15 20:43:34,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:43:34,524 INFO L93 Difference]: Finished difference Result 374 states and 490 transitions. [2023-12-15 20:43:34,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-12-15 20:43:34,524 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.409090909090909) internal successors, (75), 22 states have internal predecessors, (75), 3 states have call successors, (22), 2 states have call predecessors, (22), 4 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) Word has length 109 [2023-12-15 20:43:34,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:43:34,526 INFO L225 Difference]: With dead ends: 374 [2023-12-15 20:43:34,526 INFO L226 Difference]: Without dead ends: 372 [2023-12-15 20:43:34,527 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 238 SyntacticMatches, 3 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 505 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=523, Invalid=1733, Unknown=0, NotChecked=0, Total=2256 [2023-12-15 20:43:34,528 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 315 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 530 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 339 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-15 20:43:34,528 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [339 Valid, 268 Invalid, 623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 530 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-15 20:43:34,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2023-12-15 20:43:34,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 314. [2023-12-15 20:43:34,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 219 states have (on average 1.2054794520547945) internal successors, (264), 219 states have internal predecessors, (264), 80 states have call successors, (80), 14 states have call predecessors, (80), 14 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) [2023-12-15 20:43:34,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 424 transitions. [2023-12-15 20:43:34,569 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 424 transitions. Word has length 109 [2023-12-15 20:43:34,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:43:34,570 INFO L495 AbstractCegarLoop]: Abstraction has 314 states and 424 transitions. [2023-12-15 20:43:34,570 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.409090909090909) internal successors, (75), 22 states have internal predecessors, (75), 3 states have call successors, (22), 2 states have call predecessors, (22), 4 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2023-12-15 20:43:34,570 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 424 transitions. [2023-12-15 20:43:34,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-12-15 20:43:34,571 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:43:34,571 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:34,591 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-15 20:43:34,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-12-15 20:43:34,779 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:43:34,779 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:43:34,779 INFO L85 PathProgramCache]: Analyzing trace with hash -1209278763, now seen corresponding path program 1 times [2023-12-15 20:43:34,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:43:34,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505152331] [2023-12-15 20:43:34,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:43:34,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:43:34,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:34,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:43:34,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:34,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:43:34,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:34,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:43:34,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:34,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:43:34,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:34,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:43:34,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:34,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 20:43:34,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:34,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 20:43:34,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:34,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-15 20:43:34,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:34,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 20:43:34,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:34,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-15 20:43:34,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:34,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-15 20:43:34,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:34,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 20:43:34,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:34,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 20:43:34,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:34,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-15 20:43:34,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:34,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-15 20:43:34,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:34,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-15 20:43:34,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:34,966 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 36 proven. 9 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2023-12-15 20:43:34,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:43:34,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505152331] [2023-12-15 20:43:34,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505152331] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 20:43:34,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [392822437] [2023-12-15 20:43:34,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:43:34,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 20:43:34,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 20:43:34,968 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 20:43:35,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-15 20:43:35,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:43:35,067 INFO L262 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-15 20:43:35,078 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 20:43:35,161 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 183 proven. 9 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2023-12-15 20:43:35,161 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 20:43:35,277 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 36 proven. 9 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2023-12-15 20:43:35,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [392822437] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-15 20:43:35,278 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-15 20:43:35,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2023-12-15 20:43:35,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378711591] [2023-12-15 20:43:35,278 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-15 20:43:35,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-15 20:43:35,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:43:35,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-15 20:43:35,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2023-12-15 20:43:35,279 INFO L87 Difference]: Start difference. First operand 314 states and 424 transitions. Second operand has 14 states, 14 states have (on average 4.357142857142857) internal successors, (61), 14 states have internal predecessors, (61), 3 states have call successors, (22), 2 states have call predecessors, (22), 4 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) [2023-12-15 20:43:35,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:43:35,568 INFO L93 Difference]: Finished difference Result 514 states and 675 transitions. [2023-12-15 20:43:35,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-15 20:43:35,584 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.357142857142857) internal successors, (61), 14 states have internal predecessors, (61), 3 states have call successors, (22), 2 states have call predecessors, (22), 4 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) Word has length 110 [2023-12-15 20:43:35,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:43:35,586 INFO L225 Difference]: With dead ends: 514 [2023-12-15 20:43:35,586 INFO L226 Difference]: Without dead ends: 354 [2023-12-15 20:43:35,587 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 243 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=141, Invalid=321, Unknown=0, NotChecked=0, Total=462 [2023-12-15 20:43:35,587 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 126 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-15 20:43:35,588 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 201 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-15 20:43:35,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2023-12-15 20:43:35,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 326. [2023-12-15 20:43:35,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 228 states have (on average 1.1710526315789473) internal successors, (267), 228 states have internal predecessors, (267), 80 states have call successors, (80), 17 states have call predecessors, (80), 17 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) [2023-12-15 20:43:35,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 427 transitions. [2023-12-15 20:43:35,668 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 427 transitions. Word has length 110 [2023-12-15 20:43:35,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:43:35,669 INFO L495 AbstractCegarLoop]: Abstraction has 326 states and 427 transitions. [2023-12-15 20:43:35,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.357142857142857) internal successors, (61), 14 states have internal predecessors, (61), 3 states have call successors, (22), 2 states have call predecessors, (22), 4 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) [2023-12-15 20:43:35,669 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 427 transitions. [2023-12-15 20:43:35,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-12-15 20:43:35,670 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:43:35,670 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:35,679 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-12-15 20:43:35,876 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-12-15 20:43:35,876 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:43:35,876 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:43:35,876 INFO L85 PathProgramCache]: Analyzing trace with hash -508214185, now seen corresponding path program 1 times [2023-12-15 20:43:35,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:43:35,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790031161] [2023-12-15 20:43:35,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:43:35,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:43:35,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-15 20:43:35,907 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-15 20:43:35,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-15 20:43:35,964 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-15 20:43:35,964 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-15 20:43:35,965 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-15 20:43:35,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-15 20:43:35,968 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 20:43:35,970 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-15 20:43:36,038 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.12 08:43:36 BoogieIcfgContainer [2023-12-15 20:43:36,039 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-15 20:43:36,039 INFO L158 Benchmark]: Toolchain (without parser) took 11979.02ms. Allocated memory was 187.7MB in the beginning and 358.6MB in the end (delta: 170.9MB). Free memory was 152.1MB in the beginning and 165.6MB in the end (delta: -13.4MB). Peak memory consumption was 158.3MB. Max. memory is 8.0GB. [2023-12-15 20:43:36,039 INFO L158 Benchmark]: CDTParser took 0.42ms. Allocated memory is still 187.7MB. Free memory is still 146.0MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-15 20:43:36,039 INFO L158 Benchmark]: CACSL2BoogieTranslator took 235.30ms. Allocated memory is still 187.7MB. Free memory was 152.1MB in the beginning and 139.3MB in the end (delta: 12.8MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-15 20:43:36,039 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.24ms. Allocated memory is still 187.7MB. Free memory was 139.3MB in the beginning and 136.7MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-15 20:43:36,039 INFO L158 Benchmark]: Boogie Preprocessor took 58.97ms. Allocated memory is still 187.7MB. Free memory was 136.7MB in the beginning and 133.6MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-15 20:43:36,040 INFO L158 Benchmark]: RCFGBuilder took 448.13ms. Allocated memory is still 187.7MB. Free memory was 133.6MB in the beginning and 114.2MB in the end (delta: 19.4MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2023-12-15 20:43:36,040 INFO L158 Benchmark]: TraceAbstraction took 11176.84ms. Allocated memory was 187.7MB in the beginning and 358.6MB in the end (delta: 170.9MB). Free memory was 113.7MB in the beginning and 165.6MB in the end (delta: -51.9MB). Peak memory consumption was 119.5MB. Max. memory is 8.0GB. [2023-12-15 20:43:36,041 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.42ms. Allocated memory is still 187.7MB. Free memory is still 146.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 235.30ms. Allocated memory is still 187.7MB. Free memory was 152.1MB in the beginning and 139.3MB in the end (delta: 12.8MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 41.24ms. Allocated memory is still 187.7MB. Free memory was 139.3MB in the beginning and 136.7MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 58.97ms. Allocated memory is still 187.7MB. Free memory was 136.7MB in the beginning and 133.6MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 448.13ms. Allocated memory is still 187.7MB. Free memory was 133.6MB in the beginning and 114.2MB in the end (delta: 19.4MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * TraceAbstraction took 11176.84ms. Allocated memory was 187.7MB in the beginning and 358.6MB in the end (delta: 170.9MB). Free memory was 113.7MB in the beginning and 165.6MB in the end (delta: -51.9MB). Peak memory consumption was 119.5MB. 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 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of shiftRight at line 101. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 10; [L23] unsigned char var_1_2 = 0; [L24] unsigned char var_1_5 = 0; [L25] signed long int var_1_7 = 256; [L26] signed long int var_1_8 = 63; [L27] signed long int var_1_9 = 1; [L28] signed long int var_1_10 = 0; [L29] signed long int var_1_11 = 16; [L30] signed long int var_1_12 = -5; [L31] unsigned char var_1_14 = 128; [L32] signed long int var_1_15 = 4; [L33] unsigned long int var_1_16 = 500; [L34] unsigned char var_1_17 = 2; [L35] unsigned char var_1_18 = 100; [L36] signed long int last_1_var_1_12 = -5; [L37] unsigned char last_1_var_1_17 = 2; [L105] isInitial = 1 [L106] FCALL initially() [L107] COND TRUE 1 [L108] CALL updateLastVariables() [L97] last_1_var_1_12 = var_1_12 [L98] last_1_var_1_17 = var_1_17 [L108] RET updateLastVariables() [L109] CALL updateVariables() [L71] var_1_2 = __VERIFIER_nondet_uchar() [L72] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_5=0, var_1_7=256, var_1_8=63, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_5=0, var_1_7=256, var_1_8=63, var_1_9=1] [L72] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_5=0, var_1_7=256, var_1_8=63, var_1_9=1] [L73] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=0, var_1_7=256, var_1_8=63, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=0, var_1_7=256, var_1_8=63, var_1_9=1] [L73] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=0, var_1_7=256, var_1_8=63, var_1_9=1] [L74] var_1_5 = __VERIFIER_nondet_uchar() [L75] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_7=256, var_1_8=63, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_7=256, var_1_8=63, var_1_9=1] [L75] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_7=256, var_1_8=63, var_1_9=1] [L76] CALL assume_abort_if_not(var_1_5 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=63, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=63, var_1_9=1] [L76] RET assume_abort_if_not(var_1_5 <= 1) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=63, var_1_9=1] [L77] var_1_8 = __VERIFIER_nondet_long() [L78] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=1] [L78] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=1] [L79] CALL assume_abort_if_not(var_1_8 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=1] [L79] RET assume_abort_if_not(var_1_8 <= 2147483647) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=1] [L80] var_1_9 = __VERIFIER_nondet_long() [L81] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L81] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L82] CALL assume_abort_if_not(var_1_9 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L82] RET assume_abort_if_not(var_1_9 <= 2147483647) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L83] var_1_10 = __VERIFIER_nondet_long() [L84] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L84] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L85] CALL assume_abort_if_not(var_1_10 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L85] RET assume_abort_if_not(var_1_10 <= 2147483647) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L86] var_1_11 = __VERIFIER_nondet_long() [L87] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L87] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L88] CALL assume_abort_if_not(var_1_11 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L88] RET assume_abort_if_not(var_1_11 <= 2147483647) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L89] var_1_14 = __VERIFIER_nondet_uchar() [L90] CALL assume_abort_if_not(var_1_14 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=127, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=127, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L90] RET assume_abort_if_not(var_1_14 >= 127) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=127, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L91] CALL assume_abort_if_not(var_1_14 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=127, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=127, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L91] RET assume_abort_if_not(var_1_14 <= 255) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=127, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L92] var_1_18 = __VERIFIER_nondet_uchar() [L93] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=127, var_1_15=4, var_1_16=500, var_1_17=2, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=127, var_1_15=4, var_1_16=500, var_1_17=2, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L93] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=127, var_1_15=4, var_1_16=500, var_1_17=2, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L94] CALL assume_abort_if_not(var_1_18 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=127, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=254, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=127, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=254, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L94] RET assume_abort_if_not(var_1_18 <= 254) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=127, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=254, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L109] RET updateVariables() [L110] CALL step() [L41] unsigned char stepLocal_1 = last_1_var_1_12 >= last_1_var_1_17; [L42] signed long int stepLocal_0 = last_1_var_1_17; VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, stepLocal_0=2, stepLocal_1=0, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=127, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=254, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L43] COND FALSE !(\read(var_1_2)) [L52] var_1_1 = last_1_var_1_17 VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, stepLocal_0=2, stepLocal_1=0, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=127, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=254, var_1_1=2, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L54] COND FALSE !(\read(var_1_2)) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, stepLocal_0=2, stepLocal_1=0, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=127, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=254, var_1_1=2, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L57] var_1_15 = var_1_8 [L58] var_1_16 = var_1_14 [L59] var_1_17 = var_1_18 VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, stepLocal_0=2, stepLocal_1=0, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=127, var_1_15=0, var_1_16=127, var_1_17=254, var_1_18=254, var_1_1=2, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L60] EXPR -4 >> var_1_1 VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, stepLocal_0=2, stepLocal_1=0, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=127, var_1_15=0, var_1_16=127, var_1_17=254, var_1_18=254, var_1_1=2, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L60] EXPR (((-4 >> var_1_1)) < (var_1_1)) ? ((-4 >> var_1_1)) : (var_1_1) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, stepLocal_0=2, stepLocal_1=0, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=127, var_1_15=0, var_1_16=127, var_1_17=254, var_1_18=254, var_1_1=2, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L60] EXPR -4 >> var_1_1 VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, stepLocal_0=2, stepLocal_1=0, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=127, var_1_15=0, var_1_16=127, var_1_17=254, var_1_18=254, var_1_1=2, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L60] EXPR (((-4 >> var_1_1)) < (var_1_1)) ? ((-4 >> var_1_1)) : (var_1_1) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, stepLocal_0=2, stepLocal_1=0, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=127, var_1_15=0, var_1_16=127, var_1_17=254, var_1_18=254, var_1_1=2, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L60] signed long int stepLocal_3 = ((((-4 >> var_1_1)) < (var_1_1)) ? ((-4 >> var_1_1)) : (var_1_1)); [L61] signed long int stepLocal_2 = var_1_1 / -8; VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, stepLocal_0=2, stepLocal_1=0, stepLocal_2=0, stepLocal_3=-255, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=127, var_1_15=0, var_1_16=127, var_1_17=254, var_1_18=254, var_1_1=2, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L62] COND TRUE (~ var_1_17) <= stepLocal_3 VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, stepLocal_0=2, stepLocal_1=0, stepLocal_2=0, stepLocal_3=-255, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=127, var_1_15=0, var_1_16=127, var_1_17=254, var_1_18=254, var_1_1=2, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L63] COND FALSE !((var_1_14 - 64) < stepLocal_2) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, stepLocal_0=2, stepLocal_1=0, stepLocal_2=0, stepLocal_3=-255, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=127, var_1_15=0, var_1_16=127, var_1_17=254, var_1_18=254, var_1_1=2, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L110] RET step() [L111] CALL, EXPR property() [L101] EXPR ((var_1_2 ? (((last_1_var_1_12 >= last_1_var_1_17) && var_1_5) ? ((last_1_var_1_12 >= last_1_var_1_17) ? (var_1_1 == ((unsigned short int) 5)) : (var_1_1 == ((unsigned short int) ((((25) < (last_1_var_1_17)) ? (25) : (last_1_var_1_17)))))) : 1) : (var_1_1 == ((unsigned short int) last_1_var_1_17))) && (var_1_2 ? (var_1_7 == ((signed long int) (((var_1_8 + var_1_9) + var_1_10) - var_1_11))) : 1)) && (((~ var_1_17) <= (((((-4 >> var_1_1)) < (var_1_1)) ? ((-4 >> var_1_1)) : (var_1_1)))) ? (((var_1_14 - 64) < (var_1_1 / -8)) ? (var_1_12 == ((signed long int) var_1_1)) : 1) : (var_1_12 == ((signed long int) (var_1_17 - var_1_14)))) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=127, var_1_15=0, var_1_16=127, var_1_17=254, var_1_18=254, var_1_1=2, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L101] EXPR -4 >> var_1_1 VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=127, var_1_15=0, var_1_16=127, var_1_17=254, var_1_18=254, var_1_1=2, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L101] EXPR (((-4 >> var_1_1)) < (var_1_1)) ? ((-4 >> var_1_1)) : (var_1_1) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=127, var_1_15=0, var_1_16=127, var_1_17=254, var_1_18=254, var_1_1=2, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L101] EXPR -4 >> var_1_1 VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=127, var_1_15=0, var_1_16=127, var_1_17=254, var_1_18=254, var_1_1=2, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L101] EXPR (((-4 >> var_1_1)) < (var_1_1)) ? ((-4 >> var_1_1)) : (var_1_1) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=127, var_1_15=0, var_1_16=127, var_1_17=254, var_1_18=254, var_1_1=2, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L101] EXPR ((var_1_2 ? (((last_1_var_1_12 >= last_1_var_1_17) && var_1_5) ? ((last_1_var_1_12 >= last_1_var_1_17) ? (var_1_1 == ((unsigned short int) 5)) : (var_1_1 == ((unsigned short int) ((((25) < (last_1_var_1_17)) ? (25) : (last_1_var_1_17)))))) : 1) : (var_1_1 == ((unsigned short int) last_1_var_1_17))) && (var_1_2 ? (var_1_7 == ((signed long int) (((var_1_8 + var_1_9) + var_1_10) - var_1_11))) : 1)) && (((~ var_1_17) <= (((((-4 >> var_1_1)) < (var_1_1)) ? ((-4 >> var_1_1)) : (var_1_1)))) ? (((var_1_14 - 64) < (var_1_1 / -8)) ? (var_1_12 == ((signed long int) var_1_1)) : 1) : (var_1_12 == ((signed long int) (var_1_17 - var_1_14)))) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=127, var_1_15=0, var_1_16=127, var_1_17=254, var_1_18=254, var_1_1=2, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L101-L102] return (((((var_1_2 ? (((last_1_var_1_12 >= last_1_var_1_17) && var_1_5) ? ((last_1_var_1_12 >= last_1_var_1_17) ? (var_1_1 == ((unsigned short int) 5)) : (var_1_1 == ((unsigned short int) ((((25) < (last_1_var_1_17)) ? (25) : (last_1_var_1_17)))))) : 1) : (var_1_1 == ((unsigned short int) last_1_var_1_17))) && (var_1_2 ? (var_1_7 == ((signed long int) (((var_1_8 + var_1_9) + var_1_10) - var_1_11))) : 1)) && (((~ var_1_17) <= (((((-4 >> var_1_1)) < (var_1_1)) ? ((-4 >> var_1_1)) : (var_1_1)))) ? (((var_1_14 - 64) < (var_1_1 / -8)) ? (var_1_12 == ((signed long int) var_1_1)) : 1) : (var_1_12 == ((signed long int) (var_1_17 - var_1_14))))) && (var_1_15 == ((signed long int) var_1_8))) && (var_1_16 == ((unsigned long int) var_1_14))) && (var_1_17 == ((unsigned char) var_1_18)) ; [L111] RET, EXPR property() [L111] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=127, var_1_15=0, var_1_16=127, var_1_17=254, var_1_18=254, var_1_1=2, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=127, var_1_15=0, var_1_16=127, var_1_17=254, var_1_18=254, var_1_1=2, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 56 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.1s, OverallIterations: 12, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1037 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 989 mSDsluCounter, 2171 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1360 mSDsCounter, 289 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1354 IncrementalHoareTripleChecker+Invalid, 1643 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 289 mSolverCounterUnsat, 811 mSDtfsCounter, 1354 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 908 GetRequests, 805 SyntacticMatches, 4 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 625 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=326occurred in iteration=11, InterpolantAutomatonStates: 94, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 11 MinimizatonAttempts, 414 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 6.4s InterpolantComputationTime, 1493 NumberOfCodeBlocks, 1493 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 1587 ConstructedInterpolants, 0 QuantifiedInterpolants, 7409 SizeOfPredicates, 22 NumberOfNonLiveVariables, 535 ConjunctsInSsa, 39 ConjunctsInUnsatCore, 15 InterpolantComputations, 9 PerfectInterpolantSequences, 7104/7200 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-12-15 20:43:36,082 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...