/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_has-floats_file-70.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-15 20:40:40,900 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-15 20:40:40,962 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:40:40,967 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-15 20:40:40,968 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-15 20:40:40,994 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-15 20:40:40,995 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-15 20:40:40,995 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-15 20:40:40,996 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-15 20:40:40,999 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-15 20:40:41,000 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-15 20:40:41,000 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-15 20:40:41,001 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-15 20:40:41,002 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-15 20:40:41,002 INFO L153 SettingsManager]: * Use SBE=true [2023-12-15 20:40:41,002 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-15 20:40:41,002 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-15 20:40:41,002 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-15 20:40:41,003 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-15 20:40:41,003 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-15 20:40:41,003 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-15 20:40:41,003 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-15 20:40:41,003 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-15 20:40:41,003 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-15 20:40:41,004 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-15 20:40:41,004 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-15 20:40:41,004 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-15 20:40:41,004 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-15 20:40:41,004 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-15 20:40:41,004 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-15 20:40:41,005 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-15 20:40:41,005 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-15 20:40:41,005 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 20:40:41,006 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-15 20:40:41,006 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-15 20:40:41,006 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-15 20:40:41,006 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-15 20:40:41,006 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-15 20:40:41,006 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-15 20:40:41,006 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-15 20:40:41,006 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-15 20:40:41,006 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-15 20:40:41,007 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-15 20:40:41,007 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:40:41,166 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-15 20:40:41,178 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-15 20:40:41,179 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-15 20:40:41,180 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-15 20:40:41,181 INFO L274 PluginConnector]: CDTParser initialized [2023-12-15 20:40:41,181 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-70.i [2023-12-15 20:40:42,062 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-15 20:40:42,203 INFO L384 CDTParser]: Found 1 translation units. [2023-12-15 20:40:42,204 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-70.i [2023-12-15 20:40:42,209 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb2dec8d9/424276e6d76d4b85bd183d3ff28c7212/FLAG67c03abee [2023-12-15 20:40:42,218 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb2dec8d9/424276e6d76d4b85bd183d3ff28c7212 [2023-12-15 20:40:42,220 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-15 20:40:42,221 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-15 20:40:42,222 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-15 20:40:42,222 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-15 20:40:42,229 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-15 20:40:42,229 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 08:40:42" (1/1) ... [2023-12-15 20:40:42,230 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b1c56ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:40:42, skipping insertion in model container [2023-12-15 20:40:42,230 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 08:40:42" (1/1) ... [2023-12-15 20:40:42,245 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-15 20:40:42,328 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-70.i[917,930] [2023-12-15 20:40:42,353 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 20:40:42,363 INFO L202 MainTranslator]: Completed pre-run [2023-12-15 20:40:42,372 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-70.i[917,930] [2023-12-15 20:40:42,386 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 20:40:42,395 INFO L206 MainTranslator]: Completed translation [2023-12-15 20:40:42,396 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:40:42 WrapperNode [2023-12-15 20:40:42,396 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-15 20:40:42,396 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-15 20:40:42,396 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-15 20:40:42,397 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-15 20:40:42,401 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:40:42" (1/1) ... [2023-12-15 20:40:42,409 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:40:42" (1/1) ... [2023-12-15 20:40:42,430 INFO L138 Inliner]: procedures = 26, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 134 [2023-12-15 20:40:42,431 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-15 20:40:42,431 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-15 20:40:42,431 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-15 20:40:42,431 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-15 20:40:42,438 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:40:42" (1/1) ... [2023-12-15 20:40:42,438 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:40:42" (1/1) ... [2023-12-15 20:40:42,440 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:40:42" (1/1) ... [2023-12-15 20:40:42,449 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:40:42,449 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:40:42" (1/1) ... [2023-12-15 20:40:42,449 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:40:42" (1/1) ... [2023-12-15 20:40:42,459 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:40:42" (1/1) ... [2023-12-15 20:40:42,461 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:40:42" (1/1) ... [2023-12-15 20:40:42,463 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:40:42" (1/1) ... [2023-12-15 20:40:42,464 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:40:42" (1/1) ... [2023-12-15 20:40:42,466 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-15 20:40:42,467 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-15 20:40:42,467 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-15 20:40:42,467 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-15 20:40:42,468 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:40:42" (1/1) ... [2023-12-15 20:40:42,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 20:40:42,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 20:40:42,505 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:40:42,510 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:40:42,526 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-15 20:40:42,526 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-15 20:40:42,527 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-15 20:40:42,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-15 20:40:42,527 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-15 20:40:42,527 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-15 20:40:42,571 INFO L241 CfgBuilder]: Building ICFG [2023-12-15 20:40:42,572 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-15 20:40:42,764 INFO L282 CfgBuilder]: Performing block encoding [2023-12-15 20:40:42,782 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-15 20:40:42,783 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-15 20:40:42,783 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 08:40:42 BoogieIcfgContainer [2023-12-15 20:40:42,783 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-15 20:40:42,786 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-15 20:40:42,786 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-15 20:40:42,788 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-15 20:40:42,788 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.12 08:40:42" (1/3) ... [2023-12-15 20:40:42,789 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f40c26f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 08:40:42, skipping insertion in model container [2023-12-15 20:40:42,789 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:40:42" (2/3) ... [2023-12-15 20:40:42,789 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f40c26f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 08:40:42, skipping insertion in model container [2023-12-15 20:40:42,789 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 08:40:42" (3/3) ... [2023-12-15 20:40:42,790 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-70.i [2023-12-15 20:40:42,802 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-15 20:40:42,802 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-15 20:40:42,839 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-15 20:40:42,843 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;@5ab5a8be, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-15 20:40:42,844 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-15 20:40:42,846 INFO L276 IsEmpty]: Start isEmpty. Operand has 50 states, 35 states have (on average 1.457142857142857) internal successors, (51), 36 states have internal predecessors, (51), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-15 20:40:42,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2023-12-15 20:40:42,854 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:40:42,854 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:42,855 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:40:42,859 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:40:42,859 INFO L85 PathProgramCache]: Analyzing trace with hash 406866168, now seen corresponding path program 1 times [2023-12-15 20:40:42,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:40:42,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958036198] [2023-12-15 20:40:42,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:40:42,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:40:42,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:43,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:40:43,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:43,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:40:43,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:43,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:40:43,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:43,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:40:43,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:43,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:40:43,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:43,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-15 20:40:43,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:43,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-15 20:40:43,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:43,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-15 20:40:43,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:43,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-15 20:40:43,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:43,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-15 20:40:43,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:43,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-15 20:40:43,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:43,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-15 20:40:43,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:43,153 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-15 20:40:43,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:40:43,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958036198] [2023-12-15 20:40:43,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958036198] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:40:43,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:40:43,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-15 20:40:43,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485630024] [2023-12-15 20:40:43,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:40:43,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-15 20:40:43,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:40:43,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-15 20:40:43,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-15 20:40:43,188 INFO L87 Difference]: Start difference. First operand has 50 states, 35 states have (on average 1.457142857142857) internal successors, (51), 36 states have internal predecessors, (51), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-15 20:40:43,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:40:43,223 INFO L93 Difference]: Finished difference Result 97 states and 160 transitions. [2023-12-15 20:40:43,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-15 20:40:43,225 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 83 [2023-12-15 20:40:43,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:40:43,229 INFO L225 Difference]: With dead ends: 97 [2023-12-15 20:40:43,229 INFO L226 Difference]: Without dead ends: 48 [2023-12-15 20:40:43,232 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 38 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:40:43,234 INFO L413 NwaCegarLoop]: 67 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, 67 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:40:43,234 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 67 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 20:40:43,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2023-12-15 20:40:43,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2023-12-15 20:40:43,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 34 states have (on average 1.3529411764705883) internal successors, (46), 34 states have internal predecessors, (46), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-15 20:40:43,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 70 transitions. [2023-12-15 20:40:43,270 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 70 transitions. Word has length 83 [2023-12-15 20:40:43,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:40:43,270 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 70 transitions. [2023-12-15 20:40:43,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-15 20:40:43,270 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 70 transitions. [2023-12-15 20:40:43,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2023-12-15 20:40:43,272 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:40:43,272 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:43,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-15 20:40:43,273 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:40:43,273 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:40:43,273 INFO L85 PathProgramCache]: Analyzing trace with hash -1600030208, now seen corresponding path program 1 times [2023-12-15 20:40:43,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:40:43,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449748254] [2023-12-15 20:40:43,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:40:43,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:40:43,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:43,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:40:43,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:43,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:40:43,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:43,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:40:43,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:43,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:40:43,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:43,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:40:43,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:43,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-15 20:40:43,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:43,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-15 20:40:43,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:43,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-15 20:40:43,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:43,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-15 20:40:43,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:43,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-15 20:40:43,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:43,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-15 20:40:43,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:43,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-15 20:40:43,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:43,394 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-15 20:40:43,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:40:43,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449748254] [2023-12-15 20:40:43,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449748254] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:40:43,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:40:43,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 20:40:43,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64894158] [2023-12-15 20:40:43,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:40:43,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 20:40:43,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:40:43,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 20:40:43,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 20:40:43,397 INFO L87 Difference]: Start difference. First operand 48 states and 70 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-15 20:40:43,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:40:43,457 INFO L93 Difference]: Finished difference Result 95 states and 139 transitions. [2023-12-15 20:40:43,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 20:40:43,458 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 83 [2023-12-15 20:40:43,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:40:43,460 INFO L225 Difference]: With dead ends: 95 [2023-12-15 20:40:43,460 INFO L226 Difference]: Without dead ends: 48 [2023-12-15 20:40:43,461 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 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:40:43,462 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 4 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 20:40:43,463 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 105 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 20:40:43,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2023-12-15 20:40:43,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2023-12-15 20:40:43,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 34 states have internal predecessors, (45), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-15 20:40:43,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 69 transitions. [2023-12-15 20:40:43,469 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 69 transitions. Word has length 83 [2023-12-15 20:40:43,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:40:43,471 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 69 transitions. [2023-12-15 20:40:43,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-15 20:40:43,471 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 69 transitions. [2023-12-15 20:40:43,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2023-12-15 20:40:43,472 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:40:43,472 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:43,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-15 20:40:43,472 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:40:43,473 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:40:43,473 INFO L85 PathProgramCache]: Analyzing trace with hash -2145450332, now seen corresponding path program 1 times [2023-12-15 20:40:43,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:40:43,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831259042] [2023-12-15 20:40:43,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:40:43,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:40:43,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:43,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:40:43,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:43,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:40:43,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:43,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:40:43,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:43,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:40:43,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:43,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:40:43,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:43,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-15 20:40:43,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:43,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-15 20:40:43,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:43,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-15 20:40:43,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:43,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-15 20:40:43,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:43,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-15 20:40:43,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:43,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-15 20:40:43,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:43,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-15 20:40:43,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:43,595 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-15 20:40:43,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:40:43,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831259042] [2023-12-15 20:40:43,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831259042] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:40:43,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:40:43,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 20:40:43,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4617483] [2023-12-15 20:40:43,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:40:43,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 20:40:43,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:40:43,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 20:40:43,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 20:40:43,597 INFO L87 Difference]: Start difference. First operand 48 states and 69 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-15 20:40:43,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:40:43,658 INFO L93 Difference]: Finished difference Result 138 states and 198 transitions. [2023-12-15 20:40:43,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 20:40:43,658 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 85 [2023-12-15 20:40:43,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:40:43,662 INFO L225 Difference]: With dead ends: 138 [2023-12-15 20:40:43,662 INFO L226 Difference]: Without dead ends: 91 [2023-12-15 20:40:43,664 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 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:40:43,667 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 56 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 20:40:43,667 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 134 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 20:40:43,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2023-12-15 20:40:43,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 59. [2023-12-15 20:40:43,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 45 states have (on average 1.3333333333333333) internal successors, (60), 45 states have internal predecessors, (60), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-15 20:40:43,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 84 transitions. [2023-12-15 20:40:43,674 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 84 transitions. Word has length 85 [2023-12-15 20:40:43,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:40:43,674 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 84 transitions. [2023-12-15 20:40:43,675 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-15 20:40:43,675 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 84 transitions. [2023-12-15 20:40:43,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2023-12-15 20:40:43,676 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:40:43,676 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:43,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-15 20:40:43,679 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:40:43,679 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:40:43,679 INFO L85 PathProgramCache]: Analyzing trace with hash -1752423322, now seen corresponding path program 1 times [2023-12-15 20:40:43,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:40:43,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791937721] [2023-12-15 20:40:43,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:40:43,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:40:43,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:44,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:40:44,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:44,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:40:44,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:44,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:40:44,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:44,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:40:44,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:44,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:40:44,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:44,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-15 20:40:44,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:44,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-15 20:40:44,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:44,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-15 20:40:44,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:44,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-15 20:40:44,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:44,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-15 20:40:44,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:44,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-15 20:40:44,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:44,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-15 20:40:44,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:44,255 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-15 20:40:44,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:40:44,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791937721] [2023-12-15 20:40:44,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791937721] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:40:44,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:40:44,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-15 20:40:44,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183682187] [2023-12-15 20:40:44,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:40:44,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-15 20:40:44,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:40:44,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-15 20:40:44,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2023-12-15 20:40:44,258 INFO L87 Difference]: Start difference. First operand 59 states and 84 transitions. Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-15 20:40:44,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:40:44,448 INFO L93 Difference]: Finished difference Result 196 states and 273 transitions. [2023-12-15 20:40:44,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-15 20:40:44,449 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 85 [2023-12-15 20:40:44,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:40:44,455 INFO L225 Difference]: With dead ends: 196 [2023-12-15 20:40:44,455 INFO L226 Difference]: Without dead ends: 138 [2023-12-15 20:40:44,458 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2023-12-15 20:40:44,459 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 98 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 20:40:44,459 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 212 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 20:40:44,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2023-12-15 20:40:44,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 104. [2023-12-15 20:40:44,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 87 states have (on average 1.3563218390804597) internal successors, (118), 88 states have internal predecessors, (118), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2023-12-15 20:40:44,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 146 transitions. [2023-12-15 20:40:44,468 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 146 transitions. Word has length 85 [2023-12-15 20:40:44,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:40:44,468 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 146 transitions. [2023-12-15 20:40:44,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-15 20:40:44,469 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 146 transitions. [2023-12-15 20:40:44,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2023-12-15 20:40:44,470 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:40:44,470 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:44,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-15 20:40:44,471 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:40:44,471 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:40:44,471 INFO L85 PathProgramCache]: Analyzing trace with hash 1733197348, now seen corresponding path program 1 times [2023-12-15 20:40:44,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:40:44,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998398901] [2023-12-15 20:40:44,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:40:44,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:40:44,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:45,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:40:45,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:45,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:40:45,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:45,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:40:45,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:45,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:40:45,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:45,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:40:45,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:45,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-15 20:40:45,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:45,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-15 20:40:45,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:45,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-15 20:40:45,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:45,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-15 20:40:45,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:45,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-15 20:40:45,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:45,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-15 20:40:45,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:45,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-15 20:40:45,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:45,462 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-15 20:40:45,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:40:45,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998398901] [2023-12-15 20:40:45,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998398901] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:40:45,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:40:45,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-15 20:40:45,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262991259] [2023-12-15 20:40:45,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:40:45,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 20:40:45,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:40:45,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 20:40:45,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-15 20:40:45,466 INFO L87 Difference]: Start difference. First operand 104 states and 146 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-15 20:40:45,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:40:45,716 INFO L93 Difference]: Finished difference Result 234 states and 326 transitions. [2023-12-15 20:40:45,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-15 20:40:45,718 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 85 [2023-12-15 20:40:45,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:40:45,720 INFO L225 Difference]: With dead ends: 234 [2023-12-15 20:40:45,720 INFO L226 Difference]: Without dead ends: 131 [2023-12-15 20:40:45,720 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-12-15 20:40:45,721 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 84 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-15 20:40:45,721 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 140 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-15 20:40:45,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2023-12-15 20:40:45,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 114. [2023-12-15 20:40:45,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 97 states have (on average 1.3505154639175259) internal successors, (131), 98 states have internal predecessors, (131), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2023-12-15 20:40:45,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 159 transitions. [2023-12-15 20:40:45,733 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 159 transitions. Word has length 85 [2023-12-15 20:40:45,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:40:45,733 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 159 transitions. [2023-12-15 20:40:45,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-15 20:40:45,733 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 159 transitions. [2023-12-15 20:40:45,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2023-12-15 20:40:45,734 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:40:45,734 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:45,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-15 20:40:45,735 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:40:45,735 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:40:45,735 INFO L85 PathProgramCache]: Analyzing trace with hash 1531426724, now seen corresponding path program 1 times [2023-12-15 20:40:45,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:40:45,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884963843] [2023-12-15 20:40:45,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:40:45,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:40:45,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:48,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:40:48,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:48,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:40:48,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:48,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:40:48,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:48,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:40:48,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:48,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:40:48,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:48,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-15 20:40:48,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:48,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-15 20:40:48,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:48,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-15 20:40:48,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:48,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-15 20:40:48,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:48,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-15 20:40:48,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:48,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-15 20:40:48,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:48,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-15 20:40:48,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:48,387 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-15 20:40:48,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:40:48,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884963843] [2023-12-15 20:40:48,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884963843] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:40:48,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:40:48,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-15 20:40:48,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746880451] [2023-12-15 20:40:48,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:40:48,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-15 20:40:48,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:40:48,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-15 20:40:48,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2023-12-15 20:40:48,388 INFO L87 Difference]: Start difference. First operand 114 states and 159 transitions. Second operand has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-15 20:40:49,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:40:49,730 INFO L93 Difference]: Finished difference Result 259 states and 355 transitions. [2023-12-15 20:40:49,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-15 20:40:49,731 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 85 [2023-12-15 20:40:49,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:40:49,732 INFO L225 Difference]: With dead ends: 259 [2023-12-15 20:40:49,732 INFO L226 Difference]: Without dead ends: 146 [2023-12-15 20:40:49,733 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2023-12-15 20:40:49,733 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 116 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-15 20:40:49,733 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 334 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 351 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-15 20:40:49,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2023-12-15 20:40:49,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 114. [2023-12-15 20:40:49,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 97 states have (on average 1.3505154639175259) internal successors, (131), 98 states have internal predecessors, (131), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2023-12-15 20:40:49,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 159 transitions. [2023-12-15 20:40:49,743 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 159 transitions. Word has length 85 [2023-12-15 20:40:49,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:40:49,743 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 159 transitions. [2023-12-15 20:40:49,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-15 20:40:49,743 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 159 transitions. [2023-12-15 20:40:49,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2023-12-15 20:40:49,744 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:40:49,744 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:49,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-15 20:40:49,744 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:40:49,745 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:40:49,745 INFO L85 PathProgramCache]: Analyzing trace with hash 722080098, now seen corresponding path program 1 times [2023-12-15 20:40:49,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:40:49,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675220635] [2023-12-15 20:40:49,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:40:49,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:40:49,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:51,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:40:51,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:51,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:40:51,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:51,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:40:51,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:51,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:40:51,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:51,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:40:51,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:51,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-15 20:40:51,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:51,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-15 20:40:51,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:51,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-15 20:40:51,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:51,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-15 20:40:51,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:51,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-15 20:40:51,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:51,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-15 20:40:51,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:51,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-15 20:40:51,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:51,146 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-15 20:40:51,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:40:51,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675220635] [2023-12-15 20:40:51,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675220635] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:40:51,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:40:51,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-15 20:40:51,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478204409] [2023-12-15 20:40:51,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:40:51,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 20:40:51,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:40:51,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 20:40:51,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-15 20:40:51,149 INFO L87 Difference]: Start difference. First operand 114 states and 159 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-15 20:40:51,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:40:51,281 INFO L93 Difference]: Finished difference Result 230 states and 319 transitions. [2023-12-15 20:40:51,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-15 20:40:51,282 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 85 [2023-12-15 20:40:51,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:40:51,283 INFO L225 Difference]: With dead ends: 230 [2023-12-15 20:40:51,283 INFO L226 Difference]: Without dead ends: 117 [2023-12-15 20:40:51,283 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-15 20:40:51,284 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 54 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 20:40:51,284 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 132 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 20:40:51,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2023-12-15 20:40:51,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 104. [2023-12-15 20:40:51,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 87 states have (on average 1.3333333333333333) internal successors, (116), 88 states have internal predecessors, (116), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2023-12-15 20:40:51,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 144 transitions. [2023-12-15 20:40:51,290 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 144 transitions. Word has length 85 [2023-12-15 20:40:51,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:40:51,291 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 144 transitions. [2023-12-15 20:40:51,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-15 20:40:51,291 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 144 transitions. [2023-12-15 20:40:51,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2023-12-15 20:40:51,292 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:40:51,292 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:51,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-15 20:40:51,292 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:40:51,292 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:40:51,292 INFO L85 PathProgramCache]: Analyzing trace with hash 1262680296, now seen corresponding path program 1 times [2023-12-15 20:40:51,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:40:51,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658839056] [2023-12-15 20:40:51,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:40:51,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:40:51,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:51,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:40:51,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:51,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:40:51,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:51,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:40:51,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:51,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:40:51,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:51,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:40:51,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:51,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-15 20:40:51,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:51,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-15 20:40:51,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:51,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-15 20:40:51,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:51,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-15 20:40:51,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:51,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-15 20:40:51,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:51,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-15 20:40:51,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:51,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-15 20:40:51,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:51,336 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-15 20:40:51,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:40:51,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658839056] [2023-12-15 20:40:51,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658839056] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:40:51,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:40:51,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 20:40:51,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717476142] [2023-12-15 20:40:51,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:40:51,337 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 20:40:51,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:40:51,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 20:40:51,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 20:40:51,337 INFO L87 Difference]: Start difference. First operand 104 states and 144 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-15 20:40:51,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:40:51,353 INFO L93 Difference]: Finished difference Result 210 states and 289 transitions. [2023-12-15 20:40:51,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 20:40:51,353 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 85 [2023-12-15 20:40:51,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:40:51,354 INFO L225 Difference]: With dead ends: 210 [2023-12-15 20:40:51,354 INFO L226 Difference]: Without dead ends: 107 [2023-12-15 20:40:51,354 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 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:40:51,355 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 29 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 20:40:51,357 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 146 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 20:40:51,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2023-12-15 20:40:51,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 104. [2023-12-15 20:40:51,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 87 states have (on average 1.3218390804597702) internal successors, (115), 88 states have internal predecessors, (115), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2023-12-15 20:40:51,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 143 transitions. [2023-12-15 20:40:51,377 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 143 transitions. Word has length 85 [2023-12-15 20:40:51,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:40:51,377 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 143 transitions. [2023-12-15 20:40:51,377 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-15 20:40:51,377 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 143 transitions. [2023-12-15 20:40:51,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2023-12-15 20:40:51,378 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:40:51,378 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:51,378 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-15 20:40:51,378 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:40:51,379 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:40:51,379 INFO L85 PathProgramCache]: Analyzing trace with hash 251563046, now seen corresponding path program 1 times [2023-12-15 20:40:51,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:40:51,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644589782] [2023-12-15 20:40:51,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:40:51,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:40:51,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:51,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:40:51,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:51,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:40:51,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:51,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:40:51,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:51,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:40:51,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:51,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:40:51,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:51,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-15 20:40:51,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:51,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-15 20:40:51,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:51,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-15 20:40:51,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:51,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-15 20:40:51,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:51,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-15 20:40:51,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:51,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-15 20:40:51,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:51,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-15 20:40:51,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:51,465 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-15 20:40:51,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:40:51,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644589782] [2023-12-15 20:40:51,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644589782] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:40:51,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:40:51,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-15 20:40:51,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287852498] [2023-12-15 20:40:51,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:40:51,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-15 20:40:51,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:40:51,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-15 20:40:51,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-15 20:40:51,468 INFO L87 Difference]: Start difference. First operand 104 states and 143 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-15 20:40:51,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:40:51,492 INFO L93 Difference]: Finished difference Result 210 states and 287 transitions. [2023-12-15 20:40:51,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-15 20:40:51,493 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 85 [2023-12-15 20:40:51,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:40:51,493 INFO L225 Difference]: With dead ends: 210 [2023-12-15 20:40:51,493 INFO L226 Difference]: Without dead ends: 107 [2023-12-15 20:40:51,494 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-15 20:40:51,495 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 26 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 20:40:51,495 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 219 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 20:40:51,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2023-12-15 20:40:51,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 104. [2023-12-15 20:40:51,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 87 states have (on average 1.2988505747126438) internal successors, (113), 88 states have internal predecessors, (113), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2023-12-15 20:40:51,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 141 transitions. [2023-12-15 20:40:51,507 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 141 transitions. Word has length 85 [2023-12-15 20:40:51,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:40:51,508 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 141 transitions. [2023-12-15 20:40:51,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-15 20:40:51,508 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 141 transitions. [2023-12-15 20:40:51,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2023-12-15 20:40:51,509 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:40:51,510 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:51,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-15 20:40:51,510 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:40:51,510 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:40:51,510 INFO L85 PathProgramCache]: Analyzing trace with hash -745219659, now seen corresponding path program 1 times [2023-12-15 20:40:51,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:40:51,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676720758] [2023-12-15 20:40:51,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:40:51,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:40:51,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:51,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:40:51,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:51,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:40:51,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:51,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:40:51,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:51,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:40:51,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:51,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:40:51,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:51,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-15 20:40:51,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:51,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-15 20:40:51,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:51,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-15 20:40:51,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:51,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-15 20:40:51,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:51,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-15 20:40:51,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:51,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-15 20:40:51,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:51,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-15 20:40:51,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:51,558 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-15 20:40:51,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:40:51,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676720758] [2023-12-15 20:40:51,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676720758] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:40:51,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:40:51,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 20:40:51,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397109428] [2023-12-15 20:40:51,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:40:51,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 20:40:51,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:40:51,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 20:40:51,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 20:40:51,569 INFO L87 Difference]: Start difference. First operand 104 states and 141 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-15 20:40:51,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:40:51,594 INFO L93 Difference]: Finished difference Result 207 states and 281 transitions. [2023-12-15 20:40:51,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 20:40:51,595 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 88 [2023-12-15 20:40:51,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:40:51,596 INFO L225 Difference]: With dead ends: 207 [2023-12-15 20:40:51,596 INFO L226 Difference]: Without dead ends: 104 [2023-12-15 20:40:51,597 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 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:40:51,597 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 5 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 103 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:40:51,598 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 103 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 20:40:51,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2023-12-15 20:40:51,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2023-12-15 20:40:51,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 87 states have (on average 1.2528735632183907) internal successors, (109), 88 states have internal predecessors, (109), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2023-12-15 20:40:51,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 137 transitions. [2023-12-15 20:40:51,603 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 137 transitions. Word has length 88 [2023-12-15 20:40:51,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:40:51,604 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 137 transitions. [2023-12-15 20:40:51,604 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-15 20:40:51,604 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 137 transitions. [2023-12-15 20:40:51,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2023-12-15 20:40:51,605 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:40:51,606 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:51,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-15 20:40:51,606 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:40:51,606 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:40:51,606 INFO L85 PathProgramCache]: Analyzing trace with hash -1647609509, now seen corresponding path program 1 times [2023-12-15 20:40:51,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:40:51,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360476257] [2023-12-15 20:40:51,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:40:51,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:40:51,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:51,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:40:51,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:51,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:40:51,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:51,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:40:51,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:51,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:40:51,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:51,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:40:51,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:51,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-15 20:40:51,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:51,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-15 20:40:51,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:51,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-15 20:40:51,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:51,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-15 20:40:51,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:51,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-15 20:40:51,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:51,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-15 20:40:51,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:51,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-15 20:40:51,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:51,766 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 9 proven. 24 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2023-12-15 20:40:51,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:40:51,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360476257] [2023-12-15 20:40:51,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360476257] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 20:40:51,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1728131518] [2023-12-15 20:40:51,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:40:51,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 20:40:51,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 20:40:51,769 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:40:51,801 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:40:51,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:51,852 INFO L262 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-15 20:40:51,859 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 20:40:51,987 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 113 proven. 24 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2023-12-15 20:40:51,987 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 20:40:52,486 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 9 proven. 24 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2023-12-15 20:40:52,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1728131518] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-15 20:40:52,486 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-15 20:40:52,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 9] total 14 [2023-12-15 20:40:52,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94577121] [2023-12-15 20:40:52,487 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-15 20:40:52,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-15 20:40:52,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:40:52,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-15 20:40:52,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2023-12-15 20:40:52,488 INFO L87 Difference]: Start difference. First operand 104 states and 137 transitions. Second operand has 14 states, 14 states have (on average 4.5) internal successors, (63), 14 states have internal predecessors, (63), 3 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (29), 3 states have call predecessors, (29), 3 states have call successors, (29) [2023-12-15 20:40:54,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:40:54,326 INFO L93 Difference]: Finished difference Result 262 states and 328 transitions. [2023-12-15 20:40:54,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-12-15 20:40:54,326 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.5) internal successors, (63), 14 states have internal predecessors, (63), 3 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (29), 3 states have call predecessors, (29), 3 states have call successors, (29) Word has length 90 [2023-12-15 20:40:54,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:40:54,327 INFO L225 Difference]: With dead ends: 262 [2023-12-15 20:40:54,327 INFO L226 Difference]: Without dead ends: 153 [2023-12-15 20:40:54,328 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 197 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=242, Invalid=688, Unknown=0, NotChecked=0, Total=930 [2023-12-15 20:40:54,328 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 143 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 601 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 601 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-15 20:40:54,328 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 239 Invalid, 624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 601 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-15 20:40:54,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2023-12-15 20:40:54,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 100. [2023-12-15 20:40:54,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 82 states have (on average 1.1829268292682926) internal successors, (97), 83 states have internal predecessors, (97), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2023-12-15 20:40:54,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 125 transitions. [2023-12-15 20:40:54,337 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 125 transitions. Word has length 90 [2023-12-15 20:40:54,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:40:54,337 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 125 transitions. [2023-12-15 20:40:54,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.5) internal successors, (63), 14 states have internal predecessors, (63), 3 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (29), 3 states have call predecessors, (29), 3 states have call successors, (29) [2023-12-15 20:40:54,337 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 125 transitions. [2023-12-15 20:40:54,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2023-12-15 20:40:54,338 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:40:54,338 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:54,347 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-12-15 20:40:54,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-12-15 20:40:54,543 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:40:54,543 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:40:54,543 INFO L85 PathProgramCache]: Analyzing trace with hash 1545220059, now seen corresponding path program 1 times [2023-12-15 20:40:54,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:40:54,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352029411] [2023-12-15 20:40:54,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:40:54,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:40:54,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:54,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:40:54,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:54,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:40:54,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:54,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:40:54,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:54,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:40:54,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:54,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:40:54,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:54,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-15 20:40:54,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:54,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-15 20:40:54,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:54,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-15 20:40:54,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:54,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-15 20:40:54,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:54,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-15 20:40:54,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:54,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-15 20:40:54,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:54,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-15 20:40:54,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:54,822 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 6 proven. 27 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2023-12-15 20:40:54,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:40:54,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352029411] [2023-12-15 20:40:54,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352029411] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 20:40:54,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1911971838] [2023-12-15 20:40:54,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:40:54,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 20:40:54,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 20:40:54,824 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:40:54,850 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:40:54,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:54,888 INFO L262 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-15 20:40:54,890 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 20:40:55,032 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 87 proven. 27 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2023-12-15 20:40:55,032 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 20:40:55,192 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 6 proven. 27 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2023-12-15 20:40:55,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1911971838] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-15 20:40:55,192 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-15 20:40:55,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 22 [2023-12-15 20:40:55,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272808229] [2023-12-15 20:40:55,193 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-15 20:40:55,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-12-15 20:40:55,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:40:55,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-12-15 20:40:55,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=382, Unknown=0, NotChecked=0, Total=462 [2023-12-15 20:40:55,194 INFO L87 Difference]: Start difference. First operand 100 states and 125 transitions. Second operand has 22 states, 22 states have (on average 2.9545454545454546) internal successors, (65), 22 states have internal predecessors, (65), 3 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 3 states have call predecessors, (31), 3 states have call successors, (31) [2023-12-15 20:40:55,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:40:55,838 INFO L93 Difference]: Finished difference Result 211 states and 259 transitions. [2023-12-15 20:40:55,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-12-15 20:40:55,838 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.9545454545454546) internal successors, (65), 22 states have internal predecessors, (65), 3 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 3 states have call predecessors, (31), 3 states have call successors, (31) Word has length 90 [2023-12-15 20:40:55,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:40:55,839 INFO L225 Difference]: With dead ends: 211 [2023-12-15 20:40:55,839 INFO L226 Difference]: Without dead ends: 112 [2023-12-15 20:40:55,840 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 192 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=302, Invalid=1180, Unknown=0, NotChecked=0, Total=1482 [2023-12-15 20:40:55,840 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 302 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 556 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 556 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-15 20:40:55,840 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [304 Valid, 243 Invalid, 579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 556 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-15 20:40:55,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2023-12-15 20:40:55,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 104. [2023-12-15 20:40:55,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 85 states have (on average 1.1529411764705881) internal successors, (98), 86 states have internal predecessors, (98), 14 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2023-12-15 20:40:55,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 126 transitions. [2023-12-15 20:40:55,848 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 126 transitions. Word has length 90 [2023-12-15 20:40:55,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:40:55,848 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 126 transitions. [2023-12-15 20:40:55,848 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.9545454545454546) internal successors, (65), 22 states have internal predecessors, (65), 3 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 3 states have call predecessors, (31), 3 states have call successors, (31) [2023-12-15 20:40:55,848 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 126 transitions. [2023-12-15 20:40:55,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2023-12-15 20:40:55,849 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:40:55,849 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:55,858 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-12-15 20:40:56,058 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-12-15 20:40:56,058 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:40:56,058 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:40:56,059 INFO L85 PathProgramCache]: Analyzing trace with hash 958414045, now seen corresponding path program 1 times [2023-12-15 20:40:56,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:40:56,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086996362] [2023-12-15 20:40:56,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:40:56,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:40:56,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-15 20:40:56,085 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-15 20:40:56,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-15 20:40:56,129 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-15 20:40:56,129 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-15 20:40:56,130 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-15 20:40:56,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-15 20:40:56,133 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 20:40:56,135 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-15 20:40:56,182 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.12 08:40:56 BoogieIcfgContainer [2023-12-15 20:40:56,182 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-15 20:40:56,183 INFO L158 Benchmark]: Toolchain (without parser) took 13962.02ms. Allocated memory was 198.2MB in the beginning and 562.0MB in the end (delta: 363.9MB). Free memory was 153.9MB in the beginning and 455.4MB in the end (delta: -301.5MB). Peak memory consumption was 64.0MB. Max. memory is 8.0GB. [2023-12-15 20:40:56,183 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 198.2MB. Free memory is still 144.7MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-15 20:40:56,183 INFO L158 Benchmark]: CACSL2BoogieTranslator took 174.30ms. Allocated memory is still 198.2MB. Free memory was 153.6MB in the beginning and 140.5MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-15 20:40:56,183 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.47ms. Allocated memory is still 198.2MB. Free memory was 140.5MB in the beginning and 137.5MB in the end (delta: 3.0MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-15 20:40:56,183 INFO L158 Benchmark]: Boogie Preprocessor took 35.21ms. Allocated memory is still 198.2MB. Free memory was 137.5MB in the beginning and 134.0MB in the end (delta: 3.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-15 20:40:56,183 INFO L158 Benchmark]: RCFGBuilder took 316.03ms. Allocated memory is still 198.2MB. Free memory was 133.6MB in the beginning and 115.1MB in the end (delta: 18.5MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2023-12-15 20:40:56,184 INFO L158 Benchmark]: TraceAbstraction took 13396.31ms. Allocated memory was 198.2MB in the beginning and 562.0MB in the end (delta: 363.9MB). Free memory was 114.4MB in the beginning and 455.4MB in the end (delta: -341.0MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. [2023-12-15 20:40:56,184 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 198.2MB. Free memory is still 144.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 174.30ms. Allocated memory is still 198.2MB. Free memory was 153.6MB in the beginning and 140.5MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 34.47ms. Allocated memory is still 198.2MB. Free memory was 140.5MB in the beginning and 137.5MB in the end (delta: 3.0MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 35.21ms. Allocated memory is still 198.2MB. Free memory was 137.5MB in the beginning and 134.0MB in the end (delta: 3.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 316.03ms. Allocated memory is still 198.2MB. Free memory was 133.6MB in the beginning and 115.1MB in the end (delta: 18.5MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * TraceAbstraction took 13396.31ms. Allocated memory was 198.2MB in the beginning and 562.0MB in the end (delta: 363.9MB). Free memory was 114.4MB in the beginning and 455.4MB in the end (delta: -341.0MB). Peak memory consumption was 24.1MB. 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 someBinaryDOUBLEComparisonOperation at line 85, overapproximation of someBinaryArithmeticDOUBLEoperation at line 57. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 0; [L23] unsigned char var_1_2 = 0; [L24] unsigned short int var_1_4 = 19138; [L25] signed char var_1_6 = 25; [L26] signed long int var_1_7 = -50; [L27] double var_1_8 = 8.3; [L28] double var_1_9 = 255.6; [L29] double var_1_10 = 10000000.375; [L30] double var_1_11 = 0.0; [L31] double var_1_12 = 255.375; [L32] unsigned char var_1_13 = 50; [L33] unsigned char var_1_14 = 2; [L34] signed char var_1_15 = 1; [L35] signed char var_1_16 = 5; [L89] isInitial = 1 [L90] FCALL initially() [L91] COND TRUE 1 [L92] FCALL updateLastVariables() [L93] CALL updateVariables() [L61] var_1_2 = __VERIFIER_nondet_uchar() [L62] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=80000003/8, var_1_11=0, var_1_12=2043/8, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_4=19138, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=1278/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=80000003/8, var_1_11=0, var_1_12=2043/8, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_4=19138, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=1278/5] [L62] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=80000003/8, var_1_11=0, var_1_12=2043/8, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_4=19138, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=1278/5] [L63] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=80000003/8, var_1_11=0, var_1_12=2043/8, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=19138, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=1278/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=80000003/8, var_1_11=0, var_1_12=2043/8, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=19138, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=1278/5] [L63] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=80000003/8, var_1_11=0, var_1_12=2043/8, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=19138, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=1278/5] [L64] var_1_4 = __VERIFIER_nondet_ushort() [L65] CALL assume_abort_if_not(var_1_4 >= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=80000003/8, var_1_11=0, var_1_12=2043/8, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=1278/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=80000003/8, var_1_11=0, var_1_12=2043/8, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=1278/5] [L65] RET assume_abort_if_not(var_1_4 >= 16383) VAL [isInitial=1, var_1_10=80000003/8, var_1_11=0, var_1_12=2043/8, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=1278/5] [L66] CALL assume_abort_if_not(var_1_4 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=80000003/8, var_1_11=0, var_1_12=2043/8, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=1278/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=80000003/8, var_1_11=0, var_1_12=2043/8, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=1278/5] [L66] RET assume_abort_if_not(var_1_4 <= 32767) VAL [isInitial=1, var_1_10=80000003/8, var_1_11=0, var_1_12=2043/8, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=1278/5] [L67] var_1_9 = __VERIFIER_nondet_double() [L68] CALL assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=80000003/8, var_1_11=0, var_1_12=2043/8, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=80000003/8, var_1_11=0, var_1_12=2043/8, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L68] RET assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=80000003/8, var_1_11=0, var_1_12=2043/8, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L69] var_1_10 = __VERIFIER_nondet_double() [L70] CALL assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=2043/8, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_11=0, var_1_12=2043/8, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L70] RET assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=0, var_1_12=2043/8, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L71] var_1_11 = __VERIFIER_nondet_double() [L72] CALL assume_abort_if_not((var_1_11 >= 4611686.018427382800e+12F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_12=2043/8, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_12=2043/8, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L72] RET assume_abort_if_not((var_1_11 >= 4611686.018427382800e+12F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, var_1_12=2043/8, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L73] var_1_12 = __VERIFIER_nondet_double() [L74] CALL assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L74] RET assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L75] var_1_14 = __VERIFIER_nondet_uchar() [L76] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=50, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_13=50, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L76] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, var_1_13=50, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L77] CALL assume_abort_if_not(var_1_14 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_13=50, var_1_14=0, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_13=50, var_1_14=0, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L77] RET assume_abort_if_not(var_1_14 <= 254) VAL [isInitial=1, var_1_13=50, var_1_14=0, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L78] var_1_16 = __VERIFIER_nondet_char() [L79] CALL assume_abort_if_not(var_1_16 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_13=50, var_1_14=0, var_1_15=1, var_1_16=-127, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_13=50, var_1_14=0, var_1_15=1, var_1_16=-127, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L79] RET assume_abort_if_not(var_1_16 >= -127) VAL [isInitial=1, var_1_13=50, var_1_14=0, var_1_15=1, var_1_16=-127, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L80] CALL assume_abort_if_not(var_1_16 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_13=50, var_1_14=0, var_1_15=1, var_1_16=-127, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_13=50, var_1_14=0, var_1_15=1, var_1_16=-127, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L80] RET assume_abort_if_not(var_1_16 <= 126) VAL [isInitial=1, var_1_13=50, var_1_14=0, var_1_15=1, var_1_16=-127, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L93] RET updateVariables() [L94] CALL step() [L39] var_1_13 = var_1_14 [L40] var_1_15 = var_1_16 VAL [isInitial=1, var_1_13=0, var_1_14=0, var_1_15=-127, var_1_16=-127, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L41] COND TRUE \read(var_1_2) [L42] var_1_1 = ((17222 - var_1_13) + (((((29916) < (var_1_4)) ? (29916) : (var_1_4))) - var_1_13)) VAL [isInitial=1, var_1_13=0, var_1_14=0, var_1_15=-127, var_1_16=-127, var_1_1=33605, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L44] COND FALSE !(var_1_2 && (var_1_4 >= (var_1_13 + var_1_1))) VAL [isInitial=1, var_1_13=0, var_1_14=0, var_1_15=-127, var_1_16=-127, var_1_1=33605, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L47] unsigned short int stepLocal_0 = var_1_4; VAL [isInitial=1, stepLocal_0=16383, var_1_13=0, var_1_14=0, var_1_15=-127, var_1_16=-127, var_1_1=33605, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L48] EXPR var_1_13 << var_1_13 VAL [isInitial=1, stepLocal_0=16383, var_1_13=0, var_1_14=0, var_1_15=-127, var_1_16=-127, var_1_1=33605, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L48] EXPR ((var_1_13) > ((var_1_13 << var_1_13))) ? (var_1_13) : ((var_1_13 << var_1_13)) VAL [isInitial=1, stepLocal_0=16383, var_1_13=0, var_1_14=0, var_1_15=-127, var_1_16=-127, var_1_1=33605, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L48] EXPR var_1_13 << var_1_13 VAL [isInitial=1, stepLocal_0=16383, var_1_13=0, var_1_14=0, var_1_15=-127, var_1_16=-127, var_1_1=33605, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L48] EXPR ((var_1_13) > ((var_1_13 << var_1_13))) ? (var_1_13) : ((var_1_13 << var_1_13)) VAL [isInitial=1, stepLocal_0=16383, var_1_13=0, var_1_14=0, var_1_15=-127, var_1_16=-127, var_1_1=33605, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L48] COND FALSE !(stepLocal_0 <= ((((var_1_13) > ((var_1_13 << var_1_13))) ? (var_1_13) : ((var_1_13 << var_1_13))))) [L51] var_1_7 = (var_1_13 + (var_1_1 + var_1_4)) VAL [isInitial=1, stepLocal_0=16383, var_1_13=0, var_1_14=0, var_1_15=-127, var_1_16=-127, var_1_1=33605, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=49988, var_1_8=83/10] [L53] unsigned char stepLocal_1 = var_1_13; VAL [isInitial=1, stepLocal_0=16383, stepLocal_1=0, var_1_13=0, var_1_14=0, var_1_15=-127, var_1_16=-127, var_1_1=33605, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=49988, var_1_8=83/10] [L54] COND FALSE !(var_1_13 < stepLocal_1) [L57] var_1_8 = ((var_1_11 - var_1_12) - var_1_9) VAL [isInitial=1, stepLocal_0=16383, stepLocal_1=0, var_1_13=0, var_1_14=0, var_1_15=-127, var_1_16=-127, var_1_1=33605, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=49988] [L94] RET step() [L95] CALL, EXPR property() [L85] EXPR ((var_1_2 ? (var_1_1 == ((unsigned short int) ((17222 - var_1_13) + (((((29916) < (var_1_4)) ? (29916) : (var_1_4))) - var_1_13)))) : 1) && ((var_1_2 && (var_1_4 >= (var_1_13 + var_1_1))) ? (var_1_6 == ((signed char) 8)) : 1)) && ((var_1_4 <= ((((var_1_13) > ((var_1_13 << var_1_13))) ? (var_1_13) : ((var_1_13 << var_1_13))))) ? (var_1_7 == ((signed long int) (((((var_1_13 - var_1_13)) < (var_1_4)) ? ((var_1_13 - var_1_13)) : (var_1_4))))) : (var_1_7 == ((signed long int) (var_1_13 + (var_1_1 + var_1_4))))) VAL [isInitial=1, var_1_13=0, var_1_14=0, var_1_15=-127, var_1_16=-127, var_1_1=33605, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=49988] [L85] EXPR var_1_13 << var_1_13 VAL [isInitial=1, var_1_13=0, var_1_14=0, var_1_15=-127, var_1_16=-127, var_1_1=33605, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=49988] [L85] EXPR ((var_1_13) > ((var_1_13 << var_1_13))) ? (var_1_13) : ((var_1_13 << var_1_13)) VAL [isInitial=1, var_1_13=0, var_1_14=0, var_1_15=-127, var_1_16=-127, var_1_1=33605, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=49988] [L85] EXPR var_1_13 << var_1_13 VAL [isInitial=1, var_1_13=0, var_1_14=0, var_1_15=-127, var_1_16=-127, var_1_1=33605, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=49988] [L85] EXPR ((var_1_13) > ((var_1_13 << var_1_13))) ? (var_1_13) : ((var_1_13 << var_1_13)) VAL [isInitial=1, var_1_13=0, var_1_14=0, var_1_15=-127, var_1_16=-127, var_1_1=33605, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=49988] [L85] EXPR ((var_1_2 ? (var_1_1 == ((unsigned short int) ((17222 - var_1_13) + (((((29916) < (var_1_4)) ? (29916) : (var_1_4))) - var_1_13)))) : 1) && ((var_1_2 && (var_1_4 >= (var_1_13 + var_1_1))) ? (var_1_6 == ((signed char) 8)) : 1)) && ((var_1_4 <= ((((var_1_13) > ((var_1_13 << var_1_13))) ? (var_1_13) : ((var_1_13 << var_1_13))))) ? (var_1_7 == ((signed long int) (((((var_1_13 - var_1_13)) < (var_1_4)) ? ((var_1_13 - var_1_13)) : (var_1_4))))) : (var_1_7 == ((signed long int) (var_1_13 + (var_1_1 + var_1_4))))) VAL [isInitial=1, var_1_13=0, var_1_14=0, var_1_15=-127, var_1_16=-127, var_1_1=33605, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=49988] [L85-L86] return (((((var_1_2 ? (var_1_1 == ((unsigned short int) ((17222 - var_1_13) + (((((29916) < (var_1_4)) ? (29916) : (var_1_4))) - var_1_13)))) : 1) && ((var_1_2 && (var_1_4 >= (var_1_13 + var_1_1))) ? (var_1_6 == ((signed char) 8)) : 1)) && ((var_1_4 <= ((((var_1_13) > ((var_1_13 << var_1_13))) ? (var_1_13) : ((var_1_13 << var_1_13))))) ? (var_1_7 == ((signed long int) (((((var_1_13 - var_1_13)) < (var_1_4)) ? ((var_1_13 - var_1_13)) : (var_1_4))))) : (var_1_7 == ((signed long int) (var_1_13 + (var_1_1 + var_1_4)))))) && ((var_1_13 < var_1_13) ? (var_1_8 == ((double) (var_1_9 - var_1_10))) : (var_1_8 == ((double) ((var_1_11 - var_1_12) - var_1_9))))) && (var_1_13 == ((unsigned char) var_1_14))) && (var_1_15 == ((signed char) var_1_16)) ; [L95] RET, EXPR property() [L95] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, var_1_13=0, var_1_14=0, var_1_15=-127, var_1_16=-127, var_1_1=33605, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=49988] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, var_1_13=0, var_1_14=0, var_1_15=-127, var_1_16=-127, var_1_1=33605, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=49988] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 50 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 13.3s, OverallIterations: 13, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 921 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 917 mSDsluCounter, 2074 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1343 mSDsCounter, 66 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1955 IncrementalHoareTripleChecker+Invalid, 2021 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 66 mSolverCounterUnsat, 731 mSDtfsCounter, 1955 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 772 GetRequests, 665 SyntacticMatches, 2 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 393 ImplicationChecksByTransitivity, 3.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=114occurred in iteration=5, InterpolantAutomatonStates: 97, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 195 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 7.4s InterpolantComputationTime, 1299 NumberOfCodeBlocks, 1299 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 1373 ConstructedInterpolants, 0 QuantifiedInterpolants, 8428 SizeOfPredicates, 9 NumberOfNonLiveVariables, 447 ConjunctsInSsa, 27 ConjunctsInUnsatCore, 16 InterpolantComputations, 10 PerfectInterpolantSequences, 4071/4224 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:40:56,205 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...