/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/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/geo1-u_unwindbound20.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 06:12:59,548 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 06:12:59,550 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 06:12:59,608 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 06:12:59,608 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 06:12:59,609 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 06:12:59,612 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 06:12:59,614 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 06:12:59,616 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 06:12:59,621 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 06:12:59,622 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 06:12:59,624 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 06:12:59,624 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 06:12:59,626 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 06:12:59,627 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 06:12:59,629 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 06:12:59,630 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 06:12:59,630 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 06:12:59,632 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 06:12:59,637 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 06:12:59,639 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 06:12:59,640 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 06:12:59,641 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 06:12:59,641 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 06:12:59,643 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 06:12:59,649 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 06:12:59,649 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 06:12:59,649 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 06:12:59,650 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 06:12:59,650 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 06:12:59,651 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 06:12:59,652 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 06:12:59,652 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 06:12:59,653 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 06:12:59,653 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 06:12:59,654 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 06:12:59,654 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 06:12:59,655 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 06:12:59,655 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 06:12:59,655 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 06:12:59,656 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 06:12:59,657 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 06:12:59,658 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-08 06:12:59,667 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 06:12:59,668 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 06:12:59,669 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 06:12:59,669 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-08 06:12:59,669 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 06:12:59,670 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-08 06:12:59,670 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 06:12:59,670 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 06:12:59,670 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 06:12:59,670 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 06:12:59,670 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-08 06:12:59,670 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 06:12:59,671 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 06:12:59,671 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 06:12:59,671 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 06:12:59,671 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 06:12:59,671 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 06:12:59,671 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 06:12:59,671 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 06:12:59,672 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 06:12:59,672 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 06:12:59,672 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 06:12:59,672 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 06:12:59,672 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 06:12:59,672 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-08 06:12:59,673 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 06:13:00,060 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 06:13:00,103 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 06:13:00,105 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 06:13:00,106 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 06:13:00,106 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 06:13:00,107 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/geo1-u_unwindbound20.c [2022-04-08 06:13:00,187 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7567f439d/84442ce229ca495eb808887a19b04caa/FLAG0e3dbbae7 [2022-04-08 06:13:00,827 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 06:13:00,827 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/geo1-u_unwindbound20.c [2022-04-08 06:13:00,835 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7567f439d/84442ce229ca495eb808887a19b04caa/FLAG0e3dbbae7 [2022-04-08 06:13:01,164 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7567f439d/84442ce229ca495eb808887a19b04caa [2022-04-08 06:13:01,166 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 06:13:01,167 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 06:13:01,176 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 06:13:01,176 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 06:13:01,191 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 06:13:01,192 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 06:13:01" (1/1) ... [2022-04-08 06:13:01,193 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@642b6452 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 06:13:01, skipping insertion in model container [2022-04-08 06:13:01,193 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 06:13:01" (1/1) ... [2022-04-08 06:13:01,198 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 06:13:01,221 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 06:13:01,520 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_unwindbound20.c[555,568] [2022-04-08 06:13:01,560 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 06:13:01,587 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 06:13:01,601 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_unwindbound20.c[555,568] [2022-04-08 06:13:01,628 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 06:13:01,640 INFO L208 MainTranslator]: Completed translation [2022-04-08 06:13:01,644 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 06:13:01 WrapperNode [2022-04-08 06:13:01,644 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 06:13:01,646 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 06:13:01,646 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 06:13:01,646 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 06:13:01,655 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 06:13:01" (1/1) ... [2022-04-08 06:13:01,656 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 06:13:01" (1/1) ... [2022-04-08 06:13:01,661 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 06:13:01" (1/1) ... [2022-04-08 06:13:01,661 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 06:13:01" (1/1) ... [2022-04-08 06:13:01,666 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 06:13:01" (1/1) ... [2022-04-08 06:13:01,670 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 06:13:01" (1/1) ... [2022-04-08 06:13:01,671 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 06:13:01" (1/1) ... [2022-04-08 06:13:01,677 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 06:13:01,678 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 06:13:01,678 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 06:13:01,678 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 06:13:01,679 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 06:13:01" (1/1) ... [2022-04-08 06:13:01,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 06:13:01,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:13:01,708 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 06:13:01,718 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 06:13:01,778 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 06:13:01,778 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 06:13:01,779 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 06:13:01,779 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-08 06:13:01,779 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 06:13:01,779 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 06:13:01,779 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 06:13:01,779 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 06:13:01,779 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 06:13:01,780 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 06:13:01,780 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-08 06:13:01,780 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-08 06:13:01,781 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 06:13:01,781 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 06:13:01,781 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 06:13:01,781 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 06:13:01,781 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 06:13:01,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 06:13:01,782 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 06:13:01,782 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 06:13:01,842 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 06:13:01,844 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 06:13:02,028 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 06:13:02,034 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 06:13:02,034 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 06:13:02,052 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 06:13:02 BoogieIcfgContainer [2022-04-08 06:13:02,052 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 06:13:02,054 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 06:13:02,054 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 06:13:02,057 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 06:13:02,057 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 06:13:01" (1/3) ... [2022-04-08 06:13:02,058 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@dbd5871 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 06:13:02, skipping insertion in model container [2022-04-08 06:13:02,058 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 06:13:01" (2/3) ... [2022-04-08 06:13:02,058 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@dbd5871 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 06:13:02, skipping insertion in model container [2022-04-08 06:13:02,058 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 06:13:02" (3/3) ... [2022-04-08 06:13:02,059 INFO L111 eAbstractionObserver]: Analyzing ICFG geo1-u_unwindbound20.c [2022-04-08 06:13:02,069 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 06:13:02,070 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 06:13:02,126 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 06:13:02,135 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 06:13:02,135 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 06:13:02,156 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 15 states have internal predecessors, (19), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 06:13:02,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-08 06:13:02,163 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:13:02,164 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 06:13:02,164 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:13:02,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:13:02,170 INFO L85 PathProgramCache]: Analyzing trace with hash -1864317590, now seen corresponding path program 1 times [2022-04-08 06:13:02,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:13:02,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [110828070] [2022-04-08 06:13:02,187 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:13:02,187 INFO L85 PathProgramCache]: Analyzing trace with hash -1864317590, now seen corresponding path program 2 times [2022-04-08 06:13:02,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:13:02,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60459408] [2022-04-08 06:13:02,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:13:02,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:13:02,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:13:02,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 06:13:02,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:13:02,410 INFO L290 TraceCheckUtils]: 0: Hoare triple {31#(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(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {26#true} is VALID [2022-04-08 06:13:02,410 INFO L290 TraceCheckUtils]: 1: Hoare triple {26#true} assume true; {26#true} is VALID [2022-04-08 06:13:02,411 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26#true} {26#true} #55#return; {26#true} is VALID [2022-04-08 06:13:02,413 INFO L272 TraceCheckUtils]: 0: Hoare triple {26#true} call ULTIMATE.init(); {31#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 06:13:02,414 INFO L290 TraceCheckUtils]: 1: Hoare triple {31#(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(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {26#true} is VALID [2022-04-08 06:13:02,414 INFO L290 TraceCheckUtils]: 2: Hoare triple {26#true} assume true; {26#true} is VALID [2022-04-08 06:13:02,414 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26#true} {26#true} #55#return; {26#true} is VALID [2022-04-08 06:13:02,414 INFO L272 TraceCheckUtils]: 4: Hoare triple {26#true} call #t~ret7 := main(); {26#true} is VALID [2022-04-08 06:13:02,415 INFO L290 TraceCheckUtils]: 5: Hoare triple {26#true} havoc ~z~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;~z~0 := #t~nondet4;havoc #t~nondet4;~k~0 := #t~nondet5;havoc #t~nondet5;~x~0 := 1;~y~0 := ~z~0 % 4294967296;~c~0 := 1; {26#true} is VALID [2022-04-08 06:13:02,415 INFO L290 TraceCheckUtils]: 6: Hoare triple {26#true} assume !true; {27#false} is VALID [2022-04-08 06:13:02,416 INFO L290 TraceCheckUtils]: 7: Hoare triple {27#false} ~x~0 := ~x~0 * ((~z~0 - 1) % 4294967296); {27#false} is VALID [2022-04-08 06:13:02,416 INFO L272 TraceCheckUtils]: 8: Hoare triple {27#false} call __VERIFIER_assert((if 0 == 1 + ~x~0 - ~y~0 then 1 else 0)); {27#false} is VALID [2022-04-08 06:13:02,417 INFO L290 TraceCheckUtils]: 9: Hoare triple {27#false} ~cond := #in~cond; {27#false} is VALID [2022-04-08 06:13:02,417 INFO L290 TraceCheckUtils]: 10: Hoare triple {27#false} assume 0 == ~cond; {27#false} is VALID [2022-04-08 06:13:02,417 INFO L290 TraceCheckUtils]: 11: Hoare triple {27#false} assume !false; {27#false} is VALID [2022-04-08 06:13:02,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 06:13:02,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:13:02,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60459408] [2022-04-08 06:13:02,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60459408] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:13:02,420 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:13:02,420 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 06:13:02,425 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:13:02,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [110828070] [2022-04-08 06:13:02,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [110828070] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:13:02,426 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:13:02,426 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 06:13:02,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403010884] [2022-04-08 06:13:02,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:13:02,431 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 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 12 [2022-04-08 06:13:02,433 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:13:02,436 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 06:13:02,458 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:13:02,459 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-08 06:13:02,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:13:02,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-08 06:13:02,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 06:13:02,479 INFO L87 Difference]: Start difference. First operand has 23 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 15 states have internal predecessors, (19), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 06:13:02,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:13:02,563 INFO L93 Difference]: Finished difference Result 41 states and 52 transitions. [2022-04-08 06:13:02,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-08 06:13:02,564 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 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 12 [2022-04-08 06:13:02,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:13:02,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 06:13:02,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 52 transitions. [2022-04-08 06:13:02,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 06:13:02,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 52 transitions. [2022-04-08 06:13:02,584 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 52 transitions. [2022-04-08 06:13:02,641 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:13:02,647 INFO L225 Difference]: With dead ends: 41 [2022-04-08 06:13:02,647 INFO L226 Difference]: Without dead ends: 19 [2022-04-08 06:13:02,650 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 06:13:02,653 INFO L913 BasicCegarLoop]: 24 mSDtfsCounter, 6 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 06:13:02,653 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 28 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 06:13:02,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-04-08 06:13:02,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2022-04-08 06:13:02,691 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:13:02,692 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand has 18 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 06:13:02,693 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand has 18 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 06:13:02,693 INFO L87 Difference]: Start difference. First operand 19 states. Second operand has 18 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 06:13:02,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:13:02,700 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2022-04-08 06:13:02,701 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-08 06:13:02,701 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:13:02,701 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:13:02,702 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 19 states. [2022-04-08 06:13:02,702 INFO L87 Difference]: Start difference. First operand has 18 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 19 states. [2022-04-08 06:13:02,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:13:02,711 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2022-04-08 06:13:02,711 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-08 06:13:02,712 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:13:02,712 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:13:02,712 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:13:02,712 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:13:02,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 06:13:02,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2022-04-08 06:13:02,715 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 12 [2022-04-08 06:13:02,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:13:02,716 INFO L478 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2022-04-08 06:13:02,716 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 06:13:02,716 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 20 transitions. [2022-04-08 06:13:02,750 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 06:13:02,751 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-04-08 06:13:02,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-08 06:13:02,751 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:13:02,751 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 06:13:02,752 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 06:13:02,752 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:13:02,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:13:02,753 INFO L85 PathProgramCache]: Analyzing trace with hash 2049175951, now seen corresponding path program 1 times [2022-04-08 06:13:02,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:13:02,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [899145495] [2022-04-08 06:13:02,754 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:13:02,754 INFO L85 PathProgramCache]: Analyzing trace with hash 2049175951, now seen corresponding path program 2 times [2022-04-08 06:13:02,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:13:02,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986595688] [2022-04-08 06:13:02,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:13:02,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:13:02,768 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:13:02,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [146270238] [2022-04-08 06:13:02,768 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 06:13:02,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:13:02,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:13:02,770 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 06:13:02,772 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 06:13:02,831 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-08 06:13:02,832 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:13:02,834 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 06:13:02,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:13:02,845 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:13:02,996 INFO L272 TraceCheckUtils]: 0: Hoare triple {190#true} call ULTIMATE.init(); {190#true} is VALID [2022-04-08 06:13:02,996 INFO L290 TraceCheckUtils]: 1: Hoare triple {190#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);~counter~0 := 0; {190#true} is VALID [2022-04-08 06:13:02,997 INFO L290 TraceCheckUtils]: 2: Hoare triple {190#true} assume true; {190#true} is VALID [2022-04-08 06:13:02,997 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {190#true} {190#true} #55#return; {190#true} is VALID [2022-04-08 06:13:02,997 INFO L272 TraceCheckUtils]: 4: Hoare triple {190#true} call #t~ret7 := main(); {190#true} is VALID [2022-04-08 06:13:02,998 INFO L290 TraceCheckUtils]: 5: Hoare triple {190#true} havoc ~z~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;~z~0 := #t~nondet4;havoc #t~nondet4;~k~0 := #t~nondet5;havoc #t~nondet5;~x~0 := 1;~y~0 := ~z~0 % 4294967296;~c~0 := 1; {210#(and (= (mod main_~z~0 4294967296) main_~y~0) (= main_~x~0 1))} is VALID [2022-04-08 06:13:02,999 INFO L290 TraceCheckUtils]: 6: Hoare triple {210#(and (= (mod main_~z~0 4294967296) main_~y~0) (= main_~x~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {210#(and (= (mod main_~z~0 4294967296) main_~y~0) (= main_~x~0 1))} is VALID [2022-04-08 06:13:02,999 INFO L290 TraceCheckUtils]: 7: Hoare triple {210#(and (= (mod main_~z~0 4294967296) main_~y~0) (= main_~x~0 1))} assume !!(#t~post6 < 20);havoc #t~post6; {210#(and (= (mod main_~z~0 4294967296) main_~y~0) (= main_~x~0 1))} is VALID [2022-04-08 06:13:03,000 INFO L272 TraceCheckUtils]: 8: Hoare triple {210#(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)); {220#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 06:13:03,001 INFO L290 TraceCheckUtils]: 9: Hoare triple {220#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {224#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 06:13:03,002 INFO L290 TraceCheckUtils]: 10: Hoare triple {224#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {191#false} is VALID [2022-04-08 06:13:03,002 INFO L290 TraceCheckUtils]: 11: Hoare triple {191#false} assume !false; {191#false} is VALID [2022-04-08 06:13:03,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 06:13:03,003 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 06:13:03,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:13:03,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986595688] [2022-04-08 06:13:03,003 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:13:03,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [146270238] [2022-04-08 06:13:03,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [146270238] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:13:03,004 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:13:03,004 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 06:13:03,005 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:13:03,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [899145495] [2022-04-08 06:13:03,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [899145495] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:13:03,005 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:13:03,006 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 06:13:03,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368002691] [2022-04-08 06:13:03,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:13:03,007 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-08 06:13:03,007 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:13:03,007 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 06:13:03,070 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:13:03,070 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 06:13:03,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:13:03,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 06:13:03,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 06:13:03,072 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 06:13:03,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:13:03,259 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2022-04-08 06:13:03,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 06:13:03,260 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-08 06:13:03,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:13:03,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 06:13:03,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2022-04-08 06:13:03,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 06:13:03,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2022-04-08 06:13:03,264 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 33 transitions. [2022-04-08 06:13:03,304 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 06:13:03,306 INFO L225 Difference]: With dead ends: 29 [2022-04-08 06:13:03,306 INFO L226 Difference]: Without dead ends: 27 [2022-04-08 06:13:03,307 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 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 06:13:03,308 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 7 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 06:13:03,309 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 58 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 06:13:03,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-08 06:13:03,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2022-04-08 06:13:03,320 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:13:03,320 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 25 states, 16 states have (on average 1.25) internal successors, (20), 18 states have internal predecessors, (20), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 06:13:03,320 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 25 states, 16 states have (on average 1.25) internal successors, (20), 18 states have internal predecessors, (20), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 06:13:03,321 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 25 states, 16 states have (on average 1.25) internal successors, (20), 18 states have internal predecessors, (20), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 06:13:03,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:13:03,323 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-04-08 06:13:03,323 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-08 06:13:03,324 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:13:03,324 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:13:03,324 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 16 states have (on average 1.25) internal successors, (20), 18 states have internal predecessors, (20), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 27 states. [2022-04-08 06:13:03,325 INFO L87 Difference]: Start difference. First operand has 25 states, 16 states have (on average 1.25) internal successors, (20), 18 states have internal predecessors, (20), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 27 states. [2022-04-08 06:13:03,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:13:03,327 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-04-08 06:13:03,327 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-08 06:13:03,327 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:13:03,327 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:13:03,328 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:13:03,328 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:13:03,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 16 states have (on average 1.25) internal successors, (20), 18 states have internal predecessors, (20), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 06:13:03,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2022-04-08 06:13:03,334 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 12 [2022-04-08 06:13:03,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:13:03,334 INFO L478 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2022-04-08 06:13:03,335 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 06:13:03,335 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 28 transitions. [2022-04-08 06:13:03,368 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:13:03,369 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-04-08 06:13:03,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-08 06:13:03,369 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:13:03,369 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 06:13:03,389 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-08 06:13:03,570 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 06:13:03,570 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:13:03,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:13:03,571 INFO L85 PathProgramCache]: Analyzing trace with hash -975399299, now seen corresponding path program 1 times [2022-04-08 06:13:03,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:13:03,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [755226234] [2022-04-08 06:13:03,572 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:13:03,572 INFO L85 PathProgramCache]: Analyzing trace with hash -975399299, now seen corresponding path program 2 times [2022-04-08 06:13:03,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:13:03,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946645231] [2022-04-08 06:13:03,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:13:03,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:13:03,593 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:13:03,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [532019084] [2022-04-08 06:13:03,594 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 06:13:03,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:13:03,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:13:03,597 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 06:13:03,599 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 06:13:03,638 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-08 06:13:03,639 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:13:03,640 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-08 06:13:03,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:13:03,649 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:13:03,728 INFO L272 TraceCheckUtils]: 0: Hoare triple {394#true} call ULTIMATE.init(); {394#true} is VALID [2022-04-08 06:13:03,729 INFO L290 TraceCheckUtils]: 1: Hoare triple {394#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);~counter~0 := 0; {402#(<= ~counter~0 0)} is VALID [2022-04-08 06:13:03,730 INFO L290 TraceCheckUtils]: 2: Hoare triple {402#(<= ~counter~0 0)} assume true; {402#(<= ~counter~0 0)} is VALID [2022-04-08 06:13:03,731 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {402#(<= ~counter~0 0)} {394#true} #55#return; {402#(<= ~counter~0 0)} is VALID [2022-04-08 06:13:03,731 INFO L272 TraceCheckUtils]: 4: Hoare triple {402#(<= ~counter~0 0)} call #t~ret7 := main(); {402#(<= ~counter~0 0)} is VALID [2022-04-08 06:13:03,732 INFO L290 TraceCheckUtils]: 5: Hoare triple {402#(<= ~counter~0 0)} havoc ~z~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;~z~0 := #t~nondet4;havoc #t~nondet4;~k~0 := #t~nondet5;havoc #t~nondet5;~x~0 := 1;~y~0 := ~z~0 % 4294967296;~c~0 := 1; {402#(<= ~counter~0 0)} is VALID [2022-04-08 06:13:03,732 INFO L290 TraceCheckUtils]: 6: Hoare triple {402#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {418#(<= |main_#t~post6| 0)} is VALID [2022-04-08 06:13:03,733 INFO L290 TraceCheckUtils]: 7: Hoare triple {418#(<= |main_#t~post6| 0)} assume !(#t~post6 < 20);havoc #t~post6; {395#false} is VALID [2022-04-08 06:13:03,733 INFO L290 TraceCheckUtils]: 8: Hoare triple {395#false} ~x~0 := ~x~0 * ((~z~0 - 1) % 4294967296); {395#false} is VALID [2022-04-08 06:13:03,733 INFO L272 TraceCheckUtils]: 9: Hoare triple {395#false} call __VERIFIER_assert((if 0 == 1 + ~x~0 - ~y~0 then 1 else 0)); {395#false} is VALID [2022-04-08 06:13:03,734 INFO L290 TraceCheckUtils]: 10: Hoare triple {395#false} ~cond := #in~cond; {395#false} is VALID [2022-04-08 06:13:03,734 INFO L290 TraceCheckUtils]: 11: Hoare triple {395#false} assume 0 == ~cond; {395#false} is VALID [2022-04-08 06:13:03,734 INFO L290 TraceCheckUtils]: 12: Hoare triple {395#false} assume !false; {395#false} is VALID [2022-04-08 06:13:03,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 06:13:03,735 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 06:13:03,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:13:03,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946645231] [2022-04-08 06:13:03,735 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:13:03,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [532019084] [2022-04-08 06:13:03,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [532019084] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:13:03,736 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:13:03,736 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 06:13:03,736 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:13:03,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [755226234] [2022-04-08 06:13:03,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [755226234] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:13:03,737 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:13:03,737 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 06:13:03,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831991576] [2022-04-08 06:13:03,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:13:03,738 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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 13 [2022-04-08 06:13:03,738 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:13:03,738 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 06:13:03,749 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:13:03,750 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 06:13:03,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:13:03,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 06:13:03,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 06:13:03,751 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 06:13:03,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:13:03,812 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2022-04-08 06:13:03,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 06:13:03,813 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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 13 [2022-04-08 06:13:03,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:13:03,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 06:13:03,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 30 transitions. [2022-04-08 06:13:03,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 06:13:03,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 30 transitions. [2022-04-08 06:13:03,816 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 30 transitions. [2022-04-08 06:13:03,843 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:13:03,844 INFO L225 Difference]: With dead ends: 33 [2022-04-08 06:13:03,844 INFO L226 Difference]: Without dead ends: 25 [2022-04-08 06:13:03,845 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 10 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-08 06:13:03,846 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 0 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 48 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-08 06:13:03,846 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 48 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 06:13:03,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-08 06:13:03,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-04-08 06:13:03,859 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:13:03,860 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 25 states, 16 states have (on average 1.1875) internal successors, (19), 18 states have internal predecessors, (19), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 06:13:03,860 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 25 states, 16 states have (on average 1.1875) internal successors, (19), 18 states have internal predecessors, (19), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 06:13:03,860 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 25 states, 16 states have (on average 1.1875) internal successors, (19), 18 states have internal predecessors, (19), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 06:13:03,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:13:03,862 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2022-04-08 06:13:03,862 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-04-08 06:13:03,863 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:13:03,863 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:13:03,863 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 16 states have (on average 1.1875) internal successors, (19), 18 states have internal predecessors, (19), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 25 states. [2022-04-08 06:13:03,863 INFO L87 Difference]: Start difference. First operand has 25 states, 16 states have (on average 1.1875) internal successors, (19), 18 states have internal predecessors, (19), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 25 states. [2022-04-08 06:13:03,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:13:03,865 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2022-04-08 06:13:03,865 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-04-08 06:13:03,866 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:13:03,866 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:13:03,866 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:13:03,866 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:13:03,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 16 states have (on average 1.1875) internal successors, (19), 18 states have internal predecessors, (19), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 06:13:03,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2022-04-08 06:13:03,868 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 13 [2022-04-08 06:13:03,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:13:03,868 INFO L478 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2022-04-08 06:13:03,868 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 06:13:03,869 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 27 transitions. [2022-04-08 06:13:03,897 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 06:13:03,898 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-04-08 06:13:03,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-08 06:13:03,898 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:13:03,899 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 06:13:03,930 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 06:13:04,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 06:13:04,125 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:13:04,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:13:04,126 INFO L85 PathProgramCache]: Analyzing trace with hash 198190047, now seen corresponding path program 1 times [2022-04-08 06:13:04,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:13:04,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1868084807] [2022-04-08 06:13:04,126 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:13:04,126 INFO L85 PathProgramCache]: Analyzing trace with hash 198190047, now seen corresponding path program 2 times [2022-04-08 06:13:04,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:13:04,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760545739] [2022-04-08 06:13:04,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:13:04,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:13:04,143 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:13:04,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [5044080] [2022-04-08 06:13:04,143 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 06:13:04,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:13:04,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:13:04,149 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 06:13:04,151 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-08 06:13:04,199 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 06:13:04,199 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-04-08 06:13:04,200 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-08 06:13:04,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-08 06:13:04,236 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-08 06:13:04,237 INFO L130 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found a feasible trace [2022-04-08 06:13:04,237 INFO L618 BasicCegarLoop]: Counterexample is feasible [2022-04-08 06:13:04,239 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-08 06:13:04,266 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-08 06:13:04,459 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:13:04,463 INFO L719 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2] [2022-04-08 06:13:04,465 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-08 06:13:04,478 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-08 06:13:04,478 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-08 06:13:04,478 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-08 06:13:04,478 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-08 06:13:04,478 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-08 06:13:04,478 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-08 06:13:04,478 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2022-04-08 06:13:04,478 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-08 06:13:04,478 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-08 06:13:04,479 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-08 06:13:04,479 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-08 06:13:04,479 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-08 06:13:04,479 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-08 06:13:04,479 WARN L170 areAnnotationChecker]: L33-3 has no Hoare annotation [2022-04-08 06:13:04,479 WARN L170 areAnnotationChecker]: L33-3 has no Hoare annotation [2022-04-08 06:13:04,479 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-08 06:13:04,479 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-08 06:13:04,479 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-08 06:13:04,479 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-08 06:13:04,479 WARN L170 areAnnotationChecker]: L13-2 has no Hoare annotation [2022-04-08 06:13:04,479 WARN L170 areAnnotationChecker]: L33-4 has no Hoare annotation [2022-04-08 06:13:04,479 WARN L170 areAnnotationChecker]: L33-1 has no Hoare annotation [2022-04-08 06:13:04,480 WARN L170 areAnnotationChecker]: L33-1 has no Hoare annotation [2022-04-08 06:13:04,480 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2022-04-08 06:13:04,480 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2022-04-08 06:13:04,480 WARN L170 areAnnotationChecker]: L16-2 has no Hoare annotation [2022-04-08 06:13:04,480 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2022-04-08 06:13:04,480 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2022-04-08 06:13:04,480 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2022-04-08 06:13:04,480 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2022-04-08 06:13:04,480 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-08 06:13:04,480 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-08 06:13:04,480 WARN L170 areAnnotationChecker]: L47-1 has no Hoare annotation [2022-04-08 06:13:04,480 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2022-04-08 06:13:04,480 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2022-04-08 06:13:04,480 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-08 06:13:04,480 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-08 06:13:04,480 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 06:13:04,481 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.04 06:13:04 BoogieIcfgContainer [2022-04-08 06:13:04,482 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-08 06:13:04,488 INFO L158 Benchmark]: Toolchain (without parser) took 3315.55ms. Allocated memory was 170.9MB in the beginning and 209.7MB in the end (delta: 38.8MB). Free memory was 148.6MB in the beginning and 130.2MB in the end (delta: 18.4MB). Peak memory consumption was 57.0MB. Max. memory is 8.0GB. [2022-04-08 06:13:04,489 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 170.9MB. Free memory is still 135.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 06:13:04,489 INFO L158 Benchmark]: CACSL2BoogieTranslator took 469.30ms. Allocated memory is still 170.9MB. Free memory was 148.6MB in the beginning and 146.9MB in the end (delta: 1.6MB). Peak memory consumption was 12.7MB. Max. memory is 8.0GB. [2022-04-08 06:13:04,491 INFO L158 Benchmark]: Boogie Preprocessor took 31.67ms. Allocated memory is still 170.9MB. Free memory was 146.9MB in the beginning and 145.5MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-08 06:13:04,493 INFO L158 Benchmark]: RCFGBuilder took 374.31ms. Allocated memory is still 170.9MB. Free memory was 145.5MB in the beginning and 135.0MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-08 06:13:04,493 INFO L158 Benchmark]: TraceAbstraction took 2427.87ms. Allocated memory was 170.9MB in the beginning and 209.7MB in the end (delta: 38.8MB). Free memory was 134.3MB in the beginning and 130.2MB in the end (delta: 4.1MB). Peak memory consumption was 42.2MB. Max. memory is 8.0GB. [2022-04-08 06:13:04,495 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.15ms. Allocated memory is still 170.9MB. Free memory is still 135.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 469.30ms. Allocated memory is still 170.9MB. Free memory was 148.6MB in the beginning and 146.9MB in the end (delta: 1.6MB). Peak memory consumption was 12.7MB. Max. memory is 8.0GB. * Boogie Preprocessor took 31.67ms. Allocated memory is still 170.9MB. Free memory was 146.9MB in the beginning and 145.5MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 374.31ms. Allocated memory is still 170.9MB. Free memory was 145.5MB in the beginning and 135.0MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 2427.87ms. Allocated memory was 170.9MB in the beginning and 209.7MB in the end (delta: 38.8MB). Free memory was 134.3MB in the beginning and 130.2MB in the end (delta: 4.1MB). Peak memory consumption was 42.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L22] int counter = 0; [L24] unsigned int z, k; [L25] long long x, y, c; [L26] z = __VERIFIER_nondet_uint() [L27] k = __VERIFIER_nondet_uint() [L29] x = 1 [L30] y = z [L31] c = 1 [L33] EXPR counter++ [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(x*z - x - y + 1 == 0) [L16] COND FALSE !(!(cond)) [L34] RET __VERIFIER_assert(x*z - x - y + 1 == 0) [L36] COND TRUE !(c < k) [L45] x = x * (z - 1) [L47] CALL __VERIFIER_assert(1 + x - y == 0) [L16] COND TRUE !(cond) [L18] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 30 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.3s, OverallIterations: 4, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 14 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 13 mSDsluCounter, 134 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 76 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 43 IncrementalHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 58 mSDtfsCounter, 43 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 28 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=25occurred in iteration=2, InterpolantAutomatonStates: 12, 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, 3 MinimizatonAttempts, 3 StatesRemovedByMinimization, 2 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 06:13:04,525 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...