/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/freire1_unwindbound20.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 12:43:22,193 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 12:43:22,194 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 12:43:22,214 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 12:43:22,214 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 12:43:22,215 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 12:43:22,215 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 12:43:22,216 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 12:43:22,217 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 12:43:22,218 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 12:43:22,218 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 12:43:22,219 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 12:43:22,219 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 12:43:22,220 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 12:43:22,220 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 12:43:22,221 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 12:43:22,221 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 12:43:22,222 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 12:43:22,223 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 12:43:22,224 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 12:43:22,224 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 12:43:22,228 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 12:43:22,231 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 12:43:22,232 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 12:43:22,232 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 12:43:22,234 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 12:43:22,234 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 12:43:22,234 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 12:43:22,234 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 12:43:22,235 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 12:43:22,235 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 12:43:22,235 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 12:43:22,236 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 12:43:22,236 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 12:43:22,236 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 12:43:22,237 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 12:43:22,237 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 12:43:22,237 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 12:43:22,238 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 12:43:22,238 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 12:43:22,238 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 12:43:22,252 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 12:43:22,252 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-08 12:43:22,257 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 12:43:22,257 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 12:43:22,258 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 12:43:22,258 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 12:43:22,258 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 12:43:22,258 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 12:43:22,259 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 12:43:22,259 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 12:43:22,259 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 12:43:22,259 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 12:43:22,259 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 12:43:22,259 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 12:43:22,259 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 12:43:22,259 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 12:43:22,259 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 12:43:22,259 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 12:43:22,259 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 12:43:22,259 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 12:43:22,260 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 12:43:22,260 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 12:43:22,260 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 12:43:22,260 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-08 12:43:22,260 INFO L138 SettingsManager]: * Use separate solver for trace checks=false 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.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-08 12:43:22,438 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 12:43:22,453 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 12:43:22,455 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 12:43:22,455 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 12:43:22,456 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 12:43:22,457 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/freire1_unwindbound20.c [2022-04-08 12:43:22,525 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/502a57ba7/d7f710a276014c6e83c6ea2fcade5f9e/FLAG2449ed0fe [2022-04-08 12:43:22,877 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 12:43:22,877 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/freire1_unwindbound20.c [2022-04-08 12:43:22,881 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/502a57ba7/d7f710a276014c6e83c6ea2fcade5f9e/FLAG2449ed0fe [2022-04-08 12:43:22,888 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/502a57ba7/d7f710a276014c6e83c6ea2fcade5f9e [2022-04-08 12:43:22,890 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 12:43:22,890 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 12:43:22,891 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 12:43:22,892 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 12:43:22,893 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 12:43:22,894 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 12:43:22" (1/1) ... [2022-04-08 12:43:22,895 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cd007b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 12:43:22, skipping insertion in model container [2022-04-08 12:43:22,895 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 12:43:22" (1/1) ... [2022-04-08 12:43:22,899 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 12:43:22,906 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 12:43:23,015 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/freire1_unwindbound20.c[712,725] [2022-04-08 12:43:23,025 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 12:43:23,030 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 12:43:23,038 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/freire1_unwindbound20.c[712,725] [2022-04-08 12:43:23,041 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 12:43:23,049 INFO L208 MainTranslator]: Completed translation [2022-04-08 12:43:23,049 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 12:43:23 WrapperNode [2022-04-08 12:43:23,049 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 12:43:23,050 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 12:43:23,050 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 12:43:23,050 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 12:43:23,069 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 12:43:23" (1/1) ... [2022-04-08 12:43:23,069 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 12:43:23" (1/1) ... [2022-04-08 12:43:23,073 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 12:43:23" (1/1) ... [2022-04-08 12:43:23,074 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 12:43:23" (1/1) ... [2022-04-08 12:43:23,078 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 12:43:23" (1/1) ... [2022-04-08 12:43:23,080 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 12:43:23" (1/1) ... [2022-04-08 12:43:23,081 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 12:43:23" (1/1) ... [2022-04-08 12:43:23,082 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 12:43:23,083 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 12:43:23,083 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 12:43:23,083 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 12:43:23,083 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 12:43:23" (1/1) ... [2022-04-08 12:43:23,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 12:43:23,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:43:23,101 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-08 12:43:23,103 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-08 12:43:23,125 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 12:43:23,126 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 12:43:23,126 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 12:43:23,126 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-08 12:43:23,126 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 12:43:23,126 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 12:43:23,126 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 12:43:23,126 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 12:43:23,126 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 12:43:23,126 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 12:43:23,126 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_double [2022-04-08 12:43:23,126 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-08 12:43:23,126 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 12:43:23,127 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 12:43:23,127 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 12:43:23,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 12:43:23,127 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 12:43:23,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 12:43:23,129 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 12:43:23,129 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 12:43:23,172 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 12:43:23,173 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 12:43:23,276 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 12:43:23,288 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 12:43:23,288 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 12:43:23,290 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 12:43:23 BoogieIcfgContainer [2022-04-08 12:43:23,290 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 12:43:23,300 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 12:43:23,300 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 12:43:23,302 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 12:43:23,302 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 12:43:22" (1/3) ... [2022-04-08 12:43:23,303 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19bdb01c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 12:43:23, skipping insertion in model container [2022-04-08 12:43:23,303 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 12:43:23" (2/3) ... [2022-04-08 12:43:23,303 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19bdb01c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 12:43:23, skipping insertion in model container [2022-04-08 12:43:23,303 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 12:43:23" (3/3) ... [2022-04-08 12:43:23,304 INFO L111 eAbstractionObserver]: Analyzing ICFG freire1_unwindbound20.c [2022-04-08 12:43:23,307 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 12:43:23,307 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 12:43:23,337 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 12:43:23,341 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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 [2022-04-08 12:43:23,341 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 12:43:23,353 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 12:43:23,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-08 12:43:23,357 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:43:23,357 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 12:43:23,358 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:43:23,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:43:23,361 INFO L85 PathProgramCache]: Analyzing trace with hash 1665267581, now seen corresponding path program 1 times [2022-04-08 12:43:23,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:43:23,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1059381124] [2022-04-08 12:43:23,378 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:43:23,378 INFO L85 PathProgramCache]: Analyzing trace with hash 1665267581, now seen corresponding path program 2 times [2022-04-08 12:43:23,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:43:23,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107967314] [2022-04-08 12:43:23,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:43:23,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:43:23,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:43:23,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 12:43:23,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:43:23,541 INFO L290 TraceCheckUtils]: 0: Hoare triple {30#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {25#true} is VALID [2022-04-08 12:43:23,542 INFO L290 TraceCheckUtils]: 1: Hoare triple {25#true} assume true; {25#true} is VALID [2022-04-08 12:43:23,542 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25#true} {25#true} #54#return; {25#true} is VALID [2022-04-08 12:43:23,544 INFO L272 TraceCheckUtils]: 0: Hoare triple {25#true} call ULTIMATE.init(); {30#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 12:43:23,544 INFO L290 TraceCheckUtils]: 1: Hoare triple {30#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {25#true} is VALID [2022-04-08 12:43:23,544 INFO L290 TraceCheckUtils]: 2: Hoare triple {25#true} assume true; {25#true} is VALID [2022-04-08 12:43:23,545 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25#true} {25#true} #54#return; {25#true} is VALID [2022-04-08 12:43:23,545 INFO L272 TraceCheckUtils]: 4: Hoare triple {25#true} call #t~ret6 := main(); {25#true} is VALID [2022-04-08 12:43:23,546 INFO L290 TraceCheckUtils]: 5: Hoare triple {25#true} havoc ~r~0;havoc ~a~0;havoc ~x~0;~a~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~someBinaryArithmeticDOUBLEoperation(~a~0, 2.0);~r~0 := 0; {25#true} is VALID [2022-04-08 12:43:23,546 INFO L290 TraceCheckUtils]: 6: Hoare triple {25#true} assume !true; {26#false} is VALID [2022-04-08 12:43:23,547 INFO L272 TraceCheckUtils]: 7: Hoare triple {26#false} call __VERIFIER_assert((if 0 == ~convertDOUBLEToINT(~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(~convertINTToDOUBLE(~r~0 * ~r~0), ~a~0), ~convertINTToDOUBLE(~r~0)), ~someBinaryArithmeticDOUBLEoperation(~convertINTToDOUBLE(2), ~x~0))) then 1 else 0)); {26#false} is VALID [2022-04-08 12:43:23,547 INFO L290 TraceCheckUtils]: 8: Hoare triple {26#false} ~cond := #in~cond; {26#false} is VALID [2022-04-08 12:43:23,547 INFO L290 TraceCheckUtils]: 9: Hoare triple {26#false} assume 0 == ~cond; {26#false} is VALID [2022-04-08 12:43:23,548 INFO L290 TraceCheckUtils]: 10: Hoare triple {26#false} assume !false; {26#false} is VALID [2022-04-08 12:43:23,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 12:43:23,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:43:23,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107967314] [2022-04-08 12:43:23,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107967314] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:43:23,550 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:43:23,550 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 12:43:23,552 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:43:23,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1059381124] [2022-04-08 12:43:23,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1059381124] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:43:23,553 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:43:23,553 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 12:43:23,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218791999] [2022-04-08 12:43:23,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:43:23,557 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-08 12:43:23,558 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:43:23,561 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 12:43:23,582 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:43:23,583 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-08 12:43:23,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:43:23,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-08 12:43:23,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 12:43:23,608 INFO L87 Difference]: Start difference. First operand has 22 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 12:43:23,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:43:23,704 INFO L93 Difference]: Finished difference Result 39 states and 50 transitions. [2022-04-08 12:43:23,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-08 12:43:23,704 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-08 12:43:23,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:43:23,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 12:43:23,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2022-04-08 12:43:23,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 12:43:23,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2022-04-08 12:43:23,714 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 50 transitions. [2022-04-08 12:43:23,778 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:43:23,783 INFO L225 Difference]: With dead ends: 39 [2022-04-08 12:43:23,783 INFO L226 Difference]: Without dead ends: 18 [2022-04-08 12:43:23,785 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 12:43:23,787 INFO L913 BasicCegarLoop]: 23 mSDtfsCounter, 6 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 12:43:23,788 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 27 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 12:43:23,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-04-08 12:43:23,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2022-04-08 12:43:23,810 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:43:23,811 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand has 17 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 12:43:23,811 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand has 17 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 12:43:23,812 INFO L87 Difference]: Start difference. First operand 18 states. Second operand has 17 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 12:43:23,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:43:23,814 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2022-04-08 12:43:23,814 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-04-08 12:43:23,814 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:43:23,814 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:43:23,815 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 18 states. [2022-04-08 12:43:23,815 INFO L87 Difference]: Start difference. First operand has 17 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 18 states. [2022-04-08 12:43:23,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:43:23,817 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2022-04-08 12:43:23,817 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-04-08 12:43:23,817 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:43:23,817 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:43:23,817 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:43:23,817 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:43:23,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 12:43:23,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-04-08 12:43:23,819 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 11 [2022-04-08 12:43:23,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:43:23,820 INFO L478 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-04-08 12:43:23,820 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 12:43:23,820 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 19 transitions. [2022-04-08 12:43:23,840 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:43:23,840 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-08 12:43:23,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-08 12:43:23,840 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:43:23,841 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 12:43:23,841 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 12:43:23,841 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:43:23,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:43:23,842 INFO L85 PathProgramCache]: Analyzing trace with hash -318583316, now seen corresponding path program 1 times [2022-04-08 12:43:23,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:43:23,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1192826995] [2022-04-08 12:43:23,843 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:43:23,843 INFO L85 PathProgramCache]: Analyzing trace with hash -318583316, now seen corresponding path program 2 times [2022-04-08 12:43:23,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:43:23,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310150206] [2022-04-08 12:43:23,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:43:23,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:43:23,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:43:23,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 12:43:23,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:43:23,937 INFO L290 TraceCheckUtils]: 0: Hoare triple {188#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {186#(= ~counter~0 0)} is VALID [2022-04-08 12:43:23,938 INFO L290 TraceCheckUtils]: 1: Hoare triple {186#(= ~counter~0 0)} assume true; {186#(= ~counter~0 0)} is VALID [2022-04-08 12:43:23,938 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {186#(= ~counter~0 0)} {181#true} #54#return; {186#(= ~counter~0 0)} is VALID [2022-04-08 12:43:23,939 INFO L272 TraceCheckUtils]: 0: Hoare triple {181#true} call ULTIMATE.init(); {188#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 12:43:23,939 INFO L290 TraceCheckUtils]: 1: Hoare triple {188#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {186#(= ~counter~0 0)} is VALID [2022-04-08 12:43:23,941 INFO L290 TraceCheckUtils]: 2: Hoare triple {186#(= ~counter~0 0)} assume true; {186#(= ~counter~0 0)} is VALID [2022-04-08 12:43:23,941 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {186#(= ~counter~0 0)} {181#true} #54#return; {186#(= ~counter~0 0)} is VALID [2022-04-08 12:43:23,941 INFO L272 TraceCheckUtils]: 4: Hoare triple {186#(= ~counter~0 0)} call #t~ret6 := main(); {186#(= ~counter~0 0)} is VALID [2022-04-08 12:43:23,942 INFO L290 TraceCheckUtils]: 5: Hoare triple {186#(= ~counter~0 0)} havoc ~r~0;havoc ~a~0;havoc ~x~0;~a~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~someBinaryArithmeticDOUBLEoperation(~a~0, 2.0);~r~0 := 0; {186#(= ~counter~0 0)} is VALID [2022-04-08 12:43:23,942 INFO L290 TraceCheckUtils]: 6: Hoare triple {186#(= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {187#(= |main_#t~post5| 0)} is VALID [2022-04-08 12:43:23,943 INFO L290 TraceCheckUtils]: 7: Hoare triple {187#(= |main_#t~post5| 0)} assume !(#t~post5 < 20);havoc #t~post5; {182#false} is VALID [2022-04-08 12:43:23,943 INFO L272 TraceCheckUtils]: 8: Hoare triple {182#false} call __VERIFIER_assert((if 0 == ~convertDOUBLEToINT(~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(~convertINTToDOUBLE(~r~0 * ~r~0), ~a~0), ~convertINTToDOUBLE(~r~0)), ~someBinaryArithmeticDOUBLEoperation(~convertINTToDOUBLE(2), ~x~0))) then 1 else 0)); {182#false} is VALID [2022-04-08 12:43:23,943 INFO L290 TraceCheckUtils]: 9: Hoare triple {182#false} ~cond := #in~cond; {182#false} is VALID [2022-04-08 12:43:23,943 INFO L290 TraceCheckUtils]: 10: Hoare triple {182#false} assume 0 == ~cond; {182#false} is VALID [2022-04-08 12:43:23,943 INFO L290 TraceCheckUtils]: 11: Hoare triple {182#false} assume !false; {182#false} is VALID [2022-04-08 12:43:23,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 12:43:23,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:43:23,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310150206] [2022-04-08 12:43:23,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310150206] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:43:23,944 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:43:23,944 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 12:43:23,945 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:43:23,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1192826995] [2022-04-08 12:43:23,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1192826995] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:43:23,945 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:43:23,945 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 12:43:23,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100151432] [2022-04-08 12:43:23,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:43:23,946 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-08 12:43:23,946 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:43:23,946 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 12:43:23,955 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:43:23,955 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 12:43:23,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:43:23,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 12:43:23,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 12:43:23,956 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 12:43:24,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:43:24,056 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2022-04-08 12:43:24,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 12:43:24,056 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-08 12:43:24,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:43:24,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 12:43:24,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 28 transitions. [2022-04-08 12:43:24,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 12:43:24,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 28 transitions. [2022-04-08 12:43:24,062 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 28 transitions. [2022-04-08 12:43:24,085 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:43:24,087 INFO L225 Difference]: With dead ends: 26 [2022-04-08 12:43:24,088 INFO L226 Difference]: Without dead ends: 19 [2022-04-08 12:43:24,088 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 12:43:24,091 INFO L913 BasicCegarLoop]: 17 mSDtfsCounter, 6 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 12:43:24,091 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 33 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 12:43:24,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-04-08 12:43:24,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-04-08 12:43:24,098 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:43:24,098 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand has 19 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 12:43:24,099 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand has 19 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 12:43:24,099 INFO L87 Difference]: Start difference. First operand 19 states. Second operand has 19 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 12:43:24,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:43:24,101 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2022-04-08 12:43:24,101 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-08 12:43:24,102 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:43:24,103 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:43:24,104 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 19 states. [2022-04-08 12:43:24,104 INFO L87 Difference]: Start difference. First operand has 19 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 19 states. [2022-04-08 12:43:24,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:43:24,107 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2022-04-08 12:43:24,107 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-08 12:43:24,107 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:43:24,107 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:43:24,107 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:43:24,107 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:43:24,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 12:43:24,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2022-04-08 12:43:24,109 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 12 [2022-04-08 12:43:24,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:43:24,109 INFO L478 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2022-04-08 12:43:24,111 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 12:43:24,111 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 21 transitions. [2022-04-08 12:43:24,127 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:43:24,128 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-08 12:43:24,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-08 12:43:24,128 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:43:24,128 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 12:43:24,129 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-08 12:43:24,129 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:43:24,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:43:24,130 INFO L85 PathProgramCache]: Analyzing trace with hash -316795856, now seen corresponding path program 1 times [2022-04-08 12:43:24,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:43:24,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [733117632] [2022-04-08 12:43:24,132 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:43:24,132 INFO L85 PathProgramCache]: Analyzing trace with hash -316795856, now seen corresponding path program 2 times [2022-04-08 12:43:24,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:43:24,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568502884] [2022-04-08 12:43:24,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:43:24,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:43:24,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-08 12:43:24,159 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-08 12:43:24,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-08 12:43:24,177 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-08 12:43:24,178 INFO L130 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found a feasible trace [2022-04-08 12:43:24,178 INFO L618 BasicCegarLoop]: Counterexample is feasible [2022-04-08 12:43:24,180 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-08 12:43:24,181 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-08 12:43:24,183 INFO L719 BasicCegarLoop]: Path program histogram: [2, 2, 2] [2022-04-08 12:43:24,184 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-08 12:43:24,193 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-08 12:43:24,193 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-08 12:43:24,193 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-08 12:43:24,193 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-08 12:43:24,193 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-08 12:43:24,193 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-08 12:43:24,193 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2022-04-08 12:43:24,193 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-08 12:43:24,194 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-08 12:43:24,194 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-08 12:43:24,194 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-08 12:43:24,194 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2022-04-08 12:43:24,194 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2022-04-08 12:43:24,194 WARN L170 areAnnotationChecker]: L32-3 has no Hoare annotation [2022-04-08 12:43:24,194 WARN L170 areAnnotationChecker]: L32-3 has no Hoare annotation [2022-04-08 12:43:24,194 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2022-04-08 12:43:24,194 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2022-04-08 12:43:24,194 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-08 12:43:24,194 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-08 12:43:24,194 WARN L170 areAnnotationChecker]: L14-2 has no Hoare annotation [2022-04-08 12:43:24,194 WARN L170 areAnnotationChecker]: L32-4 has no Hoare annotation [2022-04-08 12:43:24,194 WARN L170 areAnnotationChecker]: L32-4 has no Hoare annotation [2022-04-08 12:43:24,194 WARN L170 areAnnotationChecker]: L32-1 has no Hoare annotation [2022-04-08 12:43:24,194 WARN L170 areAnnotationChecker]: L32-1 has no Hoare annotation [2022-04-08 12:43:24,194 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-04-08 12:43:24,194 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-04-08 12:43:24,195 WARN L170 areAnnotationChecker]: L17-2 has no Hoare annotation [2022-04-08 12:43:24,195 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2022-04-08 12:43:24,195 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2022-04-08 12:43:24,195 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2022-04-08 12:43:24,195 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-08 12:43:24,195 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-08 12:43:24,195 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-08 12:43:24,195 WARN L170 areAnnotationChecker]: L33-1 has no Hoare annotation [2022-04-08 12:43:24,195 WARN L170 areAnnotationChecker]: L33-1 has no Hoare annotation [2022-04-08 12:43:24,195 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-08 12:43:24,195 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-08 12:43:24,196 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.04 12:43:24 BoogieIcfgContainer [2022-04-08 12:43:24,196 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-08 12:43:24,197 INFO L158 Benchmark]: Toolchain (without parser) took 1306.35ms. Allocated memory was 190.8MB in the beginning and 233.8MB in the end (delta: 43.0MB). Free memory was 141.5MB in the beginning and 208.6MB in the end (delta: -67.1MB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 12:43:24,197 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 190.8MB. Free memory is still 157.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 12:43:24,197 INFO L158 Benchmark]: CACSL2BoogieTranslator took 158.20ms. Allocated memory is still 190.8MB. Free memory was 141.2MB in the beginning and 167.5MB in the end (delta: -26.3MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-04-08 12:43:24,198 INFO L158 Benchmark]: Boogie Preprocessor took 32.04ms. Allocated memory is still 190.8MB. Free memory was 167.5MB in the beginning and 165.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-08 12:43:24,198 INFO L158 Benchmark]: RCFGBuilder took 207.48ms. Allocated memory is still 190.8MB. Free memory was 165.9MB in the beginning and 154.9MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-08 12:43:24,198 INFO L158 Benchmark]: TraceAbstraction took 896.49ms. Allocated memory was 190.8MB in the beginning and 233.8MB in the end (delta: 43.0MB). Free memory was 154.4MB in the beginning and 208.6MB in the end (delta: -54.2MB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 12:43:24,199 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 190.8MB. Free memory is still 157.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 158.20ms. Allocated memory is still 190.8MB. Free memory was 141.2MB in the beginning and 167.5MB in the end (delta: -26.3MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 32.04ms. Allocated memory is still 190.8MB. Free memory was 167.5MB in the beginning and 165.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 207.48ms. Allocated memory is still 190.8MB. Free memory was 165.9MB in the beginning and 154.9MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 896.49ms. Allocated memory was 190.8MB in the beginning and 233.8MB in the end (delta: 43.0MB). Free memory was 154.4MB in the beginning and 208.6MB in the end (delta: -54.2MB). There was no memory consumed. 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 call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of to_int at line 33, overapproximation of someBinaryArithmeticDOUBLEoperation at line 29. Possible FailurePath: [L24] int counter = 0; [L26] int r; [L27] double a, x; [L28] a = __VERIFIER_nondet_double() [L29] x = a / 2.0 [L30] r = 0 [L32] EXPR counter++ [L32] COND TRUE counter++<20 [L33] CALL __VERIFIER_assert((int)(r*r - a - r + 2*x) == 0) [L17] COND TRUE !(cond) [L19] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 29 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.8s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 12 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 12 mSDsluCounter, 60 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 20 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 39 IncrementalHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 40 mSDtfsCounter, 39 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22occurred in iteration=0, InterpolantAutomatonStates: 9, 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, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: No data available, 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 [2022-04-08 12:43:24,224 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...