/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-97.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-19 10:39:55,006 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-19 10:39:55,086 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-19 10:39:55,091 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-19 10:39:55,091 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-19 10:39:55,113 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-19 10:39:55,114 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-19 10:39:55,115 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-19 10:39:55,115 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-19 10:39:55,118 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-19 10:39:55,118 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-19 10:39:55,119 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-19 10:39:55,119 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-19 10:39:55,120 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-19 10:39:55,121 INFO L153 SettingsManager]: * Use SBE=true [2023-12-19 10:39:55,121 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-19 10:39:55,121 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-19 10:39:55,121 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-19 10:39:55,121 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-19 10:39:55,121 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-19 10:39:55,122 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-19 10:39:55,122 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-19 10:39:55,123 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-19 10:39:55,123 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-19 10:39:55,123 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-19 10:39:55,123 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-19 10:39:55,124 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-19 10:39:55,124 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-19 10:39:55,124 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-19 10:39:55,124 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-19 10:39:55,125 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-19 10:39:55,125 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-19 10:39:55,125 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-19 10:39:55,125 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-19 10:39:55,125 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-19 10:39:55,126 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-19 10:39:55,126 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-19 10:39:55,126 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-19 10:39:55,126 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-19 10:39:55,126 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-19 10:39:55,126 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-19 10:39:55,126 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-19 10:39:55,126 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-19 10:39:55,126 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Use bitabs translation -> true [2023-12-19 10:39:55,310 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-19 10:39:55,331 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-19 10:39:55,333 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-19 10:39:55,334 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-19 10:39:55,334 INFO L274 PluginConnector]: CDTParser initialized [2023-12-19 10:39:55,335 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-97.i [2023-12-19 10:39:56,564 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-19 10:39:56,779 INFO L384 CDTParser]: Found 1 translation units. [2023-12-19 10:39:56,780 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-97.i [2023-12-19 10:39:56,790 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89f70f8d3/59d2dce76bbf435ba7c2b5f57303a6b2/FLAG0af911a81 [2023-12-19 10:39:56,806 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89f70f8d3/59d2dce76bbf435ba7c2b5f57303a6b2 [2023-12-19 10:39:56,808 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-19 10:39:56,810 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-19 10:39:56,814 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-19 10:39:56,814 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-19 10:39:56,818 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-19 10:39:56,819 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 10:39:56" (1/1) ... [2023-12-19 10:39:56,820 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31edab46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 10:39:56, skipping insertion in model container [2023-12-19 10:39:56,820 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 10:39:56" (1/1) ... [2023-12-19 10:39:56,849 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-19 10:39:56,957 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-97.i[917,930] [2023-12-19 10:39:56,991 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-19 10:39:57,004 INFO L202 MainTranslator]: Completed pre-run [2023-12-19 10:39:57,015 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-97.i[917,930] [2023-12-19 10:39:57,029 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-19 10:39:57,041 INFO L206 MainTranslator]: Completed translation [2023-12-19 10:39:57,042 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 10:39:57 WrapperNode [2023-12-19 10:39:57,042 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-19 10:39:57,043 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-19 10:39:57,043 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-19 10:39:57,043 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-19 10:39:57,049 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 10:39:57" (1/1) ... [2023-12-19 10:39:57,057 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 10:39:57" (1/1) ... [2023-12-19 10:39:57,084 INFO L138 Inliner]: procedures = 26, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 147 [2023-12-19 10:39:57,084 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-19 10:39:57,085 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-19 10:39:57,085 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-19 10:39:57,085 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-19 10:39:57,093 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 10:39:57" (1/1) ... [2023-12-19 10:39:57,094 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 10:39:57" (1/1) ... [2023-12-19 10:39:57,096 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 10:39:57" (1/1) ... [2023-12-19 10:39:57,110 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-12-19 10:39:57,110 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 10:39:57" (1/1) ... [2023-12-19 10:39:57,111 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 10:39:57" (1/1) ... [2023-12-19 10:39:57,121 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 10:39:57" (1/1) ... [2023-12-19 10:39:57,125 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 10:39:57" (1/1) ... [2023-12-19 10:39:57,126 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 10:39:57" (1/1) ... [2023-12-19 10:39:57,127 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 10:39:57" (1/1) ... [2023-12-19 10:39:57,128 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-19 10:39:57,129 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-19 10:39:57,129 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-19 10:39:57,129 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-19 10:39:57,130 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 10:39:57" (1/1) ... [2023-12-19 10:39:57,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-19 10:39:57,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 10:39:57,181 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-19 10:39:57,201 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-19 10:39:57,222 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-19 10:39:57,223 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-19 10:39:57,223 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-19 10:39:57,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-19 10:39:57,223 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-19 10:39:57,223 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-19 10:39:57,285 INFO L241 CfgBuilder]: Building ICFG [2023-12-19 10:39:57,286 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-19 10:39:57,484 INFO L282 CfgBuilder]: Performing block encoding [2023-12-19 10:39:57,525 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-19 10:39:57,525 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-19 10:39:57,526 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 10:39:57 BoogieIcfgContainer [2023-12-19 10:39:57,526 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-19 10:39:57,528 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-19 10:39:57,528 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-19 10:39:57,538 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-19 10:39:57,538 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.12 10:39:56" (1/3) ... [2023-12-19 10:39:57,538 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@418ca5e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 10:39:57, skipping insertion in model container [2023-12-19 10:39:57,539 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 10:39:57" (2/3) ... [2023-12-19 10:39:57,539 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@418ca5e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 10:39:57, skipping insertion in model container [2023-12-19 10:39:57,539 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 10:39:57" (3/3) ... [2023-12-19 10:39:57,540 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-97.i [2023-12-19 10:39:57,551 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-19 10:39:57,552 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-19 10:39:57,587 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-19 10:39:57,593 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;@2d29f63b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-19 10:39:57,594 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-19 10:39:57,598 INFO L276 IsEmpty]: Start isEmpty. Operand has 55 states, 35 states have (on average 1.5142857142857142) internal successors, (53), 36 states have internal predecessors, (53), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-12-19 10:39:57,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-12-19 10:39:57,615 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 10:39:57,615 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 10:39:57,616 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 10:39:57,622 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 10:39:57,622 INFO L85 PathProgramCache]: Analyzing trace with hash 139205515, now seen corresponding path program 1 times [2023-12-19 10:39:57,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 10:39:57,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212111369] [2023-12-19 10:39:57,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 10:39:57,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 10:39:57,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:39:57,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 10:39:57,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:39:57,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 10:39:57,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:39:57,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 10:39:57,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:39:57,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-19 10:39:57,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:39:57,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-19 10:39:57,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:39:57,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 10:39:57,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:39:57,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 10:39:57,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:39:57,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-19 10:39:57,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:39:57,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-19 10:39:57,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:39:57,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-19 10:39:57,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:39:57,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-19 10:39:57,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:39:57,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 10:39:57,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:39:57,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 10:39:57,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:39:57,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-19 10:39:57,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:39:57,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-19 10:39:57,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:39:57,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-19 10:39:57,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:39:57,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-19 10:39:57,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:39:57,987 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-19 10:39:57,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 10:39:57,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212111369] [2023-12-19 10:39:57,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212111369] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 10:39:57,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 10:39:57,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-19 10:39:57,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996542806] [2023-12-19 10:39:57,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 10:39:57,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-19 10:39:57,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 10:39:58,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-19 10:39:58,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-19 10:39:58,036 INFO L87 Difference]: Start difference. First operand has 55 states, 35 states have (on average 1.5142857142857142) internal successors, (53), 36 states have internal predecessors, (53), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2023-12-19 10:39:58,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 10:39:58,085 INFO L93 Difference]: Finished difference Result 107 states and 189 transitions. [2023-12-19 10:39:58,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-19 10:39:58,088 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 104 [2023-12-19 10:39:58,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 10:39:58,094 INFO L225 Difference]: With dead ends: 107 [2023-12-19 10:39:58,094 INFO L226 Difference]: Without dead ends: 53 [2023-12-19 10:39:58,097 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-19 10:39:58,100 INFO L413 NwaCegarLoop]: 79 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, 79 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 10:39:58,101 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 79 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 10:39:58,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2023-12-19 10:39:58,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2023-12-19 10:39:58,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 34 states have (on average 1.411764705882353) internal successors, (48), 34 states have internal predecessors, (48), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-12-19 10:39:58,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 82 transitions. [2023-12-19 10:39:58,135 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 82 transitions. Word has length 104 [2023-12-19 10:39:58,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 10:39:58,135 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 82 transitions. [2023-12-19 10:39:58,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2023-12-19 10:39:58,135 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 82 transitions. [2023-12-19 10:39:58,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-12-19 10:39:58,138 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 10:39:58,138 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 10:39:58,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-19 10:39:58,139 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 10:39:58,139 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 10:39:58,140 INFO L85 PathProgramCache]: Analyzing trace with hash 853837385, now seen corresponding path program 1 times [2023-12-19 10:39:58,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 10:39:58,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127359506] [2023-12-19 10:39:58,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 10:39:58,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 10:39:58,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:39:58,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 10:39:58,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:39:58,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 10:39:58,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:39:58,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 10:39:58,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:39:58,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-19 10:39:58,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:39:58,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-19 10:39:58,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:39:58,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 10:39:58,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:39:58,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 10:39:58,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:39:58,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-19 10:39:58,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:39:58,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-19 10:39:58,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:39:58,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-19 10:39:58,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:39:58,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-19 10:39:58,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:39:58,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 10:39:58,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:39:58,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 10:39:58,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:39:58,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-19 10:39:58,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:39:58,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-19 10:39:58,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:39:58,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-19 10:39:58,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:39:58,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-19 10:39:58,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:39:58,587 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-19 10:39:58,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 10:39:58,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127359506] [2023-12-19 10:39:58,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127359506] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 10:39:58,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 10:39:58,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-19 10:39:58,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785511501] [2023-12-19 10:39:58,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 10:39:58,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-19 10:39:58,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 10:39:58,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-19 10:39:58,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-19 10:39:58,591 INFO L87 Difference]: Start difference. First operand 53 states and 82 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-19 10:39:58,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 10:39:58,691 INFO L93 Difference]: Finished difference Result 150 states and 230 transitions. [2023-12-19 10:39:58,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-19 10:39:58,691 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 104 [2023-12-19 10:39:58,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 10:39:58,697 INFO L225 Difference]: With dead ends: 150 [2023-12-19 10:39:58,697 INFO L226 Difference]: Without dead ends: 98 [2023-12-19 10:39:58,699 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 37 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-19 10:39:58,702 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 77 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 10:39:58,702 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 439 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 10:39:58,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2023-12-19 10:39:58,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 56. [2023-12-19 10:39:58,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 37 states have internal predecessors, (51), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-12-19 10:39:58,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 85 transitions. [2023-12-19 10:39:58,714 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 85 transitions. Word has length 104 [2023-12-19 10:39:58,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 10:39:58,715 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 85 transitions. [2023-12-19 10:39:58,716 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-19 10:39:58,716 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 85 transitions. [2023-12-19 10:39:58,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-12-19 10:39:58,723 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 10:39:58,724 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 10:39:58,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-19 10:39:58,724 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 10:39:58,725 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 10:39:58,725 INFO L85 PathProgramCache]: Analyzing trace with hash 991670493, now seen corresponding path program 1 times [2023-12-19 10:39:58,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 10:39:58,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070154458] [2023-12-19 10:39:58,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 10:39:58,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 10:39:58,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:39:59,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 10:39:59,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:39:59,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 10:39:59,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:39:59,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 10:39:59,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:39:59,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-19 10:39:59,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:39:59,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-19 10:39:59,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:39:59,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 10:39:59,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:39:59,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 10:39:59,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:39:59,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-19 10:39:59,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:39:59,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-19 10:39:59,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:39:59,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-19 10:39:59,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:39:59,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-19 10:39:59,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:39:59,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 10:39:59,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:39:59,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 10:39:59,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:39:59,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-19 10:39:59,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:39:59,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-19 10:39:59,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:39:59,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-19 10:39:59,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:39:59,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-19 10:39:59,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:39:59,068 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-19 10:39:59,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 10:39:59,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070154458] [2023-12-19 10:39:59,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070154458] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 10:39:59,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 10:39:59,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-19 10:39:59,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461319624] [2023-12-19 10:39:59,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 10:39:59,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-19 10:39:59,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 10:39:59,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-19 10:39:59,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-19 10:39:59,076 INFO L87 Difference]: Start difference. First operand 56 states and 85 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-19 10:39:59,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 10:39:59,322 INFO L93 Difference]: Finished difference Result 197 states and 296 transitions. [2023-12-19 10:39:59,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-19 10:39:59,322 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 105 [2023-12-19 10:39:59,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 10:39:59,327 INFO L225 Difference]: With dead ends: 197 [2023-12-19 10:39:59,328 INFO L226 Difference]: Without dead ends: 142 [2023-12-19 10:39:59,329 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-12-19 10:39:59,331 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 133 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 10:39:59,332 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 472 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 10:39:59,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2023-12-19 10:39:59,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 57. [2023-12-19 10:39:59,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 38 states have (on average 1.3421052631578947) internal successors, (51), 38 states have internal predecessors, (51), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-12-19 10:39:59,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 85 transitions. [2023-12-19 10:39:59,348 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 85 transitions. Word has length 105 [2023-12-19 10:39:59,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 10:39:59,348 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 85 transitions. [2023-12-19 10:39:59,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-19 10:39:59,348 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 85 transitions. [2023-12-19 10:39:59,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2023-12-19 10:39:59,349 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 10:39:59,350 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 10:39:59,350 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-19 10:39:59,350 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 10:39:59,350 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 10:39:59,350 INFO L85 PathProgramCache]: Analyzing trace with hash -483714034, now seen corresponding path program 1 times [2023-12-19 10:39:59,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 10:39:59,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522491693] [2023-12-19 10:39:59,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 10:39:59,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 10:39:59,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:39:59,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 10:39:59,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:39:59,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 10:39:59,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:39:59,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 10:39:59,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:39:59,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-19 10:39:59,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:39:59,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-19 10:39:59,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:39:59,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 10:39:59,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:39:59,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 10:39:59,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:39:59,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-19 10:39:59,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:39:59,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-19 10:39:59,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:39:59,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-19 10:39:59,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:39:59,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-19 10:39:59,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:39:59,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 10:39:59,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:39:59,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 10:39:59,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:39:59,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-19 10:39:59,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:39:59,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-19 10:39:59,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:39:59,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-19 10:39:59,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:39:59,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-19 10:39:59,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:39:59,867 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 63 proven. 27 refuted. 0 times theorem prover too weak. 454 trivial. 0 not checked. [2023-12-19 10:39:59,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 10:39:59,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522491693] [2023-12-19 10:39:59,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522491693] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 10:39:59,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [280713410] [2023-12-19 10:39:59,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 10:39:59,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 10:39:59,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 10:39:59,887 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 10:39:59,920 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-19 10:39:59,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:39:59,998 INFO L262 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-19 10:40:00,009 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 10:40:00,303 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 302 proven. 27 refuted. 0 times theorem prover too weak. 215 trivial. 0 not checked. [2023-12-19 10:40:00,304 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-19 10:40:00,540 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 63 proven. 30 refuted. 0 times theorem prover too weak. 451 trivial. 0 not checked. [2023-12-19 10:40:00,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [280713410] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-19 10:40:00,541 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-19 10:40:00,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 15 [2023-12-19 10:40:00,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737475237] [2023-12-19 10:40:00,542 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-19 10:40:00,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-12-19 10:40:00,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 10:40:00,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-12-19 10:40:00,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2023-12-19 10:40:00,543 INFO L87 Difference]: Start difference. First operand 57 states and 85 transitions. Second operand has 15 states, 15 states have (on average 3.2) internal successors, (48), 15 states have internal predecessors, (48), 3 states have call successors, (23), 3 states have call predecessors, (23), 7 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) [2023-12-19 10:40:00,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 10:40:00,884 INFO L93 Difference]: Finished difference Result 143 states and 209 transitions. [2023-12-19 10:40:00,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-19 10:40:00,885 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.2) internal successors, (48), 15 states have internal predecessors, (48), 3 states have call successors, (23), 3 states have call predecessors, (23), 7 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) Word has length 106 [2023-12-19 10:40:00,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 10:40:00,886 INFO L225 Difference]: With dead ends: 143 [2023-12-19 10:40:00,886 INFO L226 Difference]: Without dead ends: 87 [2023-12-19 10:40:00,887 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 236 SyntacticMatches, 4 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=211, Invalid=439, Unknown=0, NotChecked=0, Total=650 [2023-12-19 10:40:00,888 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 81 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-19 10:40:00,888 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 158 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-19 10:40:00,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2023-12-19 10:40:00,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 78. [2023-12-19 10:40:00,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 48 states have internal predecessors, (58), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2023-12-19 10:40:00,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 112 transitions. [2023-12-19 10:40:00,903 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 112 transitions. Word has length 106 [2023-12-19 10:40:00,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 10:40:00,904 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 112 transitions. [2023-12-19 10:40:00,904 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.2) internal successors, (48), 15 states have internal predecessors, (48), 3 states have call successors, (23), 3 states have call predecessors, (23), 7 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) [2023-12-19 10:40:00,904 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 112 transitions. [2023-12-19 10:40:00,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2023-12-19 10:40:00,906 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 10:40:00,906 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 10:40:00,913 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-12-19 10:40:01,112 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 10:40:01,113 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 10:40:01,113 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 10:40:01,113 INFO L85 PathProgramCache]: Analyzing trace with hash 1856438580, now seen corresponding path program 1 times [2023-12-19 10:40:01,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 10:40:01,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207393315] [2023-12-19 10:40:01,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 10:40:01,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 10:40:01,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:40:01,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 10:40:01,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:40:01,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 10:40:01,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:40:01,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 10:40:01,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:40:01,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-19 10:40:01,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:40:01,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-19 10:40:01,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:40:01,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 10:40:01,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:40:01,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 10:40:01,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:40:01,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-19 10:40:01,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:40:01,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-19 10:40:01,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:40:01,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-19 10:40:01,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:40:01,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-19 10:40:01,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:40:01,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 10:40:01,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:40:01,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 10:40:01,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:40:01,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-19 10:40:01,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:40:01,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-19 10:40:01,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:40:01,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-19 10:40:01,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:40:01,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-19 10:40:01,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:40:01,333 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-19 10:40:01,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 10:40:01,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207393315] [2023-12-19 10:40:01,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207393315] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 10:40:01,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 10:40:01,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-19 10:40:01,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207186865] [2023-12-19 10:40:01,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 10:40:01,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-19 10:40:01,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 10:40:01,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-19 10:40:01,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-12-19 10:40:01,340 INFO L87 Difference]: Start difference. First operand 78 states and 112 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-19 10:40:01,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 10:40:01,605 INFO L93 Difference]: Finished difference Result 190 states and 265 transitions. [2023-12-19 10:40:01,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-19 10:40:01,605 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 106 [2023-12-19 10:40:01,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 10:40:01,609 INFO L225 Difference]: With dead ends: 190 [2023-12-19 10:40:01,609 INFO L226 Difference]: Without dead ends: 128 [2023-12-19 10:40:01,609 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2023-12-19 10:40:01,610 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 146 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 10:40:01,610 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 392 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 10:40:01,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2023-12-19 10:40:01,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 124. [2023-12-19 10:40:01,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 73 states have (on average 1.1917808219178083) internal successors, (87), 75 states have internal predecessors, (87), 44 states have call successors, (44), 6 states have call predecessors, (44), 6 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2023-12-19 10:40:01,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 175 transitions. [2023-12-19 10:40:01,658 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 175 transitions. Word has length 106 [2023-12-19 10:40:01,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 10:40:01,659 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 175 transitions. [2023-12-19 10:40:01,659 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-19 10:40:01,659 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 175 transitions. [2023-12-19 10:40:01,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-12-19 10:40:01,663 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 10:40:01,664 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 10:40:01,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-19 10:40:01,664 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 10:40:01,664 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 10:40:01,664 INFO L85 PathProgramCache]: Analyzing trace with hash -1170083422, now seen corresponding path program 1 times [2023-12-19 10:40:01,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 10:40:01,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138907498] [2023-12-19 10:40:01,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 10:40:01,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 10:40:01,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-19 10:40:01,734 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-19 10:40:01,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-19 10:40:01,824 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-19 10:40:01,824 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-19 10:40:01,825 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-19 10:40:01,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-19 10:40:01,829 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2023-12-19 10:40:01,833 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-19 10:40:02,014 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.12 10:40:02 BoogieIcfgContainer [2023-12-19 10:40:02,014 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-19 10:40:02,015 INFO L158 Benchmark]: Toolchain (without parser) took 5204.70ms. Allocated memory was 240.1MB in the beginning and 326.1MB in the end (delta: 86.0MB). Free memory was 181.4MB in the beginning and 288.8MB in the end (delta: -107.3MB). Peak memory consumption was 41.6MB. Max. memory is 8.0GB. [2023-12-19 10:40:02,015 INFO L158 Benchmark]: CDTParser took 0.55ms. Allocated memory is still 240.1MB. Free memory is still 187.5MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-19 10:40:02,015 INFO L158 Benchmark]: CACSL2BoogieTranslator took 228.60ms. Allocated memory is still 240.1MB. Free memory was 181.2MB in the beginning and 168.6MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-19 10:40:02,015 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.66ms. Allocated memory is still 240.1MB. Free memory was 168.6MB in the beginning and 166.1MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-19 10:40:02,015 INFO L158 Benchmark]: Boogie Preprocessor took 43.50ms. Allocated memory is still 240.1MB. Free memory was 166.1MB in the beginning and 163.4MB in the end (delta: 2.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-19 10:40:02,015 INFO L158 Benchmark]: RCFGBuilder took 397.01ms. Allocated memory is still 240.1MB. Free memory was 163.4MB in the beginning and 191.8MB in the end (delta: -28.4MB). Peak memory consumption was 7.0MB. Max. memory is 8.0GB. [2023-12-19 10:40:02,016 INFO L158 Benchmark]: TraceAbstraction took 4486.14ms. Allocated memory was 240.1MB in the beginning and 326.1MB in the end (delta: 86.0MB). Free memory was 191.3MB in the beginning and 288.8MB in the end (delta: -97.5MB). Peak memory consumption was 50.3MB. Max. memory is 8.0GB. [2023-12-19 10:40:02,017 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.55ms. Allocated memory is still 240.1MB. Free memory is still 187.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 228.60ms. Allocated memory is still 240.1MB. Free memory was 181.2MB in the beginning and 168.6MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 41.66ms. Allocated memory is still 240.1MB. Free memory was 168.6MB in the beginning and 166.1MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 43.50ms. Allocated memory is still 240.1MB. Free memory was 166.1MB in the beginning and 163.4MB in the end (delta: 2.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 397.01ms. Allocated memory is still 240.1MB. Free memory was 163.4MB in the beginning and 191.8MB in the end (delta: -28.4MB). Peak memory consumption was 7.0MB. Max. memory is 8.0GB. * TraceAbstraction took 4486.14ms. Allocated memory was 240.1MB in the beginning and 326.1MB in the end (delta: 86.0MB). Free memory was 191.3MB in the beginning and 288.8MB in the end (delta: -97.5MB). Peak memory consumption was 50.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 100. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 16; [L23] signed short int var_1_7 = 32; [L24] signed short int var_1_8 = 20113; [L25] signed short int var_1_9 = 100; [L26] signed char var_1_10 = 100; [L27] signed char var_1_11 = -1; [L28] signed char var_1_12 = 16; [L29] unsigned char var_1_13 = 1; [L30] unsigned char var_1_15 = 0; [L31] unsigned char var_1_16 = 1; [L32] unsigned short int var_1_18 = 10; [L33] unsigned short int var_1_19 = 256; [L34] float var_1_20 = 32.5; [L35] float var_1_21 = 127.4; [L36] signed short int var_1_22 = 128; [L104] isInitial = 1 [L105] FCALL initially() [L106] COND TRUE 1 [L107] FCALL updateLastVariables() [L108] CALL updateVariables() [L70] var_1_7 = __VERIFIER_nondet_short() [L71] CALL assume_abort_if_not(var_1_7 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=0, var_1_8=20113, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=0, var_1_8=20113, var_1_9=100] [L71] RET assume_abort_if_not(var_1_7 >= -1) VAL [isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=0, var_1_8=20113, var_1_9=100] [L72] CALL assume_abort_if_not(var_1_7 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=0, var_1_8=20113, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=0, var_1_8=20113, var_1_9=100] [L72] RET assume_abort_if_not(var_1_7 <= 32766) VAL [isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=0, var_1_8=20113, var_1_9=100] [L73] var_1_8 = __VERIFIER_nondet_short() [L74] CALL assume_abort_if_not(var_1_8 >= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=0, var_1_8=16383, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=0, var_1_8=16383, var_1_9=100] [L74] RET assume_abort_if_not(var_1_8 >= 16383) VAL [isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=0, var_1_8=16383, var_1_9=100] [L75] CALL assume_abort_if_not(var_1_8 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=0, var_1_8=16383, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=0, var_1_8=16383, var_1_9=100] [L75] RET assume_abort_if_not(var_1_8 <= 32766) VAL [isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=0, var_1_8=16383, var_1_9=100] [L76] var_1_9 = __VERIFIER_nondet_short() [L77] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=0, var_1_8=16383, var_1_9=16382] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=0, var_1_8=16383, var_1_9=16382] [L77] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=0, var_1_8=16383, var_1_9=16382] [L78] CALL assume_abort_if_not(var_1_9 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=0, var_1_8=16383, var_1_9=16382] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=0, var_1_8=16383, var_1_9=16382] [L78] RET assume_abort_if_not(var_1_9 <= 16383) VAL [isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=0, var_1_8=16383, var_1_9=16382] [L79] var_1_11 = __VERIFIER_nondet_char() [L80] CALL assume_abort_if_not(var_1_11 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-63, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=0, var_1_8=16383, var_1_9=16382] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=100, var_1_11=-63, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=0, var_1_8=16383, var_1_9=16382] [L80] RET assume_abort_if_not(var_1_11 >= -63) VAL [isInitial=1, var_1_10=100, var_1_11=-63, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=0, var_1_8=16383, var_1_9=16382] [L81] CALL assume_abort_if_not(var_1_11 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-63, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=0, var_1_8=16383, var_1_9=16382] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=100, var_1_11=-63, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=0, var_1_8=16383, var_1_9=16382] [L81] RET assume_abort_if_not(var_1_11 <= 63) VAL [isInitial=1, var_1_10=100, var_1_11=-63, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=0, var_1_8=16383, var_1_9=16382] [L82] var_1_12 = __VERIFIER_nondet_char() [L83] CALL assume_abort_if_not(var_1_12 >= -31) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-63, var_1_12=-31, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=0, var_1_8=16383, var_1_9=16382] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=100, var_1_11=-63, var_1_12=-31, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=0, var_1_8=16383, var_1_9=16382] [L83] RET assume_abort_if_not(var_1_12 >= -31) VAL [isInitial=1, var_1_10=100, var_1_11=-63, var_1_12=-31, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=0, var_1_8=16383, var_1_9=16382] [L84] CALL assume_abort_if_not(var_1_12 <= 32) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-63, var_1_12=-31, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=0, var_1_8=16383, var_1_9=16382] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=100, var_1_11=-63, var_1_12=-31, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=0, var_1_8=16383, var_1_9=16382] [L84] RET assume_abort_if_not(var_1_12 <= 32) VAL [isInitial=1, var_1_10=100, var_1_11=-63, var_1_12=-31, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=0, var_1_8=16383, var_1_9=16382] [L85] var_1_15 = __VERIFIER_nondet_uchar() [L86] CALL assume_abort_if_not(var_1_15 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-63, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=0, var_1_8=16383, var_1_9=16382] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=100, var_1_11=-63, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=0, var_1_8=16383, var_1_9=16382] [L86] RET assume_abort_if_not(var_1_15 >= 1) VAL [isInitial=1, var_1_10=100, var_1_11=-63, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=0, var_1_8=16383, var_1_9=16382] [L87] CALL assume_abort_if_not(var_1_15 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-63, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=0, var_1_8=16383, var_1_9=16382] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=100, var_1_11=-63, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=0, var_1_8=16383, var_1_9=16382] [L87] RET assume_abort_if_not(var_1_15 <= 1) VAL [isInitial=1, var_1_10=100, var_1_11=-63, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=0, var_1_8=16383, var_1_9=16382] [L88] var_1_16 = __VERIFIER_nondet_uchar() [L89] CALL assume_abort_if_not(var_1_16 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-63, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=0, var_1_8=16383, var_1_9=16382] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=100, var_1_11=-63, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=0, var_1_8=16383, var_1_9=16382] [L89] RET assume_abort_if_not(var_1_16 >= 1) VAL [isInitial=1, var_1_10=100, var_1_11=-63, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=0, var_1_8=16383, var_1_9=16382] [L90] CALL assume_abort_if_not(var_1_16 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-63, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=0, var_1_8=16383, var_1_9=16382] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=100, var_1_11=-63, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=0, var_1_8=16383, var_1_9=16382] [L90] RET assume_abort_if_not(var_1_16 <= 1) VAL [isInitial=1, var_1_10=100, var_1_11=-63, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=0, var_1_8=16383, var_1_9=16382] [L91] var_1_19 = __VERIFIER_nondet_ushort() [L92] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-63, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=0, var_1_8=16383, var_1_9=16382] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=100, var_1_11=-63, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=0, var_1_8=16383, var_1_9=16382] [L92] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, var_1_10=100, var_1_11=-63, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=0, var_1_8=16383, var_1_9=16382] [L93] CALL assume_abort_if_not(var_1_19 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-63, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_19=0, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=0, var_1_8=16383, var_1_9=16382] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=100, var_1_11=-63, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_19=0, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=0, var_1_8=16383, var_1_9=16382] [L93] RET assume_abort_if_not(var_1_19 <= 65534) VAL [isInitial=1, var_1_10=100, var_1_11=-63, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_19=0, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=0, var_1_8=16383, var_1_9=16382] [L94] var_1_21 = __VERIFIER_nondet_float() [L95] CALL assume_abort_if_not((var_1_21 >= -922337.2036854765600e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-63, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_19=0, var_1_1=16, var_1_20=65/2, var_1_22=128, var_1_7=0, var_1_8=16383, var_1_9=16382] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=100, var_1_11=-63, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_19=0, var_1_1=16, var_1_20=65/2, var_1_22=128, var_1_7=0, var_1_8=16383, var_1_9=16382] [L95] RET assume_abort_if_not((var_1_21 >= -922337.2036854765600e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=100, var_1_11=-63, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_19=0, var_1_1=16, var_1_20=65/2, var_1_22=128, var_1_7=0, var_1_8=16383, var_1_9=16382] [L108] RET updateVariables() [L109] CALL step() [L40] var_1_18 = var_1_19 [L41] var_1_20 = var_1_21 [L42] var_1_22 = var_1_12 VAL [isInitial=1, var_1_10=100, var_1_11=-63, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=20118, var_1_21=20118, var_1_22=-31, var_1_7=0, var_1_8=16383, var_1_9=16382] [L43] COND TRUE 127.5f > var_1_20 [L44] var_1_13 = (var_1_15 && var_1_16) VAL [isInitial=1, var_1_10=100, var_1_11=-63, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=20118, var_1_21=20118, var_1_22=-31, var_1_7=0, var_1_8=16383, var_1_9=16382] [L48] COND TRUE var_1_18 == var_1_7 [L49] var_1_10 = (var_1_11 + (var_1_12 + -25)) VAL [isInitial=1, var_1_10=-119, var_1_11=-63, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=20118, var_1_21=20118, var_1_22=-31, var_1_7=0, var_1_8=16383, var_1_9=16382] [L57] COND TRUE \read(var_1_13) VAL [isInitial=1, var_1_10=-119, var_1_11=-63, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=20118, var_1_21=20118, var_1_22=-31, var_1_7=0, var_1_8=16383, var_1_9=16382] [L58] COND FALSE !(var_1_10 > var_1_22) [L65] var_1_1 = 8 VAL [isInitial=1, var_1_10=-119, var_1_11=-63, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=0, var_1_19=0, var_1_1=8, var_1_20=20118, var_1_21=20118, var_1_22=-31, var_1_7=0, var_1_8=16383, var_1_9=16382] [L109] RET step() [L110] CALL, EXPR property() [L100] EXPR (var_1_13 ? ((var_1_10 > var_1_22) ? (var_1_13 ? (var_1_1 == ((signed short int) (var_1_7 - (var_1_8 - var_1_9)))) : (var_1_1 == ((signed short int) var_1_18))) : (var_1_1 == ((signed short int) 8))) : 1) && ((var_1_18 == var_1_7) ? (var_1_10 == ((signed char) (var_1_11 + (var_1_12 + -25)))) : ((((32 * -25) | var_1_22) >= var_1_11) ? (var_1_13 ? (var_1_10 == ((signed char) var_1_12)) : 1) : 1)) VAL [isInitial=1, var_1_10=-119, var_1_11=-63, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=0, var_1_19=0, var_1_1=8, var_1_20=20118, var_1_21=20118, var_1_22=-31, var_1_7=0, var_1_8=16383, var_1_9=16382] [L100] EXPR (var_1_18 == var_1_7) ? (var_1_10 == ((signed char) (var_1_11 + (var_1_12 + -25)))) : ((((32 * -25) | var_1_22) >= var_1_11) ? (var_1_13 ? (var_1_10 == ((signed char) var_1_12)) : 1) : 1) VAL [isInitial=1, var_1_10=-119, var_1_11=-63, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=0, var_1_19=0, var_1_1=8, var_1_20=20118, var_1_21=20118, var_1_22=-31, var_1_7=0, var_1_8=16383, var_1_9=16382] [L100] EXPR (var_1_13 ? ((var_1_10 > var_1_22) ? (var_1_13 ? (var_1_1 == ((signed short int) (var_1_7 - (var_1_8 - var_1_9)))) : (var_1_1 == ((signed short int) var_1_18))) : (var_1_1 == ((signed short int) 8))) : 1) && ((var_1_18 == var_1_7) ? (var_1_10 == ((signed char) (var_1_11 + (var_1_12 + -25)))) : ((((32 * -25) | var_1_22) >= var_1_11) ? (var_1_13 ? (var_1_10 == ((signed char) var_1_12)) : 1) : 1)) VAL [isInitial=1, var_1_10=-119, var_1_11=-63, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=0, var_1_19=0, var_1_1=8, var_1_20=20118, var_1_21=20118, var_1_22=-31, var_1_7=0, var_1_8=16383, var_1_9=16382] [L100-L101] return (((((var_1_13 ? ((var_1_10 > var_1_22) ? (var_1_13 ? (var_1_1 == ((signed short int) (var_1_7 - (var_1_8 - var_1_9)))) : (var_1_1 == ((signed short int) var_1_18))) : (var_1_1 == ((signed short int) 8))) : 1) && ((var_1_18 == var_1_7) ? (var_1_10 == ((signed char) (var_1_11 + (var_1_12 + -25)))) : ((((32 * -25) | var_1_22) >= var_1_11) ? (var_1_13 ? (var_1_10 == ((signed char) var_1_12)) : 1) : 1))) && ((127.5f > var_1_20) ? (var_1_13 == ((unsigned char) (var_1_15 && var_1_16))) : (var_1_13 == ((unsigned char) ((var_1_20 >= var_1_20) || var_1_15))))) && (var_1_18 == ((unsigned short int) var_1_19))) && (var_1_20 == ((float) var_1_21))) && (var_1_22 == ((signed short int) var_1_12)) ; [L110] RET, EXPR property() [L110] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, var_1_10=-119, var_1_11=-63, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=0, var_1_19=0, var_1_1=8, var_1_20=20118, var_1_21=20118, var_1_22=-31, var_1_7=0, var_1_8=16383, var_1_9=16382] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, var_1_10=-119, var_1_11=-63, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=0, var_1_19=0, var_1_1=8, var_1_20=20118, var_1_21=20118, var_1_22=-31, var_1_7=0, var_1_8=16383, var_1_9=16382] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 55 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.3s, OverallIterations: 6, TraceHistogramMax: 17, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 452 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 437 mSDsluCounter, 1540 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1004 mSDsCounter, 74 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 571 IncrementalHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 74 mSolverCounterUnsat, 536 mSDtfsCounter, 571 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 450 GetRequests, 400 SyntacticMatches, 4 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=124occurred in iteration=5, InterpolantAutomatonStates: 43, 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, 140 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 738 NumberOfCodeBlocks, 738 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 730 ConstructedInterpolants, 0 QuantifiedInterpolants, 1924 SizeOfPredicates, 6 NumberOfNonLiveVariables, 255 ConjunctsInSsa, 13 ConjunctsInUnsatCore, 7 InterpolantComputations, 4 PerfectInterpolantSequences, 3724/3808 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-12-19 10:40:02,040 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...