/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/geo1-u_valuebound2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 12:44:26,435 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 12:44:26,437 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 12:44:26,483 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 12:44:26,483 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 12:44:26,485 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 12:44:26,487 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 12:44:26,489 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 12:44:26,490 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 12:44:26,493 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 12:44:26,494 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 12:44:26,495 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 12:44:26,495 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 12:44:26,496 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 12:44:26,497 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 12:44:26,499 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 12:44:26,500 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 12:44:26,500 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 12:44:26,502 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 12:44:26,506 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 12:44:26,507 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 12:44:26,507 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 12:44:26,508 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 12:44:26,508 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 12:44:26,509 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 12:44:26,514 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 12:44:26,514 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 12:44:26,514 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 12:44:26,514 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 12:44:26,515 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 12:44:26,516 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 12:44:26,516 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 12:44:26,517 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 12:44:26,517 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 12:44:26,518 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 12:44:26,518 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 12:44:26,518 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 12:44:26,519 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 12:44:26,519 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 12:44:26,519 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 12:44:26,519 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 12:44:26,520 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 12:44:26,521 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:44:26,528 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 12:44:26,528 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 12:44:26,529 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 12:44:26,529 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 12:44:26,529 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 12:44:26,529 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 12:44:26,529 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 12:44:26,529 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 12:44:26,530 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 12:44:26,530 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 12:44:26,530 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 12:44:26,530 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 12:44:26,530 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 12:44:26,530 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 12:44:26,530 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 12:44:26,531 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 12:44:26,531 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 12:44:26,531 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 12:44:26,531 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 12:44:26,531 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 12:44:26,531 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 12:44:26,531 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-08 12:44:26,531 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:44:26,721 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 12:44:26,739 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 12:44:26,740 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 12:44:26,741 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 12:44:26,741 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 12:44:26,742 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/geo1-u_valuebound2.c [2022-04-08 12:44:26,791 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27d39ec23/e09da1f745d1437c8ed880b53556ce31/FLAG12619b700 [2022-04-08 12:44:27,108 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 12:44:27,108 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/geo1-u_valuebound2.c [2022-04-08 12:44:27,118 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27d39ec23/e09da1f745d1437c8ed880b53556ce31/FLAG12619b700 [2022-04-08 12:44:27,130 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27d39ec23/e09da1f745d1437c8ed880b53556ce31 [2022-04-08 12:44:27,131 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 12:44:27,132 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 12:44:27,134 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 12:44:27,134 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 12:44:27,137 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 12:44:27,137 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 12:44:27" (1/1) ... [2022-04-08 12:44:27,138 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28d076f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 12:44:27, skipping insertion in model container [2022-04-08 12:44:27,138 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 12:44:27" (1/1) ... [2022-04-08 12:44:27,143 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 12:44:27,151 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 12:44:27,251 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/geo1-u_valuebound2.c[555,568] [2022-04-08 12:44:27,263 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 12:44:27,268 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 12:44:27,285 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/geo1-u_valuebound2.c[555,568] [2022-04-08 12:44:27,289 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 12:44:27,298 INFO L208 MainTranslator]: Completed translation [2022-04-08 12:44:27,298 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 12:44:27 WrapperNode [2022-04-08 12:44:27,298 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 12:44:27,299 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 12:44:27,299 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 12:44:27,299 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 12:44:27,305 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 12:44:27" (1/1) ... [2022-04-08 12:44:27,305 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 12:44:27" (1/1) ... [2022-04-08 12:44:27,309 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 12:44:27" (1/1) ... [2022-04-08 12:44:27,309 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 12:44:27" (1/1) ... [2022-04-08 12:44:27,312 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 12:44:27" (1/1) ... [2022-04-08 12:44:27,314 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 12:44:27" (1/1) ... [2022-04-08 12:44:27,315 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 12:44:27" (1/1) ... [2022-04-08 12:44:27,316 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 12:44:27,316 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 12:44:27,316 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 12:44:27,316 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 12:44:27,317 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 12:44:27" (1/1) ... [2022-04-08 12:44:27,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 12:44:27,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:44:27,335 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:44:27,361 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:44:27,370 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 12:44:27,370 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 12:44:27,370 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 12:44:27,370 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-08 12:44:27,370 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 12:44:27,371 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 12:44:27,371 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 12:44:27,371 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 12:44:27,371 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 12:44:27,371 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 12:44:27,371 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-08 12:44:27,371 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-08 12:44:27,371 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 12:44:27,371 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 12:44:27,371 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 12:44:27,372 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 12:44:27,372 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 12:44:27,372 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 12:44:27,372 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 12:44:27,372 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 12:44:27,418 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 12:44:27,419 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 12:44:27,504 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 12:44:27,509 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 12:44:27,509 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 12:44:27,510 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 12:44:27 BoogieIcfgContainer [2022-04-08 12:44:27,510 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 12:44:27,511 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 12:44:27,511 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 12:44:27,515 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 12:44:27,516 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 12:44:27" (1/3) ... [2022-04-08 12:44:27,516 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d777418 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 12:44:27, skipping insertion in model container [2022-04-08 12:44:27,516 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 12:44:27" (2/3) ... [2022-04-08 12:44:27,516 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d777418 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 12:44:27, skipping insertion in model container [2022-04-08 12:44:27,516 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 12:44:27" (3/3) ... [2022-04-08 12:44:27,517 INFO L111 eAbstractionObserver]: Analyzing ICFG geo1-u_valuebound2.c [2022-04-08 12:44:27,520 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 12:44:27,520 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 12:44:27,594 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 12:44:27,598 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:44:27,598 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 12:44:27,617 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 12:44:27,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-08 12:44:27,625 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:44:27,626 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 12:44:27,626 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:44:27,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:44:27,632 INFO L85 PathProgramCache]: Analyzing trace with hash 1335806002, now seen corresponding path program 1 times [2022-04-08 12:44:27,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:44:27,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1964289375] [2022-04-08 12:44:27,645 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:44:27,645 INFO L85 PathProgramCache]: Analyzing trace with hash 1335806002, now seen corresponding path program 2 times [2022-04-08 12:44:27,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:44:27,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862992871] [2022-04-08 12:44:27,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:44:27,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:44:27,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:44:27,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 12:44:27,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:44:27,813 INFO L290 TraceCheckUtils]: 0: Hoare triple {46#(and (= |#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(9, 2);call #Ultimate.allocInit(12, 3); {33#true} is VALID [2022-04-08 12:44:27,813 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#true} assume true; {33#true} is VALID [2022-04-08 12:44:27,814 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {33#true} {33#true} #62#return; {33#true} is VALID [2022-04-08 12:44:27,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-08 12:44:27,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:44:27,823 INFO L290 TraceCheckUtils]: 0: Hoare triple {33#true} ~cond := #in~cond; {33#true} is VALID [2022-04-08 12:44:27,824 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#true} assume 0 == ~cond;assume false; {34#false} is VALID [2022-04-08 12:44:27,824 INFO L290 TraceCheckUtils]: 2: Hoare triple {34#false} assume true; {34#false} is VALID [2022-04-08 12:44:27,824 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34#false} {33#true} #54#return; {34#false} is VALID [2022-04-08 12:44:27,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-08 12:44:27,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:44:27,846 INFO L290 TraceCheckUtils]: 0: Hoare triple {33#true} ~cond := #in~cond; {33#true} is VALID [2022-04-08 12:44:27,847 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#true} assume 0 == ~cond;assume false; {34#false} is VALID [2022-04-08 12:44:27,847 INFO L290 TraceCheckUtils]: 2: Hoare triple {34#false} assume true; {34#false} is VALID [2022-04-08 12:44:27,847 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34#false} {34#false} #56#return; {34#false} is VALID [2022-04-08 12:44:27,848 INFO L272 TraceCheckUtils]: 0: Hoare triple {33#true} call ULTIMATE.init(); {46#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 12:44:27,849 INFO L290 TraceCheckUtils]: 1: Hoare triple {46#(and (= |#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(9, 2);call #Ultimate.allocInit(12, 3); {33#true} is VALID [2022-04-08 12:44:27,849 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#true} assume true; {33#true} is VALID [2022-04-08 12:44:27,849 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#true} {33#true} #62#return; {33#true} is VALID [2022-04-08 12:44:27,849 INFO L272 TraceCheckUtils]: 4: Hoare triple {33#true} call #t~ret6 := main(); {33#true} is VALID [2022-04-08 12:44:27,849 INFO L290 TraceCheckUtils]: 5: Hoare triple {33#true} havoc ~z~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;~z~0 := #t~nondet4;havoc #t~nondet4; {33#true} is VALID [2022-04-08 12:44:27,849 INFO L272 TraceCheckUtils]: 6: Hoare triple {33#true} call assume_abort_if_not((if ~z~0 % 4294967296 >= 0 && ~z~0 % 4294967296 <= 2 then 1 else 0)); {33#true} is VALID [2022-04-08 12:44:27,850 INFO L290 TraceCheckUtils]: 7: Hoare triple {33#true} ~cond := #in~cond; {33#true} is VALID [2022-04-08 12:44:27,850 INFO L290 TraceCheckUtils]: 8: Hoare triple {33#true} assume 0 == ~cond;assume false; {34#false} is VALID [2022-04-08 12:44:27,850 INFO L290 TraceCheckUtils]: 9: Hoare triple {34#false} assume true; {34#false} is VALID [2022-04-08 12:44:27,850 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {34#false} {33#true} #54#return; {34#false} is VALID [2022-04-08 12:44:27,850 INFO L290 TraceCheckUtils]: 11: Hoare triple {34#false} ~k~0 := #t~nondet5;havoc #t~nondet5; {34#false} is VALID [2022-04-08 12:44:27,851 INFO L272 TraceCheckUtils]: 12: Hoare triple {34#false} call assume_abort_if_not((if ~k~0 % 4294967296 >= 0 && ~k~0 % 4294967296 <= 2 then 1 else 0)); {33#true} is VALID [2022-04-08 12:44:27,851 INFO L290 TraceCheckUtils]: 13: Hoare triple {33#true} ~cond := #in~cond; {33#true} is VALID [2022-04-08 12:44:27,851 INFO L290 TraceCheckUtils]: 14: Hoare triple {33#true} assume 0 == ~cond;assume false; {34#false} is VALID [2022-04-08 12:44:27,851 INFO L290 TraceCheckUtils]: 15: Hoare triple {34#false} assume true; {34#false} is VALID [2022-04-08 12:44:27,852 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {34#false} {34#false} #56#return; {34#false} is VALID [2022-04-08 12:44:27,852 INFO L290 TraceCheckUtils]: 17: Hoare triple {34#false} ~x~0 := 1;~y~0 := ~z~0 % 4294967296;~c~0 := 1; {34#false} is VALID [2022-04-08 12:44:27,852 INFO L290 TraceCheckUtils]: 18: Hoare triple {34#false} assume !false; {34#false} is VALID [2022-04-08 12:44:27,852 INFO L272 TraceCheckUtils]: 19: Hoare triple {34#false} call __VERIFIER_assert((if 0 == 1 + (~x~0 * (~z~0 % 4294967296) - ~x~0 - ~y~0) then 1 else 0)); {34#false} is VALID [2022-04-08 12:44:27,852 INFO L290 TraceCheckUtils]: 20: Hoare triple {34#false} ~cond := #in~cond; {34#false} is VALID [2022-04-08 12:44:27,852 INFO L290 TraceCheckUtils]: 21: Hoare triple {34#false} assume 0 == ~cond; {34#false} is VALID [2022-04-08 12:44:27,853 INFO L290 TraceCheckUtils]: 22: Hoare triple {34#false} assume !false; {34#false} is VALID [2022-04-08 12:44:27,853 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 12:44:27,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:44:27,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862992871] [2022-04-08 12:44:27,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862992871] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:44:27,854 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:44:27,854 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 12:44:27,856 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:44:27,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1964289375] [2022-04-08 12:44:27,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1964289375] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:44:27,856 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:44:27,856 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 12:44:27,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858048989] [2022-04-08 12:44:27,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:44:27,860 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-08 12:44:27,861 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:44:27,863 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 12:44:27,893 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:44:27,893 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-08 12:44:27,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:44:27,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-08 12:44:27,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 12:44:27,916 INFO L87 Difference]: Start difference. First operand has 30 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 12:44:28,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:44:28,035 INFO L93 Difference]: Finished difference Result 53 states and 68 transitions. [2022-04-08 12:44:28,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-08 12:44:28,036 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-08 12:44:28,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:44:28,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 12:44:28,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 68 transitions. [2022-04-08 12:44:28,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 12:44:28,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 68 transitions. [2022-04-08 12:44:28,053 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 68 transitions. [2022-04-08 12:44:28,133 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:44:28,139 INFO L225 Difference]: With dead ends: 53 [2022-04-08 12:44:28,140 INFO L226 Difference]: Without dead ends: 25 [2022-04-08 12:44:28,141 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 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:44:28,144 INFO L913 BasicCegarLoop]: 28 mSDtfsCounter, 17 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 12:44:28,145 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 31 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 12:44:28,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-08 12:44:28,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-04-08 12:44:28,169 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:44:28,170 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 25 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 16 states have internal predecessors, (17), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 12:44:28,171 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 25 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 16 states have internal predecessors, (17), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 12:44:28,172 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 25 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 16 states have internal predecessors, (17), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 12:44:28,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:44:28,178 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2022-04-08 12:44:28,181 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-04-08 12:44:28,182 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:44:28,182 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:44:28,182 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 16 states have internal predecessors, (17), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 25 states. [2022-04-08 12:44:28,183 INFO L87 Difference]: Start difference. First operand has 25 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 16 states have internal predecessors, (17), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 25 states. [2022-04-08 12:44:28,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:44:28,186 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2022-04-08 12:44:28,186 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-04-08 12:44:28,186 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:44:28,186 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:44:28,187 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:44:28,187 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:44:28,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 16 states have internal predecessors, (17), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 12:44:28,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2022-04-08 12:44:28,190 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 23 [2022-04-08 12:44:28,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:44:28,217 INFO L478 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2022-04-08 12:44:28,217 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 12:44:28,217 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 27 transitions. [2022-04-08 12:44:28,242 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-08 12:44:28,242 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-04-08 12:44:28,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-08 12:44:28,243 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:44:28,243 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 12:44:28,243 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 12:44:28,244 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:44:28,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:44:28,244 INFO L85 PathProgramCache]: Analyzing trace with hash 736000694, now seen corresponding path program 1 times [2022-04-08 12:44:28,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:44:28,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1915615857] [2022-04-08 12:44:28,245 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:44:28,245 INFO L85 PathProgramCache]: Analyzing trace with hash 736000694, now seen corresponding path program 2 times [2022-04-08 12:44:28,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:44:28,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160110607] [2022-04-08 12:44:28,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:44:28,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:44:28,275 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:44:28,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2129814967] [2022-04-08 12:44:28,276 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 12:44:28,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:44:28,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:44:28,278 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-08 12:44:28,279 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-08 12:44:28,311 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-08 12:44:28,311 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:44:28,312 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 12:44:28,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:44:28,322 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:44:28,426 INFO L272 TraceCheckUtils]: 0: Hoare triple {255#true} call ULTIMATE.init(); {255#true} is VALID [2022-04-08 12:44:28,426 INFO L290 TraceCheckUtils]: 1: Hoare triple {255#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(9, 2);call #Ultimate.allocInit(12, 3); {255#true} is VALID [2022-04-08 12:44:28,426 INFO L290 TraceCheckUtils]: 2: Hoare triple {255#true} assume true; {255#true} is VALID [2022-04-08 12:44:28,426 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {255#true} {255#true} #62#return; {255#true} is VALID [2022-04-08 12:44:28,426 INFO L272 TraceCheckUtils]: 4: Hoare triple {255#true} call #t~ret6 := main(); {255#true} is VALID [2022-04-08 12:44:28,426 INFO L290 TraceCheckUtils]: 5: Hoare triple {255#true} havoc ~z~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;~z~0 := #t~nondet4;havoc #t~nondet4; {255#true} is VALID [2022-04-08 12:44:28,427 INFO L272 TraceCheckUtils]: 6: Hoare triple {255#true} call assume_abort_if_not((if ~z~0 % 4294967296 >= 0 && ~z~0 % 4294967296 <= 2 then 1 else 0)); {255#true} is VALID [2022-04-08 12:44:28,427 INFO L290 TraceCheckUtils]: 7: Hoare triple {255#true} ~cond := #in~cond; {255#true} is VALID [2022-04-08 12:44:28,427 INFO L290 TraceCheckUtils]: 8: Hoare triple {255#true} assume !(0 == ~cond); {255#true} is VALID [2022-04-08 12:44:28,427 INFO L290 TraceCheckUtils]: 9: Hoare triple {255#true} assume true; {255#true} is VALID [2022-04-08 12:44:28,427 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {255#true} {255#true} #54#return; {255#true} is VALID [2022-04-08 12:44:28,427 INFO L290 TraceCheckUtils]: 11: Hoare triple {255#true} ~k~0 := #t~nondet5;havoc #t~nondet5; {255#true} is VALID [2022-04-08 12:44:28,427 INFO L272 TraceCheckUtils]: 12: Hoare triple {255#true} call assume_abort_if_not((if ~k~0 % 4294967296 >= 0 && ~k~0 % 4294967296 <= 2 then 1 else 0)); {255#true} is VALID [2022-04-08 12:44:28,428 INFO L290 TraceCheckUtils]: 13: Hoare triple {255#true} ~cond := #in~cond; {255#true} is VALID [2022-04-08 12:44:28,428 INFO L290 TraceCheckUtils]: 14: Hoare triple {255#true} assume !(0 == ~cond); {255#true} is VALID [2022-04-08 12:44:28,428 INFO L290 TraceCheckUtils]: 15: Hoare triple {255#true} assume true; {255#true} is VALID [2022-04-08 12:44:28,428 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {255#true} {255#true} #56#return; {255#true} is VALID [2022-04-08 12:44:28,428 INFO L290 TraceCheckUtils]: 17: Hoare triple {255#true} ~x~0 := 1;~y~0 := ~z~0 % 4294967296;~c~0 := 1; {311#(and (= (mod main_~z~0 4294967296) main_~y~0) (= main_~x~0 1))} is VALID [2022-04-08 12:44:28,429 INFO L290 TraceCheckUtils]: 18: Hoare triple {311#(and (= (mod main_~z~0 4294967296) main_~y~0) (= main_~x~0 1))} assume !false; {311#(and (= (mod main_~z~0 4294967296) main_~y~0) (= main_~x~0 1))} is VALID [2022-04-08 12:44:28,430 INFO L272 TraceCheckUtils]: 19: Hoare triple {311#(and (= (mod main_~z~0 4294967296) main_~y~0) (= main_~x~0 1))} call __VERIFIER_assert((if 0 == 1 + (~x~0 * (~z~0 % 4294967296) - ~x~0 - ~y~0) then 1 else 0)); {318#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 12:44:28,430 INFO L290 TraceCheckUtils]: 20: Hoare triple {318#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {322#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 12:44:28,430 INFO L290 TraceCheckUtils]: 21: Hoare triple {322#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {256#false} is VALID [2022-04-08 12:44:28,431 INFO L290 TraceCheckUtils]: 22: Hoare triple {256#false} assume !false; {256#false} is VALID [2022-04-08 12:44:28,431 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 12:44:28,431 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 12:44:28,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:44:28,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160110607] [2022-04-08 12:44:28,431 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:44:28,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2129814967] [2022-04-08 12:44:28,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2129814967] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:44:28,432 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:44:28,432 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 12:44:28,432 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:44:28,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1915615857] [2022-04-08 12:44:28,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1915615857] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:44:28,433 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:44:28,433 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 12:44:28,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416684183] [2022-04-08 12:44:28,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:44:28,433 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2022-04-08 12:44:28,433 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:44:28,434 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 12:44:28,448 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:44:28,448 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 12:44:28,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:44:28,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 12:44:28,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 12:44:28,449 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 12:44:28,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:44:28,541 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2022-04-08 12:44:28,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 12:44:28,542 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2022-04-08 12:44:28,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:44:28,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 12:44:28,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 38 transitions. [2022-04-08 12:44:28,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 12:44:28,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 38 transitions. [2022-04-08 12:44:28,544 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 38 transitions. [2022-04-08 12:44:28,572 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:44:28,573 INFO L225 Difference]: With dead ends: 35 [2022-04-08 12:44:28,573 INFO L226 Difference]: Without dead ends: 33 [2022-04-08 12:44:28,574 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 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:44:28,574 INFO L913 BasicCegarLoop]: 23 mSDtfsCounter, 6 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 12:44:28,575 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 84 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 12:44:28,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-08 12:44:28,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2022-04-08 12:44:28,582 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:44:28,582 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 31 states, 19 states have (on average 1.105263157894737) internal successors, (21), 21 states have internal predecessors, (21), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 12:44:28,583 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 31 states, 19 states have (on average 1.105263157894737) internal successors, (21), 21 states have internal predecessors, (21), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 12:44:28,583 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 31 states, 19 states have (on average 1.105263157894737) internal successors, (21), 21 states have internal predecessors, (21), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 12:44:28,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:44:28,584 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2022-04-08 12:44:28,584 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2022-04-08 12:44:28,585 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:44:28,585 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:44:28,585 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 19 states have (on average 1.105263157894737) internal successors, (21), 21 states have internal predecessors, (21), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Second operand 33 states. [2022-04-08 12:44:28,585 INFO L87 Difference]: Start difference. First operand has 31 states, 19 states have (on average 1.105263157894737) internal successors, (21), 21 states have internal predecessors, (21), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Second operand 33 states. [2022-04-08 12:44:28,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:44:28,587 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2022-04-08 12:44:28,587 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2022-04-08 12:44:28,587 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:44:28,587 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:44:28,587 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:44:28,587 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:44:28,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 19 states have (on average 1.105263157894737) internal successors, (21), 21 states have internal predecessors, (21), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 12:44:28,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2022-04-08 12:44:28,589 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 23 [2022-04-08 12:44:28,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:44:28,589 INFO L478 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2022-04-08 12:44:28,589 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 12:44:28,589 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 33 transitions. [2022-04-08 12:44:28,618 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:44:28,618 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2022-04-08 12:44:28,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-08 12:44:28,619 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:44:28,619 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 12:44:28,636 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-08 12:44:28,837 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-08 12:44:28,837 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:44:28,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:44:28,838 INFO L85 PathProgramCache]: Analyzing trace with hash -1598096837, now seen corresponding path program 1 times [2022-04-08 12:44:28,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:44:28,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1427596995] [2022-04-08 12:44:28,838 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:44:28,838 INFO L85 PathProgramCache]: Analyzing trace with hash -1598096837, now seen corresponding path program 2 times [2022-04-08 12:44:28,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:44:28,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402185921] [2022-04-08 12:44:28,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:44:28,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:44:28,847 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:44:28,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1112959477] [2022-04-08 12:44:28,848 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 12:44:28,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:44:28,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:44:28,849 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-08 12:44:28,850 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-08 12:44:28,886 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 12:44:28,886 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-04-08 12:44:28,886 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-08 12:44:28,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-08 12:44:28,906 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-08 12:44:28,906 INFO L130 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found a feasible trace [2022-04-08 12:44:28,906 INFO L618 BasicCegarLoop]: Counterexample is feasible [2022-04-08 12:44:28,908 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-08 12:44:28,927 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-08 12:44:29,125 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-08 12:44:29,128 INFO L719 BasicCegarLoop]: Path program histogram: [2, 2, 2] [2022-04-08 12:44:29,130 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-08 12:44:29,138 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-08 12:44:29,138 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-08 12:44:29,138 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-08 12:44:29,138 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-08 12:44:29,138 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-08 12:44:29,138 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-08 12:44:29,138 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2022-04-08 12:44:29,138 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-08 12:44:29,139 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-08 12:44:29,139 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-08 12:44:29,139 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-08 12:44:29,139 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-08 12:44:29,139 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-08 12:44:29,139 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2022-04-08 12:44:29,139 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2022-04-08 12:44:29,139 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-08 12:44:29,139 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-08 12:44:29,139 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-08 12:44:29,139 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-08 12:44:29,139 WARN L170 areAnnotationChecker]: L13-2 has no Hoare annotation [2022-04-08 12:44:29,139 WARN L170 areAnnotationChecker]: L26-1 has no Hoare annotation [2022-04-08 12:44:29,139 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2022-04-08 12:44:29,139 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2022-04-08 12:44:29,139 WARN L170 areAnnotationChecker]: L16-2 has no Hoare annotation [2022-04-08 12:44:29,139 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-08 12:44:29,139 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-08 12:44:29,139 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2022-04-08 12:44:29,139 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2022-04-08 12:44:29,139 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-08 12:44:29,139 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-08 12:44:29,139 WARN L170 areAnnotationChecker]: L28-1 has no Hoare annotation [2022-04-08 12:44:29,139 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2022-04-08 12:44:29,139 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2022-04-08 12:44:29,139 WARN L170 areAnnotationChecker]: L48-1 has no Hoare annotation [2022-04-08 12:44:29,139 WARN L170 areAnnotationChecker]: L34-2 has no Hoare annotation [2022-04-08 12:44:29,139 WARN L170 areAnnotationChecker]: L34-2 has no Hoare annotation [2022-04-08 12:44:29,139 WARN L170 areAnnotationChecker]: L34-2 has no Hoare annotation [2022-04-08 12:44:29,140 WARN L170 areAnnotationChecker]: L34-3 has no Hoare annotation [2022-04-08 12:44:29,140 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-08 12:44:29,140 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-04-08 12:44:29,140 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-04-08 12:44:29,140 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-04-08 12:44:29,140 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-04-08 12:44:29,140 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-08 12:44:29,140 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:44:29,140 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.04 12:44:29 BoogieIcfgContainer [2022-04-08 12:44:29,141 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-08 12:44:29,141 INFO L158 Benchmark]: Toolchain (without parser) took 2009.20ms. Allocated memory is still 188.7MB. Free memory was 142.9MB in the beginning and 118.5MB in the end (delta: 24.4MB). Peak memory consumption was 25.3MB. Max. memory is 8.0GB. [2022-04-08 12:44:29,141 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 188.7MB. Free memory is still 159.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 12:44:29,142 INFO L158 Benchmark]: CACSL2BoogieTranslator took 164.54ms. Allocated memory is still 188.7MB. Free memory was 142.6MB in the beginning and 166.5MB in the end (delta: -23.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-08 12:44:29,142 INFO L158 Benchmark]: Boogie Preprocessor took 16.65ms. Allocated memory is still 188.7MB. Free memory was 166.5MB in the beginning and 165.2MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-08 12:44:29,142 INFO L158 Benchmark]: RCFGBuilder took 193.96ms. Allocated memory is still 188.7MB. Free memory was 165.2MB in the beginning and 154.5MB in the end (delta: 10.7MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-08 12:44:29,142 INFO L158 Benchmark]: TraceAbstraction took 1629.59ms. Allocated memory is still 188.7MB. Free memory was 154.1MB in the beginning and 118.5MB in the end (delta: 35.6MB). Peak memory consumption was 36.0MB. Max. memory is 8.0GB. [2022-04-08 12:44:29,143 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 188.7MB. Free memory is still 159.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 164.54ms. Allocated memory is still 188.7MB. Free memory was 142.6MB in the beginning and 166.5MB in the end (delta: -23.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 16.65ms. Allocated memory is still 188.7MB. Free memory was 166.5MB in the beginning and 165.2MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 193.96ms. Allocated memory is still 188.7MB. Free memory was 165.2MB in the beginning and 154.5MB in the end (delta: 10.7MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 1629.59ms. Allocated memory is still 188.7MB. Free memory was 154.1MB in the beginning and 118.5MB in the end (delta: 35.6MB). Peak memory consumption was 36.0MB. 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 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L23] unsigned int z, k; [L24] long long x, y, c; [L25] z = __VERIFIER_nondet_uint() [L26] CALL assume_abort_if_not(z>=0 && z<=2) [L13] COND FALSE !(!cond) [L26] RET assume_abort_if_not(z>=0 && z<=2) [L27] k = __VERIFIER_nondet_uint() [L28] CALL assume_abort_if_not(k>=0 && k<=2) [L13] COND FALSE !(!cond) [L28] RET assume_abort_if_not(k>=0 && k<=2) [L30] x = 1 [L31] y = z [L32] c = 1 [L34] COND TRUE 1 [L35] CALL __VERIFIER_assert(x*z - x - y + 1 == 0) [L16] COND FALSE !(!(cond)) [L35] RET __VERIFIER_assert(x*z - x - y + 1 == 0) [L37] COND TRUE !(c < k) [L46] x = x * (z - 1) [L48] CALL __VERIFIER_assert(1 + x - y == 0) [L16] COND TRUE !(cond) [L18] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 33 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.5s, OverallIterations: 3, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 28 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 23 mSDsluCounter, 115 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 64 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 32 IncrementalHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 51 mSDtfsCounter, 32 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 33 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31occurred in iteration=2, InterpolantAutomatonStates: 8, 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, 2 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 proved your program to be incorrect! [2022-04-08 12:44:29,171 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...