/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/freire2_unwindbound5.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 15:16:20,003 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 15:16:20,004 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 15:16:20,030 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 15:16:20,031 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 15:16:20,032 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 15:16:20,037 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 15:16:20,042 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 15:16:20,044 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 15:16:20,044 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 15:16:20,045 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 15:16:20,046 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 15:16:20,047 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 15:16:20,053 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 15:16:20,054 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 15:16:20,054 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 15:16:20,055 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 15:16:20,055 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 15:16:20,057 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 15:16:20,058 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 15:16:20,059 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 15:16:20,063 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 15:16:20,064 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 15:16:20,065 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 15:16:20,066 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 15:16:20,074 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 15:16:20,074 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 15:16:20,075 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 15:16:20,075 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 15:16:20,076 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 15:16:20,077 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 15:16:20,077 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 15:16:20,078 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 15:16:20,079 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 15:16:20,080 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 15:16:20,080 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 15:16:20,081 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 15:16:20,081 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 15:16:20,081 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 15:16:20,081 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 15:16:20,082 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 15:16:20,084 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 15:16:20,085 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-15 15:16:20,095 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 15:16:20,096 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 15:16:20,097 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 15:16:20,097 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 15:16:20,097 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 15:16:20,097 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 15:16:20,097 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 15:16:20,097 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 15:16:20,097 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 15:16:20,098 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 15:16:20,098 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 15:16:20,098 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 15:16:20,099 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 15:16:20,099 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 15:16:20,099 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 15:16:20,099 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 15:16:20,099 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 15:16:20,099 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 15:16:20,099 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 15:16:20,100 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 15:16:20,100 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 15:16:20,100 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-15 15:16:20,100 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-15 15:16:20,322 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 15:16:20,345 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 15:16:20,347 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 15:16:20,347 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 15:16:20,349 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 15:16:20,350 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/freire2_unwindbound5.c [2022-04-15 15:16:20,412 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03c9adf70/dcf62ae1006a495ab4cba16904da437b/FLAG1e33e66cf [2022-04-15 15:16:20,750 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 15:16:20,750 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/freire2_unwindbound5.c [2022-04-15 15:16:20,756 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03c9adf70/dcf62ae1006a495ab4cba16904da437b/FLAG1e33e66cf [2022-04-15 15:16:21,186 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03c9adf70/dcf62ae1006a495ab4cba16904da437b [2022-04-15 15:16:21,188 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 15:16:21,189 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 15:16:21,191 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 15:16:21,191 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 15:16:21,194 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 15:16:21,195 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 03:16:21" (1/1) ... [2022-04-15 15:16:21,196 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44cc6a0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:16:21, skipping insertion in model container [2022-04-15 15:16:21,196 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 03:16:21" (1/1) ... [2022-04-15 15:16:21,203 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 15:16:21,216 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 15:16:21,351 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/freire2_unwindbound5.c[709,722] [2022-04-15 15:16:21,371 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 15:16:21,379 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 15:16:21,391 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/freire2_unwindbound5.c[709,722] [2022-04-15 15:16:21,403 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 15:16:21,418 INFO L208 MainTranslator]: Completed translation [2022-04-15 15:16:21,419 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:16:21 WrapperNode [2022-04-15 15:16:21,419 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 15:16:21,420 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 15:16:21,420 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 15:16:21,420 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 15:16:21,431 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:16:21" (1/1) ... [2022-04-15 15:16:21,431 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:16:21" (1/1) ... [2022-04-15 15:16:21,449 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:16:21" (1/1) ... [2022-04-15 15:16:21,450 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:16:21" (1/1) ... [2022-04-15 15:16:21,462 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:16:21" (1/1) ... [2022-04-15 15:16:21,466 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:16:21" (1/1) ... [2022-04-15 15:16:21,467 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:16:21" (1/1) ... [2022-04-15 15:16:21,468 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 15:16:21,469 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 15:16:21,469 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 15:16:21,469 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 15:16:21,470 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:16:21" (1/1) ... [2022-04-15 15:16:21,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 15:16:21,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:16:21,499 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-15 15:16:21,501 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-15 15:16:21,525 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 15:16:21,525 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 15:16:21,526 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 15:16:21,526 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 15:16:21,526 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 15:16:21,526 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 15:16:21,526 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 15:16:21,526 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 15:16:21,526 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 15:16:21,526 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 15:16:21,527 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_double [2022-04-15 15:16:21,527 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 15:16:21,527 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 15:16:21,527 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 15:16:21,527 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 15:16:21,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 15:16:21,527 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 15:16:21,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 15:16:21,527 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 15:16:21,528 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 15:16:21,579 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 15:16:21,580 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 15:16:21,701 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 15:16:21,710 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 15:16:21,723 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 15:16:21,730 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 03:16:21 BoogieIcfgContainer [2022-04-15 15:16:21,731 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 15:16:21,732 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 15:16:21,732 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 15:16:21,735 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 15:16:21,735 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 03:16:21" (1/3) ... [2022-04-15 15:16:21,736 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10a2ea43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 03:16:21, skipping insertion in model container [2022-04-15 15:16:21,736 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:16:21" (2/3) ... [2022-04-15 15:16:21,737 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10a2ea43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 03:16:21, skipping insertion in model container [2022-04-15 15:16:21,737 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 03:16:21" (3/3) ... [2022-04-15 15:16:21,738 INFO L111 eAbstractionObserver]: Analyzing ICFG freire2_unwindbound5.c [2022-04-15 15:16:21,742 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 15:16:21,742 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 15:16:21,801 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 15:16:21,809 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-15 15:16:21,810 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 15:16:21,839 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 15:16:21,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-15 15:16:21,845 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:16:21,846 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 15:16:21,846 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:16:21,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:16:21,855 INFO L85 PathProgramCache]: Analyzing trace with hash -643130361, now seen corresponding path program 1 times [2022-04-15 15:16:21,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:16:21,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1488386831] [2022-04-15 15:16:21,873 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:16:21,873 INFO L85 PathProgramCache]: Analyzing trace with hash -643130361, now seen corresponding path program 2 times [2022-04-15 15:16:21,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:16:21,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382057103] [2022-04-15 15:16:21,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:16:21,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:16:21,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:16:22,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 15:16:22,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:16:22,080 INFO L290 TraceCheckUtils]: 0: Hoare triple {34#(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; {29#true} is VALID [2022-04-15 15:16:22,081 INFO L290 TraceCheckUtils]: 1: Hoare triple {29#true} assume true; {29#true} is VALID [2022-04-15 15:16:22,081 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {29#true} {29#true} #66#return; {29#true} is VALID [2022-04-15 15:16:22,087 INFO L272 TraceCheckUtils]: 0: Hoare triple {29#true} call ULTIMATE.init(); {34#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 15:16:22,088 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#(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; {29#true} is VALID [2022-04-15 15:16:22,088 INFO L290 TraceCheckUtils]: 2: Hoare triple {29#true} assume true; {29#true} is VALID [2022-04-15 15:16:22,088 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29#true} {29#true} #66#return; {29#true} is VALID [2022-04-15 15:16:22,088 INFO L272 TraceCheckUtils]: 4: Hoare triple {29#true} call #t~ret6 := main(); {29#true} is VALID [2022-04-15 15:16:22,089 INFO L290 TraceCheckUtils]: 5: Hoare triple {29#true} havoc ~r~0;havoc ~a~0;havoc ~x~0;havoc ~s~0;~a~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~a~0;~s~0 := 3.25;~r~0 := 1; {29#true} is VALID [2022-04-15 15:16:22,090 INFO L290 TraceCheckUtils]: 6: Hoare triple {29#true} assume !true; {30#false} is VALID [2022-04-15 15:16:22,090 INFO L272 TraceCheckUtils]: 7: Hoare triple {30#false} call __VERIFIER_assert((if 1 == ~convertDOUBLEToINT(~someBinaryArithmeticDOUBLEoperation(~convertINTToDOUBLE(4), ~s~0)) - 12 * ~r~0 * ~r~0 then 1 else 0)); {30#false} is VALID [2022-04-15 15:16:22,090 INFO L290 TraceCheckUtils]: 8: Hoare triple {30#false} ~cond := #in~cond; {30#false} is VALID [2022-04-15 15:16:22,090 INFO L290 TraceCheckUtils]: 9: Hoare triple {30#false} assume 0 == ~cond; {30#false} is VALID [2022-04-15 15:16:22,091 INFO L290 TraceCheckUtils]: 10: Hoare triple {30#false} assume !false; {30#false} is VALID [2022-04-15 15:16:22,091 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-15 15:16:22,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:16:22,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382057103] [2022-04-15 15:16:22,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382057103] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:16:22,093 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:16:22,093 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 15:16:22,095 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:16:22,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1488386831] [2022-04-15 15:16:22,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1488386831] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:16:22,096 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:16:22,096 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 15:16:22,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934684661] [2022-04-15 15:16:22,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:16:22,101 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-15 15:16:22,102 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:16:22,105 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-15 15:16:22,132 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-15 15:16:22,132 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 15:16:22,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:16:22,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 15:16:22,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 15:16:22,152 INFO L87 Difference]: Start difference. First operand has 26 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) 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-15 15:16:22,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:16:22,292 INFO L93 Difference]: Finished difference Result 47 states and 70 transitions. [2022-04-15 15:16:22,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 15:16:22,292 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-15 15:16:22,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:16:22,294 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-15 15:16:22,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2022-04-15 15:16:22,313 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-15 15:16:22,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2022-04-15 15:16:22,323 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 70 transitions. [2022-04-15 15:16:22,419 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:16:22,433 INFO L225 Difference]: With dead ends: 47 [2022-04-15 15:16:22,433 INFO L226 Difference]: Without dead ends: 22 [2022-04-15 15:16:22,437 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-15 15:16:22,443 INFO L913 BasicCegarLoop]: 31 mSDtfsCounter, 6 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 15:16:22,445 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 35 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 15:16:22,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-15 15:16:22,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2022-04-15 15:16:22,487 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:16:22,487 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 21 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 15:16:22,488 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 21 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 15:16:22,488 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 21 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 15:16:22,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:16:22,492 INFO L93 Difference]: Finished difference Result 22 states and 28 transitions. [2022-04-15 15:16:22,492 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2022-04-15 15:16:22,492 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:16:22,493 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:16:22,493 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 22 states. [2022-04-15 15:16:22,493 INFO L87 Difference]: Start difference. First operand has 21 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 22 states. [2022-04-15 15:16:22,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:16:22,496 INFO L93 Difference]: Finished difference Result 22 states and 28 transitions. [2022-04-15 15:16:22,496 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2022-04-15 15:16:22,497 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:16:22,497 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:16:22,497 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:16:22,497 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:16:22,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 15:16:22,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2022-04-15 15:16:22,501 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 27 transitions. Word has length 11 [2022-04-15 15:16:22,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:16:22,502 INFO L478 AbstractCegarLoop]: Abstraction has 21 states and 27 transitions. [2022-04-15 15:16:22,502 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-15 15:16:22,502 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 27 transitions. [2022-04-15 15:16:22,533 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:16:22,534 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 27 transitions. [2022-04-15 15:16:22,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-15 15:16:22,536 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:16:22,536 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 15:16:22,536 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 15:16:22,536 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:16:22,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:16:22,537 INFO L85 PathProgramCache]: Analyzing trace with hash 1070997212, now seen corresponding path program 1 times [2022-04-15 15:16:22,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:16:22,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1918273241] [2022-04-15 15:16:22,538 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:16:22,538 INFO L85 PathProgramCache]: Analyzing trace with hash 1070997212, now seen corresponding path program 2 times [2022-04-15 15:16:22,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:16:22,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300293301] [2022-04-15 15:16:22,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:16:22,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:16:22,555 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:16:22,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [232419051] [2022-04-15 15:16:22,555 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 15:16:22,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:16:22,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:16:22,557 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) [2022-04-15 15:16:22,579 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-15 15:16:22,624 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-15 15:16:22,624 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:16:22,626 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-15 15:16:22,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:16:22,640 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:16:22,747 INFO L272 TraceCheckUtils]: 0: Hoare triple {217#true} call ULTIMATE.init(); {217#true} is VALID [2022-04-15 15:16:22,748 INFO L290 TraceCheckUtils]: 1: Hoare triple {217#true} #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; {225#(<= ~counter~0 0)} is VALID [2022-04-15 15:16:22,749 INFO L290 TraceCheckUtils]: 2: Hoare triple {225#(<= ~counter~0 0)} assume true; {225#(<= ~counter~0 0)} is VALID [2022-04-15 15:16:22,750 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {225#(<= ~counter~0 0)} {217#true} #66#return; {225#(<= ~counter~0 0)} is VALID [2022-04-15 15:16:22,750 INFO L272 TraceCheckUtils]: 4: Hoare triple {225#(<= ~counter~0 0)} call #t~ret6 := main(); {225#(<= ~counter~0 0)} is VALID [2022-04-15 15:16:22,751 INFO L290 TraceCheckUtils]: 5: Hoare triple {225#(<= ~counter~0 0)} havoc ~r~0;havoc ~a~0;havoc ~x~0;havoc ~s~0;~a~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~a~0;~s~0 := 3.25;~r~0 := 1; {225#(<= ~counter~0 0)} is VALID [2022-04-15 15:16:22,751 INFO L290 TraceCheckUtils]: 6: Hoare triple {225#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {241#(<= |main_#t~post5| 0)} is VALID [2022-04-15 15:16:22,752 INFO L290 TraceCheckUtils]: 7: Hoare triple {241#(<= |main_#t~post5| 0)} assume !(#t~post5 < 5);havoc #t~post5; {218#false} is VALID [2022-04-15 15:16:22,752 INFO L272 TraceCheckUtils]: 8: Hoare triple {218#false} call __VERIFIER_assert((if 1 == ~convertDOUBLEToINT(~someBinaryArithmeticDOUBLEoperation(~convertINTToDOUBLE(4), ~s~0)) - 12 * ~r~0 * ~r~0 then 1 else 0)); {218#false} is VALID [2022-04-15 15:16:22,752 INFO L290 TraceCheckUtils]: 9: Hoare triple {218#false} ~cond := #in~cond; {218#false} is VALID [2022-04-15 15:16:22,753 INFO L290 TraceCheckUtils]: 10: Hoare triple {218#false} assume 0 == ~cond; {218#false} is VALID [2022-04-15 15:16:22,753 INFO L290 TraceCheckUtils]: 11: Hoare triple {218#false} assume !false; {218#false} is VALID [2022-04-15 15:16:22,753 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-15 15:16:22,753 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 15:16:22,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:16:22,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300293301] [2022-04-15 15:16:22,754 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:16:22,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [232419051] [2022-04-15 15:16:22,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [232419051] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:16:22,754 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:16:22,755 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 15:16:22,755 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:16:22,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1918273241] [2022-04-15 15:16:22,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1918273241] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:16:22,756 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:16:22,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 15:16:22,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205350730] [2022-04-15 15:16:22,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:16:22,757 INFO L78 Accepts]: Start accepts. Automaton has has 4 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-15 15:16:22,757 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:16:22,757 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 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-15 15:16:22,768 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-15 15:16:22,769 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 15:16:22,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:16:22,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 15:16:22,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 15:16:22,770 INFO L87 Difference]: Start difference. First operand 21 states and 27 transitions. Second operand has 4 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-15 15:16:22,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:16:22,842 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2022-04-15 15:16:22,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 15:16:22,843 INFO L78 Accepts]: Start accepts. Automaton has has 4 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-15 15:16:22,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:16:22,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 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-15 15:16:22,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-04-15 15:16:22,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 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-15 15:16:22,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-04-15 15:16:22,847 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 40 transitions. [2022-04-15 15:16:22,883 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:16:22,884 INFO L225 Difference]: With dead ends: 32 [2022-04-15 15:16:22,885 INFO L226 Difference]: Without dead ends: 23 [2022-04-15 15:16:22,885 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 15:16:22,886 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 0 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 15:16:22,887 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 69 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 15:16:22,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-15 15:16:22,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-04-15 15:16:22,895 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:16:22,896 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 23 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 15:16:22,896 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 23 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 15:16:22,897 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 23 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 15:16:22,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:16:22,899 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2022-04-15 15:16:22,899 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2022-04-15 15:16:22,900 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:16:22,900 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:16:22,900 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 23 states. [2022-04-15 15:16:22,900 INFO L87 Difference]: Start difference. First operand has 23 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 23 states. [2022-04-15 15:16:22,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:16:22,903 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2022-04-15 15:16:22,903 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2022-04-15 15:16:22,903 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:16:22,904 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:16:22,904 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:16:22,904 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:16:22,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 15:16:22,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2022-04-15 15:16:22,906 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 29 transitions. Word has length 12 [2022-04-15 15:16:22,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:16:22,906 INFO L478 AbstractCegarLoop]: Abstraction has 23 states and 29 transitions. [2022-04-15 15:16:22,907 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 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-15 15:16:22,907 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 29 transitions. [2022-04-15 15:16:22,935 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:16:22,936 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2022-04-15 15:16:22,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-15 15:16:22,936 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:16:22,937 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 15:16:22,971 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-15 15:16:23,159 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:16:23,160 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:16:23,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:16:23,161 INFO L85 PathProgramCache]: Analyzing trace with hash 1072665508, now seen corresponding path program 1 times [2022-04-15 15:16:23,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:16:23,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [26046829] [2022-04-15 15:16:23,161 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:16:23,162 INFO L85 PathProgramCache]: Analyzing trace with hash 1072665508, now seen corresponding path program 2 times [2022-04-15 15:16:23,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:16:23,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530289494] [2022-04-15 15:16:23,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:16:23,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:16:23,172 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:16:23,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1048903388] [2022-04-15 15:16:23,173 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 15:16:23,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:16:23,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:16:23,174 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 15:16:23,197 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-15 15:16:23,213 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-15 15:16:23,213 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-04-15 15:16:23,213 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 15:16:23,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 15:16:23,234 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 15:16:23,235 INFO L130 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found a feasible trace [2022-04-15 15:16:23,235 INFO L618 BasicCegarLoop]: Counterexample is feasible [2022-04-15 15:16:23,237 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-15 15:16:23,263 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-15 15:16:23,451 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-15 15:16:23,454 INFO L719 BasicCegarLoop]: Path program histogram: [2, 2, 2] [2022-04-15 15:16:23,456 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-15 15:16:23,463 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-15 15:16:23,463 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-15 15:16:23,463 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-15 15:16:23,463 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-15 15:16:23,463 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-15 15:16:23,463 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-15 15:16:23,464 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2022-04-15 15:16:23,464 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-15 15:16:23,464 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-15 15:16:23,464 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-15 15:16:23,464 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-15 15:16:23,464 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2022-04-15 15:16:23,464 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2022-04-15 15:16:23,464 WARN L170 areAnnotationChecker]: L33-3 has no Hoare annotation [2022-04-15 15:16:23,464 WARN L170 areAnnotationChecker]: L33-3 has no Hoare annotation [2022-04-15 15:16:23,464 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2022-04-15 15:16:23,464 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2022-04-15 15:16:23,464 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-15 15:16:23,464 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-15 15:16:23,464 WARN L170 areAnnotationChecker]: L14-2 has no Hoare annotation [2022-04-15 15:16:23,465 WARN L170 areAnnotationChecker]: L33-4 has no Hoare annotation [2022-04-15 15:16:23,465 WARN L170 areAnnotationChecker]: L33-4 has no Hoare annotation [2022-04-15 15:16:23,465 WARN L170 areAnnotationChecker]: L33-1 has no Hoare annotation [2022-04-15 15:16:23,465 WARN L170 areAnnotationChecker]: L33-1 has no Hoare annotation [2022-04-15 15:16:23,465 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-04-15 15:16:23,465 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-04-15 15:16:23,465 WARN L170 areAnnotationChecker]: L17-2 has no Hoare annotation [2022-04-15 15:16:23,465 WARN L170 areAnnotationChecker]: L45 has no Hoare annotation [2022-04-15 15:16:23,465 WARN L170 areAnnotationChecker]: L45 has no Hoare annotation [2022-04-15 15:16:23,465 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2022-04-15 15:16:23,465 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2022-04-15 15:16:23,465 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 15:16:23,465 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 15:16:23,466 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 15:16:23,466 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 15:16:23,466 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 15:16:23,466 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 15:16:23,466 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2022-04-15 15:16:23,466 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2022-04-15 15:16:23,466 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2022-04-15 15:16:23,466 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2022-04-15 15:16:23,466 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-04-15 15:16:23,466 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-04-15 15:16:23,466 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2022-04-15 15:16:23,466 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2022-04-15 15:16:23,466 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2022-04-15 15:16:23,466 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-15 15:16:23,466 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-15 15:16:23,467 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-15 15:16:23,470 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 03:16:23 BoogieIcfgContainer [2022-04-15 15:16:23,470 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-15 15:16:23,471 INFO L158 Benchmark]: Toolchain (without parser) took 2282.04ms. Allocated memory was 189.8MB in the beginning and 228.6MB in the end (delta: 38.8MB). Free memory was 139.5MB in the beginning and 184.6MB in the end (delta: -45.1MB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 15:16:23,472 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 189.8MB. Free memory is still 155.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 15:16:23,472 INFO L158 Benchmark]: CACSL2BoogieTranslator took 228.15ms. Allocated memory was 189.8MB in the beginning and 228.6MB in the end (delta: 38.8MB). Free memory was 139.2MB in the beginning and 204.8MB in the end (delta: -65.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-15 15:16:23,473 INFO L158 Benchmark]: Boogie Preprocessor took 48.51ms. Allocated memory is still 228.6MB. Free memory was 204.8MB in the beginning and 203.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-15 15:16:23,474 INFO L158 Benchmark]: RCFGBuilder took 261.62ms. Allocated memory is still 228.6MB. Free memory was 203.2MB in the beginning and 192.0MB in the end (delta: 11.2MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-15 15:16:23,474 INFO L158 Benchmark]: TraceAbstraction took 1738.14ms. Allocated memory is still 228.6MB. Free memory was 191.3MB in the beginning and 184.6MB in the end (delta: 6.7MB). Peak memory consumption was 7.9MB. Max. memory is 8.0GB. [2022-04-15 15:16:23,477 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 189.8MB. Free memory is still 155.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 228.15ms. Allocated memory was 189.8MB in the beginning and 228.6MB in the end (delta: 38.8MB). Free memory was 139.2MB in the beginning and 204.8MB in the end (delta: -65.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 48.51ms. Allocated memory is still 228.6MB. Free memory was 204.8MB in the beginning and 203.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 261.62ms. Allocated memory is still 228.6MB. Free memory was 203.2MB in the beginning and 192.0MB in the end (delta: 11.2MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 1738.14ms. Allocated memory is still 228.6MB. Free memory was 191.3MB in the beginning and 184.6MB in the end (delta: 6.7MB). Peak memory consumption was 7.9MB. 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 34. Possible FailurePath: [L24] int counter = 0; [L26] int r; [L27] double a, x, s; [L28] a = __VERIFIER_nondet_double() [L29] x = a [L30] s = 3.25 [L31] r = 1 [L33] EXPR counter++ [L33] COND TRUE counter++<5 [L34] CALL __VERIFIER_assert((int)(4*s) - 12*r*r == 1) [L17] COND TRUE !(cond) [L19] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 33 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.7s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6 mSDsluCounter, 104 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 48 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 22 IncrementalHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 56 mSDtfsCounter, 22 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=26occurred in iteration=0, InterpolantAutomatonStates: 7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 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-15 15:16:23,506 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...