/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 false -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-24.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-20 21:55:30,414 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-20 21:55:30,469 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-20 21:55:30,471 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-20 21:55:30,478 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-20 21:55:30,501 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-20 21:55:30,502 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-20 21:55:30,502 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-20 21:55:30,502 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-20 21:55:30,503 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-20 21:55:30,503 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-20 21:55:30,503 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-20 21:55:30,503 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-20 21:55:30,504 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-20 21:55:30,504 INFO L153 SettingsManager]: * Use SBE=true [2023-12-20 21:55:30,504 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-20 21:55:30,504 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-20 21:55:30,505 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-20 21:55:30,505 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-20 21:55:30,505 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-20 21:55:30,505 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-20 21:55:30,508 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-20 21:55:30,509 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-20 21:55:30,509 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-20 21:55:30,512 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-20 21:55:30,512 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-20 21:55:30,512 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-20 21:55:30,513 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-20 21:55:30,513 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-20 21:55:30,513 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-20 21:55:30,514 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-20 21:55:30,514 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-20 21:55:30,514 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-20 21:55:30,514 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-20 21:55:30,514 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-20 21:55:30,515 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-20 21:55:30,515 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-20 21:55:30,515 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-20 21:55:30,515 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-20 21:55:30,515 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-20 21:55:30,515 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-20 21:55:30,515 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-20 21:55:30,515 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-20 21:55:30,515 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 -> false [2023-12-20 21:55:30,694 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-20 21:55:30,716 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-20 21:55:30,718 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-20 21:55:30,719 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-20 21:55:30,721 INFO L274 PluginConnector]: CDTParser initialized [2023-12-20 21:55:30,722 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-24.i [2023-12-20 21:55:31,751 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-20 21:55:31,869 INFO L384 CDTParser]: Found 1 translation units. [2023-12-20 21:55:31,869 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-24.i [2023-12-20 21:55:31,874 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f04bb8ef1/3b82f70167b64c2d97b933df80bb1b8f/FLAG5e8bb0422 [2023-12-20 21:55:31,883 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f04bb8ef1/3b82f70167b64c2d97b933df80bb1b8f [2023-12-20 21:55:31,885 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-20 21:55:31,886 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-20 21:55:31,887 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-20 21:55:31,887 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-20 21:55:31,890 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-20 21:55:31,890 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.12 09:55:31" (1/1) ... [2023-12-20 21:55:31,891 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37dcabfd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 09:55:31, skipping insertion in model container [2023-12-20 21:55:31,891 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.12 09:55:31" (1/1) ... [2023-12-20 21:55:31,914 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-20 21:55:32,014 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-24.i[917,930] [2023-12-20 21:55:32,037 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-20 21:55:32,045 INFO L202 MainTranslator]: Completed pre-run [2023-12-20 21:55:32,052 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-24.i[917,930] [2023-12-20 21:55:32,067 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-20 21:55:32,077 INFO L206 MainTranslator]: Completed translation [2023-12-20 21:55:32,078 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 09:55:32 WrapperNode [2023-12-20 21:55:32,078 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-20 21:55:32,079 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-20 21:55:32,079 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-20 21:55:32,079 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-20 21:55:32,086 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 09:55:32" (1/1) ... [2023-12-20 21:55:32,092 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 09:55:32" (1/1) ... [2023-12-20 21:55:32,113 INFO L138 Inliner]: procedures = 26, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 103 [2023-12-20 21:55:32,114 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-20 21:55:32,114 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-20 21:55:32,114 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-20 21:55:32,114 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-20 21:55:32,126 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 09:55:32" (1/1) ... [2023-12-20 21:55:32,127 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 09:55:32" (1/1) ... [2023-12-20 21:55:32,129 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 09:55:32" (1/1) ... [2023-12-20 21:55:32,138 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-20 21:55:32,138 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 09:55:32" (1/1) ... [2023-12-20 21:55:32,139 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 09:55:32" (1/1) ... [2023-12-20 21:55:32,143 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 09:55:32" (1/1) ... [2023-12-20 21:55:32,145 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 09:55:32" (1/1) ... [2023-12-20 21:55:32,147 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 09:55:32" (1/1) ... [2023-12-20 21:55:32,148 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 09:55:32" (1/1) ... [2023-12-20 21:55:32,150 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-20 21:55:32,150 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-20 21:55:32,151 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-20 21:55:32,151 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-20 21:55:32,151 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 09:55:32" (1/1) ... [2023-12-20 21:55:32,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-20 21:55:32,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 21:55:32,213 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-20 21:55:32,229 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-20 21:55:32,234 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-20 21:55:32,234 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-20 21:55:32,234 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-20 21:55:32,234 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-20 21:55:32,234 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-20 21:55:32,235 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-20 21:55:32,306 INFO L241 CfgBuilder]: Building ICFG [2023-12-20 21:55:32,307 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-20 21:55:32,480 INFO L282 CfgBuilder]: Performing block encoding [2023-12-20 21:55:32,521 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-20 21:55:32,522 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-20 21:55:32,522 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.12 09:55:32 BoogieIcfgContainer [2023-12-20 21:55:32,522 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-20 21:55:32,524 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-20 21:55:32,524 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-20 21:55:32,526 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-20 21:55:32,526 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.12 09:55:31" (1/3) ... [2023-12-20 21:55:32,526 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45c680b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.12 09:55:32, skipping insertion in model container [2023-12-20 21:55:32,526 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 09:55:32" (2/3) ... [2023-12-20 21:55:32,527 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45c680b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.12 09:55:32, skipping insertion in model container [2023-12-20 21:55:32,527 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.12 09:55:32" (3/3) ... [2023-12-20 21:55:32,527 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-24.i [2023-12-20 21:55:32,539 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-20 21:55:32,539 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-20 21:55:32,578 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-20 21:55:32,583 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;@3acbf61b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-20 21:55:32,583 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-20 21:55:32,585 INFO L276 IsEmpty]: Start isEmpty. Operand has 41 states, 23 states have (on average 1.391304347826087) internal successors, (32), 24 states have internal predecessors, (32), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-20 21:55:32,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2023-12-20 21:55:32,593 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 21:55:32,593 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 21:55:32,594 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 21:55:32,597 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 21:55:32,597 INFO L85 PathProgramCache]: Analyzing trace with hash 965612790, now seen corresponding path program 1 times [2023-12-20 21:55:32,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 21:55:32,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876982249] [2023-12-20 21:55:32,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 21:55:32,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 21:55:32,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:55:32,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 21:55:32,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:55:32,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 21:55:32,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:55:32,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-20 21:55:32,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:55:32,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-20 21:55:32,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:55:32,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-20 21:55:32,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:55:32,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-20 21:55:32,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:55:32,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 21:55:32,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:55:32,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-20 21:55:32,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:55:32,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-20 21:55:32,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:55:32,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-20 21:55:32,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:55:32,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-20 21:55:32,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:55:32,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-20 21:55:32,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:55:32,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-20 21:55:32,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:55:32,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-20 21:55:32,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:55:32,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-20 21:55:32,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:55:32,814 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-20 21:55:32,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 21:55:32,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876982249] [2023-12-20 21:55:32,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876982249] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 21:55:32,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 21:55:32,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-20 21:55:32,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321872095] [2023-12-20 21:55:32,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 21:55:32,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-20 21:55:32,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 21:55:32,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-20 21:55:32,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-20 21:55:32,841 INFO L87 Difference]: Start difference. First operand has 41 states, 23 states have (on average 1.391304347826087) internal successors, (32), 24 states have internal predecessors, (32), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2023-12-20 21:55:32,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 21:55:32,878 INFO L93 Difference]: Finished difference Result 79 states and 137 transitions. [2023-12-20 21:55:32,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-20 21:55:32,880 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 92 [2023-12-20 21:55:32,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 21:55:32,885 INFO L225 Difference]: With dead ends: 79 [2023-12-20 21:55:32,886 INFO L226 Difference]: Without dead ends: 39 [2023-12-20 21:55:32,888 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 47 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-20 21:55:32,890 INFO L413 NwaCegarLoop]: 54 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, 54 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-20 21:55:32,890 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 54 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 21:55:32,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2023-12-20 21:55:32,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2023-12-20 21:55:32,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-20 21:55:32,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 57 transitions. [2023-12-20 21:55:32,937 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 57 transitions. Word has length 92 [2023-12-20 21:55:32,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 21:55:32,937 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 57 transitions. [2023-12-20 21:55:32,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2023-12-20 21:55:32,938 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 57 transitions. [2023-12-20 21:55:32,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2023-12-20 21:55:32,942 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 21:55:32,942 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 21:55:32,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-20 21:55:32,943 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 21:55:32,945 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 21:55:32,946 INFO L85 PathProgramCache]: Analyzing trace with hash -1609989192, now seen corresponding path program 1 times [2023-12-20 21:55:32,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 21:55:32,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23493041] [2023-12-20 21:55:32,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 21:55:32,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 21:55:33,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:55:33,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 21:55:33,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:55:33,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 21:55:33,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:55:33,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-20 21:55:33,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:55:33,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-20 21:55:33,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:55:33,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-20 21:55:33,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:55:33,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-20 21:55:33,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:55:33,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 21:55:33,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:55:33,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-20 21:55:33,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:55:33,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-20 21:55:33,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:55:33,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-20 21:55:33,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:55:33,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-20 21:55:33,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:55:33,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-20 21:55:33,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:55:33,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-20 21:55:33,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:55:33,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-20 21:55:33,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:55:33,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-20 21:55:33,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:55:33,549 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 30 proven. 12 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2023-12-20 21:55:33,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 21:55:33,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23493041] [2023-12-20 21:55:33,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23493041] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 21:55:33,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [863160290] [2023-12-20 21:55:33,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 21:55:33,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 21:55:33,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 21:55:33,553 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-20 21:55:33,609 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-20 21:55:33,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:55:33,647 INFO L262 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-20 21:55:33,652 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 21:55:33,727 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 194 proven. 12 refuted. 0 times theorem prover too weak. 214 trivial. 0 not checked. [2023-12-20 21:55:33,728 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 21:55:33,856 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 30 proven. 12 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2023-12-20 21:55:33,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [863160290] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-20 21:55:33,858 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-20 21:55:33,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2023-12-20 21:55:33,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425035296] [2023-12-20 21:55:33,859 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-20 21:55:33,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-20 21:55:33,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 21:55:33,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-20 21:55:33,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-12-20 21:55:33,863 INFO L87 Difference]: Start difference. First operand 39 states and 57 transitions. Second operand has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 2 states have call successors, (19), 2 states have call predecessors, (19), 4 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2023-12-20 21:55:34,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 21:55:34,272 INFO L93 Difference]: Finished difference Result 155 states and 217 transitions. [2023-12-20 21:55:34,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-12-20 21:55:34,272 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 2 states have call successors, (19), 2 states have call predecessors, (19), 4 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 92 [2023-12-20 21:55:34,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 21:55:34,274 INFO L225 Difference]: With dead ends: 155 [2023-12-20 21:55:34,274 INFO L226 Difference]: Without dead ends: 117 [2023-12-20 21:55:34,274 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 210 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=161, Invalid=345, Unknown=0, NotChecked=0, Total=506 [2023-12-20 21:55:34,275 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 105 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-20 21:55:34,276 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 190 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-20 21:55:34,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2023-12-20 21:55:34,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 69. [2023-12-20 21:55:34,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 40 states have (on average 1.175) internal successors, (47), 41 states have internal predecessors, (47), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2023-12-20 21:55:34,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 97 transitions. [2023-12-20 21:55:34,291 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 97 transitions. Word has length 92 [2023-12-20 21:55:34,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 21:55:34,292 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 97 transitions. [2023-12-20 21:55:34,292 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 2 states have call successors, (19), 2 states have call predecessors, (19), 4 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2023-12-20 21:55:34,292 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 97 transitions. [2023-12-20 21:55:34,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2023-12-20 21:55:34,293 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 21:55:34,293 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 21:55:34,315 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-20 21:55:34,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 21:55:34,499 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 21:55:34,499 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 21:55:34,499 INFO L85 PathProgramCache]: Analyzing trace with hash 165018170, now seen corresponding path program 1 times [2023-12-20 21:55:34,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 21:55:34,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627276508] [2023-12-20 21:55:34,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 21:55:34,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 21:55:34,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-20 21:55:34,553 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-20 21:55:34,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-20 21:55:34,648 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-20 21:55:34,648 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-20 21:55:34,649 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-20 21:55:34,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-20 21:55:34,652 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-12-20 21:55:34,654 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-20 21:55:34,694 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.12 09:55:34 BoogieIcfgContainer [2023-12-20 21:55:34,694 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-20 21:55:34,695 INFO L158 Benchmark]: Toolchain (without parser) took 2808.65ms. Allocated memory was 200.3MB in the beginning and 243.3MB in the end (delta: 43.0MB). Free memory was 163.2MB in the beginning and 92.2MB in the end (delta: 71.0MB). Peak memory consumption was 113.9MB. Max. memory is 8.0GB. [2023-12-20 21:55:34,695 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 200.3MB. Free memory is still 147.9MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-20 21:55:34,695 INFO L158 Benchmark]: CACSL2BoogieTranslator took 191.75ms. Allocated memory is still 200.3MB. Free memory was 162.8MB in the beginning and 150.2MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-20 21:55:34,695 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.94ms. Allocated memory is still 200.3MB. Free memory was 150.2MB in the beginning and 147.8MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-20 21:55:34,696 INFO L158 Benchmark]: Boogie Preprocessor took 35.50ms. Allocated memory is still 200.3MB. Free memory was 147.8MB in the beginning and 144.7MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-20 21:55:34,696 INFO L158 Benchmark]: RCFGBuilder took 371.54ms. Allocated memory is still 200.3MB. Free memory was 144.7MB in the beginning and 127.9MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2023-12-20 21:55:34,696 INFO L158 Benchmark]: TraceAbstraction took 2170.54ms. Allocated memory was 200.3MB in the beginning and 243.3MB in the end (delta: 43.0MB). Free memory was 127.2MB in the beginning and 92.2MB in the end (delta: 35.0MB). Peak memory consumption was 77.2MB. Max. memory is 8.0GB. [2023-12-20 21:55:34,698 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 200.3MB. Free memory is still 147.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 191.75ms. Allocated memory is still 200.3MB. Free memory was 162.8MB in the beginning and 150.2MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 34.94ms. Allocated memory is still 200.3MB. Free memory was 150.2MB in the beginning and 147.8MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 35.50ms. Allocated memory is still 200.3MB. Free memory was 147.8MB in the beginning and 144.7MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 371.54ms. Allocated memory is still 200.3MB. Free memory was 144.7MB in the beginning and 127.9MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * TraceAbstraction took 2170.54ms. Allocated memory was 200.3MB in the beginning and 243.3MB in the end (delta: 43.0MB). Free memory was 127.2MB in the beginning and 92.2MB in the end (delta: 35.0MB). Peak memory consumption was 77.2MB. 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 88, overapproximation of someBinaryDOUBLEComparisonOperation at line 88. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = 32; [L23] unsigned char var_1_2 = 0; [L24] signed char var_1_4 = 16; [L25] signed char var_1_5 = 4; [L26] signed char var_1_6 = 0; [L27] unsigned short int var_1_7 = 0; [L28] unsigned short int var_1_10 = 55182; [L29] unsigned char var_1_12 = 0; [L30] unsigned char var_1_14 = 1; [L31] unsigned char var_1_15 = 1; [L32] unsigned char var_1_16 = 100; [L33] float var_1_17 = 2.25; [L34] float var_1_18 = 199.4; [L35] signed char var_1_19 = -128; [L92] isInitial = 1 [L93] FCALL initially() [L94] COND TRUE 1 [L95] FCALL updateLastVariables() [L96] CALL updateVariables() [L61] var_1_2 = __VERIFIER_nondet_uchar() [L62] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=55182, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_18=997/5, var_1_19=-128, var_1_1=32, var_1_4=16, var_1_5=4, var_1_6=0, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=55182, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_18=997/5, var_1_19=-128, var_1_1=32, var_1_4=16, var_1_5=4, var_1_6=0, var_1_7=0] [L62] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=55182, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_18=997/5, var_1_19=-128, var_1_1=32, var_1_4=16, var_1_5=4, var_1_6=0, var_1_7=0] [L63] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=55182, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_18=997/5, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=16, var_1_5=4, var_1_6=0, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=55182, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_18=997/5, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=16, var_1_5=4, var_1_6=0, var_1_7=0] [L63] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=55182, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_18=997/5, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=16, var_1_5=4, var_1_6=0, var_1_7=0] [L64] var_1_4 = __VERIFIER_nondet_char() [L65] CALL assume_abort_if_not(var_1_4 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10=55182, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_18=997/5, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=125, var_1_5=4, var_1_6=0, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=55182, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_18=997/5, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=125, var_1_5=4, var_1_6=0, var_1_7=0] [L65] RET assume_abort_if_not(var_1_4 >= -1) VAL [isInitial=1, var_1_10=55182, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_18=997/5, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=125, var_1_5=4, var_1_6=0, var_1_7=0] [L66] CALL assume_abort_if_not(var_1_4 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=55182, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_18=997/5, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=125, var_1_5=4, var_1_6=0, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=55182, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_18=997/5, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=125, var_1_5=4, var_1_6=0, var_1_7=0] [L66] RET assume_abort_if_not(var_1_4 <= 126) VAL [isInitial=1, var_1_10=55182, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_18=997/5, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=125, var_1_5=4, var_1_6=0, var_1_7=0] [L67] var_1_5 = __VERIFIER_nondet_char() [L68] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=55182, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_18=997/5, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=125, var_1_5=124, var_1_6=0, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=55182, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_18=997/5, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=125, var_1_5=124, var_1_6=0, var_1_7=0] [L68] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_10=55182, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_18=997/5, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=125, var_1_5=124, var_1_6=0, var_1_7=0] [L69] CALL assume_abort_if_not(var_1_5 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=55182, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_18=997/5, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=125, var_1_5=124, var_1_6=0, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=55182, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_18=997/5, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=125, var_1_5=124, var_1_6=0, var_1_7=0] [L69] RET assume_abort_if_not(var_1_5 <= 126) VAL [isInitial=1, var_1_10=55182, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_18=997/5, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=125, var_1_5=124, var_1_6=0, var_1_7=0] [L70] var_1_6 = __VERIFIER_nondet_char() [L71] CALL assume_abort_if_not(var_1_6 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_10=55182, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_18=997/5, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=125, var_1_5=124, var_1_6=126, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=55182, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_18=997/5, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=125, var_1_5=124, var_1_6=126, var_1_7=0] [L71] RET assume_abort_if_not(var_1_6 >= -127) VAL [isInitial=1, var_1_10=55182, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_18=997/5, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=125, var_1_5=124, var_1_6=126, var_1_7=0] [L72] CALL assume_abort_if_not(var_1_6 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=55182, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_18=997/5, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=125, var_1_5=124, var_1_6=126, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=55182, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_18=997/5, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=125, var_1_5=124, var_1_6=126, var_1_7=0] [L72] RET assume_abort_if_not(var_1_6 <= 126) VAL [isInitial=1, var_1_10=55182, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_18=997/5, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=125, var_1_5=124, var_1_6=126, var_1_7=0] [L73] var_1_10 = __VERIFIER_nondet_ushort() [L74] CALL assume_abort_if_not(var_1_10 >= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=32767, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_18=997/5, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=125, var_1_5=124, var_1_6=126, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=32767, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_18=997/5, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=125, var_1_5=124, var_1_6=126, var_1_7=0] [L74] RET assume_abort_if_not(var_1_10 >= 32767) VAL [isInitial=1, var_1_10=32767, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_18=997/5, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=125, var_1_5=124, var_1_6=126, var_1_7=0] [L75] CALL assume_abort_if_not(var_1_10 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=32767, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_18=997/5, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=125, var_1_5=124, var_1_6=126, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=32767, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_18=997/5, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=125, var_1_5=124, var_1_6=126, var_1_7=0] [L75] RET assume_abort_if_not(var_1_10 <= 65534) VAL [isInitial=1, var_1_10=32767, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_18=997/5, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=125, var_1_5=124, var_1_6=126, var_1_7=0] [L76] var_1_14 = __VERIFIER_nondet_uchar() [L77] CALL assume_abort_if_not(var_1_14 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=32767, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_18=997/5, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=125, var_1_5=124, var_1_6=126, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=32767, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_18=997/5, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=125, var_1_5=124, var_1_6=126, var_1_7=0] [L77] RET assume_abort_if_not(var_1_14 >= 1) VAL [isInitial=1, var_1_10=32767, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_18=997/5, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=125, var_1_5=124, var_1_6=126, var_1_7=0] [L78] CALL assume_abort_if_not(var_1_14 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=32767, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_18=997/5, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=125, var_1_5=124, var_1_6=126, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=32767, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_18=997/5, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=125, var_1_5=124, var_1_6=126, var_1_7=0] [L78] RET assume_abort_if_not(var_1_14 <= 1) VAL [isInitial=1, var_1_10=32767, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_18=997/5, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=125, var_1_5=124, var_1_6=126, var_1_7=0] [L79] var_1_15 = __VERIFIER_nondet_uchar() [L80] CALL assume_abort_if_not(var_1_15 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=32767, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_18=997/5, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=125, var_1_5=124, var_1_6=126, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=32767, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_18=997/5, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=125, var_1_5=124, var_1_6=126, var_1_7=0] [L80] RET assume_abort_if_not(var_1_15 >= 1) VAL [isInitial=1, var_1_10=32767, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_18=997/5, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=125, var_1_5=124, var_1_6=126, var_1_7=0] [L81] CALL assume_abort_if_not(var_1_15 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=32767, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_18=997/5, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=125, var_1_5=124, var_1_6=126, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=32767, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_18=997/5, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=125, var_1_5=124, var_1_6=126, var_1_7=0] [L81] RET assume_abort_if_not(var_1_15 <= 1) VAL [isInitial=1, var_1_10=32767, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_18=997/5, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=125, var_1_5=124, var_1_6=126, var_1_7=0] [L82] var_1_18 = __VERIFIER_nondet_float() [L83] CALL assume_abort_if_not((var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=32767, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=125, var_1_5=124, var_1_6=126, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=32767, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=125, var_1_5=124, var_1_6=126, var_1_7=0] [L83] RET assume_abort_if_not((var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=32767, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=125, var_1_5=124, var_1_6=126, var_1_7=0] [L96] RET updateVariables() [L97] CALL step() [L39] COND FALSE !(! var_1_2) [L42] var_1_12 = ((! var_1_15) || (! (! 0))) VAL [isInitial=1, var_1_10=32767, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=125, var_1_5=124, var_1_6=126, var_1_7=0] [L44] var_1_16 = var_1_5 [L45] var_1_17 = var_1_18 [L46] var_1_19 = var_1_4 VAL [isInitial=1, var_1_10=32767, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=124, var_1_17=55187, var_1_18=55187, var_1_19=125, var_1_1=32, var_1_2=1, var_1_4=125, var_1_5=124, var_1_6=126, var_1_7=0] [L47] COND FALSE !(var_1_12 || (64.75f < var_1_17)) [L54] var_1_1 = var_1_4 VAL [isInitial=1, var_1_10=32767, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=124, var_1_17=55187, var_1_18=55187, var_1_19=125, var_1_1=125, var_1_2=1, var_1_4=125, var_1_5=124, var_1_6=126, var_1_7=0] [L56] COND TRUE (((((var_1_17 * 127.75)) > ((var_1_17 / 3.4))) ? ((var_1_17 * 127.75)) : ((var_1_17 / 3.4)))) >= var_1_17 [L57] var_1_7 = (((((var_1_10 - (22925 - var_1_5))) < (var_1_16)) ? ((var_1_10 - (22925 - var_1_5))) : (var_1_16))) VAL [isInitial=1, var_1_10=32767, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=124, var_1_17=55187, var_1_18=55187, var_1_19=125, var_1_1=125, var_1_2=1, var_1_4=125, var_1_5=124, var_1_6=126, var_1_7=124] [L97] RET step() [L98] CALL, EXPR property() [L88-L89] return ((((((var_1_12 || (64.75f < var_1_17)) ? (var_1_12 ? (var_1_1 == ((signed char) (var_1_4 - var_1_5))) : (var_1_1 == ((signed char) ((((((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5)))) < (var_1_6)) ? (((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5)))) : (var_1_6)))))) : (var_1_1 == ((signed char) var_1_4))) && (((((((var_1_17 * 127.75)) > ((var_1_17 / 3.4))) ? ((var_1_17 * 127.75)) : ((var_1_17 / 3.4)))) >= var_1_17) ? (var_1_7 == ((unsigned short int) (((((var_1_10 - (22925 - var_1_5))) < (var_1_16)) ? ((var_1_10 - (22925 - var_1_5))) : (var_1_16))))) : 1)) && ((! var_1_2) ? (var_1_12 == ((unsigned char) var_1_14)) : (var_1_12 == ((unsigned char) ((! var_1_15) || (! (! 0))))))) && (var_1_16 == ((unsigned char) var_1_5))) && (var_1_17 == ((float) var_1_18))) && (var_1_19 == ((signed char) var_1_4)) ; [L98] RET, EXPR property() [L98] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, var_1_10=32767, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=124, var_1_17=55187, var_1_18=55187, var_1_19=125, var_1_1=125, var_1_2=1, var_1_4=125, var_1_5=124, var_1_6=126, var_1_7=124] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, var_1_10=32767, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=124, var_1_17=55187, var_1_18=55187, var_1_19=125, var_1_1=125, var_1_2=1, var_1_4=125, var_1_5=124, var_1_6=126, var_1_7=124] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 41 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.1s, OverallIterations: 3, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 116 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 105 mSDsluCounter, 244 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 125 mSDsCounter, 73 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 291 IncrementalHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 73 mSolverCounterUnsat, 119 mSDtfsCounter, 291 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 281 GetRequests, 257 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=69occurred in iteration=2, InterpolantAutomatonStates: 21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 48 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 368 NumberOfCodeBlocks, 368 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 364 ConstructedInterpolants, 0 QuantifiedInterpolants, 894 SizeOfPredicates, 4 NumberOfNonLiveVariables, 229 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 4 InterpolantComputations, 1 PerfectInterpolantSequences, 1644/1680 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-20 21:55:34,711 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...