/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_fillercode_fillercodestructure_normal_file-63.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-15 20:38:02,980 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-15 20:38:03,050 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-15 20:38:03,054 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-15 20:38:03,054 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-15 20:38:03,079 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-15 20:38:03,079 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-15 20:38:03,084 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-15 20:38:03,084 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-15 20:38:03,086 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-15 20:38:03,086 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-15 20:38:03,086 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-15 20:38:03,086 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-15 20:38:03,087 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-15 20:38:03,087 INFO L153 SettingsManager]: * Use SBE=true [2023-12-15 20:38:03,087 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-15 20:38:03,087 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-15 20:38:03,088 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-15 20:38:03,088 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-15 20:38:03,088 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-15 20:38:03,088 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-15 20:38:03,091 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-15 20:38:03,092 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-15 20:38:03,092 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-15 20:38:03,092 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-15 20:38:03,092 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-15 20:38:03,092 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-15 20:38:03,092 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-15 20:38:03,093 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-15 20:38:03,093 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-15 20:38:03,094 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-15 20:38:03,094 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-15 20:38:03,094 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 20:38:03,094 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-15 20:38:03,094 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-15 20:38:03,094 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-15 20:38:03,095 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-15 20:38:03,095 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-15 20:38:03,095 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-15 20:38:03,095 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-15 20:38:03,095 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-15 20:38:03,095 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-15 20:38:03,095 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-15 20:38:03,096 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Use bitabs translation -> true [2023-12-15 20:38:03,278 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-15 20:38:03,297 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-15 20:38:03,299 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-15 20:38:03,300 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-15 20:38:03,300 INFO L274 PluginConnector]: CDTParser initialized [2023-12-15 20:38:03,301 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-63.i [2023-12-15 20:38:04,411 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-15 20:38:04,581 INFO L384 CDTParser]: Found 1 translation units. [2023-12-15 20:38:04,581 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-63.i [2023-12-15 20:38:04,589 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/25916612f/8831e92ecae94d75b23e601f4d20ed3a/FLAG59eb50475 [2023-12-15 20:38:04,606 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/25916612f/8831e92ecae94d75b23e601f4d20ed3a [2023-12-15 20:38:04,609 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-15 20:38:04,611 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-15 20:38:04,613 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-15 20:38:04,613 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-15 20:38:04,617 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-15 20:38:04,617 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 08:38:04" (1/1) ... [2023-12-15 20:38:04,618 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b2deda1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:38:04, skipping insertion in model container [2023-12-15 20:38:04,618 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 08:38:04" (1/1) ... [2023-12-15 20:38:04,652 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-15 20:38:04,750 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_fillercode_fillercodestructure_normal_file-63.i[913,926] [2023-12-15 20:38:04,795 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 20:38:04,803 INFO L202 MainTranslator]: Completed pre-run [2023-12-15 20:38:04,819 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_fillercode_fillercodestructure_normal_file-63.i[913,926] [2023-12-15 20:38:04,839 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 20:38:04,851 INFO L206 MainTranslator]: Completed translation [2023-12-15 20:38:04,851 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:38:04 WrapperNode [2023-12-15 20:38:04,851 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-15 20:38:04,852 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-15 20:38:04,852 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-15 20:38:04,852 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-15 20:38:04,857 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:38:04" (1/1) ... [2023-12-15 20:38:04,864 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:38:04" (1/1) ... [2023-12-15 20:38:04,903 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 170 [2023-12-15 20:38:04,904 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-15 20:38:04,904 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-15 20:38:04,904 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-15 20:38:04,905 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-15 20:38:04,933 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:38:04" (1/1) ... [2023-12-15 20:38:04,933 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:38:04" (1/1) ... [2023-12-15 20:38:04,936 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:38:04" (1/1) ... [2023-12-15 20:38:04,950 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-12-15 20:38:04,950 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:38:04" (1/1) ... [2023-12-15 20:38:04,950 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:38:04" (1/1) ... [2023-12-15 20:38:04,958 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:38:04" (1/1) ... [2023-12-15 20:38:04,961 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:38:04" (1/1) ... [2023-12-15 20:38:04,962 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:38:04" (1/1) ... [2023-12-15 20:38:04,964 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:38:04" (1/1) ... [2023-12-15 20:38:04,966 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-15 20:38:04,967 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-15 20:38:04,967 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-15 20:38:04,967 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-15 20:38:04,967 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:38:04" (1/1) ... [2023-12-15 20:38:04,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 20:38:04,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 20:38:04,989 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-15 20:38:05,031 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-15 20:38:05,049 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-15 20:38:05,050 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-15 20:38:05,050 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-15 20:38:05,050 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-15 20:38:05,051 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-15 20:38:05,051 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-15 20:38:05,133 INFO L241 CfgBuilder]: Building ICFG [2023-12-15 20:38:05,134 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-15 20:38:05,410 INFO L282 CfgBuilder]: Performing block encoding [2023-12-15 20:38:05,442 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-15 20:38:05,442 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-15 20:38:05,443 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 08:38:05 BoogieIcfgContainer [2023-12-15 20:38:05,443 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-15 20:38:05,444 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-15 20:38:05,444 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-15 20:38:05,446 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-15 20:38:05,446 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.12 08:38:04" (1/3) ... [2023-12-15 20:38:05,447 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39f9cd91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 08:38:05, skipping insertion in model container [2023-12-15 20:38:05,447 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:38:04" (2/3) ... [2023-12-15 20:38:05,447 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39f9cd91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 08:38:05, skipping insertion in model container [2023-12-15 20:38:05,447 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 08:38:05" (3/3) ... [2023-12-15 20:38:05,448 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_normal_file-63.i [2023-12-15 20:38:05,460 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-15 20:38:05,460 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-15 20:38:05,492 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-15 20:38:05,496 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;@54ff3ed7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-15 20:38:05,497 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-15 20:38:05,499 INFO L276 IsEmpty]: Start isEmpty. Operand has 62 states, 43 states have (on average 1.4883720930232558) internal successors, (64), 44 states have internal predecessors, (64), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-15 20:38:05,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-12-15 20:38:05,507 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:38:05,507 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] [2023-12-15 20:38:05,508 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:38:05,511 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:38:05,511 INFO L85 PathProgramCache]: Analyzing trace with hash -1333531042, now seen corresponding path program 1 times [2023-12-15 20:38:05,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:38:05,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102420569] [2023-12-15 20:38:05,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:38:05,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:38:05,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:05,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:38:05,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:05,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:38:05,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:05,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:38:05,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:05,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:38:05,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:05,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:38:05,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:05,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 20:38:05,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:05,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 20:38:05,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:05,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 20:38:05,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:05,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 20:38:05,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:05,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-15 20:38:05,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:05,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-15 20:38:05,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:05,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-15 20:38:05,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:05,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-15 20:38:05,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:05,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-12-15 20:38:05,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:05,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-12-15 20:38:05,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:05,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-12-15 20:38:05,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:05,805 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-15 20:38:05,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:38:05,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102420569] [2023-12-15 20:38:05,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102420569] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:38:05,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:38:05,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-15 20:38:05,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079839271] [2023-12-15 20:38:05,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:38:05,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-15 20:38:05,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:38:05,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-15 20:38:05,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-15 20:38:05,843 INFO L87 Difference]: Start difference. First operand has 62 states, 43 states have (on average 1.4883720930232558) internal successors, (64), 44 states have internal predecessors, (64), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2023-12-15 20:38:05,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:38:05,885 INFO L93 Difference]: Finished difference Result 121 states and 206 transitions. [2023-12-15 20:38:05,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-15 20:38:05,887 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 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 112 [2023-12-15 20:38:05,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:38:05,891 INFO L225 Difference]: With dead ends: 121 [2023-12-15 20:38:05,891 INFO L226 Difference]: Without dead ends: 60 [2023-12-15 20:38:05,893 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-15 20:38:05,895 INFO L413 NwaCegarLoop]: 88 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, 88 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 20:38:05,896 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 88 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 20:38:05,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2023-12-15 20:38:05,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2023-12-15 20:38:05,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 42 states have (on average 1.4047619047619047) internal successors, (59), 42 states have internal predecessors, (59), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-15 20:38:05,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 91 transitions. [2023-12-15 20:38:05,935 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 91 transitions. Word has length 112 [2023-12-15 20:38:05,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:38:05,935 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 91 transitions. [2023-12-15 20:38:05,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2023-12-15 20:38:05,936 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 91 transitions. [2023-12-15 20:38:05,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-12-15 20:38:05,938 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:38:05,938 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] [2023-12-15 20:38:05,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-15 20:38:05,939 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:38:05,939 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:38:05,939 INFO L85 PathProgramCache]: Analyzing trace with hash 646606634, now seen corresponding path program 1 times [2023-12-15 20:38:05,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:38:05,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488951040] [2023-12-15 20:38:05,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:38:05,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:38:05,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:06,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:38:06,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:06,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:38:06,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:06,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:38:06,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:06,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:38:06,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:06,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:38:06,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:06,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 20:38:06,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:06,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 20:38:06,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:06,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 20:38:06,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:06,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 20:38:06,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:06,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-15 20:38:06,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:06,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-15 20:38:06,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:06,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-15 20:38:06,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:06,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-15 20:38:06,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:06,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-12-15 20:38:06,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:06,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-12-15 20:38:06,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:06,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-12-15 20:38:06,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:06,132 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-15 20:38:06,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:38:06,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488951040] [2023-12-15 20:38:06,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488951040] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:38:06,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:38:06,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 20:38:06,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422824203] [2023-12-15 20:38:06,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:38:06,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 20:38:06,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:38:06,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 20:38:06,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 20:38:06,134 INFO L87 Difference]: Start difference. First operand 60 states and 91 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-15 20:38:06,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:38:06,191 INFO L93 Difference]: Finished difference Result 143 states and 218 transitions. [2023-12-15 20:38:06,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 20:38:06,191 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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 112 [2023-12-15 20:38:06,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:38:06,192 INFO L225 Difference]: With dead ends: 143 [2023-12-15 20:38:06,192 INFO L226 Difference]: Without dead ends: 84 [2023-12-15 20:38:06,193 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 20:38:06,194 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 27 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 20:38:06,194 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 175 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 20:38:06,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2023-12-15 20:38:06,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 71. [2023-12-15 20:38:06,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 53 states have (on average 1.4339622641509433) internal successors, (76), 53 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-15 20:38:06,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 108 transitions. [2023-12-15 20:38:06,204 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 108 transitions. Word has length 112 [2023-12-15 20:38:06,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:38:06,205 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 108 transitions. [2023-12-15 20:38:06,205 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-15 20:38:06,205 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 108 transitions. [2023-12-15 20:38:06,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-12-15 20:38:06,208 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:38:06,208 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] [2023-12-15 20:38:06,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-15 20:38:06,208 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:38:06,209 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:38:06,209 INFO L85 PathProgramCache]: Analyzing trace with hash -1962809622, now seen corresponding path program 1 times [2023-12-15 20:38:06,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:38:06,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162772070] [2023-12-15 20:38:06,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:38:06,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:38:06,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:06,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:38:06,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:06,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:38:06,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:06,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:38:06,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:06,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:38:06,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:06,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:38:06,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:06,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 20:38:06,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:06,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 20:38:06,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:06,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 20:38:06,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:06,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 20:38:06,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:06,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-15 20:38:06,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:06,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-15 20:38:06,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:06,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-15 20:38:06,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:06,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-15 20:38:06,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:06,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-12-15 20:38:06,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:06,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-12-15 20:38:06,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:06,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-12-15 20:38:06,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:06,526 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-15 20:38:06,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:38:06,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162772070] [2023-12-15 20:38:06,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162772070] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:38:06,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:38:06,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-15 20:38:06,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240617052] [2023-12-15 20:38:06,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:38:06,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-15 20:38:06,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:38:06,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-15 20:38:06,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-15 20:38:06,533 INFO L87 Difference]: Start difference. First operand 71 states and 108 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-15 20:38:06,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:38:06,694 INFO L93 Difference]: Finished difference Result 209 states and 318 transitions. [2023-12-15 20:38:06,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-15 20:38:06,695 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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 112 [2023-12-15 20:38:06,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:38:06,698 INFO L225 Difference]: With dead ends: 209 [2023-12-15 20:38:06,698 INFO L226 Difference]: Without dead ends: 139 [2023-12-15 20:38:06,701 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-15 20:38:06,703 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 200 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 20:38:06,704 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 161 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 20:38:06,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2023-12-15 20:38:06,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 91. [2023-12-15 20:38:06,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 73 states have (on average 1.452054794520548) internal successors, (106), 73 states have internal predecessors, (106), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-15 20:38:06,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 138 transitions. [2023-12-15 20:38:06,728 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 138 transitions. Word has length 112 [2023-12-15 20:38:06,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:38:06,729 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 138 transitions. [2023-12-15 20:38:06,730 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-15 20:38:06,730 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 138 transitions. [2023-12-15 20:38:06,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-12-15 20:38:06,733 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:38:06,733 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] [2023-12-15 20:38:06,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-15 20:38:06,734 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:38:06,734 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:38:06,734 INFO L85 PathProgramCache]: Analyzing trace with hash 2073992236, now seen corresponding path program 1 times [2023-12-15 20:38:06,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:38:06,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847514616] [2023-12-15 20:38:06,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:38:06,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:38:06,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:07,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:38:07,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:07,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:38:07,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:07,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:38:07,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:07,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:38:07,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:07,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:38:07,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:07,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 20:38:07,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:07,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 20:38:07,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:07,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 20:38:07,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:07,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 20:38:07,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:07,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-15 20:38:07,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:07,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-15 20:38:07,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:07,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-15 20:38:07,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:07,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-15 20:38:07,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:07,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-12-15 20:38:07,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:07,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-12-15 20:38:07,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:07,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-12-15 20:38:07,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:07,070 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-15 20:38:07,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:38:07,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847514616] [2023-12-15 20:38:07,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847514616] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:38:07,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:38:07,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-15 20:38:07,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125700278] [2023-12-15 20:38:07,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:38:07,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 20:38:07,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:38:07,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 20:38:07,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-15 20:38:07,072 INFO L87 Difference]: Start difference. First operand 91 states and 138 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-15 20:38:07,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:38:07,219 INFO L93 Difference]: Finished difference Result 270 states and 404 transitions. [2023-12-15 20:38:07,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-15 20:38:07,220 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 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 112 [2023-12-15 20:38:07,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:38:07,222 INFO L225 Difference]: With dead ends: 270 [2023-12-15 20:38:07,222 INFO L226 Difference]: Without dead ends: 180 [2023-12-15 20:38:07,225 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-15 20:38:07,231 INFO L413 NwaCegarLoop]: 183 mSDtfsCounter, 208 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 20:38:07,232 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 315 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 20:38:07,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2023-12-15 20:38:07,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 102. [2023-12-15 20:38:07,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 84 states have (on average 1.4285714285714286) internal successors, (120), 84 states have internal predecessors, (120), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-15 20:38:07,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 152 transitions. [2023-12-15 20:38:07,253 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 152 transitions. Word has length 112 [2023-12-15 20:38:07,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:38:07,254 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 152 transitions. [2023-12-15 20:38:07,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-15 20:38:07,254 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 152 transitions. [2023-12-15 20:38:07,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-12-15 20:38:07,255 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:38:07,255 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] [2023-12-15 20:38:07,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-15 20:38:07,256 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:38:07,256 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:38:07,256 INFO L85 PathProgramCache]: Analyzing trace with hash 1321040424, now seen corresponding path program 1 times [2023-12-15 20:38:07,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:38:07,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324654903] [2023-12-15 20:38:07,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:38:07,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:38:07,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:07,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:38:07,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:07,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:38:07,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:07,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:38:07,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:07,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:38:07,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:07,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:38:07,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:07,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 20:38:07,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:07,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 20:38:07,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:07,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 20:38:07,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:07,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 20:38:07,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:07,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-15 20:38:07,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:07,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-15 20:38:07,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:07,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-15 20:38:07,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:07,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-15 20:38:07,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:07,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-12-15 20:38:07,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:07,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-12-15 20:38:07,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:07,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-12-15 20:38:07,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:07,510 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-15 20:38:07,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:38:07,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324654903] [2023-12-15 20:38:07,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324654903] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:38:07,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:38:07,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-15 20:38:07,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318037403] [2023-12-15 20:38:07,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:38:07,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-15 20:38:07,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:38:07,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-15 20:38:07,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-15 20:38:07,512 INFO L87 Difference]: Start difference. First operand 102 states and 152 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-15 20:38:07,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:38:07,693 INFO L93 Difference]: Finished difference Result 298 states and 442 transitions. [2023-12-15 20:38:07,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-15 20:38:07,693 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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 112 [2023-12-15 20:38:07,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:38:07,694 INFO L225 Difference]: With dead ends: 298 [2023-12-15 20:38:07,694 INFO L226 Difference]: Without dead ends: 197 [2023-12-15 20:38:07,695 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-15 20:38:07,695 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 192 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-15 20:38:07,695 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 95 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-15 20:38:07,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2023-12-15 20:38:07,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 104. [2023-12-15 20:38:07,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 86 states have (on average 1.4186046511627908) internal successors, (122), 86 states have internal predecessors, (122), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-15 20:38:07,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 154 transitions. [2023-12-15 20:38:07,705 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 154 transitions. Word has length 112 [2023-12-15 20:38:07,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:38:07,706 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 154 transitions. [2023-12-15 20:38:07,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-15 20:38:07,706 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 154 transitions. [2023-12-15 20:38:07,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-12-15 20:38:07,707 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:38:07,707 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] [2023-12-15 20:38:07,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-15 20:38:07,707 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:38:07,707 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:38:07,707 INFO L85 PathProgramCache]: Analyzing trace with hash 1062874986, now seen corresponding path program 1 times [2023-12-15 20:38:07,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:38:07,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911757744] [2023-12-15 20:38:07,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:38:07,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:38:07,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:07,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:38:07,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:07,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:38:07,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:07,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:38:07,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:07,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:38:07,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:07,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:38:07,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:07,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 20:38:07,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:07,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 20:38:07,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:07,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 20:38:07,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:07,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 20:38:07,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:07,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-15 20:38:07,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:07,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-15 20:38:07,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:07,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-15 20:38:07,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:07,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-15 20:38:07,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:07,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-12-15 20:38:07,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:07,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-12-15 20:38:07,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:08,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-12-15 20:38:08,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:08,001 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-15 20:38:08,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:38:08,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911757744] [2023-12-15 20:38:08,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911757744] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:38:08,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:38:08,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-15 20:38:08,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41778468] [2023-12-15 20:38:08,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:38:08,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-15 20:38:08,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:38:08,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-15 20:38:08,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-15 20:38:08,003 INFO L87 Difference]: Start difference. First operand 104 states and 154 transitions. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-15 20:38:08,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:38:08,225 INFO L93 Difference]: Finished difference Result 270 states and 398 transitions. [2023-12-15 20:38:08,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-15 20:38:08,226 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 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 112 [2023-12-15 20:38:08,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:38:08,227 INFO L225 Difference]: With dead ends: 270 [2023-12-15 20:38:08,227 INFO L226 Difference]: Without dead ends: 167 [2023-12-15 20:38:08,227 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2023-12-15 20:38:08,227 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 86 mSDsluCounter, 506 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 640 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-15 20:38:08,228 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 640 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-15 20:38:08,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2023-12-15 20:38:08,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 116. [2023-12-15 20:38:08,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 98 states have (on average 1.4183673469387754) internal successors, (139), 98 states have internal predecessors, (139), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-15 20:38:08,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 171 transitions. [2023-12-15 20:38:08,240 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 171 transitions. Word has length 112 [2023-12-15 20:38:08,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:38:08,241 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 171 transitions. [2023-12-15 20:38:08,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-15 20:38:08,241 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 171 transitions. [2023-12-15 20:38:08,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-12-15 20:38:08,241 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:38:08,242 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-15 20:38:08,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-15 20:38:08,242 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:38:08,242 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:38:08,242 INFO L85 PathProgramCache]: Analyzing trace with hash -234745676, now seen corresponding path program 1 times [2023-12-15 20:38:08,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:38:08,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007169416] [2023-12-15 20:38:08,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:38:08,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:38:08,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:08,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:38:08,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:08,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:38:08,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:08,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:38:08,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:08,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:38:08,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:08,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:38:08,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:08,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 20:38:08,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:08,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 20:38:08,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:08,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 20:38:08,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:08,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 20:38:08,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:08,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-15 20:38:08,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:08,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-15 20:38:08,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:08,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-15 20:38:08,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:08,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-15 20:38:08,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:08,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-12-15 20:38:08,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:08,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-12-15 20:38:08,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:08,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-12-15 20:38:08,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:08,469 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-15 20:38:08,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:38:08,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007169416] [2023-12-15 20:38:08,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007169416] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:38:08,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:38:08,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-15 20:38:08,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336114271] [2023-12-15 20:38:08,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:38:08,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 20:38:08,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:38:08,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 20:38:08,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-15 20:38:08,471 INFO L87 Difference]: Start difference. First operand 116 states and 171 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-15 20:38:08,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:38:08,672 INFO L93 Difference]: Finished difference Result 377 states and 556 transitions. [2023-12-15 20:38:08,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-15 20:38:08,673 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-15 20:38:08,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:38:08,676 INFO L225 Difference]: With dead ends: 377 [2023-12-15 20:38:08,676 INFO L226 Difference]: Without dead ends: 262 [2023-12-15 20:38:08,677 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-15 20:38:08,678 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 112 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 20:38:08,678 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 298 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 20:38:08,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2023-12-15 20:38:08,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 225. [2023-12-15 20:38:08,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 190 states have (on average 1.3894736842105264) internal successors, (264), 190 states have internal predecessors, (264), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2023-12-15 20:38:08,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 328 transitions. [2023-12-15 20:38:08,721 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 328 transitions. Word has length 113 [2023-12-15 20:38:08,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:38:08,722 INFO L495 AbstractCegarLoop]: Abstraction has 225 states and 328 transitions. [2023-12-15 20:38:08,722 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-15 20:38:08,722 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 328 transitions. [2023-12-15 20:38:08,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-12-15 20:38:08,723 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:38:08,723 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-15 20:38:08,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-15 20:38:08,724 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:38:08,724 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:38:08,724 INFO L85 PathProgramCache]: Analyzing trace with hash 294085926, now seen corresponding path program 1 times [2023-12-15 20:38:08,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:38:08,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615979427] [2023-12-15 20:38:08,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:38:08,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:38:08,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:08,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:38:08,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:08,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:38:08,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:08,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:38:08,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:08,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:38:08,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:08,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:38:08,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:08,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 20:38:08,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:08,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 20:38:08,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:08,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 20:38:08,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:08,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 20:38:08,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:08,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-15 20:38:08,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:08,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-15 20:38:08,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:08,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-15 20:38:08,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:08,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-15 20:38:08,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:08,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-12-15 20:38:08,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:08,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-12-15 20:38:08,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:08,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-12-15 20:38:08,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:08,809 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-15 20:38:08,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:38:08,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615979427] [2023-12-15 20:38:08,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615979427] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:38:08,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:38:08,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 20:38:08,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082511086] [2023-12-15 20:38:08,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:38:08,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 20:38:08,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:38:08,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 20:38:08,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 20:38:08,811 INFO L87 Difference]: Start difference. First operand 225 states and 328 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 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-15 20:38:08,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:38:08,896 INFO L93 Difference]: Finished difference Result 540 states and 787 transitions. [2023-12-15 20:38:08,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 20:38:08,897 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 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-15 20:38:08,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:38:08,899 INFO L225 Difference]: With dead ends: 540 [2023-12-15 20:38:08,899 INFO L226 Difference]: Without dead ends: 316 [2023-12-15 20:38:08,899 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 20:38:08,900 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 67 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 20:38:08,900 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 208 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 20:38:08,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2023-12-15 20:38:08,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 232. [2023-12-15 20:38:08,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 197 states have (on average 1.380710659898477) internal successors, (272), 197 states have internal predecessors, (272), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2023-12-15 20:38:08,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 336 transitions. [2023-12-15 20:38:08,938 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 336 transitions. Word has length 113 [2023-12-15 20:38:08,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:38:08,939 INFO L495 AbstractCegarLoop]: Abstraction has 232 states and 336 transitions. [2023-12-15 20:38:08,939 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 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-15 20:38:08,939 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 336 transitions. [2023-12-15 20:38:08,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-12-15 20:38:08,940 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:38:08,940 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-15 20:38:08,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-15 20:38:08,940 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:38:08,940 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:38:08,940 INFO L85 PathProgramCache]: Analyzing trace with hash -1798271025, now seen corresponding path program 1 times [2023-12-15 20:38:08,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:38:08,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953776490] [2023-12-15 20:38:08,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:38:08,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:38:08,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:08,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:38:08,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:08,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:38:08,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:08,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:38:08,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:08,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:38:08,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:08,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:38:08,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:08,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 20:38:08,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:08,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 20:38:08,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:08,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 20:38:09,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:09,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 20:38:09,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:09,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-15 20:38:09,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:09,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-15 20:38:09,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:09,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-15 20:38:09,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:09,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-15 20:38:09,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:09,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-12-15 20:38:09,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:09,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-12-15 20:38:09,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:09,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-12-15 20:38:09,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:09,010 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-15 20:38:09,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:38:09,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953776490] [2023-12-15 20:38:09,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953776490] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:38:09,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:38:09,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 20:38:09,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480789602] [2023-12-15 20:38:09,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:38:09,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 20:38:09,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:38:09,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 20:38:09,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 20:38:09,012 INFO L87 Difference]: Start difference. First operand 232 states and 336 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 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-15 20:38:09,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:38:09,098 INFO L93 Difference]: Finished difference Result 545 states and 789 transitions. [2023-12-15 20:38:09,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 20:38:09,099 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 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-15 20:38:09,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:38:09,110 INFO L225 Difference]: With dead ends: 545 [2023-12-15 20:38:09,110 INFO L226 Difference]: Without dead ends: 314 [2023-12-15 20:38:09,110 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 20:38:09,111 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 70 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 20:38:09,112 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 175 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 20:38:09,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2023-12-15 20:38:09,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 212. [2023-12-15 20:38:09,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 177 states have (on average 1.3615819209039548) internal successors, (241), 177 states have internal predecessors, (241), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2023-12-15 20:38:09,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 305 transitions. [2023-12-15 20:38:09,151 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 305 transitions. Word has length 113 [2023-12-15 20:38:09,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:38:09,152 INFO L495 AbstractCegarLoop]: Abstraction has 212 states and 305 transitions. [2023-12-15 20:38:09,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 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-15 20:38:09,152 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 305 transitions. [2023-12-15 20:38:09,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-12-15 20:38:09,153 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:38:09,153 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-15 20:38:09,153 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-15 20:38:09,153 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:38:09,153 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:38:09,153 INFO L85 PathProgramCache]: Analyzing trace with hash 582902774, now seen corresponding path program 1 times [2023-12-15 20:38:09,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:38:09,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271517818] [2023-12-15 20:38:09,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:38:09,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:38:09,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:09,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:38:09,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:09,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:38:09,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:09,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:38:09,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:09,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:38:09,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:09,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:38:09,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:09,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 20:38:09,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:09,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 20:38:09,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:09,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 20:38:09,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:09,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 20:38:09,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:09,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-15 20:38:09,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:09,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-15 20:38:09,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:09,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-15 20:38:09,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:09,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-15 20:38:09,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:09,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-12-15 20:38:09,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:09,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-12-15 20:38:09,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:09,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-12-15 20:38:09,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:09,476 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-15 20:38:09,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:38:09,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271517818] [2023-12-15 20:38:09,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271517818] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:38:09,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:38:09,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-15 20:38:09,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828509260] [2023-12-15 20:38:09,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:38:09,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-15 20:38:09,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:38:09,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-15 20:38:09,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-12-15 20:38:09,478 INFO L87 Difference]: Start difference. First operand 212 states and 305 transitions. Second operand has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 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-15 20:38:09,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:38:09,812 INFO L93 Difference]: Finished difference Result 501 states and 704 transitions. [2023-12-15 20:38:09,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-15 20:38:09,812 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 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-15 20:38:09,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:38:09,813 INFO L225 Difference]: With dead ends: 501 [2023-12-15 20:38:09,813 INFO L226 Difference]: Without dead ends: 290 [2023-12-15 20:38:09,814 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2023-12-15 20:38:09,814 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 78 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-15 20:38:09,814 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 489 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-15 20:38:09,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2023-12-15 20:38:09,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 210. [2023-12-15 20:38:09,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 175 states have (on average 1.2914285714285714) internal successors, (226), 175 states have internal predecessors, (226), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2023-12-15 20:38:09,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 290 transitions. [2023-12-15 20:38:09,845 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 290 transitions. Word has length 113 [2023-12-15 20:38:09,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:38:09,845 INFO L495 AbstractCegarLoop]: Abstraction has 210 states and 290 transitions. [2023-12-15 20:38:09,845 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 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-15 20:38:09,845 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 290 transitions. [2023-12-15 20:38:09,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-12-15 20:38:09,846 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:38:09,846 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, 1] [2023-12-15 20:38:09,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-15 20:38:09,846 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:38:09,846 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:38:09,847 INFO L85 PathProgramCache]: Analyzing trace with hash -1538284443, now seen corresponding path program 1 times [2023-12-15 20:38:09,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:38:09,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300816509] [2023-12-15 20:38:09,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:38:09,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:38:09,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:10,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:38:10,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:10,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:38:10,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:10,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:38:10,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:10,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:38:10,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:10,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:38:10,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:10,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 20:38:10,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:10,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 20:38:10,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:10,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 20:38:10,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:10,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 20:38:10,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:10,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-15 20:38:10,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:10,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-15 20:38:10,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:10,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-15 20:38:10,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:10,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-15 20:38:10,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:10,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-12-15 20:38:10,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:10,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-12-15 20:38:10,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:10,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-12-15 20:38:10,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:10,130 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-15 20:38:10,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:38:10,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300816509] [2023-12-15 20:38:10,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300816509] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:38:10,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:38:10,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-15 20:38:10,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570369265] [2023-12-15 20:38:10,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:38:10,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-15 20:38:10,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:38:10,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-15 20:38:10,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-12-15 20:38:10,131 INFO L87 Difference]: Start difference. First operand 210 states and 290 transitions. Second operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-15 20:38:10,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:38:10,594 INFO L93 Difference]: Finished difference Result 518 states and 716 transitions. [2023-12-15 20:38:10,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-15 20:38:10,595 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 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 114 [2023-12-15 20:38:10,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:38:10,596 INFO L225 Difference]: With dead ends: 518 [2023-12-15 20:38:10,596 INFO L226 Difference]: Without dead ends: 309 [2023-12-15 20:38:10,597 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2023-12-15 20:38:10,597 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 185 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 602 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-15 20:38:10,597 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 602 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-15 20:38:10,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2023-12-15 20:38:10,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 218. [2023-12-15 20:38:10,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 183 states have (on average 1.289617486338798) internal successors, (236), 183 states have internal predecessors, (236), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2023-12-15 20:38:10,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 300 transitions. [2023-12-15 20:38:10,629 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 300 transitions. Word has length 114 [2023-12-15 20:38:10,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:38:10,629 INFO L495 AbstractCegarLoop]: Abstraction has 218 states and 300 transitions. [2023-12-15 20:38:10,629 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-15 20:38:10,629 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 300 transitions. [2023-12-15 20:38:10,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-12-15 20:38:10,630 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:38:10,630 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, 1] [2023-12-15 20:38:10,630 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-15 20:38:10,630 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:38:10,630 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:38:10,631 INFO L85 PathProgramCache]: Analyzing trace with hash -1105564529, now seen corresponding path program 1 times [2023-12-15 20:38:10,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:38:10,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318164099] [2023-12-15 20:38:10,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:38:10,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:38:10,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:10,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:38:10,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:10,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:38:10,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:10,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:38:10,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:10,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:38:10,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:10,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:38:10,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:10,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 20:38:10,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:10,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 20:38:10,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:10,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 20:38:10,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:10,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 20:38:10,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:10,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-15 20:38:10,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:10,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-15 20:38:10,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:10,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-15 20:38:10,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:10,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-15 20:38:10,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:10,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-12-15 20:38:10,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:10,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-12-15 20:38:10,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:10,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-12-15 20:38:10,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:38:10,697 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-15 20:38:10,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:38:10,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318164099] [2023-12-15 20:38:10,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318164099] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:38:10,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:38:10,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 20:38:10,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109936331] [2023-12-15 20:38:10,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:38:10,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 20:38:10,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:38:10,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 20:38:10,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 20:38:10,698 INFO L87 Difference]: Start difference. First operand 218 states and 300 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-15 20:38:10,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:38:10,789 INFO L93 Difference]: Finished difference Result 551 states and 757 transitions. [2023-12-15 20:38:10,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 20:38:10,789 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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 114 [2023-12-15 20:38:10,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:38:10,790 INFO L225 Difference]: With dead ends: 551 [2023-12-15 20:38:10,791 INFO L226 Difference]: Without dead ends: 334 [2023-12-15 20:38:10,791 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 20:38:10,791 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 76 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 20:38:10,792 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 160 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 20:38:10,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2023-12-15 20:38:10,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 246. [2023-12-15 20:38:10,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 211 states have (on average 1.2748815165876777) internal successors, (269), 211 states have internal predecessors, (269), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2023-12-15 20:38:10,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 333 transitions. [2023-12-15 20:38:10,825 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 333 transitions. Word has length 114 [2023-12-15 20:38:10,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:38:10,825 INFO L495 AbstractCegarLoop]: Abstraction has 246 states and 333 transitions. [2023-12-15 20:38:10,825 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-15 20:38:10,826 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 333 transitions. [2023-12-15 20:38:10,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-12-15 20:38:10,826 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:38:10,826 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, 1] [2023-12-15 20:38:10,826 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-15 20:38:10,827 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:38:10,827 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:38:10,827 INFO L85 PathProgramCache]: Analyzing trace with hash -1103717487, now seen corresponding path program 1 times [2023-12-15 20:38:10,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:38:10,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414606466] [2023-12-15 20:38:10,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:38:10,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:38:10,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-15 20:38:10,854 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-15 20:38:10,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-15 20:38:10,909 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-15 20:38:10,909 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-15 20:38:10,909 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-15 20:38:10,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-15 20:38:10,913 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 20:38:10,915 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-15 20:38:10,962 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.12 08:38:10 BoogieIcfgContainer [2023-12-15 20:38:10,962 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-15 20:38:10,962 INFO L158 Benchmark]: Toolchain (without parser) took 6350.98ms. Allocated memory was 179.3MB in the beginning and 329.3MB in the end (delta: 149.9MB). Free memory was 146.7MB in the beginning and 176.1MB in the end (delta: -29.4MB). Peak memory consumption was 121.6MB. Max. memory is 8.0GB. [2023-12-15 20:38:10,962 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 179.3MB. Free memory was 137.1MB in the beginning and 137.1MB in the end (delta: 77.0kB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-15 20:38:10,962 INFO L158 Benchmark]: CACSL2BoogieTranslator took 238.24ms. Allocated memory is still 179.3MB. Free memory was 146.2MB in the beginning and 132.1MB in the end (delta: 14.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2023-12-15 20:38:10,962 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.62ms. Allocated memory is still 179.3MB. Free memory was 132.1MB in the beginning and 128.4MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-15 20:38:10,963 INFO L158 Benchmark]: Boogie Preprocessor took 61.72ms. Allocated memory is still 179.3MB. Free memory was 128.4MB in the beginning and 123.2MB in the end (delta: 5.2MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2023-12-15 20:38:10,963 INFO L158 Benchmark]: RCFGBuilder took 476.43ms. Allocated memory is still 179.3MB. Free memory was 123.2MB in the beginning and 99.1MB in the end (delta: 24.1MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. [2023-12-15 20:38:10,963 INFO L158 Benchmark]: TraceAbstraction took 5517.45ms. Allocated memory was 179.3MB in the beginning and 329.3MB in the end (delta: 149.9MB). Free memory was 98.6MB in the beginning and 176.1MB in the end (delta: -77.5MB). Peak memory consumption was 73.4MB. Max. memory is 8.0GB. [2023-12-15 20:38:10,964 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.11ms. Allocated memory is still 179.3MB. Free memory was 137.1MB in the beginning and 137.1MB in the end (delta: 77.0kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 238.24ms. Allocated memory is still 179.3MB. Free memory was 146.2MB in the beginning and 132.1MB in the end (delta: 14.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 51.62ms. Allocated memory is still 179.3MB. Free memory was 132.1MB in the beginning and 128.4MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 61.72ms. Allocated memory is still 179.3MB. Free memory was 128.4MB in the beginning and 123.2MB in the end (delta: 5.2MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * RCFGBuilder took 476.43ms. Allocated memory is still 179.3MB. Free memory was 123.2MB in the beginning and 99.1MB in the end (delta: 24.1MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. * TraceAbstraction took 5517.45ms. Allocated memory was 179.3MB in the beginning and 329.3MB in the end (delta: 149.9MB). Free memory was 98.6MB in the beginning and 176.1MB in the end (delta: -77.5MB). Peak memory consumption was 73.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 124, overapproximation of someBinaryFLOATComparisonOperation at line 124, overapproximation of shiftRight at line 124. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = 64; [L23] unsigned char var_1_7 = 0; [L24] unsigned short int var_1_11 = 500; [L25] unsigned char var_1_13 = 64; [L26] unsigned char var_1_15 = 1; [L27] unsigned char var_1_16 = 8; [L28] double var_1_17 = 7.5; [L29] double var_1_18 = 31.125; [L30] double var_1_19 = 10.5; [L31] double var_1_20 = 0.0; [L32] double var_1_21 = 16.75; [L33] double var_1_22 = 2.5; [L34] double var_1_23 = 64.5; [L35] signed long int var_1_24 = 10; [L36] signed char var_1_26 = 16; [L37] signed char var_1_27 = 4; [L38] signed char var_1_28 = -10; [L39] float var_1_29 = 63.794; [L40] unsigned short int var_1_30 = 1; [L41] signed long int var_1_31 = -2; [L42] unsigned char var_1_32 = 64; [L43] signed long int last_1_var_1_1 = 64; [L44] unsigned char last_1_var_1_13 = 64; [L128] isInitial = 1 [L129] FCALL initially() [L130] COND TRUE 1 [L131] CALL updateLastVariables() [L120] last_1_var_1_1 = var_1_1 [L121] last_1_var_1_13 = var_1_13 [L131] RET updateLastVariables() [L132] CALL updateVariables() [L91] var_1_7 = __VERIFIER_nondet_uchar() [L92] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64] [L92] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64] [L93] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L93] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L94] var_1_15 = __VERIFIER_nondet_uchar() [L95] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L95] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L96] CALL assume_abort_if_not(var_1_15 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L96] RET assume_abort_if_not(var_1_15 <= 254) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L97] var_1_16 = __VERIFIER_nondet_uchar() [L98] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L98] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L99] CALL assume_abort_if_not(var_1_16 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L99] RET assume_abort_if_not(var_1_16 <= 254) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L100] var_1_18 = __VERIFIER_nondet_double() [L101] CALL assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L101] RET assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L102] var_1_19 = __VERIFIER_nondet_double() [L103] CALL assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L103] RET assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L104] var_1_20 = __VERIFIER_nondet_double() [L105] CALL assume_abort_if_not((var_1_20 >= 4611686.018427382800e+12F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L105] RET assume_abort_if_not((var_1_20 >= 4611686.018427382800e+12F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L106] var_1_21 = __VERIFIER_nondet_double() [L107] CALL assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 4611686.018427382800e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L107] RET assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 4611686.018427382800e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L108] var_1_22 = __VERIFIER_nondet_double() [L109] CALL assume_abort_if_not((var_1_22 >= -922337.2036854765600e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L109] RET assume_abort_if_not((var_1_22 >= -922337.2036854765600e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L110] var_1_23 = __VERIFIER_nondet_double() [L111] CALL assume_abort_if_not((var_1_23 >= -922337.2036854765600e+13F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 9223372.036854765600e+12F && var_1_23 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L111] RET assume_abort_if_not((var_1_23 >= -922337.2036854765600e+13F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 9223372.036854765600e+12F && var_1_23 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L112] var_1_27 = __VERIFIER_nondet_char() [L113] CALL assume_abort_if_not(var_1_27 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L113] RET assume_abort_if_not(var_1_27 >= -63) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L114] CALL assume_abort_if_not(var_1_27 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L114] RET assume_abort_if_not(var_1_27 <= 63) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L115] var_1_28 = __VERIFIER_nondet_char() [L116] CALL assume_abort_if_not(var_1_28 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L116] RET assume_abort_if_not(var_1_28 >= -63) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L117] CALL assume_abort_if_not(var_1_28 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L117] RET assume_abort_if_not(var_1_28 <= 63) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L132] RET updateVariables() [L133] CALL step() [L48] signed long int stepLocal_1 = last_1_var_1_1; VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L49] COND FALSE !(stepLocal_1 != last_1_var_1_13) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L52] var_1_31 = var_1_13 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=64, var_1_32=64, var_1_7=0] [L53] COND FALSE !(\read(var_1_7)) [L56] var_1_17 = var_1_22 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=505, var_1_1=64, var_1_22=505, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=64, var_1_32=64, var_1_7=0] [L58] COND FALSE !(\read(var_1_7)) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=505, var_1_1=64, var_1_22=505, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=64, var_1_32=64, var_1_7=0] [L61] var_1_32 = var_1_16 [L62] var_1_30 = var_1_32 [L63] unsigned char stepLocal_0 = var_1_13; VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_0=64, stepLocal_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=505, var_1_1=64, var_1_22=505, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_7=0] [L64] EXPR var_1_32 >> var_1_32 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_0=64, stepLocal_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=505, var_1_1=64, var_1_22=505, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_7=0] [L64] COND TRUE (var_1_32 >> var_1_32) < stepLocal_0 [L65] var_1_11 = var_1_32 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_0=64, stepLocal_1=64, var_1_11=68, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=505, var_1_1=64, var_1_22=505, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_7=0] [L67] COND TRUE var_1_11 >= var_1_30 [L68] var_1_26 = (var_1_27 + var_1_28) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_0=64, stepLocal_1=64, var_1_11=68, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=505, var_1_1=64, var_1_22=505, var_1_24=10, var_1_26=-126, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_7=0] [L70] EXPR (var_1_31 + 4u) | var_1_30 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_0=64, stepLocal_1=64, var_1_11=68, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=505, var_1_1=64, var_1_22=505, var_1_24=10, var_1_26=-126, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_7=0] [L70] COND TRUE 32u < ((var_1_31 + 4u) | var_1_30) [L71] var_1_1 = (var_1_26 + (var_1_26 + var_1_32)) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_0=64, stepLocal_1=64, var_1_11=68, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=505, var_1_1=-184, var_1_22=505, var_1_24=10, var_1_26=-126, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_7=0] [L79] unsigned short int stepLocal_2 = var_1_30; VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_0=64, stepLocal_1=64, stepLocal_2=68, var_1_11=68, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=505, var_1_1=-184, var_1_22=505, var_1_24=10, var_1_26=-126, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_7=0] [L80] COND TRUE ! var_1_7 [L81] var_1_24 = (var_1_11 - ((((((((var_1_30) > (var_1_13)) ? (var_1_30) : (var_1_13)))) < ((var_1_30 + var_1_15))) ? (((((var_1_30) > (var_1_13)) ? (var_1_30) : (var_1_13)))) : ((var_1_30 + var_1_15))))) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_0=64, stepLocal_1=64, stepLocal_2=68, var_1_11=68, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=505, var_1_1=-184, var_1_22=505, var_1_24=0, var_1_26=-126, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_7=0] [L133] RET step() [L134] CALL, EXPR property() [L124] EXPR (var_1_31 + 4u) | var_1_30 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=68, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=505, var_1_1=-184, var_1_22=505, var_1_24=0, var_1_26=-126, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_7=0] [L124] EXPR ((32u < ((var_1_31 + 4u) | var_1_30)) ? (var_1_1 == ((signed long int) (var_1_26 + (var_1_26 + var_1_32)))) : ((! var_1_7) ? (var_1_1 == ((signed long int) ((((var_1_26) < ((var_1_11 - var_1_32))) ? (var_1_26) : ((var_1_11 - var_1_32)))))) : (var_1_1 == ((signed long int) (var_1_32 - var_1_13))))) && (((var_1_32 >> var_1_32) < var_1_13) ? (var_1_11 == ((unsigned short int) var_1_32)) : 1) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=68, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=505, var_1_1=-184, var_1_22=505, var_1_24=0, var_1_26=-126, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_7=0] [L124] EXPR var_1_32 >> var_1_32 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=68, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=505, var_1_1=-184, var_1_22=505, var_1_24=0, var_1_26=-126, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_7=0] [L124] EXPR ((32u < ((var_1_31 + 4u) | var_1_30)) ? (var_1_1 == ((signed long int) (var_1_26 + (var_1_26 + var_1_32)))) : ((! var_1_7) ? (var_1_1 == ((signed long int) ((((var_1_26) < ((var_1_11 - var_1_32))) ? (var_1_26) : ((var_1_11 - var_1_32)))))) : (var_1_1 == ((signed long int) (var_1_32 - var_1_13))))) && (((var_1_32 >> var_1_32) < var_1_13) ? (var_1_11 == ((unsigned short int) var_1_32)) : 1) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=68, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=505, var_1_1=-184, var_1_22=505, var_1_24=0, var_1_26=-126, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_7=0] [L124-L125] return ((((((((((32u < ((var_1_31 + 4u) | var_1_30)) ? (var_1_1 == ((signed long int) (var_1_26 + (var_1_26 + var_1_32)))) : ((! var_1_7) ? (var_1_1 == ((signed long int) ((((var_1_26) < ((var_1_11 - var_1_32))) ? (var_1_26) : ((var_1_11 - var_1_32)))))) : (var_1_1 == ((signed long int) (var_1_32 - var_1_13))))) && (((var_1_32 >> var_1_32) < var_1_13) ? (var_1_11 == ((unsigned short int) var_1_32)) : 1)) && ((last_1_var_1_1 != last_1_var_1_13) ? (var_1_13 == ((unsigned char) ((((var_1_15) < (var_1_16)) ? (var_1_15) : (var_1_16))))) : 1)) && (var_1_7 ? (var_1_17 == ((double) ((((((var_1_18 + var_1_19) - (var_1_20 - var_1_21))) < (((((var_1_22) > (var_1_23)) ? (var_1_22) : (var_1_23))))) ? (((var_1_18 + var_1_19) - (var_1_20 - var_1_21))) : (((((var_1_22) > (var_1_23)) ? (var_1_22) : (var_1_23)))))))) : (var_1_17 == ((double) var_1_22)))) && ((! var_1_7) ? (var_1_24 == ((signed long int) (var_1_11 - ((((((((var_1_30) > (var_1_13)) ? (var_1_30) : (var_1_13)))) < ((var_1_30 + var_1_15))) ? (((((var_1_30) > (var_1_13)) ? (var_1_30) : (var_1_13)))) : ((var_1_30 + var_1_15))))))) : ((var_1_11 < var_1_30) ? (var_1_24 == ((signed long int) -4)) : (var_1_24 == ((signed long int) var_1_26))))) && ((var_1_11 >= var_1_30) ? (var_1_26 == ((signed char) (var_1_27 + var_1_28))) : 1)) && (var_1_7 ? (var_1_29 == ((float) var_1_20)) : 1)) && (var_1_30 == ((unsigned short int) var_1_32))) && (var_1_31 == ((signed long int) var_1_13))) && (var_1_32 == ((unsigned char) var_1_16)) ; [L134] RET, EXPR property() [L134] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=68, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=505, var_1_1=-184, var_1_22=505, var_1_24=0, var_1_26=-126, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_7=0] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=68, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=505, var_1_1=-184, var_1_22=505, var_1_24=0, var_1_26=-126, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_7=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 62 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.4s, OverallIterations: 13, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1301 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1301 mSDsluCounter, 3406 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2035 mSDsCounter, 235 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1300 IncrementalHoareTripleChecker+Invalid, 1535 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 235 mSolverCounterUnsat, 1371 mSDtfsCounter, 1300 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 490 GetRequests, 435 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=246occurred in iteration=12, InterpolantAutomatonStates: 74, 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, 12 MinimizatonAttempts, 765 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 1466 NumberOfCodeBlocks, 1466 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1340 ConstructedInterpolants, 0 QuantifiedInterpolants, 3395 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 5760/5760 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-12-15 20:38:10,998 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...