/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-36.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-15 20:42:26,961 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-15 20:42:27,018 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:42:27,022 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-15 20:42:27,022 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-15 20:42:27,049 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-15 20:42:27,049 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-15 20:42:27,050 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-15 20:42:27,050 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-15 20:42:27,053 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-15 20:42:27,053 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-15 20:42:27,054 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-15 20:42:27,054 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-15 20:42:27,055 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-15 20:42:27,055 INFO L153 SettingsManager]: * Use SBE=true [2023-12-15 20:42:27,056 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-15 20:42:27,056 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-15 20:42:27,056 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-15 20:42:27,057 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-15 20:42:27,057 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-15 20:42:27,057 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-15 20:42:27,058 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-15 20:42:27,058 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-15 20:42:27,058 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-15 20:42:27,058 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-15 20:42:27,058 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-15 20:42:27,058 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-15 20:42:27,058 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-15 20:42:27,059 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-15 20:42:27,059 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-15 20:42:27,060 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-15 20:42:27,060 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-15 20:42:27,060 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 20:42:27,060 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-15 20:42:27,060 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-15 20:42:27,060 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-15 20:42:27,061 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-15 20:42:27,061 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-15 20:42:27,061 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-15 20:42:27,061 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-15 20:42:27,061 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-15 20:42:27,061 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-15 20:42:27,061 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-15 20:42:27,061 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:42:27,262 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-15 20:42:27,281 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-15 20:42:27,282 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-15 20:42:27,283 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-15 20:42:27,283 INFO L274 PluginConnector]: CDTParser initialized [2023-12-15 20:42:27,284 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-36.i [2023-12-15 20:42:28,372 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-15 20:42:28,541 INFO L384 CDTParser]: Found 1 translation units. [2023-12-15 20:42:28,541 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-36.i [2023-12-15 20:42:28,547 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58f60d72f/ff95b7ec4df749b58fa9a423f9ab28d3/FLAG69c7af9fa [2023-12-15 20:42:28,558 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58f60d72f/ff95b7ec4df749b58fa9a423f9ab28d3 [2023-12-15 20:42:28,559 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-15 20:42:28,560 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-15 20:42:28,561 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-15 20:42:28,561 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-15 20:42:28,566 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-15 20:42:28,566 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 08:42:28" (1/1) ... [2023-12-15 20:42:28,567 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f20f0d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:42:28, skipping insertion in model container [2023-12-15 20:42:28,567 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 08:42:28" (1/1) ... [2023-12-15 20:42:28,593 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-15 20:42:28,708 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-36.i[916,929] [2023-12-15 20:42:28,740 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 20:42:28,761 INFO L202 MainTranslator]: Completed pre-run [2023-12-15 20:42:28,769 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-36.i[916,929] [2023-12-15 20:42:28,781 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 20:42:28,797 INFO L206 MainTranslator]: Completed translation [2023-12-15 20:42:28,797 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:42:28 WrapperNode [2023-12-15 20:42:28,797 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-15 20:42:28,798 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-15 20:42:28,798 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-15 20:42:28,798 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-15 20:42:28,803 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:42:28" (1/1) ... [2023-12-15 20:42:28,817 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:42:28" (1/1) ... [2023-12-15 20:42:28,841 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 126 [2023-12-15 20:42:28,841 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-15 20:42:28,842 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-15 20:42:28,842 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-15 20:42:28,842 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-15 20:42:28,851 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:42:28" (1/1) ... [2023-12-15 20:42:28,851 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:42:28" (1/1) ... [2023-12-15 20:42:28,858 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:42:28" (1/1) ... [2023-12-15 20:42:28,870 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:42:28,870 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:42:28" (1/1) ... [2023-12-15 20:42:28,871 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:42:28" (1/1) ... [2023-12-15 20:42:28,875 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:42:28" (1/1) ... [2023-12-15 20:42:28,877 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:42:28" (1/1) ... [2023-12-15 20:42:28,878 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:42:28" (1/1) ... [2023-12-15 20:42:28,890 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:42:28" (1/1) ... [2023-12-15 20:42:28,892 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-15 20:42:28,893 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-15 20:42:28,893 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-15 20:42:28,893 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-15 20:42:28,894 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:42:28" (1/1) ... [2023-12-15 20:42:28,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 20:42:28,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 20:42:28,938 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:42:28,965 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:42:28,979 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-15 20:42:28,980 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-15 20:42:28,980 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-15 20:42:28,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-15 20:42:28,980 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-15 20:42:28,980 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-15 20:42:29,049 INFO L241 CfgBuilder]: Building ICFG [2023-12-15 20:42:29,052 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-15 20:42:29,288 INFO L282 CfgBuilder]: Performing block encoding [2023-12-15 20:42:29,315 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-15 20:42:29,315 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-15 20:42:29,315 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 08:42:29 BoogieIcfgContainer [2023-12-15 20:42:29,315 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-15 20:42:29,317 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-15 20:42:29,317 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-15 20:42:29,319 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-15 20:42:29,320 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.12 08:42:28" (1/3) ... [2023-12-15 20:42:29,320 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1855fddc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 08:42:29, skipping insertion in model container [2023-12-15 20:42:29,320 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:42:28" (2/3) ... [2023-12-15 20:42:29,320 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1855fddc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 08:42:29, skipping insertion in model container [2023-12-15 20:42:29,320 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 08:42:29" (3/3) ... [2023-12-15 20:42:29,321 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-36.i [2023-12-15 20:42:29,333 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-15 20:42:29,333 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-15 20:42:29,362 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-15 20:42:29,367 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;@16f860c3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-15 20:42:29,367 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-15 20:42:29,370 INFO L276 IsEmpty]: Start isEmpty. Operand has 50 states, 31 states have (on average 1.4838709677419355) internal successors, (46), 32 states have internal predecessors, (46), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-15 20:42:29,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2023-12-15 20:42:29,377 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:42:29,377 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 20:42:29,378 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:42:29,383 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:42:29,383 INFO L85 PathProgramCache]: Analyzing trace with hash -1155893511, now seen corresponding path program 1 times [2023-12-15 20:42:29,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:42:29,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511635205] [2023-12-15 20:42:29,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:42:29,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:42:29,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:29,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:42:29,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:29,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:42:29,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:29,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:42:29,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:29,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:42:29,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:29,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:42:29,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:29,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 20:42:29,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:29,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 20:42:29,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:29,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-15 20:42:29,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:29,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 20:42:29,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:29,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-15 20:42:29,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:29,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-15 20:42:29,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:29,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 20:42:29,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:29,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 20:42:29,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:29,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-15 20:42:29,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:29,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-15 20:42:29,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:29,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-15 20:42:29,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:29,597 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-15 20:42:29,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:42:29,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511635205] [2023-12-15 20:42:29,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511635205] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:42:29,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:42:29,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-15 20:42:29,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548548069] [2023-12-15 20:42:29,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:42:29,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-15 20:42:29,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:42:29,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-15 20:42:29,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-15 20:42:29,640 INFO L87 Difference]: Start difference. First operand has 50 states, 31 states have (on average 1.4838709677419355) internal successors, (46), 32 states have internal predecessors, (46), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2023-12-15 20:42:29,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:42:29,672 INFO L93 Difference]: Finished difference Result 97 states and 170 transitions. [2023-12-15 20:42:29,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-15 20:42:29,675 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 101 [2023-12-15 20:42:29,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:42:29,683 INFO L225 Difference]: With dead ends: 97 [2023-12-15 20:42:29,683 INFO L226 Difference]: Without dead ends: 48 [2023-12-15 20:42:29,685 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-15 20:42:29,687 INFO L413 NwaCegarLoop]: 70 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, 70 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:42:29,688 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 70 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 20:42:29,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2023-12-15 20:42:29,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2023-12-15 20:42:29,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 30 states have (on average 1.3666666666666667) internal successors, (41), 30 states have internal predecessors, (41), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-15 20:42:29,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 73 transitions. [2023-12-15 20:42:29,729 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 73 transitions. Word has length 101 [2023-12-15 20:42:29,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:42:29,729 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 73 transitions. [2023-12-15 20:42:29,729 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2023-12-15 20:42:29,730 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 73 transitions. [2023-12-15 20:42:29,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2023-12-15 20:42:29,734 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:42:29,734 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 20:42:29,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-15 20:42:29,735 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:42:29,736 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:42:29,736 INFO L85 PathProgramCache]: Analyzing trace with hash -788965639, now seen corresponding path program 1 times [2023-12-15 20:42:29,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:42:29,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148640141] [2023-12-15 20:42:29,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:42:29,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:42:29,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:29,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:42:29,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:30,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:42:30,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:30,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:42:30,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:30,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:42:30,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:30,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:42:30,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:30,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 20:42:30,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:30,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 20:42:30,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:30,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-15 20:42:30,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:30,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 20:42:30,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:30,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-15 20:42:30,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:30,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-15 20:42:30,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:30,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 20:42:30,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:30,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 20:42:30,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:30,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-15 20:42:30,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:30,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-15 20:42:30,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:30,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-15 20:42:30,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:30,065 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-15 20:42:30,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:42:30,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148640141] [2023-12-15 20:42:30,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148640141] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:42:30,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:42:30,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 20:42:30,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980246847] [2023-12-15 20:42:30,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:42:30,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 20:42:30,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:42:30,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 20:42:30,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 20:42:30,075 INFO L87 Difference]: Start difference. First operand 48 states and 73 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-15 20:42:30,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:42:30,113 INFO L93 Difference]: Finished difference Result 96 states and 147 transitions. [2023-12-15 20:42:30,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 20:42:30,113 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 101 [2023-12-15 20:42:30,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:42:30,116 INFO L225 Difference]: With dead ends: 96 [2023-12-15 20:42:30,116 INFO L226 Difference]: Without dead ends: 49 [2023-12-15 20:42:30,116 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 20:42:30,118 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 0 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 20:42:30,118 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 130 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 20:42:30,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2023-12-15 20:42:30,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2023-12-15 20:42:30,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 31 states have internal predecessors, (42), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-15 20:42:30,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 74 transitions. [2023-12-15 20:42:30,134 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 74 transitions. Word has length 101 [2023-12-15 20:42:30,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:42:30,135 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 74 transitions. [2023-12-15 20:42:30,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-15 20:42:30,136 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 74 transitions. [2023-12-15 20:42:30,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2023-12-15 20:42:30,137 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:42:30,137 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 20:42:30,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-15 20:42:30,137 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:42:30,137 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:42:30,137 INFO L85 PathProgramCache]: Analyzing trace with hash -1181992649, now seen corresponding path program 1 times [2023-12-15 20:42:30,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:42:30,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529632567] [2023-12-15 20:42:30,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:42:30,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:42:30,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:30,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:42:30,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:30,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:42:30,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:30,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:42:30,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:30,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:42:30,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:30,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:42:30,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:30,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 20:42:30,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:30,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 20:42:30,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:30,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-15 20:42:30,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:30,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 20:42:30,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:30,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-15 20:42:30,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:30,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-15 20:42:30,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:30,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 20:42:30,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:30,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 20:42:30,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:30,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-15 20:42:30,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:30,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-15 20:42:30,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:30,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-15 20:42:30,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:30,391 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-15 20:42:30,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:42:30,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529632567] [2023-12-15 20:42:30,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529632567] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:42:30,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:42:30,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-15 20:42:30,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377091746] [2023-12-15 20:42:30,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:42:30,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-15 20:42:30,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:42:30,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-15 20:42:30,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-15 20:42:30,397 INFO L87 Difference]: Start difference. First operand 49 states and 74 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-15 20:42:30,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:42:30,513 INFO L93 Difference]: Finished difference Result 145 states and 220 transitions. [2023-12-15 20:42:30,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-15 20:42:30,514 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 101 [2023-12-15 20:42:30,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:42:30,515 INFO L225 Difference]: With dead ends: 145 [2023-12-15 20:42:30,515 INFO L226 Difference]: Without dead ends: 97 [2023-12-15 20:42:30,516 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-15 20:42:30,517 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 45 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 20:42:30,517 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 189 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 20:42:30,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2023-12-15 20:42:30,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 90. [2023-12-15 20:42:30,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 55 states have (on average 1.3454545454545455) internal successors, (74), 55 states have internal predecessors, (74), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2023-12-15 20:42:30,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 138 transitions. [2023-12-15 20:42:30,531 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 138 transitions. Word has length 101 [2023-12-15 20:42:30,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:42:30,531 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 138 transitions. [2023-12-15 20:42:30,531 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-15 20:42:30,531 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 138 transitions. [2023-12-15 20:42:30,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2023-12-15 20:42:30,536 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:42:30,536 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 20:42:30,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-15 20:42:30,537 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:42:30,537 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:42:30,537 INFO L85 PathProgramCache]: Analyzing trace with hash -87901061, now seen corresponding path program 1 times [2023-12-15 20:42:30,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:42:30,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57937757] [2023-12-15 20:42:30,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:42:30,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:42:30,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:30,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:42:30,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:30,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:42:30,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:30,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:42:30,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:30,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:42:30,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:30,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:42:30,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:30,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 20:42:30,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:30,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 20:42:30,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:30,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-15 20:42:30,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:30,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 20:42:30,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:30,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-15 20:42:30,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:30,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-15 20:42:30,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:30,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 20:42:30,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:30,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 20:42:30,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:30,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-15 20:42:30,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:30,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-15 20:42:30,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:30,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-15 20:42:30,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:30,854 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-15 20:42:30,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:42:30,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57937757] [2023-12-15 20:42:30,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57937757] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:42:30,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:42:30,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-15 20:42:30,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562309696] [2023-12-15 20:42:30,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:42:30,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 20:42:30,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:42:30,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 20:42:30,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-15 20:42:30,857 INFO L87 Difference]: Start difference. First operand 90 states and 138 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-15 20:42:31,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:42:31,147 INFO L93 Difference]: Finished difference Result 245 states and 374 transitions. [2023-12-15 20:42:31,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-15 20:42:31,148 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 101 [2023-12-15 20:42:31,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:42:31,152 INFO L225 Difference]: With dead ends: 245 [2023-12-15 20:42:31,152 INFO L226 Difference]: Without dead ends: 197 [2023-12-15 20:42:31,155 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2023-12-15 20:42:31,155 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 161 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-15 20:42:31,156 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 252 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-15 20:42:31,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2023-12-15 20:42:31,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 104. [2023-12-15 20:42:31,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 69 states have (on average 1.391304347826087) internal successors, (96), 69 states have internal predecessors, (96), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2023-12-15 20:42:31,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 160 transitions. [2023-12-15 20:42:31,183 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 160 transitions. Word has length 101 [2023-12-15 20:42:31,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:42:31,184 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 160 transitions. [2023-12-15 20:42:31,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-15 20:42:31,184 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 160 transitions. [2023-12-15 20:42:31,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2023-12-15 20:42:31,186 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:42:31,187 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 20:42:31,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-15 20:42:31,187 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:42:31,187 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:42:31,187 INFO L85 PathProgramCache]: Analyzing trace with hash 1575117149, now seen corresponding path program 1 times [2023-12-15 20:42:31,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:42:31,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968170030] [2023-12-15 20:42:31,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:42:31,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:42:31,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:31,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:42:31,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:31,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:42:31,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:31,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:42:31,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:31,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:42:31,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:31,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:42:31,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:31,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 20:42:31,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:31,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 20:42:31,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:31,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-15 20:42:31,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:31,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 20:42:31,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:31,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-15 20:42:31,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:31,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-15 20:42:31,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:31,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 20:42:31,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:31,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 20:42:31,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:31,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-15 20:42:31,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:31,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-15 20:42:31,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:31,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-15 20:42:31,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:42:31,493 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-15 20:42:31,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:42:31,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968170030] [2023-12-15 20:42:31,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968170030] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:42:31,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:42:31,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-15 20:42:31,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931819729] [2023-12-15 20:42:31,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:42:31,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 20:42:31,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:42:31,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 20:42:31,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-15 20:42:31,498 INFO L87 Difference]: Start difference. First operand 104 states and 160 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-15 20:42:31,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:42:31,574 INFO L93 Difference]: Finished difference Result 205 states and 312 transitions. [2023-12-15 20:42:31,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-15 20:42:31,575 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 102 [2023-12-15 20:42:31,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:42:31,577 INFO L225 Difference]: With dead ends: 205 [2023-12-15 20:42:31,577 INFO L226 Difference]: Without dead ends: 150 [2023-12-15 20:42:31,578 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 35 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:42:31,583 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 64 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 20:42:31,583 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 259 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 20:42:31,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2023-12-15 20:42:31,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 94. [2023-12-15 20:42:31,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 59 states have (on average 1.3220338983050848) internal successors, (78), 59 states have internal predecessors, (78), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2023-12-15 20:42:31,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 142 transitions. [2023-12-15 20:42:31,605 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 142 transitions. Word has length 102 [2023-12-15 20:42:31,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:42:31,606 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 142 transitions. [2023-12-15 20:42:31,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-15 20:42:31,606 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 142 transitions. [2023-12-15 20:42:31,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-12-15 20:42:31,607 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:42:31,607 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 20:42:31,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-15 20:42:31,607 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:42:31,608 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:42:31,608 INFO L85 PathProgramCache]: Analyzing trace with hash 1102985058, now seen corresponding path program 1 times [2023-12-15 20:42:31,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:42:31,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528523770] [2023-12-15 20:42:31,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:42:31,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:42:31,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-15 20:42:31,638 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-15 20:42:31,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-15 20:42:31,690 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-15 20:42:31,690 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-15 20:42:31,691 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-15 20:42:31,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-15 20:42:31,695 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2023-12-15 20:42:31,697 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-15 20:42:31,745 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.12 08:42:31 BoogieIcfgContainer [2023-12-15 20:42:31,745 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-15 20:42:31,746 INFO L158 Benchmark]: Toolchain (without parser) took 3185.40ms. Allocated memory is still 294.6MB. Free memory was 248.7MB in the beginning and 135.8MB in the end (delta: 113.0MB). Peak memory consumption was 113.5MB. Max. memory is 8.0GB. [2023-12-15 20:42:31,746 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 199.2MB. Free memory is still 147.0MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-15 20:42:31,746 INFO L158 Benchmark]: CACSL2BoogieTranslator took 236.47ms. Allocated memory is still 294.6MB. Free memory was 248.7MB in the beginning and 236.1MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-15 20:42:31,746 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.09ms. Allocated memory is still 294.6MB. Free memory was 236.1MB in the beginning and 233.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-15 20:42:31,747 INFO L158 Benchmark]: Boogie Preprocessor took 50.67ms. Allocated memory is still 294.6MB. Free memory was 233.5MB in the beginning and 230.9MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-15 20:42:31,747 INFO L158 Benchmark]: RCFGBuilder took 422.42ms. Allocated memory is still 294.6MB. Free memory was 230.9MB in the beginning and 213.1MB in the end (delta: 17.8MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2023-12-15 20:42:31,747 INFO L158 Benchmark]: TraceAbstraction took 2428.31ms. Allocated memory is still 294.6MB. Free memory was 212.0MB in the beginning and 135.8MB in the end (delta: 76.3MB). Peak memory consumption was 76.8MB. Max. memory is 8.0GB. [2023-12-15 20:42:31,748 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.12ms. Allocated memory is still 199.2MB. Free memory is still 147.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 236.47ms. Allocated memory is still 294.6MB. Free memory was 248.7MB in the beginning and 236.1MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 43.09ms. Allocated memory is still 294.6MB. Free memory was 236.1MB in the beginning and 233.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 50.67ms. Allocated memory is still 294.6MB. Free memory was 233.5MB in the beginning and 230.9MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 422.42ms. Allocated memory is still 294.6MB. Free memory was 230.9MB in the beginning and 213.1MB in the end (delta: 17.8MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * TraceAbstraction took 2428.31ms. Allocated memory is still 294.6MB. Free memory was 212.0MB in the beginning and 135.8MB in the end (delta: 76.3MB). Peak memory consumption was 76.8MB. 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 to_int at line 100, overapproximation of shiftRight at line 100. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 1; [L23] signed long int var_1_3 = 999999999; [L24] unsigned char var_1_4 = 0; [L25] signed long int var_1_5 = 4; [L26] unsigned char var_1_7 = 1; [L27] unsigned char var_1_9 = 1; [L28] signed long int var_1_10 = 64; [L29] signed long int var_1_11 = 9; [L30] signed long int var_1_12 = 199; [L31] signed long int var_1_13 = 3; [L32] unsigned char var_1_14 = 1; [L33] unsigned char var_1_16 = 2; [L34] unsigned char last_1_var_1_14 = 1; [L104] isInitial = 1 [L105] FCALL initially() [L106] COND TRUE 1 [L107] CALL updateLastVariables() [L97] last_1_var_1_14 = var_1_14 [L107] RET updateLastVariables() [L108] CALL updateVariables() [L71] var_1_3 = __VERIFIER_nondet_long() [L72] CALL assume_abort_if_not(var_1_3 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=9, var_1_12=199, var_1_13=3, var_1_14=1, var_1_16=2, var_1_1=1, var_1_3=-1, var_1_4=0, var_1_5=4, var_1_7=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=9, var_1_12=199, var_1_13=3, var_1_14=1, var_1_16=2, var_1_1=1, var_1_3=-1, var_1_4=0, var_1_5=4, var_1_7=1, var_1_9=1] [L72] RET assume_abort_if_not(var_1_3 >= -2147483648) VAL [isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=9, var_1_12=199, var_1_13=3, var_1_14=1, var_1_16=2, var_1_1=1, var_1_3=-1, var_1_4=0, var_1_5=4, var_1_7=1, var_1_9=1] [L73] CALL assume_abort_if_not(var_1_3 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=9, var_1_12=199, var_1_13=3, var_1_14=1, var_1_16=2, var_1_1=1, var_1_3=-1, var_1_4=0, var_1_5=4, var_1_7=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=9, var_1_12=199, var_1_13=3, var_1_14=1, var_1_16=2, var_1_1=1, var_1_3=-1, var_1_4=0, var_1_5=4, var_1_7=1, var_1_9=1] [L73] RET assume_abort_if_not(var_1_3 <= 2147483647) VAL [isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=9, var_1_12=199, var_1_13=3, var_1_14=1, var_1_16=2, var_1_1=1, var_1_3=-1, var_1_4=0, var_1_5=4, var_1_7=1, var_1_9=1] [L74] var_1_4 = __VERIFIER_nondet_uchar() [L75] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=9, var_1_12=199, var_1_13=3, var_1_14=1, var_1_16=2, var_1_1=1, var_1_3=-1, var_1_5=4, var_1_7=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=9, var_1_12=199, var_1_13=3, var_1_14=1, var_1_16=2, var_1_1=1, var_1_3=-1, var_1_5=4, var_1_7=1, var_1_9=1] [L75] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=9, var_1_12=199, var_1_13=3, var_1_14=1, var_1_16=2, var_1_1=1, var_1_3=-1, var_1_5=4, var_1_7=1, var_1_9=1] [L76] CALL assume_abort_if_not(var_1_4 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=9, var_1_12=199, var_1_13=3, var_1_14=1, var_1_16=2, var_1_1=1, var_1_3=-1, var_1_4=1, var_1_5=4, var_1_7=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=9, var_1_12=199, var_1_13=3, var_1_14=1, var_1_16=2, var_1_1=1, var_1_3=-1, var_1_4=1, var_1_5=4, var_1_7=1, var_1_9=1] [L76] RET assume_abort_if_not(var_1_4 <= 1) VAL [isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=9, var_1_12=199, var_1_13=3, var_1_14=1, var_1_16=2, var_1_1=1, var_1_3=-1, var_1_4=1, var_1_5=4, var_1_7=1, var_1_9=1] [L77] var_1_5 = __VERIFIER_nondet_long() [L78] CALL assume_abort_if_not(var_1_5 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=9, var_1_12=199, var_1_13=3, var_1_14=1, var_1_16=2, var_1_1=1, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_7=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=9, var_1_12=199, var_1_13=3, var_1_14=1, var_1_16=2, var_1_1=1, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_7=1, var_1_9=1] [L78] RET assume_abort_if_not(var_1_5 >= -2147483648) VAL [isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=9, var_1_12=199, var_1_13=3, var_1_14=1, var_1_16=2, var_1_1=1, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_7=1, var_1_9=1] [L79] CALL assume_abort_if_not(var_1_5 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=9, var_1_12=199, var_1_13=3, var_1_14=1, var_1_16=2, var_1_1=1, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_7=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=9, var_1_12=199, var_1_13=3, var_1_14=1, var_1_16=2, var_1_1=1, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_7=1, var_1_9=1] [L79] RET assume_abort_if_not(var_1_5 <= 2147483647) VAL [isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=9, var_1_12=199, var_1_13=3, var_1_14=1, var_1_16=2, var_1_1=1, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_7=1, var_1_9=1] [L80] var_1_9 = __VERIFIER_nondet_uchar() [L81] CALL assume_abort_if_not(var_1_9 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=9, var_1_12=199, var_1_13=3, var_1_14=1, var_1_16=2, var_1_1=1, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_7=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=9, var_1_12=199, var_1_13=3, var_1_14=1, var_1_16=2, var_1_1=1, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_7=1, var_1_9=1] [L81] RET assume_abort_if_not(var_1_9 >= 1) VAL [isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=9, var_1_12=199, var_1_13=3, var_1_14=1, var_1_16=2, var_1_1=1, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_7=1, var_1_9=1] [L82] CALL assume_abort_if_not(var_1_9 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=9, var_1_12=199, var_1_13=3, var_1_14=1, var_1_16=2, var_1_1=1, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_7=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=9, var_1_12=199, var_1_13=3, var_1_14=1, var_1_16=2, var_1_1=1, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_7=1, var_1_9=1] [L82] RET assume_abort_if_not(var_1_9 <= 1) VAL [isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=9, var_1_12=199, var_1_13=3, var_1_14=1, var_1_16=2, var_1_1=1, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_7=1, var_1_9=1] [L83] var_1_11 = __VERIFIER_nondet_long() [L84] CALL assume_abort_if_not(var_1_11 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=-1, var_1_12=199, var_1_13=3, var_1_14=1, var_1_16=2, var_1_1=1, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_7=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=-1, var_1_12=199, var_1_13=3, var_1_14=1, var_1_16=2, var_1_1=1, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_7=1, var_1_9=1] [L84] RET assume_abort_if_not(var_1_11 >= -2147483648) VAL [isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=-1, var_1_12=199, var_1_13=3, var_1_14=1, var_1_16=2, var_1_1=1, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_7=1, var_1_9=1] [L85] CALL assume_abort_if_not(var_1_11 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=-1, var_1_12=199, var_1_13=3, var_1_14=1, var_1_16=2, var_1_1=1, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_7=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=-1, var_1_12=199, var_1_13=3, var_1_14=1, var_1_16=2, var_1_1=1, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_7=1, var_1_9=1] [L85] RET assume_abort_if_not(var_1_11 <= 2147483647) VAL [isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=-1, var_1_12=199, var_1_13=3, var_1_14=1, var_1_16=2, var_1_1=1, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_7=1, var_1_9=1] [L86] var_1_12 = __VERIFIER_nondet_long() [L87] CALL assume_abort_if_not(var_1_12 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=-1, var_1_12=-1, var_1_13=3, var_1_14=1, var_1_16=2, var_1_1=1, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_7=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=-1, var_1_12=-1, var_1_13=3, var_1_14=1, var_1_16=2, var_1_1=1, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_7=1, var_1_9=1] [L87] RET assume_abort_if_not(var_1_12 >= -2147483648) VAL [isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=-1, var_1_12=-1, var_1_13=3, var_1_14=1, var_1_16=2, var_1_1=1, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_7=1, var_1_9=1] [L88] CALL assume_abort_if_not(var_1_12 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=-1, var_1_12=-1, var_1_13=3, var_1_14=1, var_1_16=2, var_1_1=1, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_7=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=-1, var_1_12=-1, var_1_13=3, var_1_14=1, var_1_16=2, var_1_1=1, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_7=1, var_1_9=1] [L88] RET assume_abort_if_not(var_1_12 <= 2147483647) VAL [isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=-1, var_1_12=-1, var_1_13=3, var_1_14=1, var_1_16=2, var_1_1=1, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_7=1, var_1_9=1] [L89] var_1_13 = __VERIFIER_nondet_long() [L90] CALL assume_abort_if_not(var_1_13 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=-1, var_1_12=-1, var_1_13=-2, var_1_14=1, var_1_16=2, var_1_1=1, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_7=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=-1, var_1_12=-1, var_1_13=-2, var_1_14=1, var_1_16=2, var_1_1=1, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_7=1, var_1_9=1] [L90] RET assume_abort_if_not(var_1_13 >= -2147483648) VAL [isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=-1, var_1_12=-1, var_1_13=-2, var_1_14=1, var_1_16=2, var_1_1=1, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_7=1, var_1_9=1] [L91] CALL assume_abort_if_not(var_1_13 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=-1, var_1_12=-1, var_1_13=-2, var_1_14=1, var_1_16=2, var_1_1=1, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_7=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=-1, var_1_12=-1, var_1_13=-2, var_1_14=1, var_1_16=2, var_1_1=1, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_7=1, var_1_9=1] [L91] RET assume_abort_if_not(var_1_13 <= 2147483647) VAL [isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=-1, var_1_12=-1, var_1_13=-2, var_1_14=1, var_1_16=2, var_1_1=1, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_7=1, var_1_9=1] [L92] var_1_16 = __VERIFIER_nondet_uchar() [L93] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=-1, var_1_12=-1, var_1_13=-2, var_1_14=1, var_1_1=1, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_7=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=-1, var_1_12=-1, var_1_13=-2, var_1_14=1, var_1_1=1, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_7=1, var_1_9=1] [L93] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=-1, var_1_12=-1, var_1_13=-2, var_1_14=1, var_1_1=1, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_7=1, var_1_9=1] [L94] CALL assume_abort_if_not(var_1_16 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=-1, var_1_12=-1, var_1_13=-2, var_1_14=1, var_1_16=1, var_1_1=1, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_7=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=-1, var_1_12=-1, var_1_13=-2, var_1_14=1, var_1_16=1, var_1_1=1, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_7=1, var_1_9=1] [L94] RET assume_abort_if_not(var_1_16 <= 254) VAL [isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=-1, var_1_12=-1, var_1_13=-2, var_1_14=1, var_1_16=1, var_1_1=1, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_7=1, var_1_9=1] [L108] RET updateVariables() [L109] CALL step() [L38] EXPR last_1_var_1_14 >> last_1_var_1_14 VAL [isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=-1, var_1_12=-1, var_1_13=-2, var_1_14=1, var_1_16=1, var_1_1=1, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_7=1, var_1_9=1] [L38] COND TRUE (last_1_var_1_14 >> last_1_var_1_14) < (- last_1_var_1_14) [L39] var_1_7 = (var_1_4 || var_1_9) VAL [isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=-1, var_1_12=-1, var_1_13=-2, var_1_14=1, var_1_16=1, var_1_1=1, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_7=1, var_1_9=1] [L41] COND FALSE !(var_1_13 == (- var_1_12)) [L48] var_1_14 = 0 VAL [isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=-1, var_1_12=-1, var_1_13=-2, var_1_14=0, var_1_16=1, var_1_1=1, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_7=1, var_1_9=1] [L50] COND TRUE var_1_5 > var_1_3 [L51] var_1_10 = 4.6 VAL [isInitial=1, last_1_var_1_14=1, var_1_11=-1, var_1_12=-1, var_1_13=-2, var_1_14=0, var_1_16=1, var_1_1=1, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_7=1, var_1_9=1] [L55] unsigned char stepLocal_0 = var_1_10 > var_1_10; VAL [isInitial=1, last_1_var_1_14=1, stepLocal_0=0, var_1_11=-1, var_1_12=-1, var_1_13=-2, var_1_14=0, var_1_16=1, var_1_1=1, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_7=1, var_1_9=1] [L56] COND FALSE !(stepLocal_0 && var_1_7) [L67] var_1_1 = var_1_14 VAL [isInitial=1, last_1_var_1_14=1, stepLocal_0=0, var_1_11=-1, var_1_12=-1, var_1_13=-2, var_1_14=0, var_1_16=1, var_1_1=0, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_7=1, var_1_9=1] [L109] RET step() [L110] CALL, EXPR property() [L100] EXPR (((var_1_10 > var_1_10) && var_1_7) ? ((((((var_1_10) > ((- var_1_10))) ? (var_1_10) : ((- var_1_10)))) != var_1_10) ? (var_1_7 ? (var_1_1 == ((unsigned long int) 10u)) : (var_1_1 == ((unsigned long int) var_1_14))) : (var_1_1 == ((unsigned long int) var_1_14))) : (var_1_1 == ((unsigned long int) var_1_14))) && (((last_1_var_1_14 >> last_1_var_1_14) < (- last_1_var_1_14)) ? (var_1_7 == ((unsigned char) (var_1_4 || var_1_9))) : 1) VAL [isInitial=1, last_1_var_1_14=1, var_1_11=-1, var_1_12=-1, var_1_13=-2, var_1_14=0, var_1_16=1, var_1_1=0, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_7=1, var_1_9=1] [L100] EXPR last_1_var_1_14 >> last_1_var_1_14 VAL [isInitial=1, last_1_var_1_14=1, var_1_11=-1, var_1_12=-1, var_1_13=-2, var_1_14=0, var_1_16=1, var_1_1=0, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_7=1, var_1_9=1] [L100] EXPR (((var_1_10 > var_1_10) && var_1_7) ? ((((((var_1_10) > ((- var_1_10))) ? (var_1_10) : ((- var_1_10)))) != var_1_10) ? (var_1_7 ? (var_1_1 == ((unsigned long int) 10u)) : (var_1_1 == ((unsigned long int) var_1_14))) : (var_1_1 == ((unsigned long int) var_1_14))) : (var_1_1 == ((unsigned long int) var_1_14))) && (((last_1_var_1_14 >> last_1_var_1_14) < (- last_1_var_1_14)) ? (var_1_7 == ((unsigned char) (var_1_4 || var_1_9))) : 1) VAL [isInitial=1, last_1_var_1_14=1, var_1_11=-1, var_1_12=-1, var_1_13=-2, var_1_14=0, var_1_16=1, var_1_1=0, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_7=1, var_1_9=1] [L100-L101] return (((((var_1_10 > var_1_10) && var_1_7) ? ((((((var_1_10) > ((- var_1_10))) ? (var_1_10) : ((- var_1_10)))) != var_1_10) ? (var_1_7 ? (var_1_1 == ((unsigned long int) 10u)) : (var_1_1 == ((unsigned long int) var_1_14))) : (var_1_1 == ((unsigned long int) var_1_14))) : (var_1_1 == ((unsigned long int) var_1_14))) && (((last_1_var_1_14 >> last_1_var_1_14) < (- last_1_var_1_14)) ? (var_1_7 == ((unsigned char) (var_1_4 || var_1_9))) : 1)) && ((var_1_5 > var_1_3) ? (var_1_10 == ((signed long int) 4.6)) : (var_1_10 == ((signed long int) ((((var_1_11) > (((((var_1_12) > (var_1_13)) ? (var_1_12) : (var_1_13))))) ? (var_1_11) : (((((var_1_12) > (var_1_13)) ? (var_1_12) : (var_1_13)))))))))) && ((var_1_13 == (- var_1_12)) ? ((var_1_7 && var_1_7) ? (var_1_14 == ((unsigned char) var_1_16)) : (var_1_14 == ((unsigned char) var_1_16))) : (var_1_14 == ((unsigned char) 0))) ; [L110] RET, EXPR property() [L110] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_14=1, var_1_10=1000000000, var_1_11=-1, var_1_12=-1, var_1_13=-2, var_1_14=0, var_1_16=1, var_1_1=0, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_7=1, var_1_9=1] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_14=1, var_1_10=1000000000, var_1_11=-1, var_1_12=-1, var_1_13=-2, var_1_14=0, var_1_16=1, var_1_1=0, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_7=1, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 50 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.3s, OverallIterations: 6, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 270 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 270 mSDsluCounter, 900 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 501 mSDsCounter, 92 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 179 IncrementalHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 92 mSolverCounterUnsat, 399 mSDtfsCounter, 179 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 202 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=104occurred in iteration=4, InterpolantAutomatonStates: 22, 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, 5 MinimizatonAttempts, 156 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 609 NumberOfCodeBlocks, 609 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 501 ConstructedInterpolants, 0 QuantifiedInterpolants, 605 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 2400/2400 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:42:31,763 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...