/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_operatoramount_amount50_file-97.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-19 14:45:29,203 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-19 14:45:29,267 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-19 14:45:29,270 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-19 14:45:29,270 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-19 14:45:29,290 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-19 14:45:29,290 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-19 14:45:29,291 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-19 14:45:29,291 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-19 14:45:29,294 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-19 14:45:29,294 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-19 14:45:29,295 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-19 14:45:29,295 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-19 14:45:29,296 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-19 14:45:29,296 INFO L153 SettingsManager]: * Use SBE=true [2023-12-19 14:45:29,296 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-19 14:45:29,296 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-19 14:45:29,296 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-19 14:45:29,297 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-19 14:45:29,297 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-19 14:45:29,297 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-19 14:45:29,297 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-19 14:45:29,298 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-19 14:45:29,298 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-19 14:45:29,298 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-19 14:45:29,298 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-19 14:45:29,298 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-19 14:45:29,298 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-19 14:45:29,299 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-19 14:45:29,299 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-19 14:45:29,299 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-19 14:45:29,300 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-19 14:45:29,300 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-19 14:45:29,300 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-19 14:45:29,300 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-19 14:45:29,300 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-19 14:45:29,300 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-19 14:45:29,300 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-19 14:45:29,301 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-19 14:45:29,301 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-19 14:45:29,301 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-19 14:45:29,301 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-19 14:45:29,301 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-19 14:45:29,301 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-19 14:45:29,454 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-19 14:45:29,467 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-19 14:45:29,469 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-19 14:45:29,469 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-19 14:45:29,470 INFO L274 PluginConnector]: CDTParser initialized [2023-12-19 14:45:29,470 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount50_file-97.i [2023-12-19 14:45:30,525 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-19 14:45:30,680 INFO L384 CDTParser]: Found 1 translation units. [2023-12-19 14:45:30,680 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount50_file-97.i [2023-12-19 14:45:30,688 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/928e1c984/918dd499c53a4256ae23da2ff092bf5b/FLAG84236abb1 [2023-12-19 14:45:30,699 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/928e1c984/918dd499c53a4256ae23da2ff092bf5b [2023-12-19 14:45:30,701 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-19 14:45:30,702 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-19 14:45:30,703 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-19 14:45:30,704 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-19 14:45:30,707 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-19 14:45:30,707 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 02:45:30" (1/1) ... [2023-12-19 14:45:30,708 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ccda0db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:45:30, skipping insertion in model container [2023-12-19 14:45:30,708 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 02:45:30" (1/1) ... [2023-12-19 14:45:30,726 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-19 14:45:30,816 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_operatoramount_amount50_file-97.i[915,928] [2023-12-19 14:45:30,872 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-19 14:45:30,879 INFO L202 MainTranslator]: Completed pre-run [2023-12-19 14:45:30,887 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_operatoramount_amount50_file-97.i[915,928] [2023-12-19 14:45:30,906 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-19 14:45:30,916 INFO L206 MainTranslator]: Completed translation [2023-12-19 14:45:30,916 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:45:30 WrapperNode [2023-12-19 14:45:30,916 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-19 14:45:30,917 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-19 14:45:30,917 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-19 14:45:30,917 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-19 14:45:30,922 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:45:30" (1/1) ... [2023-12-19 14:45:30,929 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:45:30" (1/1) ... [2023-12-19 14:45:30,989 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 191 [2023-12-19 14:45:30,989 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-19 14:45:30,990 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-19 14:45:30,990 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-19 14:45:30,990 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-19 14:45:31,010 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:45:30" (1/1) ... [2023-12-19 14:45:31,010 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:45:30" (1/1) ... [2023-12-19 14:45:31,014 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:45:30" (1/1) ... [2023-12-19 14:45:31,025 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-19 14:45:31,025 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:45:30" (1/1) ... [2023-12-19 14:45:31,025 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:45:30" (1/1) ... [2023-12-19 14:45:31,041 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:45:30" (1/1) ... [2023-12-19 14:45:31,043 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:45:30" (1/1) ... [2023-12-19 14:45:31,045 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:45:30" (1/1) ... [2023-12-19 14:45:31,046 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:45:30" (1/1) ... [2023-12-19 14:45:31,049 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-19 14:45:31,050 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-19 14:45:31,050 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-19 14:45:31,050 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-19 14:45:31,050 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:45:30" (1/1) ... [2023-12-19 14:45:31,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-19 14:45:31,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 14:45:31,078 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-19 14:45:31,095 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-19 14:45:31,110 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-19 14:45:31,110 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-19 14:45:31,110 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-19 14:45:31,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-19 14:45:31,110 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-19 14:45:31,110 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-19 14:45:31,191 INFO L241 CfgBuilder]: Building ICFG [2023-12-19 14:45:31,195 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-19 14:45:31,465 INFO L282 CfgBuilder]: Performing block encoding [2023-12-19 14:45:31,483 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-19 14:45:31,483 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-19 14:45:31,483 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 02:45:31 BoogieIcfgContainer [2023-12-19 14:45:31,483 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-19 14:45:31,485 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-19 14:45:31,485 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-19 14:45:31,487 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-19 14:45:31,487 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.12 02:45:30" (1/3) ... [2023-12-19 14:45:31,487 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34f9ffb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 02:45:31, skipping insertion in model container [2023-12-19 14:45:31,487 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:45:30" (2/3) ... [2023-12-19 14:45:31,487 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34f9ffb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 02:45:31, skipping insertion in model container [2023-12-19 14:45:31,488 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 02:45:31" (3/3) ... [2023-12-19 14:45:31,495 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount50_file-97.i [2023-12-19 14:45:31,506 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-19 14:45:31,506 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-19 14:45:31,547 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-19 14:45:31,552 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;@79e88895, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-19 14:45:31,552 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-19 14:45:31,555 INFO L276 IsEmpty]: Start isEmpty. Operand has 72 states, 53 states have (on average 1.528301886792453) internal successors, (81), 54 states have internal predecessors, (81), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-19 14:45:31,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-12-19 14:45:31,574 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 14:45:31,575 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 14:45:31,575 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 14:45:31,584 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 14:45:31,584 INFO L85 PathProgramCache]: Analyzing trace with hash -1106822011, now seen corresponding path program 1 times [2023-12-19 14:45:31,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 14:45:31,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700300524] [2023-12-19 14:45:31,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 14:45:31,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 14:45:31,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:45:31,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 14:45:31,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:45:31,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 14:45:31,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:45:31,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 14:45:31,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:45:31,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 14:45:31,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:45:31,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-19 14:45:31,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:45:31,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-19 14:45:31,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:45:31,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-19 14:45:31,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:45:31,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-19 14:45:31,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:45:31,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 14:45:31,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:45:31,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-12-19 14:45:31,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:45:31,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-19 14:45:31,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:45:31,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-12-19 14:45:31,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:45:31,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-19 14:45:31,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:45:31,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 14:45:31,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:45:31,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 14:45:31,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:45:31,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-12-19 14:45:31,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:45:31,838 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-19 14:45:31,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 14:45:31,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700300524] [2023-12-19 14:45:31,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700300524] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 14:45:31,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 14:45:31,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-19 14:45:31,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778929069] [2023-12-19 14:45:31,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 14:45:31,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-19 14:45:31,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 14:45:31,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-19 14:45:31,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-19 14:45:31,867 INFO L87 Difference]: Start difference. First operand has 72 states, 53 states have (on average 1.528301886792453) internal successors, (81), 54 states have internal predecessors, (81), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2023-12-19 14:45:31,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 14:45:31,911 INFO L93 Difference]: Finished difference Result 141 states and 240 transitions. [2023-12-19 14:45:31,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-19 14:45:31,912 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 107 [2023-12-19 14:45:31,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 14:45:31,917 INFO L225 Difference]: With dead ends: 141 [2023-12-19 14:45:31,917 INFO L226 Difference]: Without dead ends: 70 [2023-12-19 14:45:31,920 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-19 14:45:31,922 INFO L413 NwaCegarLoop]: 105 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, 105 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-19 14:45:31,922 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 105 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 14:45:31,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2023-12-19 14:45:31,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2023-12-19 14:45:31,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 52 states have (on average 1.4615384615384615) internal successors, (76), 52 states have internal predecessors, (76), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-19 14:45:31,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 108 transitions. [2023-12-19 14:45:31,963 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 108 transitions. Word has length 107 [2023-12-19 14:45:31,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 14:45:31,964 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 108 transitions. [2023-12-19 14:45:31,964 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2023-12-19 14:45:31,964 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 108 transitions. [2023-12-19 14:45:31,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-12-19 14:45:31,966 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 14:45:31,967 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 14:45:31,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-19 14:45:31,967 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 14:45:31,967 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 14:45:31,967 INFO L85 PathProgramCache]: Analyzing trace with hash -695930423, now seen corresponding path program 1 times [2023-12-19 14:45:31,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 14:45:31,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870235516] [2023-12-19 14:45:31,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 14:45:31,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 14:45:32,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:45:32,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 14:45:32,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:45:32,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 14:45:32,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:45:32,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 14:45:32,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:45:32,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 14:45:32,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:45:32,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-19 14:45:32,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:45:32,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-19 14:45:32,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:45:32,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-19 14:45:32,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:45:32,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-19 14:45:32,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:45:32,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 14:45:32,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:45:32,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-12-19 14:45:32,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:45:32,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-19 14:45:32,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:45:32,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-12-19 14:45:32,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:45:32,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-19 14:45:32,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:45:32,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 14:45:32,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:45:32,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 14:45:32,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:45:32,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-12-19 14:45:32,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:45:32,180 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-19 14:45:32,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 14:45:32,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870235516] [2023-12-19 14:45:32,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870235516] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 14:45:32,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 14:45:32,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-19 14:45:32,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464946642] [2023-12-19 14:45:32,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 14:45:32,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-19 14:45:32,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 14:45:32,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-19 14:45:32,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-19 14:45:32,183 INFO L87 Difference]: Start difference. First operand 70 states and 108 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-19 14:45:32,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 14:45:32,264 INFO L93 Difference]: Finished difference Result 197 states and 302 transitions. [2023-12-19 14:45:32,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-19 14:45:32,264 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 107 [2023-12-19 14:45:32,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 14:45:32,269 INFO L225 Difference]: With dead ends: 197 [2023-12-19 14:45:32,269 INFO L226 Difference]: Without dead ends: 128 [2023-12-19 14:45:32,271 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-19 14:45:32,273 INFO L413 NwaCegarLoop]: 176 mSDtfsCounter, 95 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 14:45:32,274 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 248 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 14:45:32,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2023-12-19 14:45:32,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 90. [2023-12-19 14:45:32,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 72 states have (on average 1.4444444444444444) internal successors, (104), 72 states have internal predecessors, (104), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-19 14:45:32,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 136 transitions. [2023-12-19 14:45:32,291 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 136 transitions. Word has length 107 [2023-12-19 14:45:32,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 14:45:32,293 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 136 transitions. [2023-12-19 14:45:32,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-19 14:45:32,294 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 136 transitions. [2023-12-19 14:45:32,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-12-19 14:45:32,298 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 14:45:32,298 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 14:45:32,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-19 14:45:32,298 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 14:45:32,299 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 14:45:32,299 INFO L85 PathProgramCache]: Analyzing trace with hash -1707047673, now seen corresponding path program 1 times [2023-12-19 14:45:32,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 14:45:32,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529673197] [2023-12-19 14:45:32,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 14:45:32,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 14:45:32,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:45:32,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 14:45:32,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:45:32,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 14:45:32,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:45:32,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 14:45:32,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:45:32,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 14:45:32,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:45:32,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-19 14:45:32,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:45:32,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-19 14:45:32,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:45:32,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-19 14:45:32,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:45:32,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-19 14:45:32,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:45:32,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 14:45:32,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:45:32,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-12-19 14:45:32,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:45:32,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-19 14:45:32,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:45:32,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-12-19 14:45:32,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:45:32,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-19 14:45:32,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:45:32,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 14:45:32,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:45:32,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 14:45:32,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:45:32,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-12-19 14:45:32,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:45:32,682 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-19 14:45:32,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 14:45:32,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529673197] [2023-12-19 14:45:32,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529673197] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 14:45:32,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 14:45:32,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-19 14:45:32,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751078942] [2023-12-19 14:45:32,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 14:45:32,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-19 14:45:32,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 14:45:32,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-19 14:45:32,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-19 14:45:32,688 INFO L87 Difference]: Start difference. First operand 90 states and 136 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-19 14:45:32,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 14:45:32,893 INFO L93 Difference]: Finished difference Result 296 states and 448 transitions. [2023-12-19 14:45:32,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-19 14:45:32,893 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 107 [2023-12-19 14:45:32,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 14:45:32,896 INFO L225 Difference]: With dead ends: 296 [2023-12-19 14:45:32,896 INFO L226 Difference]: Without dead ends: 207 [2023-12-19 14:45:32,897 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2023-12-19 14:45:32,900 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 131 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-19 14:45:32,901 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 328 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-19 14:45:32,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2023-12-19 14:45:32,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 173. [2023-12-19 14:45:32,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 138 states have (on average 1.4202898550724639) internal successors, (196), 138 states have internal predecessors, (196), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2023-12-19 14:45:32,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 260 transitions. [2023-12-19 14:45:32,929 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 260 transitions. Word has length 107 [2023-12-19 14:45:32,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 14:45:32,931 INFO L495 AbstractCegarLoop]: Abstraction has 173 states and 260 transitions. [2023-12-19 14:45:32,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-19 14:45:32,931 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 260 transitions. [2023-12-19 14:45:32,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-12-19 14:45:32,934 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 14:45:32,934 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 14:45:32,934 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-19 14:45:32,934 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 14:45:32,934 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 14:45:32,934 INFO L85 PathProgramCache]: Analyzing trace with hash 225979926, now seen corresponding path program 1 times [2023-12-19 14:45:32,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 14:45:32,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726783275] [2023-12-19 14:45:32,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 14:45:32,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 14:45:32,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:45:33,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 14:45:33,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:45:33,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 14:45:33,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:45:33,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 14:45:33,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:45:33,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 14:45:33,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:45:33,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-19 14:45:33,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:45:33,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-19 14:45:33,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:45:33,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-19 14:45:33,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:45:33,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-19 14:45:33,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:45:33,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 14:45:33,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:45:33,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-12-19 14:45:33,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:45:33,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-19 14:45:33,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:45:33,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-12-19 14:45:33,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:45:33,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-19 14:45:33,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:45:33,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 14:45:33,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:45:33,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 14:45:33,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:45:33,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-12-19 14:45:33,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:45:33,337 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-19 14:45:33,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 14:45:33,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726783275] [2023-12-19 14:45:33,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726783275] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 14:45:33,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 14:45:33,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-19 14:45:33,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607858500] [2023-12-19 14:45:33,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 14:45:33,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-19 14:45:33,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 14:45:33,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-19 14:45:33,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-12-19 14:45:33,339 INFO L87 Difference]: Start difference. First operand 173 states and 260 transitions. Second operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-19 14:45:33,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 14:45:33,616 INFO L93 Difference]: Finished difference Result 460 states and 684 transitions. [2023-12-19 14:45:33,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-19 14:45:33,617 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 108 [2023-12-19 14:45:33,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 14:45:33,619 INFO L225 Difference]: With dead ends: 460 [2023-12-19 14:45:33,619 INFO L226 Difference]: Without dead ends: 288 [2023-12-19 14:45:33,622 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2023-12-19 14:45:33,623 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 117 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-19 14:45:33,624 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 447 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-19 14:45:33,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2023-12-19 14:45:33,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 266. [2023-12-19 14:45:33,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 214 states have (on average 1.3598130841121496) internal successors, (291), 214 states have internal predecessors, (291), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2023-12-19 14:45:33,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 387 transitions. [2023-12-19 14:45:33,642 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 387 transitions. Word has length 108 [2023-12-19 14:45:33,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 14:45:33,643 INFO L495 AbstractCegarLoop]: Abstraction has 266 states and 387 transitions. [2023-12-19 14:45:33,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-19 14:45:33,643 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 387 transitions. [2023-12-19 14:45:33,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-12-19 14:45:33,645 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 14:45:33,645 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 14:45:33,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-19 14:45:33,645 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 14:45:33,645 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 14:45:33,645 INFO L85 PathProgramCache]: Analyzing trace with hash 1162960113, now seen corresponding path program 1 times [2023-12-19 14:45:33,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 14:45:33,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241591011] [2023-12-19 14:45:33,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 14:45:33,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 14:45:33,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:45:33,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 14:45:33,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:45:33,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 14:45:33,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:45:33,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 14:45:33,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:45:33,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 14:45:33,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:45:33,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-19 14:45:33,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:45:33,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-19 14:45:33,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:45:33,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-19 14:45:33,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:45:33,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-19 14:45:33,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:45:33,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 14:45:33,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:45:33,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-12-19 14:45:33,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:45:33,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-19 14:45:33,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:45:33,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-12-19 14:45:33,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:45:33,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-19 14:45:33,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:45:33,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 14:45:33,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:45:33,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 14:45:33,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:45:33,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-12-19 14:45:33,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:45:33,757 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-19 14:45:33,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 14:45:33,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241591011] [2023-12-19 14:45:33,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241591011] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 14:45:33,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 14:45:33,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-19 14:45:33,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351495071] [2023-12-19 14:45:33,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 14:45:33,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-19 14:45:33,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 14:45:33,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-19 14:45:33,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-19 14:45:33,761 INFO L87 Difference]: Start difference. First operand 266 states and 387 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-19 14:45:33,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 14:45:33,801 INFO L93 Difference]: Finished difference Result 532 states and 775 transitions. [2023-12-19 14:45:33,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-19 14:45:33,801 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 109 [2023-12-19 14:45:33,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 14:45:33,803 INFO L225 Difference]: With dead ends: 532 [2023-12-19 14:45:33,804 INFO L226 Difference]: Without dead ends: 267 [2023-12-19 14:45:33,804 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-19 14:45:33,805 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 0 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 14:45:33,805 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 202 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 14:45:33,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2023-12-19 14:45:33,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 267. [2023-12-19 14:45:33,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 215 states have (on average 1.3488372093023255) internal successors, (290), 215 states have internal predecessors, (290), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2023-12-19 14:45:33,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 386 transitions. [2023-12-19 14:45:33,821 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 386 transitions. Word has length 109 [2023-12-19 14:45:33,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 14:45:33,822 INFO L495 AbstractCegarLoop]: Abstraction has 267 states and 386 transitions. [2023-12-19 14:45:33,822 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-19 14:45:33,823 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 386 transitions. [2023-12-19 14:45:33,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-12-19 14:45:33,824 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 14:45:33,825 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 14:45:33,825 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-19 14:45:33,826 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 14:45:33,826 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 14:45:33,827 INFO L85 PathProgramCache]: Analyzing trace with hash 1421125551, now seen corresponding path program 1 times [2023-12-19 14:45:33,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 14:45:33,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316974329] [2023-12-19 14:45:33,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 14:45:33,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 14:45:33,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:45:33,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 14:45:33,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:45:33,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 14:45:33,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:45:33,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 14:45:33,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:45:33,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 14:45:33,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:45:33,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-19 14:45:33,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:45:33,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-19 14:45:33,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:45:33,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-19 14:45:33,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:45:33,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-19 14:45:33,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:45:33,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 14:45:33,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:45:33,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-12-19 14:45:33,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:45:33,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-19 14:45:33,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:45:33,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-12-19 14:45:33,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:45:33,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-19 14:45:33,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:45:33,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 14:45:33,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:45:33,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 14:45:33,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:45:33,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-12-19 14:45:33,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:45:33,975 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-19 14:45:33,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 14:45:33,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316974329] [2023-12-19 14:45:33,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316974329] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 14:45:33,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 14:45:33,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-19 14:45:33,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360058787] [2023-12-19 14:45:33,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 14:45:33,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-19 14:45:33,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 14:45:33,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-19 14:45:33,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-19 14:45:33,977 INFO L87 Difference]: Start difference. First operand 267 states and 386 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-19 14:45:34,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 14:45:34,187 INFO L93 Difference]: Finished difference Result 459 states and 672 transitions. [2023-12-19 14:45:34,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-19 14:45:34,188 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 109 [2023-12-19 14:45:34,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 14:45:34,189 INFO L225 Difference]: With dead ends: 459 [2023-12-19 14:45:34,189 INFO L226 Difference]: Without dead ends: 369 [2023-12-19 14:45:34,190 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-19 14:45:34,190 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 199 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-19 14:45:34,190 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 522 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-19 14:45:34,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2023-12-19 14:45:34,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 273. [2023-12-19 14:45:34,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 221 states have (on average 1.3529411764705883) internal successors, (299), 221 states have internal predecessors, (299), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2023-12-19 14:45:34,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 395 transitions. [2023-12-19 14:45:34,209 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 395 transitions. Word has length 109 [2023-12-19 14:45:34,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 14:45:34,209 INFO L495 AbstractCegarLoop]: Abstraction has 273 states and 395 transitions. [2023-12-19 14:45:34,209 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-19 14:45:34,209 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 395 transitions. [2023-12-19 14:45:34,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-12-19 14:45:34,210 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 14:45:34,210 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 14:45:34,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-19 14:45:34,210 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 14:45:34,210 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 14:45:34,210 INFO L85 PathProgramCache]: Analyzing trace with hash -1919352067, now seen corresponding path program 1 times [2023-12-19 14:45:34,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 14:45:34,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256952049] [2023-12-19 14:45:34,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 14:45:34,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 14:45:34,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:45:34,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 14:45:34,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:45:34,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 14:45:34,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:45:34,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 14:45:34,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:45:34,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 14:45:34,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:45:34,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-19 14:45:34,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:45:34,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-19 14:45:34,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:45:34,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-19 14:45:34,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:45:34,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-19 14:45:34,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:45:34,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 14:45:34,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:45:34,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-12-19 14:45:34,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:45:34,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-19 14:45:34,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:45:34,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-12-19 14:45:34,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:45:34,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-19 14:45:34,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:45:34,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 14:45:34,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:45:34,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 14:45:34,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:45:34,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-12-19 14:45:34,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:45:34,381 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-19 14:45:34,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 14:45:34,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256952049] [2023-12-19 14:45:34,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256952049] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 14:45:34,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 14:45:34,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-19 14:45:34,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153725425] [2023-12-19 14:45:34,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 14:45:34,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-19 14:45:34,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 14:45:34,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-19 14:45:34,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-19 14:45:34,383 INFO L87 Difference]: Start difference. First operand 273 states and 395 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-19 14:45:34,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 14:45:34,454 INFO L93 Difference]: Finished difference Result 577 states and 837 transitions. [2023-12-19 14:45:34,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-19 14:45:34,455 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 109 [2023-12-19 14:45:34,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 14:45:34,456 INFO L225 Difference]: With dead ends: 577 [2023-12-19 14:45:34,456 INFO L226 Difference]: Without dead ends: 305 [2023-12-19 14:45:34,457 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 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-19 14:45:34,457 INFO L413 NwaCegarLoop]: 149 mSDtfsCounter, 95 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 14:45:34,458 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 345 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 14:45:34,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2023-12-19 14:45:34,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 273. [2023-12-19 14:45:34,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 221 states have (on average 1.3167420814479638) internal successors, (291), 221 states have internal predecessors, (291), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2023-12-19 14:45:34,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 387 transitions. [2023-12-19 14:45:34,492 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 387 transitions. Word has length 109 [2023-12-19 14:45:34,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 14:45:34,492 INFO L495 AbstractCegarLoop]: Abstraction has 273 states and 387 transitions. [2023-12-19 14:45:34,492 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-19 14:45:34,492 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 387 transitions. [2023-12-19 14:45:34,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-12-19 14:45:34,493 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 14:45:34,493 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 14:45:34,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-19 14:45:34,493 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 14:45:34,494 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 14:45:34,494 INFO L85 PathProgramCache]: Analyzing trace with hash 504397503, now seen corresponding path program 1 times [2023-12-19 14:45:34,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 14:45:34,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922537473] [2023-12-19 14:45:34,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 14:45:34,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 14:45:34,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:45:34,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 14:45:34,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:45:34,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 14:45:34,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:45:34,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 14:45:34,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:45:34,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 14:45:34,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:45:34,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-19 14:45:34,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:45:34,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-19 14:45:34,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:45:34,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-19 14:45:34,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:45:34,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-19 14:45:34,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:45:34,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 14:45:34,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:45:34,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-12-19 14:45:34,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:45:34,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-19 14:45:34,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:45:34,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-12-19 14:45:34,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:45:34,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-19 14:45:34,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:45:34,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 14:45:34,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:45:34,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 14:45:34,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:45:34,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-12-19 14:45:34,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:45:34,640 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-19 14:45:34,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 14:45:34,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922537473] [2023-12-19 14:45:34,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922537473] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 14:45:34,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 14:45:34,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-19 14:45:34,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216456929] [2023-12-19 14:45:34,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 14:45:34,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-19 14:45:34,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 14:45:34,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-19 14:45:34,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-19 14:45:34,642 INFO L87 Difference]: Start difference. First operand 273 states and 387 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-19 14:45:34,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 14:45:34,984 INFO L93 Difference]: Finished difference Result 744 states and 1053 transitions. [2023-12-19 14:45:34,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-19 14:45:34,984 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 113 [2023-12-19 14:45:34,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 14:45:34,987 INFO L225 Difference]: With dead ends: 744 [2023-12-19 14:45:34,987 INFO L226 Difference]: Without dead ends: 648 [2023-12-19 14:45:34,987 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-19 14:45:34,988 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 238 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-19 14:45:34,988 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 444 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-19 14:45:34,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2023-12-19 14:45:35,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 469. [2023-12-19 14:45:35,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 469 states, 383 states have (on average 1.318537859007833) internal successors, (505), 383 states have internal predecessors, (505), 80 states have call successors, (80), 5 states have call predecessors, (80), 5 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) [2023-12-19 14:45:35,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 665 transitions. [2023-12-19 14:45:35,050 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 665 transitions. Word has length 113 [2023-12-19 14:45:35,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 14:45:35,050 INFO L495 AbstractCegarLoop]: Abstraction has 469 states and 665 transitions. [2023-12-19 14:45:35,050 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-19 14:45:35,050 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 665 transitions. [2023-12-19 14:45:35,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-12-19 14:45:35,051 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 14:45:35,051 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 14:45:35,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-19 14:45:35,051 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 14:45:35,052 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 14:45:35,052 INFO L85 PathProgramCache]: Analyzing trace with hash -1761442810, now seen corresponding path program 1 times [2023-12-19 14:45:35,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 14:45:35,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64356652] [2023-12-19 14:45:35,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 14:45:35,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 14:45:35,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:46:07,618 WARN L293 SmtUtils]: Spent 5.09s on a formula simplification that was a NOOP. DAG size: 156 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-19 14:46:26,278 WARN L293 SmtUtils]: Spent 7.26s on a formula simplification that was a NOOP. DAG size: 153 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-19 14:46:26,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 14:46:26,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:46:26,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 14:46:26,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:46:26,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 14:46:26,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:46:26,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 14:46:26,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:46:26,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-19 14:46:26,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:46:26,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-19 14:46:26,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:46:26,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-19 14:46:26,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:46:26,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-19 14:46:26,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:46:26,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 14:46:26,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:46:26,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-12-19 14:46:26,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:46:26,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-19 14:46:26,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:46:26,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-12-19 14:46:26,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:46:26,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-19 14:46:26,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:46:26,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 14:46:26,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:46:26,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 14:46:26,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:46:26,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-12-19 14:46:26,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:46:26,327 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-19 14:46:26,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 14:46:26,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64356652] [2023-12-19 14:46:26,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64356652] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 14:46:26,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 14:46:26,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-19 14:46:26,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961537939] [2023-12-19 14:46:26,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 14:46:26,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-19 14:46:26,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 14:46:26,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-19 14:46:26,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2023-12-19 14:46:26,328 INFO L87 Difference]: Start difference. First operand 469 states and 665 transitions. Second operand has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-19 14:46:43,159 WARN L293 SmtUtils]: Spent 10.02s on a formula simplification that was a NOOP. DAG size: 165 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-19 14:46:47,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 14:46:47,718 INFO L93 Difference]: Finished difference Result 1071 states and 1487 transitions. [2023-12-19 14:46:47,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-19 14:46:47,733 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 113 [2023-12-19 14:46:47,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 14:46:47,736 INFO L225 Difference]: With dead ends: 1071 [2023-12-19 14:46:47,736 INFO L226 Difference]: Without dead ends: 892 [2023-12-19 14:46:47,737 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 41.0s TimeCoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2023-12-19 14:46:47,738 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 298 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2023-12-19 14:46:47,738 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 339 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2023-12-19 14:46:47,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 892 states. [2023-12-19 14:46:47,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 892 to 813. [2023-12-19 14:46:47,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 813 states, 712 states have (on average 1.3258426966292134) internal successors, (944), 717 states have internal predecessors, (944), 90 states have call successors, (90), 10 states have call predecessors, (90), 10 states have return successors, (90), 85 states have call predecessors, (90), 90 states have call successors, (90) [2023-12-19 14:46:47,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 1124 transitions. [2023-12-19 14:46:47,822 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 1124 transitions. Word has length 113 [2023-12-19 14:46:47,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 14:46:47,823 INFO L495 AbstractCegarLoop]: Abstraction has 813 states and 1124 transitions. [2023-12-19 14:46:47,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-19 14:46:47,823 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1124 transitions. [2023-12-19 14:46:47,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-12-19 14:46:47,824 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 14:46:47,824 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 14:46:47,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-19 14:46:47,824 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 14:46:47,824 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 14:46:47,824 INFO L85 PathProgramCache]: Analyzing trace with hash -1542588092, now seen corresponding path program 1 times [2023-12-19 14:46:47,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 14:46:47,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821766761] [2023-12-19 14:46:47,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 14:46:47,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 14:46:47,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-19 14:46:47,855 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-19 14:46:47,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-19 14:46:47,918 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-19 14:46:47,918 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-19 14:46:47,919 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-19 14:46:47,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-19 14:46:47,922 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 14:46:47,924 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-19 14:46:48,066 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.12 02:46:48 BoogieIcfgContainer [2023-12-19 14:46:48,066 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-19 14:46:48,067 INFO L158 Benchmark]: Toolchain (without parser) took 77364.53ms. Allocated memory was 205.5MB in the beginning and 408.9MB in the end (delta: 203.4MB). Free memory was 145.1MB in the beginning and 367.4MB in the end (delta: -222.3MB). Peak memory consumption was 172.9MB. Max. memory is 8.0GB. [2023-12-19 14:46:48,067 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 205.5MB. Free memory is still 155.8MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-19 14:46:48,067 INFO L158 Benchmark]: CACSL2BoogieTranslator took 213.21ms. Allocated memory is still 205.5MB. Free memory was 144.8MB in the beginning and 130.9MB in the end (delta: 13.9MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2023-12-19 14:46:48,067 INFO L158 Benchmark]: Boogie Procedure Inliner took 72.10ms. Allocated memory was 205.5MB in the beginning and 340.8MB in the end (delta: 135.3MB). Free memory was 130.7MB in the beginning and 306.8MB in the end (delta: -176.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-19 14:46:48,067 INFO L158 Benchmark]: Boogie Preprocessor took 59.10ms. Allocated memory is still 340.8MB. Free memory was 306.8MB in the beginning and 300.3MB in the end (delta: 6.5MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. [2023-12-19 14:46:48,068 INFO L158 Benchmark]: RCFGBuilder took 433.68ms. Allocated memory is still 340.8MB. Free memory was 300.3MB in the beginning and 275.1MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2023-12-19 14:46:48,068 INFO L158 Benchmark]: TraceAbstraction took 76581.71ms. Allocated memory was 340.8MB in the beginning and 408.9MB in the end (delta: 68.2MB). Free memory was 274.6MB in the beginning and 367.4MB in the end (delta: -92.8MB). Peak memory consumption was 165.7MB. Max. memory is 8.0GB. [2023-12-19 14:46:48,069 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.10ms. Allocated memory is still 205.5MB. Free memory is still 155.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 213.21ms. Allocated memory is still 205.5MB. Free memory was 144.8MB in the beginning and 130.9MB in the end (delta: 13.9MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 72.10ms. Allocated memory was 205.5MB in the beginning and 340.8MB in the end (delta: 135.3MB). Free memory was 130.7MB in the beginning and 306.8MB in the end (delta: -176.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 59.10ms. Allocated memory is still 340.8MB. Free memory was 306.8MB in the beginning and 300.3MB in the end (delta: 6.5MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. * RCFGBuilder took 433.68ms. Allocated memory is still 340.8MB. Free memory was 300.3MB in the beginning and 275.1MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * TraceAbstraction took 76581.71ms. Allocated memory was 340.8MB in the beginning and 408.9MB in the end (delta: 68.2MB). Free memory was 274.6MB in the beginning and 367.4MB in the end (delta: -92.8MB). Peak memory consumption was 165.7MB. 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 someBinaryFLOATComparisonOperation at line 122. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 2; [L23] signed long int var_1_5 = 5; [L24] unsigned char var_1_8 = 0; [L25] float var_1_9 = 128.6; [L26] float var_1_10 = 32.5; [L27] unsigned char var_1_11 = 16; [L28] unsigned char var_1_12 = 64; [L29] unsigned char var_1_13 = 4; [L30] unsigned char var_1_14 = 4; [L31] unsigned long int var_1_15 = 0; [L32] signed short int var_1_16 = 0; [L33] signed char var_1_17 = 1; [L34] signed char var_1_18 = -1; [L35] signed char var_1_19 = 0; [L36] signed long int var_1_20 = -64; [L37] unsigned char var_1_22 = 0; [L38] unsigned char var_1_23 = 0; [L39] signed long int last_1_var_1_5 = 5; [L126] isInitial = 1 [L127] FCALL initially() [L128] COND TRUE 1 [L129] CALL updateLastVariables() [L119] last_1_var_1_5 = var_1_5 [L129] RET updateLastVariables() [L130] CALL updateVariables() [L92] var_1_9 = __VERIFIER_nondet_float() [L93] CALL assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_5=5, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L93] RET assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_5=5, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L94] var_1_10 = __VERIFIER_nondet_float() [L95] CALL assume_abort_if_not((var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_5=5, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L95] RET assume_abort_if_not((var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L96] var_1_11 = __VERIFIER_nondet_uchar() [L97] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_5=5, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L97] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L98] CALL assume_abort_if_not(var_1_11 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L98] RET assume_abort_if_not(var_1_11 <= 127) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L99] var_1_12 = __VERIFIER_nondet_uchar() [L100] CALL assume_abort_if_not(var_1_12 >= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L100] RET assume_abort_if_not(var_1_12 >= 63) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L101] CALL assume_abort_if_not(var_1_12 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L101] RET assume_abort_if_not(var_1_12 <= 127) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L102] var_1_13 = __VERIFIER_nondet_uchar() [L103] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L103] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L104] CALL assume_abort_if_not(var_1_13 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L104] RET assume_abort_if_not(var_1_13 <= 63) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L105] var_1_14 = __VERIFIER_nondet_uchar() [L106] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L106] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L107] CALL assume_abort_if_not(var_1_14 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L107] RET assume_abort_if_not(var_1_14 <= 127) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L108] var_1_18 = __VERIFIER_nondet_char() [L109] CALL assume_abort_if_not(var_1_18 >= -31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L109] RET assume_abort_if_not(var_1_18 >= -31) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L110] CALL assume_abort_if_not(var_1_18 <= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L110] RET assume_abort_if_not(var_1_18 <= 32) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L111] var_1_19 = __VERIFIER_nondet_char() [L112] CALL assume_abort_if_not(var_1_19 >= -15) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L112] RET assume_abort_if_not(var_1_19 >= -15) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L113] CALL assume_abort_if_not(var_1_19 <= 16) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L113] RET assume_abort_if_not(var_1_19 <= 16) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L114] var_1_23 = __VERIFIER_nondet_uchar() [L115] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_5=5, var_1_8=0] [L115] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_5=5, var_1_8=0] [L116] CALL assume_abort_if_not(var_1_23 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L116] RET assume_abort_if_not(var_1_23 <= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L130] RET updateVariables() [L131] CALL step() [L43] COND FALSE !(var_1_9 > var_1_10) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L46] var_1_20 = var_1_8 [L47] var_1_22 = var_1_23 VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-15, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L48] COND FALSE !(\read(var_1_22)) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-15, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L51] var_1_16 = (((((var_1_15) < (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12))))) ? (var_1_15) : (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12)))))) - var_1_11) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=-127, var_1_17=1, var_1_18=0, var_1_19=-15, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L52] COND FALSE !(\read(var_1_22)) [L59] var_1_17 = -32 VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=0, var_1_19=-15, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L61] unsigned long int stepLocal_1 = var_1_20 + var_1_15; [L62] signed long int stepLocal_0 = var_1_20; VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, stepLocal_1=0, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=0, var_1_19=-15, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L63] COND TRUE stepLocal_1 < -200 VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, stepLocal_1=0, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=0, var_1_19=-15, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L64] COND FALSE !(\read(var_1_22)) [L71] var_1_1 = var_1_20 VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, stepLocal_1=0, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=0, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L76] signed long int stepLocal_4 = 256; [L77] unsigned char stepLocal_3 = var_1_22; [L78] unsigned long int stepLocal_2 = var_1_15; VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, stepLocal_1=0, stepLocal_2=0, stepLocal_3=0, stepLocal_4=256, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=0, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L79] COND FALSE !(stepLocal_4 > (var_1_15 - (last_1_var_1_5 + var_1_8))) VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, stepLocal_1=0, stepLocal_2=0, stepLocal_3=0, stepLocal_4=256, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=0, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L82] COND FALSE !(stepLocal_3 || var_1_22) [L87] var_1_5 = -10000 VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, stepLocal_1=0, stepLocal_2=0, stepLocal_3=0, stepLocal_4=256, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=0, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=-10000, var_1_8=0] [L131] RET step() [L132] CALL, EXPR property() [L122] EXPR (((var_1_20 + var_1_15) < -200) ? (var_1_22 ? ((var_1_20 > (- var_1_15)) ? (var_1_1 == ((unsigned long int) var_1_20)) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) && ((256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000)))) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=0, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=-10000, var_1_8=0] [L122] EXPR (256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000))) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=0, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=-10000, var_1_8=0] [L122] EXPR (var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000)) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=0, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=-10000, var_1_8=0] [L122] EXPR (256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000))) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=0, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=-10000, var_1_8=0] [L122] EXPR (((var_1_20 + var_1_15) < -200) ? (var_1_22 ? ((var_1_20 > (- var_1_15)) ? (var_1_1 == ((unsigned long int) var_1_20)) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) && ((256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000)))) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=0, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=-10000, var_1_8=0] [L122] EXPR (((((((var_1_20 + var_1_15) < -200) ? (var_1_22 ? ((var_1_20 > (- var_1_15)) ? (var_1_1 == ((unsigned long int) var_1_20)) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) && ((256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000))))) && ((var_1_9 > var_1_10) ? (var_1_8 == ((unsigned char) (((((var_1_11 + (var_1_12 - var_1_13))) < ((5 + var_1_14))) ? ((var_1_11 + (var_1_12 - var_1_13))) : ((5 + var_1_14)))))) : 1)) && (var_1_22 ? (var_1_15 == ((unsigned long int) var_1_8)) : 1)) && (var_1_16 == ((signed short int) (((((var_1_15) < (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12))))) ? (var_1_15) : (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12)))))) - var_1_11)))) && (var_1_22 ? ((var_1_14 < (var_1_13 & (var_1_15 / 2))) ? (var_1_17 == ((signed char) (var_1_13 + (var_1_18 + (var_1_19 + 5))))) : (var_1_17 == ((signed char) var_1_18))) : (var_1_17 == ((signed char) -32))) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=0, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=-10000, var_1_8=0] [L122-L123] return (((((((((var_1_20 + var_1_15) < -200) ? (var_1_22 ? ((var_1_20 > (- var_1_15)) ? (var_1_1 == ((unsigned long int) var_1_20)) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) && ((256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000))))) && ((var_1_9 > var_1_10) ? (var_1_8 == ((unsigned char) (((((var_1_11 + (var_1_12 - var_1_13))) < ((5 + var_1_14))) ? ((var_1_11 + (var_1_12 - var_1_13))) : ((5 + var_1_14)))))) : 1)) && (var_1_22 ? (var_1_15 == ((unsigned long int) var_1_8)) : 1)) && (var_1_16 == ((signed short int) (((((var_1_15) < (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12))))) ? (var_1_15) : (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12)))))) - var_1_11)))) && (var_1_22 ? ((var_1_14 < (var_1_13 & (var_1_15 / 2))) ? (var_1_17 == ((signed char) (var_1_13 + (var_1_18 + (var_1_19 + 5))))) : (var_1_17 == ((signed char) var_1_18))) : (var_1_17 == ((signed char) -32)))) && (var_1_20 == ((signed long int) var_1_8))) && (var_1_22 == ((unsigned char) var_1_23)) ; [L132] RET, EXPR property() [L132] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=0, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=-10000, var_1_8=0] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=0, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=-10000, var_1_8=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 72 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 76.4s, OverallIterations: 10, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 22.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1173 SdHoareTripleChecker+Valid, 3.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1173 mSDsluCounter, 2980 SdHoareTripleChecker+Invalid, 3.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1752 mSDsCounter, 264 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1097 IncrementalHoareTripleChecker+Invalid, 1361 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 264 mSolverCounterUnsat, 1228 mSDtfsCounter, 1097 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 370 GetRequests, 328 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 41.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=813occurred in iteration=9, InterpolantAutomatonStates: 49, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 9 MinimizatonAttempts, 480 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 52.7s InterpolantComputationTime, 1095 NumberOfCodeBlocks, 1095 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 973 ConstructedInterpolants, 0 QuantifiedInterpolants, 13712 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 4320/4320 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-19 14:46:48,104 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...