/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-33.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-15 20:39:59,124 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-15 20:39:59,187 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:39:59,191 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-15 20:39:59,192 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-15 20:39:59,214 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-15 20:39:59,215 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-15 20:39:59,215 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-15 20:39:59,215 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-15 20:39:59,218 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-15 20:39:59,218 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-15 20:39:59,219 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-15 20:39:59,219 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-15 20:39:59,220 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-15 20:39:59,221 INFO L153 SettingsManager]: * Use SBE=true [2023-12-15 20:39:59,221 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-15 20:39:59,221 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-15 20:39:59,221 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-15 20:39:59,221 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-15 20:39:59,222 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-15 20:39:59,222 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-15 20:39:59,223 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-15 20:39:59,223 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-15 20:39:59,223 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-15 20:39:59,223 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-15 20:39:59,223 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-15 20:39:59,223 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-15 20:39:59,224 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-15 20:39:59,224 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-15 20:39:59,224 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-15 20:39:59,225 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-15 20:39:59,225 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-15 20:39:59,225 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 20:39:59,226 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-15 20:39:59,226 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-15 20:39:59,226 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-15 20:39:59,226 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-15 20:39:59,226 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-15 20:39:59,226 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-15 20:39:59,226 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-15 20:39:59,226 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-15 20:39:59,227 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-15 20:39:59,227 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-15 20:39:59,227 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:39:59,414 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-15 20:39:59,429 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-15 20:39:59,431 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-15 20:39:59,432 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-15 20:39:59,432 INFO L274 PluginConnector]: CDTParser initialized [2023-12-15 20:39:59,433 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-33.i [2023-12-15 20:40:00,416 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-15 20:40:00,553 INFO L384 CDTParser]: Found 1 translation units. [2023-12-15 20:40:00,553 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-33.i [2023-12-15 20:40:00,559 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e39adea1/6a1d848197804aadaf0c770ed48ba689/FLAGb0c46d830 [2023-12-15 20:40:00,569 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e39adea1/6a1d848197804aadaf0c770ed48ba689 [2023-12-15 20:40:00,570 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-15 20:40:00,571 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-15 20:40:00,572 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-15 20:40:00,572 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-15 20:40:00,575 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-15 20:40:00,576 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 08:40:00" (1/1) ... [2023-12-15 20:40:00,576 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@317c196b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:40:00, skipping insertion in model container [2023-12-15 20:40:00,576 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 08:40:00" (1/1) ... [2023-12-15 20:40:00,590 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-15 20:40:00,703 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-33.i[917,930] [2023-12-15 20:40:00,753 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 20:40:00,761 INFO L202 MainTranslator]: Completed pre-run [2023-12-15 20:40:00,768 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-33.i[917,930] [2023-12-15 20:40:00,778 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 20:40:00,788 INFO L206 MainTranslator]: Completed translation [2023-12-15 20:40:00,789 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:40:00 WrapperNode [2023-12-15 20:40:00,789 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-15 20:40:00,790 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-15 20:40:00,790 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-15 20:40:00,790 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-15 20:40:00,794 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:40:00" (1/1) ... [2023-12-15 20:40:00,810 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:40:00" (1/1) ... [2023-12-15 20:40:00,830 INFO L138 Inliner]: procedures = 26, calls = 22, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 170 [2023-12-15 20:40:00,830 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-15 20:40:00,831 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-15 20:40:00,831 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-15 20:40:00,831 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-15 20:40:00,854 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:40:00" (1/1) ... [2023-12-15 20:40:00,854 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:40:00" (1/1) ... [2023-12-15 20:40:00,856 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:40:00" (1/1) ... [2023-12-15 20:40:00,876 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-12-15 20:40:00,877 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:40:00" (1/1) ... [2023-12-15 20:40:00,877 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:40:00" (1/1) ... [2023-12-15 20:40:00,891 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:40:00" (1/1) ... [2023-12-15 20:40:00,894 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:40:00" (1/1) ... [2023-12-15 20:40:00,895 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:40:00" (1/1) ... [2023-12-15 20:40:00,896 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:40:00" (1/1) ... [2023-12-15 20:40:00,898 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-15 20:40:00,899 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-15 20:40:00,899 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-15 20:40:00,899 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-15 20:40:00,899 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:40:00" (1/1) ... [2023-12-15 20:40:00,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 20:40:00,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 20:40:00,925 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-15 20:40:00,941 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-15 20:40:00,948 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-15 20:40:00,948 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-15 20:40:00,948 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-15 20:40:00,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-15 20:40:00,948 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-15 20:40:00,948 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-15 20:40:01,007 INFO L241 CfgBuilder]: Building ICFG [2023-12-15 20:40:01,010 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-15 20:40:01,295 INFO L282 CfgBuilder]: Performing block encoding [2023-12-15 20:40:01,325 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-15 20:40:01,325 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-15 20:40:01,325 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 08:40:01 BoogieIcfgContainer [2023-12-15 20:40:01,326 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-15 20:40:01,327 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-15 20:40:01,327 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-15 20:40:01,329 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-15 20:40:01,329 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.12 08:40:00" (1/3) ... [2023-12-15 20:40:01,330 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d3be66c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 08:40:01, skipping insertion in model container [2023-12-15 20:40:01,330 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:40:00" (2/3) ... [2023-12-15 20:40:01,330 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d3be66c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 08:40:01, skipping insertion in model container [2023-12-15 20:40:01,330 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 08:40:01" (3/3) ... [2023-12-15 20:40:01,334 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-33.i [2023-12-15 20:40:01,346 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-15 20:40:01,346 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-15 20:40:01,378 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-15 20:40:01,383 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;@678476b2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-15 20:40:01,383 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-15 20:40:01,386 INFO L276 IsEmpty]: Start isEmpty. Operand has 54 states, 42 states have (on average 1.5952380952380953) internal successors, (67), 43 states have internal predecessors, (67), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-12-15 20:40:01,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-12-15 20:40:01,393 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:40:01,393 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 20:40:01,394 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:40:01,397 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:40:01,397 INFO L85 PathProgramCache]: Analyzing trace with hash -169966129, now seen corresponding path program 1 times [2023-12-15 20:40:01,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:40:01,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349010554] [2023-12-15 20:40:01,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:40:01,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:40:01,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:01,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:40:01,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:01,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:40:01,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:01,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:40:01,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:01,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:40:01,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:01,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:40:01,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:01,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-15 20:40:01,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:01,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-15 20:40:01,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:01,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-15 20:40:01,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:01,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 20:40:01,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:01,620 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-12-15 20:40:01,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:40:01,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349010554] [2023-12-15 20:40:01,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349010554] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:40:01,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:40:01,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-15 20:40:01,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493734592] [2023-12-15 20:40:01,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:40:01,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-15 20:40:01,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:40:01,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-15 20:40:01,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-15 20:40:01,651 INFO L87 Difference]: Start difference. First operand has 54 states, 42 states have (on average 1.5952380952380953) internal successors, (67), 43 states have internal predecessors, (67), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2023-12-15 20:40:01,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:40:01,685 INFO L93 Difference]: Finished difference Result 105 states and 177 transitions. [2023-12-15 20:40:01,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-15 20:40:01,687 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 70 [2023-12-15 20:40:01,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:40:01,692 INFO L225 Difference]: With dead ends: 105 [2023-12-15 20:40:01,692 INFO L226 Difference]: Without dead ends: 52 [2023-12-15 20:40:01,695 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-15 20:40:01,699 INFO L413 NwaCegarLoop]: 77 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, 77 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 20:40:01,700 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 77 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 20:40:01,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2023-12-15 20:40:01,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2023-12-15 20:40:01,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 41 states have (on average 1.5121951219512195) internal successors, (62), 41 states have internal predecessors, (62), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-12-15 20:40:01,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 80 transitions. [2023-12-15 20:40:01,734 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 80 transitions. Word has length 70 [2023-12-15 20:40:01,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:40:01,735 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 80 transitions. [2023-12-15 20:40:01,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2023-12-15 20:40:01,735 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 80 transitions. [2023-12-15 20:40:01,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-12-15 20:40:01,742 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:40:01,742 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 20:40:01,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-15 20:40:01,743 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:40:01,744 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:40:01,744 INFO L85 PathProgramCache]: Analyzing trace with hash -353899831, now seen corresponding path program 1 times [2023-12-15 20:40:01,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:40:01,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087287736] [2023-12-15 20:40:01,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:40:01,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:40:01,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:01,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:40:01,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:01,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:40:01,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:01,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:40:01,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:01,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:40:01,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:01,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:40:01,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:01,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-15 20:40:01,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:01,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-15 20:40:01,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:01,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-15 20:40:01,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:01,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 20:40:01,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:01,971 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-12-15 20:40:01,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:40:01,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087287736] [2023-12-15 20:40:01,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087287736] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:40:01,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:40:01,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 20:40:01,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133407818] [2023-12-15 20:40:01,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:40:01,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 20:40:01,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:40:01,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 20:40:01,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 20:40:01,975 INFO L87 Difference]: Start difference. First operand 52 states and 80 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-15 20:40:02,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:40:02,001 INFO L93 Difference]: Finished difference Result 104 states and 161 transitions. [2023-12-15 20:40:02,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 20:40:02,003 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 70 [2023-12-15 20:40:02,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:40:02,004 INFO L225 Difference]: With dead ends: 104 [2023-12-15 20:40:02,004 INFO L226 Difference]: Without dead ends: 53 [2023-12-15 20:40:02,004 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 20:40:02,005 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 0 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 20:40:02,005 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 146 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 20:40:02,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2023-12-15 20:40:02,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2023-12-15 20:40:02,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 42 states have (on average 1.5) internal successors, (63), 42 states have internal predecessors, (63), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-12-15 20:40:02,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 81 transitions. [2023-12-15 20:40:02,023 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 81 transitions. Word has length 70 [2023-12-15 20:40:02,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:40:02,024 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 81 transitions. [2023-12-15 20:40:02,025 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-15 20:40:02,025 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 81 transitions. [2023-12-15 20:40:02,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-12-15 20:40:02,026 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:40:02,026 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 20:40:02,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-15 20:40:02,026 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:40:02,026 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:40:02,026 INFO L85 PathProgramCache]: Analyzing trace with hash -1163246457, now seen corresponding path program 1 times [2023-12-15 20:40:02,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:40:02,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165364193] [2023-12-15 20:40:02,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:40:02,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:40:02,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:02,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:40:02,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:02,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:40:02,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:02,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:40:02,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:02,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:40:02,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:02,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:40:02,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:02,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-15 20:40:02,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:02,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-15 20:40:02,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:02,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-15 20:40:02,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:02,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 20:40:02,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:02,187 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-12-15 20:40:02,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:40:02,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165364193] [2023-12-15 20:40:02,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165364193] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:40:02,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:40:02,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-15 20:40:02,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007660754] [2023-12-15 20:40:02,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:40:02,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 20:40:02,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:40:02,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 20:40:02,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-15 20:40:02,192 INFO L87 Difference]: Start difference. First operand 53 states and 81 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-15 20:40:02,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:40:02,352 INFO L93 Difference]: Finished difference Result 136 states and 207 transitions. [2023-12-15 20:40:02,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-15 20:40:02,352 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 70 [2023-12-15 20:40:02,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:40:02,356 INFO L225 Difference]: With dead ends: 136 [2023-12-15 20:40:02,356 INFO L226 Difference]: Without dead ends: 84 [2023-12-15 20:40:02,358 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-15 20:40:02,360 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 99 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 20:40:02,361 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 242 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 20:40:02,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2023-12-15 20:40:02,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 55. [2023-12-15 20:40:02,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 44 states have (on average 1.4772727272727273) internal successors, (65), 44 states have internal predecessors, (65), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-12-15 20:40:02,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 83 transitions. [2023-12-15 20:40:02,370 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 83 transitions. Word has length 70 [2023-12-15 20:40:02,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:40:02,371 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 83 transitions. [2023-12-15 20:40:02,371 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-15 20:40:02,371 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 83 transitions. [2023-12-15 20:40:02,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-12-15 20:40:02,371 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:40:02,372 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 20:40:02,372 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-15 20:40:02,372 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:40:02,372 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:40:02,372 INFO L85 PathProgramCache]: Analyzing trace with hash -462181879, now seen corresponding path program 1 times [2023-12-15 20:40:02,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:40:02,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298779395] [2023-12-15 20:40:02,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:40:02,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:40:02,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:03,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:40:03,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:03,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:40:03,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:03,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:40:03,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:03,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:40:03,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:03,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:40:03,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:03,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-15 20:40:03,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:03,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-15 20:40:03,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:03,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-15 20:40:03,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:03,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 20:40:03,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:03,868 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-12-15 20:40:03,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:40:03,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298779395] [2023-12-15 20:40:03,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298779395] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:40:03,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:40:03,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-15 20:40:03,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419882431] [2023-12-15 20:40:03,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:40:03,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-15 20:40:03,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:40:03,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-15 20:40:03,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2023-12-15 20:40:03,871 INFO L87 Difference]: Start difference. First operand 55 states and 83 transitions. Second operand has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-15 20:40:04,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:40:04,542 INFO L93 Difference]: Finished difference Result 218 states and 333 transitions. [2023-12-15 20:40:04,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-15 20:40:04,542 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 70 [2023-12-15 20:40:04,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:40:04,543 INFO L225 Difference]: With dead ends: 218 [2023-12-15 20:40:04,543 INFO L226 Difference]: Without dead ends: 164 [2023-12-15 20:40:04,544 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=90, Invalid=150, Unknown=0, NotChecked=0, Total=240 [2023-12-15 20:40:04,544 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 361 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 361 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-15 20:40:04,544 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [361 Valid, 263 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-15 20:40:04,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2023-12-15 20:40:04,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 71. [2023-12-15 20:40:04,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 60 states have (on average 1.4833333333333334) internal successors, (89), 60 states have internal predecessors, (89), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-12-15 20:40:04,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 107 transitions. [2023-12-15 20:40:04,549 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 107 transitions. Word has length 70 [2023-12-15 20:40:04,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:40:04,550 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 107 transitions. [2023-12-15 20:40:04,550 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-15 20:40:04,550 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 107 transitions. [2023-12-15 20:40:04,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-12-15 20:40:04,551 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:40:04,551 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 20:40:04,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-15 20:40:04,551 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:40:04,551 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:40:04,551 INFO L85 PathProgramCache]: Analyzing trace with hash -2050529781, now seen corresponding path program 1 times [2023-12-15 20:40:04,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:40:04,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169868030] [2023-12-15 20:40:04,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:40:04,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:40:04,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:04,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:40:04,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:04,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:40:04,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:04,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:40:04,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:04,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:40:04,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:04,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:40:04,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:04,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-15 20:40:04,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:04,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-15 20:40:04,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:04,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-15 20:40:04,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:04,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 20:40:04,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:04,818 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-12-15 20:40:04,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:40:04,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169868030] [2023-12-15 20:40:04,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169868030] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:40:04,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:40:04,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-15 20:40:04,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283108055] [2023-12-15 20:40:04,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:40:04,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-15 20:40:04,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:40:04,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-15 20:40:04,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-15 20:40:04,819 INFO L87 Difference]: Start difference. First operand 71 states and 107 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-15 20:40:05,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:40:05,071 INFO L93 Difference]: Finished difference Result 205 states and 313 transitions. [2023-12-15 20:40:05,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-15 20:40:05,073 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 70 [2023-12-15 20:40:05,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:40:05,073 INFO L225 Difference]: With dead ends: 205 [2023-12-15 20:40:05,073 INFO L226 Difference]: Without dead ends: 135 [2023-12-15 20:40:05,074 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2023-12-15 20:40:05,074 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 144 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-15 20:40:05,075 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 334 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-15 20:40:05,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2023-12-15 20:40:05,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 78. [2023-12-15 20:40:05,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 67 states have (on average 1.507462686567164) internal successors, (101), 67 states have internal predecessors, (101), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-12-15 20:40:05,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 119 transitions. [2023-12-15 20:40:05,079 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 119 transitions. Word has length 70 [2023-12-15 20:40:05,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:40:05,079 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 119 transitions. [2023-12-15 20:40:05,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-15 20:40:05,079 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 119 transitions. [2023-12-15 20:40:05,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-12-15 20:40:05,082 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:40:05,082 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 20:40:05,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-15 20:40:05,083 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:40:05,083 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:40:05,083 INFO L85 PathProgramCache]: Analyzing trace with hash 47215431, now seen corresponding path program 1 times [2023-12-15 20:40:05,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:40:05,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559651568] [2023-12-15 20:40:05,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:40:05,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:40:05,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:05,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:40:05,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:05,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:40:05,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:05,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:40:05,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:05,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:40:05,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:05,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:40:05,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:05,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-15 20:40:05,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:05,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-15 20:40:05,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:05,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-15 20:40:05,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:05,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 20:40:05,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:05,135 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-12-15 20:40:05,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:40:05,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559651568] [2023-12-15 20:40:05,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559651568] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:40:05,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:40:05,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 20:40:05,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710326919] [2023-12-15 20:40:05,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:40:05,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 20:40:05,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:40:05,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 20:40:05,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 20:40:05,137 INFO L87 Difference]: Start difference. First operand 78 states and 119 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-15 20:40:05,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:40:05,167 INFO L93 Difference]: Finished difference Result 205 states and 312 transitions. [2023-12-15 20:40:05,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 20:40:05,168 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 71 [2023-12-15 20:40:05,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:40:05,170 INFO L225 Difference]: With dead ends: 205 [2023-12-15 20:40:05,170 INFO L226 Difference]: Without dead ends: 128 [2023-12-15 20:40:05,170 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 20:40:05,171 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 50 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 20:40:05,173 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 164 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 20:40:05,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2023-12-15 20:40:05,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 95. [2023-12-15 20:40:05,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 84 states have (on average 1.4880952380952381) internal successors, (125), 84 states have internal predecessors, (125), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-12-15 20:40:05,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 143 transitions. [2023-12-15 20:40:05,189 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 143 transitions. Word has length 71 [2023-12-15 20:40:05,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:40:05,189 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 143 transitions. [2023-12-15 20:40:05,189 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-15 20:40:05,189 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 143 transitions. [2023-12-15 20:40:05,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-12-15 20:40:05,192 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:40:05,193 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 20:40:05,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-15 20:40:05,193 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:40:05,193 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:40:05,193 INFO L85 PathProgramCache]: Analyzing trace with hash -659479525, now seen corresponding path program 1 times [2023-12-15 20:40:05,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:40:05,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359003226] [2023-12-15 20:40:05,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:40:05,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:40:05,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:05,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:40:05,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:05,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:40:05,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:05,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:40:05,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:05,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:40:05,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:05,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:40:05,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:05,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-15 20:40:05,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:05,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-15 20:40:05,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:05,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-15 20:40:05,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:05,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 20:40:05,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:05,247 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-12-15 20:40:05,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:40:05,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359003226] [2023-12-15 20:40:05,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359003226] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:40:05,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:40:05,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 20:40:05,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730200794] [2023-12-15 20:40:05,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:40:05,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 20:40:05,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:40:05,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 20:40:05,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 20:40:05,249 INFO L87 Difference]: Start difference. First operand 95 states and 143 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-15 20:40:05,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:40:05,279 INFO L93 Difference]: Finished difference Result 222 states and 331 transitions. [2023-12-15 20:40:05,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 20:40:05,279 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 71 [2023-12-15 20:40:05,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:40:05,281 INFO L225 Difference]: With dead ends: 222 [2023-12-15 20:40:05,281 INFO L226 Difference]: Without dead ends: 128 [2023-12-15 20:40:05,282 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 20:40:05,284 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 65 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 20:40:05,284 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 136 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 20:40:05,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2023-12-15 20:40:05,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 81. [2023-12-15 20:40:05,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 70 states have (on average 1.4285714285714286) internal successors, (100), 70 states have internal predecessors, (100), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-12-15 20:40:05,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 118 transitions. [2023-12-15 20:40:05,295 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 118 transitions. Word has length 71 [2023-12-15 20:40:05,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:40:05,296 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 118 transitions. [2023-12-15 20:40:05,296 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-15 20:40:05,296 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 118 transitions. [2023-12-15 20:40:05,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-12-15 20:40:05,298 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:40:05,298 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 20:40:05,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-15 20:40:05,299 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:40:05,299 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:40:05,299 INFO L85 PathProgramCache]: Analyzing trace with hash 221241, now seen corresponding path program 1 times [2023-12-15 20:40:05,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:40:05,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077630161] [2023-12-15 20:40:05,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:40:05,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:40:05,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:05,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:40:05,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:05,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:40:05,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:05,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:40:05,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:05,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:40:05,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:05,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:40:05,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:05,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-15 20:40:05,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:05,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-15 20:40:05,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:05,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-15 20:40:05,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:05,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 20:40:05,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:05,962 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-12-15 20:40:05,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:40:05,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077630161] [2023-12-15 20:40:05,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077630161] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:40:05,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:40:05,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-15 20:40:05,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243522009] [2023-12-15 20:40:05,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:40:05,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-15 20:40:05,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:40:05,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-15 20:40:05,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-12-15 20:40:05,964 INFO L87 Difference]: Start difference. First operand 81 states and 118 transitions. Second operand has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-15 20:40:06,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:40:06,420 INFO L93 Difference]: Finished difference Result 263 states and 384 transitions. [2023-12-15 20:40:06,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-15 20:40:06,420 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 71 [2023-12-15 20:40:06,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:40:06,421 INFO L225 Difference]: With dead ends: 263 [2023-12-15 20:40:06,421 INFO L226 Difference]: Without dead ends: 183 [2023-12-15 20:40:06,422 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=149, Unknown=0, NotChecked=0, Total=240 [2023-12-15 20:40:06,422 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 231 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-15 20:40:06,422 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 241 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-15 20:40:06,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2023-12-15 20:40:06,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 66. [2023-12-15 20:40:06,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 55 states have (on average 1.4363636363636363) internal successors, (79), 55 states have internal predecessors, (79), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-12-15 20:40:06,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 97 transitions. [2023-12-15 20:40:06,425 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 97 transitions. Word has length 71 [2023-12-15 20:40:06,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:40:06,426 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 97 transitions. [2023-12-15 20:40:06,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-15 20:40:06,426 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 97 transitions. [2023-12-15 20:40:06,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-12-15 20:40:06,426 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:40:06,426 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 20:40:06,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-15 20:40:06,427 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:40:06,427 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:40:06,427 INFO L85 PathProgramCache]: Analyzing trace with hash -1774044299, now seen corresponding path program 1 times [2023-12-15 20:40:06,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:40:06,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42086494] [2023-12-15 20:40:06,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:40:06,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:40:06,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:06,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:40:06,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:06,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:40:06,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:06,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:40:06,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:06,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:40:06,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:06,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:40:06,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:06,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-15 20:40:06,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:06,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-15 20:40:06,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:06,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-15 20:40:06,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:06,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 20:40:06,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:06,499 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-12-15 20:40:06,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:40:06,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42086494] [2023-12-15 20:40:06,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42086494] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:40:06,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:40:06,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-15 20:40:06,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233317321] [2023-12-15 20:40:06,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:40:06,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-15 20:40:06,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:40:06,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-15 20:40:06,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-15 20:40:06,501 INFO L87 Difference]: Start difference. First operand 66 states and 97 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-15 20:40:06,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:40:06,665 INFO L93 Difference]: Finished difference Result 215 states and 312 transitions. [2023-12-15 20:40:06,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-15 20:40:06,665 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 72 [2023-12-15 20:40:06,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:40:06,666 INFO L225 Difference]: With dead ends: 215 [2023-12-15 20:40:06,666 INFO L226 Difference]: Without dead ends: 150 [2023-12-15 20:40:06,666 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-12-15 20:40:06,668 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 203 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 20:40:06,668 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 287 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 20:40:06,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2023-12-15 20:40:06,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 137. [2023-12-15 20:40:06,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 112 states have (on average 1.4017857142857142) internal successors, (157), 114 states have internal predecessors, (157), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-15 20:40:06,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 197 transitions. [2023-12-15 20:40:06,677 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 197 transitions. Word has length 72 [2023-12-15 20:40:06,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:40:06,678 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 197 transitions. [2023-12-15 20:40:06,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-15 20:40:06,678 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 197 transitions. [2023-12-15 20:40:06,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-12-15 20:40:06,679 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:40:06,679 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 20:40:06,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-15 20:40:06,679 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:40:06,680 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:40:06,680 INFO L85 PathProgramCache]: Analyzing trace with hash -1515878861, now seen corresponding path program 1 times [2023-12-15 20:40:06,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:40:06,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959751475] [2023-12-15 20:40:06,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:40:06,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:40:06,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:07,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:40:07,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:07,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:40:07,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:07,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:40:07,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:07,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:40:07,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:07,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:40:07,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:07,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-15 20:40:07,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:07,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-15 20:40:07,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:07,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-15 20:40:07,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:07,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 20:40:07,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:07,160 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-12-15 20:40:07,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:40:07,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959751475] [2023-12-15 20:40:07,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959751475] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:40:07,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:40:07,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-15 20:40:07,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572710132] [2023-12-15 20:40:07,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:40:07,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-15 20:40:07,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:40:07,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-15 20:40:07,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-12-15 20:40:07,161 INFO L87 Difference]: Start difference. First operand 137 states and 197 transitions. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-15 20:40:07,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:40:07,623 INFO L93 Difference]: Finished difference Result 391 states and 564 transitions. [2023-12-15 20:40:07,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-15 20:40:07,624 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 72 [2023-12-15 20:40:07,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:40:07,626 INFO L225 Difference]: With dead ends: 391 [2023-12-15 20:40:07,626 INFO L226 Difference]: Without dead ends: 258 [2023-12-15 20:40:07,626 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=177, Unknown=0, NotChecked=0, Total=272 [2023-12-15 20:40:07,626 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 210 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-15 20:40:07,627 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 269 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-15 20:40:07,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2023-12-15 20:40:07,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 169. [2023-12-15 20:40:07,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 144 states have (on average 1.4166666666666667) internal successors, (204), 146 states have internal predecessors, (204), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-15 20:40:07,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 244 transitions. [2023-12-15 20:40:07,636 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 244 transitions. Word has length 72 [2023-12-15 20:40:07,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:40:07,636 INFO L495 AbstractCegarLoop]: Abstraction has 169 states and 244 transitions. [2023-12-15 20:40:07,636 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-15 20:40:07,636 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 244 transitions. [2023-12-15 20:40:07,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-12-15 20:40:07,637 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:40:07,637 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 20:40:07,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-15 20:40:07,637 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:40:07,637 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:40:07,637 INFO L85 PathProgramCache]: Analyzing trace with hash 1090144693, now seen corresponding path program 1 times [2023-12-15 20:40:07,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:40:07,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26327871] [2023-12-15 20:40:07,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:40:07,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:40:07,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:07,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:40:07,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:07,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:40:07,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:07,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:40:07,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:07,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:40:07,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:07,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:40:07,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:07,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-15 20:40:07,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:07,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-15 20:40:07,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:07,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-15 20:40:07,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:07,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 20:40:07,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:07,724 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-12-15 20:40:07,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:40:07,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26327871] [2023-12-15 20:40:07,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26327871] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:40:07,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:40:07,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 20:40:07,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135181137] [2023-12-15 20:40:07,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:40:07,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 20:40:07,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:40:07,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 20:40:07,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 20:40:07,726 INFO L87 Difference]: Start difference. First operand 169 states and 244 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-15 20:40:07,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:40:07,787 INFO L93 Difference]: Finished difference Result 465 states and 671 transitions. [2023-12-15 20:40:07,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 20:40:07,788 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 72 [2023-12-15 20:40:07,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:40:07,789 INFO L225 Difference]: With dead ends: 465 [2023-12-15 20:40:07,789 INFO L226 Difference]: Without dead ends: 300 [2023-12-15 20:40:07,790 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 20:40:07,790 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 54 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 20:40:07,790 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 149 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 20:40:07,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2023-12-15 20:40:07,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 239. [2023-12-15 20:40:07,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 203 states have (on average 1.3990147783251232) internal successors, (284), 205 states have internal predecessors, (284), 29 states have call successors, (29), 6 states have call predecessors, (29), 6 states have return successors, (29), 27 states have call predecessors, (29), 29 states have call successors, (29) [2023-12-15 20:40:07,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 342 transitions. [2023-12-15 20:40:07,805 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 342 transitions. Word has length 72 [2023-12-15 20:40:07,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:40:07,805 INFO L495 AbstractCegarLoop]: Abstraction has 239 states and 342 transitions. [2023-12-15 20:40:07,805 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-15 20:40:07,805 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 342 transitions. [2023-12-15 20:40:07,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2023-12-15 20:40:07,806 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:40:07,806 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 20:40:07,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-15 20:40:07,806 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:40:07,806 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:40:07,806 INFO L85 PathProgramCache]: Analyzing trace with hash -2071902132, now seen corresponding path program 1 times [2023-12-15 20:40:07,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:40:07,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251674577] [2023-12-15 20:40:07,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:40:07,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:40:07,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:07,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:40:07,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:07,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:40:07,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:07,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:40:07,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:07,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:40:07,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:07,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:40:07,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:07,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-15 20:40:07,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:07,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-15 20:40:07,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:07,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-15 20:40:07,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:07,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 20:40:07,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:07,905 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2023-12-15 20:40:07,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:40:07,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251674577] [2023-12-15 20:40:07,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251674577] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 20:40:07,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1681860877] [2023-12-15 20:40:07,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:40:07,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 20:40:07,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 20:40:07,908 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 20:40:07,916 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-15 20:40:07,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:40:07,982 INFO L262 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-15 20:40:07,987 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 20:40:08,134 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-15 20:40:08,135 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 20:40:08,241 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2023-12-15 20:40:08,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1681860877] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-15 20:40:08,242 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-15 20:40:08,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 15 [2023-12-15 20:40:08,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810332838] [2023-12-15 20:40:08,242 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-15 20:40:08,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-12-15 20:40:08,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:40:08,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-12-15 20:40:08,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2023-12-15 20:40:08,243 INFO L87 Difference]: Start difference. First operand 239 states and 342 transitions. Second operand has 15 states, 14 states have (on average 4.214285714285714) internal successors, (59), 15 states have internal predecessors, (59), 5 states have call successors, (27), 3 states have call predecessors, (27), 5 states have return successors, (27), 3 states have call predecessors, (27), 5 states have call successors, (27) [2023-12-15 20:40:08,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:40:08,679 INFO L93 Difference]: Finished difference Result 783 states and 1086 transitions. [2023-12-15 20:40:08,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-12-15 20:40:08,679 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.214285714285714) internal successors, (59), 15 states have internal predecessors, (59), 5 states have call successors, (27), 3 states have call predecessors, (27), 5 states have return successors, (27), 3 states have call predecessors, (27), 5 states have call successors, (27) Word has length 73 [2023-12-15 20:40:08,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:40:08,682 INFO L225 Difference]: With dead ends: 783 [2023-12-15 20:40:08,682 INFO L226 Difference]: Without dead ends: 677 [2023-12-15 20:40:08,683 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=320, Invalid=870, Unknown=0, NotChecked=0, Total=1190 [2023-12-15 20:40:08,683 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 781 mSDsluCounter, 485 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 789 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-15 20:40:08,683 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [789 Valid, 551 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-15 20:40:08,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677 states. [2023-12-15 20:40:08,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677 to 263. [2023-12-15 20:40:08,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 205 states have (on average 1.3121951219512196) internal successors, (269), 206 states have internal predecessors, (269), 45 states have call successors, (45), 12 states have call predecessors, (45), 12 states have return successors, (45), 44 states have call predecessors, (45), 45 states have call successors, (45) [2023-12-15 20:40:08,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 359 transitions. [2023-12-15 20:40:08,703 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 359 transitions. Word has length 73 [2023-12-15 20:40:08,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:40:08,703 INFO L495 AbstractCegarLoop]: Abstraction has 263 states and 359 transitions. [2023-12-15 20:40:08,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.214285714285714) internal successors, (59), 15 states have internal predecessors, (59), 5 states have call successors, (27), 3 states have call predecessors, (27), 5 states have return successors, (27), 3 states have call predecessors, (27), 5 states have call successors, (27) [2023-12-15 20:40:08,703 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 359 transitions. [2023-12-15 20:40:08,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2023-12-15 20:40:08,704 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:40:08,704 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 20:40:08,736 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-15 20:40:08,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-12-15 20:40:08,908 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:40:08,909 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:40:08,909 INFO L85 PathProgramCache]: Analyzing trace with hash 1405416714, now seen corresponding path program 1 times [2023-12-15 20:40:08,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:40:08,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423002667] [2023-12-15 20:40:08,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:40:08,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:40:08,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-15 20:40:08,926 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-15 20:40:08,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-15 20:40:08,959 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-15 20:40:08,959 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-15 20:40:08,959 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-15 20:40:08,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-15 20:40:08,963 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 20:40:08,965 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-15 20:40:09,021 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.12 08:40:09 BoogieIcfgContainer [2023-12-15 20:40:09,021 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-15 20:40:09,022 INFO L158 Benchmark]: Toolchain (without parser) took 8450.41ms. Allocated memory was 260.0MB in the beginning and 383.8MB in the end (delta: 123.7MB). Free memory was 218.4MB in the beginning and 140.3MB in the end (delta: 78.1MB). Peak memory consumption was 202.9MB. Max. memory is 8.0GB. [2023-12-15 20:40:09,022 INFO L158 Benchmark]: CDTParser took 0.41ms. Allocated memory is still 185.6MB. Free memory is still 138.1MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-15 20:40:09,022 INFO L158 Benchmark]: CACSL2BoogieTranslator took 216.99ms. Allocated memory is still 260.0MB. Free memory was 218.4MB in the beginning and 205.8MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-15 20:40:09,022 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.85ms. Allocated memory is still 260.0MB. Free memory was 205.8MB in the beginning and 202.7MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-15 20:40:09,022 INFO L158 Benchmark]: Boogie Preprocessor took 67.25ms. Allocated memory is still 260.0MB. Free memory was 202.7MB in the beginning and 199.5MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-15 20:40:09,023 INFO L158 Benchmark]: RCFGBuilder took 426.89ms. Allocated memory is still 260.0MB. Free memory was 199.0MB in the beginning and 177.5MB in the end (delta: 21.5MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2023-12-15 20:40:09,023 INFO L158 Benchmark]: TraceAbstraction took 7694.30ms. Allocated memory was 260.0MB in the beginning and 383.8MB in the end (delta: 123.7MB). Free memory was 176.5MB in the beginning and 140.3MB in the end (delta: 36.2MB). Peak memory consumption was 161.0MB. Max. memory is 8.0GB. [2023-12-15 20:40:09,024 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.41ms. Allocated memory is still 185.6MB. Free memory is still 138.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 216.99ms. Allocated memory is still 260.0MB. Free memory was 218.4MB in the beginning and 205.8MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 40.85ms. Allocated memory is still 260.0MB. Free memory was 205.8MB in the beginning and 202.7MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 67.25ms. Allocated memory is still 260.0MB. Free memory was 202.7MB in the beginning and 199.5MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 426.89ms. Allocated memory is still 260.0MB. Free memory was 199.0MB in the beginning and 177.5MB in the end (delta: 21.5MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * TraceAbstraction took 7694.30ms. Allocated memory was 260.0MB in the beginning and 383.8MB in the end (delta: 123.7MB). Free memory was 176.5MB in the beginning and 140.3MB in the end (delta: 36.2MB). Peak memory consumption was 161.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 84, overapproximation of someUnaryDOUBLEoperation at line 27. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = -10; [L23] signed short int var_1_5 = 4; [L24] unsigned char var_1_7 = 200; [L25] unsigned char var_1_8 = 32; [L26] float var_1_9 = 256.5; [L27] float var_1_10 = -0.25; [L28] float var_1_11 = 0.30000000000000004; [L29] float var_1_12 = 49.5; [L30] signed long int var_1_13 = -8; [L31] unsigned char var_1_14 = 0; [L32] float var_1_15 = 0.4; [L33] signed long int var_1_16 = -256; [L34] signed long int last_1_var_1_13 = -8; [L88] isInitial = 1 [L89] FCALL initially() [L90] COND TRUE 1 [L91] CALL updateLastVariables() [L81] last_1_var_1_13 = var_1_13 [L91] RET updateLastVariables() [L92] CALL updateVariables() [L64] var_1_5 = __VERIFIER_nondet_short() [L65] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_11=7500000000000001/25000000000000000, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=16383, var_1_7=200, var_1_8=32, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=-8, var_1_11=7500000000000001/25000000000000000, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=16383, var_1_7=200, var_1_8=32, var_1_9=513/2] [L65] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_13=-8, var_1_11=7500000000000001/25000000000000000, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=16383, var_1_7=200, var_1_8=32, var_1_9=513/2] [L66] CALL assume_abort_if_not(var_1_5 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_11=7500000000000001/25000000000000000, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=16383, var_1_7=200, var_1_8=32, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=-8, var_1_11=7500000000000001/25000000000000000, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=16383, var_1_7=200, var_1_8=32, var_1_9=513/2] [L66] RET assume_abort_if_not(var_1_5 <= 16383) VAL [isInitial=1, last_1_var_1_13=-8, var_1_11=7500000000000001/25000000000000000, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=16383, var_1_7=200, var_1_8=32, var_1_9=513/2] [L67] var_1_8 = __VERIFIER_nondet_uchar() [L68] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_11=7500000000000001/25000000000000000, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=16383, var_1_7=200, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=-8, var_1_11=7500000000000001/25000000000000000, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=16383, var_1_7=200, var_1_9=513/2] [L68] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_13=-8, var_1_11=7500000000000001/25000000000000000, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=16383, var_1_7=200, var_1_9=513/2] [L69] CALL assume_abort_if_not(var_1_8 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_11=7500000000000001/25000000000000000, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=16383, var_1_7=200, var_1_8=0, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=-8, var_1_11=7500000000000001/25000000000000000, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=16383, var_1_7=200, var_1_8=0, var_1_9=513/2] [L69] RET assume_abort_if_not(var_1_8 <= 127) VAL [isInitial=1, last_1_var_1_13=-8, var_1_11=7500000000000001/25000000000000000, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=16383, var_1_7=200, var_1_8=0, var_1_9=513/2] [L70] var_1_10 = __VERIFIER_nondet_float() [L71] CALL assume_abort_if_not((var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_11=7500000000000001/25000000000000000, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=16383, var_1_7=200, var_1_8=0, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=-8, var_1_11=7500000000000001/25000000000000000, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=16383, var_1_7=200, var_1_8=0, var_1_9=513/2] [L71] RET assume_abort_if_not((var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=-8, var_1_11=7500000000000001/25000000000000000, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=16383, var_1_7=200, var_1_8=0, var_1_9=513/2] [L72] var_1_11 = __VERIFIER_nondet_float() [L73] CALL assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=16383, var_1_7=200, var_1_8=0, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=-8, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=16383, var_1_7=200, var_1_8=0, var_1_9=513/2] [L73] RET assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=-8, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=16383, var_1_7=200, var_1_8=0, var_1_9=513/2] [L74] var_1_12 = __VERIFIER_nondet_float() [L75] CALL assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=16383, var_1_7=200, var_1_8=0, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=-8, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=16383, var_1_7=200, var_1_8=0, var_1_9=513/2] [L75] RET assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=-8, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=16383, var_1_7=200, var_1_8=0, var_1_9=513/2] [L76] var_1_14 = __VERIFIER_nondet_uchar() [L77] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_13=-8, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=16383, var_1_7=200, var_1_8=0, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=-8, var_1_13=-8, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=16383, var_1_7=200, var_1_8=0, var_1_9=513/2] [L77] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_13=-8, var_1_13=-8, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=16383, var_1_7=200, var_1_8=0, var_1_9=513/2] [L78] CALL assume_abort_if_not(var_1_14 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=16383, var_1_7=200, var_1_8=0, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=-8, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=16383, var_1_7=200, var_1_8=0, var_1_9=513/2] [L78] RET assume_abort_if_not(var_1_14 <= 1) VAL [isInitial=1, last_1_var_1_13=-8, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=16383, var_1_7=200, var_1_8=0, var_1_9=513/2] [L92] RET updateVariables() [L93] CALL step() [L38] COND FALSE !(var_1_5 < last_1_var_1_13) VAL [isInitial=1, last_1_var_1_13=-8, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=16383, var_1_7=200, var_1_8=0, var_1_9=513/2] [L41] var_1_16 = var_1_7 [L42] unsigned char stepLocal_1 = var_1_7; VAL [isInitial=1, last_1_var_1_13=-8, stepLocal_1=200, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=200, var_1_1=-10, var_1_5=16383, var_1_7=200, var_1_8=0, var_1_9=513/2] [L43] COND TRUE ! var_1_14 [L44] var_1_13 = var_1_8 VAL [isInitial=1, last_1_var_1_13=-8, stepLocal_1=200, var_1_13=0, var_1_14=0, var_1_15=2/5, var_1_16=200, var_1_1=-10, var_1_5=16383, var_1_7=200, var_1_8=0, var_1_9=513/2] [L52] var_1_15 = var_1_11 VAL [isInitial=1, last_1_var_1_13=-8, stepLocal_1=200, var_1_11=16388, var_1_13=0, var_1_14=0, var_1_15=16388, var_1_16=200, var_1_1=-10, var_1_5=16383, var_1_7=200, var_1_8=0, var_1_9=513/2] [L53] EXPR var_1_13 ^ var_1_7 VAL [isInitial=1, last_1_var_1_13=-8, stepLocal_1=200, var_1_11=16388, var_1_13=0, var_1_14=0, var_1_15=16388, var_1_16=200, var_1_1=-10, var_1_5=16383, var_1_7=200, var_1_8=0, var_1_9=513/2] [L53] signed long int stepLocal_0 = (var_1_13 ^ var_1_7) + var_1_16; [L54] COND FALSE !(stepLocal_0 < -1) [L57] var_1_1 = (128 - (var_1_7 + var_1_7)) VAL [isInitial=1, last_1_var_1_13=-8, stepLocal_0=400, stepLocal_1=200, var_1_11=16388, var_1_13=0, var_1_14=0, var_1_15=16388, var_1_16=200, var_1_1=-272, var_1_5=16383, var_1_7=200, var_1_8=0, var_1_9=513/2] [L59] EXPR var_1_7 | var_1_16 VAL [isInitial=1, last_1_var_1_13=-8, stepLocal_0=400, stepLocal_1=200, var_1_11=16388, var_1_13=0, var_1_14=0, var_1_15=16388, var_1_16=200, var_1_1=-272, var_1_5=16383, var_1_7=200, var_1_8=0, var_1_9=513/2] [L59] EXPR var_1_13 & (var_1_7 | var_1_16) VAL [isInitial=1, last_1_var_1_13=-8, stepLocal_0=400, stepLocal_1=200, var_1_11=16388, var_1_13=0, var_1_14=0, var_1_15=16388, var_1_16=200, var_1_1=-272, var_1_5=16383, var_1_7=200, var_1_8=0, var_1_9=513/2] [L59] COND FALSE !(var_1_7 < (var_1_13 & (var_1_7 | var_1_16))) [L93] RET step() [L94] CALL, EXPR property() [L84] EXPR var_1_13 ^ var_1_7 VAL [isInitial=1, last_1_var_1_13=-8, var_1_11=16388, var_1_13=0, var_1_14=0, var_1_15=16388, var_1_16=200, var_1_1=-272, var_1_5=16383, var_1_7=200, var_1_8=0, var_1_9=513/2] [L84] EXPR (((((var_1_13 ^ var_1_7) + var_1_16) < -1) ? (var_1_1 == ((signed short int) 8)) : (var_1_1 == ((signed short int) (128 - (var_1_7 + var_1_7))))) && ((var_1_5 < last_1_var_1_13) ? (var_1_7 == ((unsigned char) (var_1_8 + 1))) : 1)) && ((var_1_7 < (var_1_13 & (var_1_7 | var_1_16))) ? (var_1_9 == ((float) ((((var_1_10 + (var_1_11 - var_1_12)) < 0 ) ? -(var_1_10 + (var_1_11 - var_1_12)) : (var_1_10 + (var_1_11 - var_1_12)))))) : 1) VAL [isInitial=1, last_1_var_1_13=-8, var_1_11=16388, var_1_13=0, var_1_14=0, var_1_15=16388, var_1_16=200, var_1_1=-272, var_1_5=16383, var_1_7=200, var_1_8=0, var_1_9=513/2] [L84] EXPR var_1_7 | var_1_16 VAL [isInitial=1, last_1_var_1_13=-8, var_1_11=16388, var_1_13=0, var_1_14=0, var_1_15=16388, var_1_16=200, var_1_1=-272, var_1_5=16383, var_1_7=200, var_1_8=0, var_1_9=513/2] [L84] EXPR var_1_13 & (var_1_7 | var_1_16) VAL [isInitial=1, last_1_var_1_13=-8, var_1_11=16388, var_1_13=0, var_1_14=0, var_1_15=16388, var_1_16=200, var_1_1=-272, var_1_5=16383, var_1_7=200, var_1_8=0, var_1_9=513/2] [L84] EXPR (((((var_1_13 ^ var_1_7) + var_1_16) < -1) ? (var_1_1 == ((signed short int) 8)) : (var_1_1 == ((signed short int) (128 - (var_1_7 + var_1_7))))) && ((var_1_5 < last_1_var_1_13) ? (var_1_7 == ((unsigned char) (var_1_8 + 1))) : 1)) && ((var_1_7 < (var_1_13 & (var_1_7 | var_1_16))) ? (var_1_9 == ((float) ((((var_1_10 + (var_1_11 - var_1_12)) < 0 ) ? -(var_1_10 + (var_1_11 - var_1_12)) : (var_1_10 + (var_1_11 - var_1_12)))))) : 1) VAL [isInitial=1, last_1_var_1_13=-8, var_1_11=16388, var_1_13=0, var_1_14=0, var_1_15=16388, var_1_16=200, var_1_1=-272, var_1_5=16383, var_1_7=200, var_1_8=0, var_1_9=513/2] [L84-L85] return ((((((((var_1_13 ^ var_1_7) + var_1_16) < -1) ? (var_1_1 == ((signed short int) 8)) : (var_1_1 == ((signed short int) (128 - (var_1_7 + var_1_7))))) && ((var_1_5 < last_1_var_1_13) ? (var_1_7 == ((unsigned char) (var_1_8 + 1))) : 1)) && ((var_1_7 < (var_1_13 & (var_1_7 | var_1_16))) ? (var_1_9 == ((float) ((((var_1_10 + (var_1_11 - var_1_12)) < 0 ) ? -(var_1_10 + (var_1_11 - var_1_12)) : (var_1_10 + (var_1_11 - var_1_12)))))) : 1)) && ((! var_1_14) ? (var_1_13 == ((signed long int) var_1_8)) : ((var_1_7 > (var_1_7 + var_1_7)) ? (var_1_13 == ((signed long int) var_1_7)) : (var_1_13 == ((signed long int) var_1_16))))) && (var_1_15 == ((float) var_1_11))) && (var_1_16 == ((signed long int) var_1_7)) ; [L94] RET, EXPR property() [L94] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_13=-8, var_1_11=16388, var_1_13=0, var_1_14=0, var_1_15=16388, var_1_16=200, var_1_1=-272, var_1_5=16383, var_1_7=200, var_1_8=0, var_1_9=513/2] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_13=-8, var_1_11=16388, var_1_13=0, var_1_14=0, var_1_15=16388, var_1_16=200, var_1_1=-272, var_1_5=16383, var_1_7=200, var_1_8=0, var_1_9=513/2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 54 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.6s, OverallIterations: 13, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2206 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2198 mSDsluCounter, 2859 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1918 mSDsCounter, 148 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1915 IncrementalHoareTripleChecker+Invalid, 2063 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 148 mSolverCounterUnsat, 941 mSDtfsCounter, 1915 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 498 GetRequests, 397 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 371 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=263occurred in iteration=12, InterpolantAutomatonStates: 103, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 953 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 998 NumberOfCodeBlocks, 998 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 984 ConstructedInterpolants, 0 QuantifiedInterpolants, 5862 SizeOfPredicates, 5 NumberOfNonLiveVariables, 194 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 14 InterpolantComputations, 11 PerfectInterpolantSequences, 1944/2016 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-12-15 20:40:09,046 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...