/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/loop-acceleration/functions_1-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 09:15:06,499 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 09:15:06,502 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 09:15:06,547 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 09:15:06,547 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 09:15:06,549 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 09:15:06,552 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 09:15:06,554 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 09:15:06,555 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 09:15:06,560 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 09:15:06,560 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 09:15:06,562 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 09:15:06,562 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 09:15:06,564 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 09:15:06,565 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 09:15:06,568 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 09:15:06,568 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 09:15:06,569 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 09:15:06,571 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 09:15:06,575 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 09:15:06,576 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 09:15:06,578 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 09:15:06,578 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 09:15:06,579 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 09:15:06,580 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 09:15:06,582 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 09:15:06,583 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 09:15:06,583 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 09:15:06,583 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 09:15:06,584 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 09:15:06,584 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 09:15:06,585 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 09:15:06,586 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 09:15:06,587 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 09:15:06,587 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 09:15:06,588 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 09:15:06,588 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 09:15:06,589 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 09:15:06,589 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 09:15:06,589 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 09:15:06,589 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 09:15:06,591 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 09:15:06,592 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-08 09:15:06,602 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 09:15:06,602 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 09:15:06,603 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 09:15:06,603 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 09:15:06,603 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 09:15:06,603 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 09:15:06,604 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 09:15:06,604 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 09:15:06,604 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 09:15:06,604 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 09:15:06,605 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 09:15:06,605 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 09:15:06,605 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 09:15:06,605 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 09:15:06,605 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 09:15:06,605 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 09:15:06,605 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 09:15:06,606 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 09:15:06,606 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 09:15:06,606 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 09:15:06,606 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 09:15:06,606 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-08 09:15:06,606 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 09:15:06,820 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 09:15:06,840 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 09:15:06,842 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 09:15:06,844 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 09:15:06,844 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 09:15:06,845 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/functions_1-1.c [2022-04-08 09:15:06,904 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d54a64e5/da57e45d6dac4e63ad6ffac2053b9d91/FLAG2bd9d0672 [2022-04-08 09:15:07,230 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 09:15:07,230 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/functions_1-1.c [2022-04-08 09:15:07,234 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d54a64e5/da57e45d6dac4e63ad6ffac2053b9d91/FLAG2bd9d0672 [2022-04-08 09:15:07,655 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d54a64e5/da57e45d6dac4e63ad6ffac2053b9d91 [2022-04-08 09:15:07,658 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 09:15:07,660 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 09:15:07,663 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 09:15:07,663 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 09:15:07,666 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 09:15:07,667 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 09:15:07" (1/1) ... [2022-04-08 09:15:07,668 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d20353f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:15:07, skipping insertion in model container [2022-04-08 09:15:07,668 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 09:15:07" (1/1) ... [2022-04-08 09:15:07,674 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 09:15:07,683 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 09:15:07,815 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/functions_1-1.c[325,338] [2022-04-08 09:15:07,825 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 09:15:07,832 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 09:15:07,842 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/functions_1-1.c[325,338] [2022-04-08 09:15:07,845 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 09:15:07,856 INFO L208 MainTranslator]: Completed translation [2022-04-08 09:15:07,856 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:15:07 WrapperNode [2022-04-08 09:15:07,856 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 09:15:07,857 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 09:15:07,857 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 09:15:07,857 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 09:15:07,869 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:15:07" (1/1) ... [2022-04-08 09:15:07,870 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:15:07" (1/1) ... [2022-04-08 09:15:07,875 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:15:07" (1/1) ... [2022-04-08 09:15:07,875 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:15:07" (1/1) ... [2022-04-08 09:15:07,882 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:15:07" (1/1) ... [2022-04-08 09:15:07,884 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:15:07" (1/1) ... [2022-04-08 09:15:07,885 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:15:07" (1/1) ... [2022-04-08 09:15:07,886 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 09:15:07,887 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 09:15:07,887 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 09:15:07,887 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 09:15:07,888 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:15:07" (1/1) ... [2022-04-08 09:15:07,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 09:15:07,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:15:07,928 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 09:15:07,930 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 09:15:07,954 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 09:15:07,954 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 09:15:07,954 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 09:15:07,954 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 09:15:07,954 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2022-04-08 09:15:07,954 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 09:15:07,954 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 09:15:07,955 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 09:15:07,955 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 09:15:07,955 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 09:15:07,955 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 09:15:07,955 INFO L130 BoogieDeclarations]: Found specification of procedure f [2022-04-08 09:15:07,955 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 09:15:07,955 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 09:15:07,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 09:15:07,957 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 09:15:07,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 09:15:07,957 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 09:15:07,957 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 09:15:07,999 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 09:15:08,000 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 09:15:08,078 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 09:15:08,084 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 09:15:08,084 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 09:15:08,085 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 09:15:08 BoogieIcfgContainer [2022-04-08 09:15:08,085 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 09:15:08,087 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 09:15:08,087 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 09:15:08,099 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 09:15:08,100 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 09:15:07" (1/3) ... [2022-04-08 09:15:08,100 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bbe393 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 09:15:08, skipping insertion in model container [2022-04-08 09:15:08,101 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:15:07" (2/3) ... [2022-04-08 09:15:08,101 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bbe393 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 09:15:08, skipping insertion in model container [2022-04-08 09:15:08,101 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 09:15:08" (3/3) ... [2022-04-08 09:15:08,102 INFO L111 eAbstractionObserver]: Analyzing ICFG functions_1-1.c [2022-04-08 09:15:08,107 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 09:15:08,107 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 09:15:08,173 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 09:15:08,187 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 09:15:08,188 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 09:15:08,211 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 09:15:08,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-08 09:15:08,218 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:15:08,218 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:15:08,219 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:15:08,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:15:08,223 INFO L85 PathProgramCache]: Analyzing trace with hash -1649640916, now seen corresponding path program 1 times [2022-04-08 09:15:08,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:15:08,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1087383652] [2022-04-08 09:15:08,239 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 09:15:08,240 INFO L85 PathProgramCache]: Analyzing trace with hash -1649640916, now seen corresponding path program 2 times [2022-04-08 09:15:08,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:15:08,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639728004] [2022-04-08 09:15:08,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:15:08,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:15:08,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:15:08,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:15:08,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:15:08,444 INFO L290 TraceCheckUtils]: 0: Hoare triple {31#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {26#true} is VALID [2022-04-08 09:15:08,444 INFO L290 TraceCheckUtils]: 1: Hoare triple {26#true} assume true; {26#true} is VALID [2022-04-08 09:15:08,445 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26#true} {26#true} #42#return; {26#true} is VALID [2022-04-08 09:15:08,450 INFO L272 TraceCheckUtils]: 0: Hoare triple {26#true} call ULTIMATE.init(); {31#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:15:08,450 INFO L290 TraceCheckUtils]: 1: Hoare triple {31#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {26#true} is VALID [2022-04-08 09:15:08,450 INFO L290 TraceCheckUtils]: 2: Hoare triple {26#true} assume true; {26#true} is VALID [2022-04-08 09:15:08,451 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26#true} {26#true} #42#return; {26#true} is VALID [2022-04-08 09:15:08,451 INFO L272 TraceCheckUtils]: 4: Hoare triple {26#true} call #t~ret5 := main(); {26#true} is VALID [2022-04-08 09:15:08,451 INFO L290 TraceCheckUtils]: 5: Hoare triple {26#true} ~x~0 := 0; {26#true} is VALID [2022-04-08 09:15:08,452 INFO L290 TraceCheckUtils]: 6: Hoare triple {26#true} assume !true; {27#false} is VALID [2022-04-08 09:15:08,452 INFO L272 TraceCheckUtils]: 7: Hoare triple {27#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {27#false} is VALID [2022-04-08 09:15:08,452 INFO L290 TraceCheckUtils]: 8: Hoare triple {27#false} ~cond := #in~cond; {27#false} is VALID [2022-04-08 09:15:08,453 INFO L290 TraceCheckUtils]: 9: Hoare triple {27#false} assume 0 == ~cond; {27#false} is VALID [2022-04-08 09:15:08,453 INFO L290 TraceCheckUtils]: 10: Hoare triple {27#false} assume !false; {27#false} is VALID [2022-04-08 09:15:08,453 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 09:15:08,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:15:08,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639728004] [2022-04-08 09:15:08,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639728004] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:15:08,455 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:15:08,455 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 09:15:08,457 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:15:08,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1087383652] [2022-04-08 09:15:08,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1087383652] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:15:08,458 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:15:08,458 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 09:15:08,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543239360] [2022-04-08 09:15:08,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:15:08,463 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-08 09:15:08,464 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:15:08,467 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:15:08,497 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:15:08,498 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-08 09:15:08,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:15:08,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-08 09:15:08,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 09:15:08,532 INFO L87 Difference]: Start difference. First operand has 23 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:15:08,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:15:08,664 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2022-04-08 09:15:08,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-08 09:15:08,664 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-08 09:15:08,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:15:08,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:15:08,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2022-04-08 09:15:08,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:15:08,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2022-04-08 09:15:08,684 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 37 transitions. [2022-04-08 09:15:08,744 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:15:08,751 INFO L225 Difference]: With dead ends: 34 [2022-04-08 09:15:08,752 INFO L226 Difference]: Without dead ends: 17 [2022-04-08 09:15:08,755 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 09:15:08,760 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 12 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 09:15:08,762 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 24 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 09:15:08,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-08 09:15:08,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-04-08 09:15:08,798 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:15:08,799 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 17 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 4 states have call successors, (4), 4 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 09:15:08,799 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 17 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 4 states have call successors, (4), 4 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 09:15:08,800 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 17 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 4 states have call successors, (4), 4 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 09:15:08,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:15:08,805 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2022-04-08 09:15:08,805 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-04-08 09:15:08,806 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:15:08,806 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:15:08,806 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 4 states have call successors, (4), 4 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 17 states. [2022-04-08 09:15:08,806 INFO L87 Difference]: Start difference. First operand has 17 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 4 states have call successors, (4), 4 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 17 states. [2022-04-08 09:15:08,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:15:08,809 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2022-04-08 09:15:08,809 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-04-08 09:15:08,809 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:15:08,810 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:15:08,810 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:15:08,810 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:15:08,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 4 states have call successors, (4), 4 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 09:15:08,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2022-04-08 09:15:08,813 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 11 [2022-04-08 09:15:08,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:15:08,813 INFO L478 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2022-04-08 09:15:08,814 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:15:08,814 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 17 transitions. [2022-04-08 09:15:08,838 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:15:08,839 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-04-08 09:15:08,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-08 09:15:08,841 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:15:08,843 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:15:08,843 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 09:15:08,847 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:15:08,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:15:08,849 INFO L85 PathProgramCache]: Analyzing trace with hash -1655182042, now seen corresponding path program 1 times [2022-04-08 09:15:08,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:15:08,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [754727276] [2022-04-08 09:15:08,852 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 09:15:08,852 INFO L85 PathProgramCache]: Analyzing trace with hash -1655182042, now seen corresponding path program 2 times [2022-04-08 09:15:08,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:15:08,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840675396] [2022-04-08 09:15:08,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:15:08,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:15:08,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:15:08,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:15:08,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:15:08,998 INFO L290 TraceCheckUtils]: 0: Hoare triple {176#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {170#true} is VALID [2022-04-08 09:15:08,998 INFO L290 TraceCheckUtils]: 1: Hoare triple {170#true} assume true; {170#true} is VALID [2022-04-08 09:15:08,998 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {170#true} {170#true} #42#return; {170#true} is VALID [2022-04-08 09:15:08,999 INFO L272 TraceCheckUtils]: 0: Hoare triple {170#true} call ULTIMATE.init(); {176#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:15:08,999 INFO L290 TraceCheckUtils]: 1: Hoare triple {176#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {170#true} is VALID [2022-04-08 09:15:09,001 INFO L290 TraceCheckUtils]: 2: Hoare triple {170#true} assume true; {170#true} is VALID [2022-04-08 09:15:09,001 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {170#true} {170#true} #42#return; {170#true} is VALID [2022-04-08 09:15:09,001 INFO L272 TraceCheckUtils]: 4: Hoare triple {170#true} call #t~ret5 := main(); {170#true} is VALID [2022-04-08 09:15:09,002 INFO L290 TraceCheckUtils]: 5: Hoare triple {170#true} ~x~0 := 0; {175#(= main_~x~0 0)} is VALID [2022-04-08 09:15:09,002 INFO L290 TraceCheckUtils]: 6: Hoare triple {175#(= main_~x~0 0)} assume !(~x~0 % 4294967296 < 268435455); {171#false} is VALID [2022-04-08 09:15:09,003 INFO L272 TraceCheckUtils]: 7: Hoare triple {171#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {171#false} is VALID [2022-04-08 09:15:09,003 INFO L290 TraceCheckUtils]: 8: Hoare triple {171#false} ~cond := #in~cond; {171#false} is VALID [2022-04-08 09:15:09,003 INFO L290 TraceCheckUtils]: 9: Hoare triple {171#false} assume 0 == ~cond; {171#false} is VALID [2022-04-08 09:15:09,003 INFO L290 TraceCheckUtils]: 10: Hoare triple {171#false} assume !false; {171#false} is VALID [2022-04-08 09:15:09,004 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 09:15:09,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:15:09,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840675396] [2022-04-08 09:15:09,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840675396] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:15:09,008 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:15:09,008 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 09:15:09,008 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:15:09,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [754727276] [2022-04-08 09:15:09,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [754727276] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:15:09,009 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:15:09,009 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 09:15:09,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608860989] [2022-04-08 09:15:09,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:15:09,010 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-08 09:15:09,010 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:15:09,010 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:15:09,021 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:15:09,022 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 09:15:09,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:15:09,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 09:15:09,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 09:15:09,023 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:15:09,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:15:09,111 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2022-04-08 09:15:09,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 09:15:09,111 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-08 09:15:09,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:15:09,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:15:09,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 26 transitions. [2022-04-08 09:15:09,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:15:09,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 26 transitions. [2022-04-08 09:15:09,122 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 26 transitions. [2022-04-08 09:15:09,153 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:15:09,155 INFO L225 Difference]: With dead ends: 25 [2022-04-08 09:15:09,155 INFO L226 Difference]: Without dead ends: 20 [2022-04-08 09:15:09,155 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 09:15:09,159 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 12 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 09:15:09,159 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 22 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 09:15:09,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-04-08 09:15:09,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2022-04-08 09:15:09,169 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:15:09,169 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand has 18 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 4 states have call successors, (4), 4 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 09:15:09,170 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand has 18 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 4 states have call successors, (4), 4 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 09:15:09,170 INFO L87 Difference]: Start difference. First operand 20 states. Second operand has 18 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 4 states have call successors, (4), 4 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 09:15:09,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:15:09,175 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2022-04-08 09:15:09,175 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2022-04-08 09:15:09,175 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:15:09,175 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:15:09,176 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 4 states have call successors, (4), 4 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 20 states. [2022-04-08 09:15:09,176 INFO L87 Difference]: Start difference. First operand has 18 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 4 states have call successors, (4), 4 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 20 states. [2022-04-08 09:15:09,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:15:09,177 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2022-04-08 09:15:09,178 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2022-04-08 09:15:09,178 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:15:09,178 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:15:09,178 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:15:09,178 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:15:09,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 4 states have call successors, (4), 4 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 09:15:09,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2022-04-08 09:15:09,179 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 11 [2022-04-08 09:15:09,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:15:09,180 INFO L478 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2022-04-08 09:15:09,180 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:15:09,180 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 18 transitions. [2022-04-08 09:15:09,198 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:15:09,198 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-04-08 09:15:09,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-08 09:15:09,199 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:15:09,199 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:15:09,199 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-08 09:15:09,200 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:15:09,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:15:09,200 INFO L85 PathProgramCache]: Analyzing trace with hash 1503524740, now seen corresponding path program 1 times [2022-04-08 09:15:09,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:15:09,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1674124811] [2022-04-08 09:15:09,249 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 09:15:09,249 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:15:09,249 INFO L85 PathProgramCache]: Analyzing trace with hash 1503524740, now seen corresponding path program 2 times [2022-04-08 09:15:09,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:15:09,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057021680] [2022-04-08 09:15:09,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:15:09,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:15:09,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:15:09,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:15:09,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:15:09,343 INFO L290 TraceCheckUtils]: 0: Hoare triple {318#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {307#true} is VALID [2022-04-08 09:15:09,344 INFO L290 TraceCheckUtils]: 1: Hoare triple {307#true} assume true; {307#true} is VALID [2022-04-08 09:15:09,344 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {307#true} {307#true} #42#return; {307#true} is VALID [2022-04-08 09:15:09,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-04-08 09:15:09,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:15:09,373 INFO L290 TraceCheckUtils]: 0: Hoare triple {307#true} ~z := #in~z;#res := 2 + ~z; {319#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-08 09:15:09,373 INFO L290 TraceCheckUtils]: 1: Hoare triple {319#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {319#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-08 09:15:09,374 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {319#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {312#(= main_~x~0 0)} #38#return; {316#(and (<= 2 |main_#t~ret4|) (<= |main_#t~ret4| 2))} is VALID [2022-04-08 09:15:09,375 INFO L272 TraceCheckUtils]: 0: Hoare triple {307#true} call ULTIMATE.init(); {318#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:15:09,375 INFO L290 TraceCheckUtils]: 1: Hoare triple {318#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {307#true} is VALID [2022-04-08 09:15:09,375 INFO L290 TraceCheckUtils]: 2: Hoare triple {307#true} assume true; {307#true} is VALID [2022-04-08 09:15:09,376 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {307#true} {307#true} #42#return; {307#true} is VALID [2022-04-08 09:15:09,376 INFO L272 TraceCheckUtils]: 4: Hoare triple {307#true} call #t~ret5 := main(); {307#true} is VALID [2022-04-08 09:15:09,376 INFO L290 TraceCheckUtils]: 5: Hoare triple {307#true} ~x~0 := 0; {312#(= main_~x~0 0)} is VALID [2022-04-08 09:15:09,377 INFO L290 TraceCheckUtils]: 6: Hoare triple {312#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455); {312#(= main_~x~0 0)} is VALID [2022-04-08 09:15:09,377 INFO L272 TraceCheckUtils]: 7: Hoare triple {312#(= main_~x~0 0)} call #t~ret4 := f(~x~0); {307#true} is VALID [2022-04-08 09:15:09,377 INFO L290 TraceCheckUtils]: 8: Hoare triple {307#true} ~z := #in~z;#res := 2 + ~z; {319#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-08 09:15:09,378 INFO L290 TraceCheckUtils]: 9: Hoare triple {319#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {319#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-08 09:15:09,379 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {319#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {312#(= main_~x~0 0)} #38#return; {316#(and (<= 2 |main_#t~ret4|) (<= |main_#t~ret4| 2))} is VALID [2022-04-08 09:15:09,380 INFO L290 TraceCheckUtils]: 11: Hoare triple {316#(and (<= 2 |main_#t~ret4|) (<= |main_#t~ret4| 2))} ~x~0 := #t~ret4;havoc #t~ret4; {317#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 2))} is VALID [2022-04-08 09:15:09,380 INFO L290 TraceCheckUtils]: 12: Hoare triple {317#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 2))} assume !(~x~0 % 4294967296 < 268435455); {308#false} is VALID [2022-04-08 09:15:09,380 INFO L272 TraceCheckUtils]: 13: Hoare triple {308#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {308#false} is VALID [2022-04-08 09:15:09,381 INFO L290 TraceCheckUtils]: 14: Hoare triple {308#false} ~cond := #in~cond; {308#false} is VALID [2022-04-08 09:15:09,381 INFO L290 TraceCheckUtils]: 15: Hoare triple {308#false} assume 0 == ~cond; {308#false} is VALID [2022-04-08 09:15:09,381 INFO L290 TraceCheckUtils]: 16: Hoare triple {308#false} assume !false; {308#false} is VALID [2022-04-08 09:15:09,381 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:15:09,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:15:09,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057021680] [2022-04-08 09:15:09,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057021680] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 09:15:09,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [204697937] [2022-04-08 09:15:09,382 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 09:15:09,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:15:09,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:15:09,387 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 09:15:09,421 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 09:15:09,430 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 09:15:09,431 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:15:09,433 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-08 09:15:09,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:15:09,444 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:15:09,713 INFO L272 TraceCheckUtils]: 0: Hoare triple {307#true} call ULTIMATE.init(); {307#true} is VALID [2022-04-08 09:15:09,713 INFO L290 TraceCheckUtils]: 1: Hoare triple {307#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(16, 2);call #Ultimate.allocInit(12, 3); {307#true} is VALID [2022-04-08 09:15:09,713 INFO L290 TraceCheckUtils]: 2: Hoare triple {307#true} assume true; {307#true} is VALID [2022-04-08 09:15:09,713 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {307#true} {307#true} #42#return; {307#true} is VALID [2022-04-08 09:15:09,713 INFO L272 TraceCheckUtils]: 4: Hoare triple {307#true} call #t~ret5 := main(); {307#true} is VALID [2022-04-08 09:15:09,714 INFO L290 TraceCheckUtils]: 5: Hoare triple {307#true} ~x~0 := 0; {312#(= main_~x~0 0)} is VALID [2022-04-08 09:15:09,714 INFO L290 TraceCheckUtils]: 6: Hoare triple {312#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455); {312#(= main_~x~0 0)} is VALID [2022-04-08 09:15:09,714 INFO L272 TraceCheckUtils]: 7: Hoare triple {312#(= main_~x~0 0)} call #t~ret4 := f(~x~0); {307#true} is VALID [2022-04-08 09:15:09,715 INFO L290 TraceCheckUtils]: 8: Hoare triple {307#true} ~z := #in~z;#res := 2 + ~z; {319#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-08 09:15:09,716 INFO L290 TraceCheckUtils]: 9: Hoare triple {319#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {319#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-08 09:15:09,716 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {319#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {312#(= main_~x~0 0)} #38#return; {316#(and (<= 2 |main_#t~ret4|) (<= |main_#t~ret4| 2))} is VALID [2022-04-08 09:15:09,717 INFO L290 TraceCheckUtils]: 11: Hoare triple {316#(and (<= 2 |main_#t~ret4|) (<= |main_#t~ret4| 2))} ~x~0 := #t~ret4;havoc #t~ret4; {356#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-08 09:15:09,717 INFO L290 TraceCheckUtils]: 12: Hoare triple {356#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(~x~0 % 4294967296 < 268435455); {356#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-08 09:15:09,718 INFO L272 TraceCheckUtils]: 13: Hoare triple {356#(and (<= 2 main_~x~0) (<= main_~x~0 2))} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {363#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:15:09,719 INFO L290 TraceCheckUtils]: 14: Hoare triple {363#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {367#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:15:09,719 INFO L290 TraceCheckUtils]: 15: Hoare triple {367#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {308#false} is VALID [2022-04-08 09:15:09,720 INFO L290 TraceCheckUtils]: 16: Hoare triple {308#false} assume !false; {308#false} is VALID [2022-04-08 09:15:09,720 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:15:09,720 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:15:09,921 INFO L290 TraceCheckUtils]: 16: Hoare triple {308#false} assume !false; {308#false} is VALID [2022-04-08 09:15:09,922 INFO L290 TraceCheckUtils]: 15: Hoare triple {367#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {308#false} is VALID [2022-04-08 09:15:09,923 INFO L290 TraceCheckUtils]: 14: Hoare triple {363#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {367#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:15:09,924 INFO L272 TraceCheckUtils]: 13: Hoare triple {383#(= (mod main_~x~0 2) 0)} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {363#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:15:09,924 INFO L290 TraceCheckUtils]: 12: Hoare triple {383#(= (mod main_~x~0 2) 0)} assume !(~x~0 % 4294967296 < 268435455); {383#(= (mod main_~x~0 2) 0)} is VALID [2022-04-08 09:15:09,925 INFO L290 TraceCheckUtils]: 11: Hoare triple {390#(= (mod |main_#t~ret4| 2) 0)} ~x~0 := #t~ret4;havoc #t~ret4; {383#(= (mod main_~x~0 2) 0)} is VALID [2022-04-08 09:15:09,926 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {397#(or (not (= (mod |f_#in~z| 2) 0)) (= (mod |f_#res| 2) 0))} {383#(= (mod main_~x~0 2) 0)} #38#return; {390#(= (mod |main_#t~ret4| 2) 0)} is VALID [2022-04-08 09:15:09,926 INFO L290 TraceCheckUtils]: 9: Hoare triple {397#(or (not (= (mod |f_#in~z| 2) 0)) (= (mod |f_#res| 2) 0))} assume true; {397#(or (not (= (mod |f_#in~z| 2) 0)) (= (mod |f_#res| 2) 0))} is VALID [2022-04-08 09:15:09,927 INFO L290 TraceCheckUtils]: 8: Hoare triple {307#true} ~z := #in~z;#res := 2 + ~z; {397#(or (not (= (mod |f_#in~z| 2) 0)) (= (mod |f_#res| 2) 0))} is VALID [2022-04-08 09:15:09,927 INFO L272 TraceCheckUtils]: 7: Hoare triple {383#(= (mod main_~x~0 2) 0)} call #t~ret4 := f(~x~0); {307#true} is VALID [2022-04-08 09:15:09,928 INFO L290 TraceCheckUtils]: 6: Hoare triple {383#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {383#(= (mod main_~x~0 2) 0)} is VALID [2022-04-08 09:15:09,928 INFO L290 TraceCheckUtils]: 5: Hoare triple {307#true} ~x~0 := 0; {383#(= (mod main_~x~0 2) 0)} is VALID [2022-04-08 09:15:09,928 INFO L272 TraceCheckUtils]: 4: Hoare triple {307#true} call #t~ret5 := main(); {307#true} is VALID [2022-04-08 09:15:09,928 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {307#true} {307#true} #42#return; {307#true} is VALID [2022-04-08 09:15:09,929 INFO L290 TraceCheckUtils]: 2: Hoare triple {307#true} assume true; {307#true} is VALID [2022-04-08 09:15:09,929 INFO L290 TraceCheckUtils]: 1: Hoare triple {307#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(16, 2);call #Ultimate.allocInit(12, 3); {307#true} is VALID [2022-04-08 09:15:09,929 INFO L272 TraceCheckUtils]: 0: Hoare triple {307#true} call ULTIMATE.init(); {307#true} is VALID [2022-04-08 09:15:09,929 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-08 09:15:09,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [204697937] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-08 09:15:09,930 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-08 09:15:09,930 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7, 8] total 13 [2022-04-08 09:15:09,930 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:15:09,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1674124811] [2022-04-08 09:15:09,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1674124811] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:15:09,931 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:15:09,931 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 09:15:09,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638691470] [2022-04-08 09:15:09,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:15:09,931 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2022-04-08 09:15:09,932 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:15:09,932 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (4), 2 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 09:15:09,947 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:15:09,947 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 09:15:09,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:15:09,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 09:15:09,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2022-04-08 09:15:09,948 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (4), 2 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 09:15:10,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:15:10,051 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-04-08 09:15:10,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 09:15:10,051 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2022-04-08 09:15:10,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:15:10,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (4), 2 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 09:15:10,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 17 transitions. [2022-04-08 09:15:10,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (4), 2 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 09:15:10,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 17 transitions. [2022-04-08 09:15:10,055 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 17 transitions. [2022-04-08 09:15:10,069 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:15:10,069 INFO L225 Difference]: With dead ends: 18 [2022-04-08 09:15:10,069 INFO L226 Difference]: Without dead ends: 0 [2022-04-08 09:15:10,071 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2022-04-08 09:15:10,073 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 09:15:10,081 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 47 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 09:15:10,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-08 09:15:10,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-08 09:15:10,082 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:15:10,082 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 09:15:10,082 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 09:15:10,082 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 09:15:10,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:15:10,082 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 09:15:10,083 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 09:15:10,083 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:15:10,083 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:15:10,083 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-08 09:15:10,083 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-08 09:15:10,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:15:10,083 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 09:15:10,083 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 09:15:10,083 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:15:10,083 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:15:10,083 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:15:10,083 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:15:10,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 09:15:10,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-08 09:15:10,084 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 17 [2022-04-08 09:15:10,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:15:10,084 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-08 09:15:10,084 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (4), 2 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 09:15:10,084 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-08 09:15:10,087 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:15:10,087 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 09:15:10,088 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:15:10,090 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-08 09:15:10,116 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-08 09:15:10,306 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:15:10,308 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-08 09:15:10,385 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2022-04-08 09:15:10,385 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2022-04-08 09:15:10,385 INFO L882 garLoopResultBuilder]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2022-04-08 09:15:10,385 INFO L878 garLoopResultBuilder]: At program point fEXIT(lines 12 14) the Hoare annotation is: (or (not (= (mod |f_#in~z| 2) 0)) (= (mod |f_#res| 2) 0)) [2022-04-08 09:15:10,386 INFO L885 garLoopResultBuilder]: At program point fENTRY(lines 12 14) the Hoare annotation is: true [2022-04-08 09:15:10,386 INFO L878 garLoopResultBuilder]: At program point fFINAL(lines 12 14) the Hoare annotation is: (or (not (= (mod |f_#in~z| 2) 0)) (= (mod |f_#res| 2) 0)) [2022-04-08 09:15:10,386 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 16 24) the Hoare annotation is: true [2022-04-08 09:15:10,386 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 16 24) the Hoare annotation is: true [2022-04-08 09:15:10,386 INFO L878 garLoopResultBuilder]: At program point L20(line 20) the Hoare annotation is: (= (mod main_~x~0 2) 0) [2022-04-08 09:15:10,386 INFO L878 garLoopResultBuilder]: At program point L20-1(line 20) the Hoare annotation is: (and (= (mod |main_#t~ret4| 2) 0) (= (mod main_~x~0 2) 0)) [2022-04-08 09:15:10,386 INFO L878 garLoopResultBuilder]: At program point L19-2(lines 19 21) the Hoare annotation is: (= (mod main_~x~0 2) 0) [2022-04-08 09:15:10,386 INFO L878 garLoopResultBuilder]: At program point L19-3(lines 19 21) the Hoare annotation is: (= (mod main_~x~0 2) 0) [2022-04-08 09:15:10,386 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 16 24) the Hoare annotation is: true [2022-04-08 09:15:10,386 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-08 09:15:10,386 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-08 09:15:10,387 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-08 09:15:10,387 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-08 09:15:10,387 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-08 09:15:10,387 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-08 09:15:10,387 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-08 09:15:10,387 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 5 10) the Hoare annotation is: true [2022-04-08 09:15:10,387 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 5 10) the Hoare annotation is: true [2022-04-08 09:15:10,387 INFO L878 garLoopResultBuilder]: At program point L7(line 7) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-04-08 09:15:10,388 INFO L878 garLoopResultBuilder]: At program point L6(lines 6 8) the Hoare annotation is: (or (not (<= 1 |__VERIFIER_assert_#in~cond|)) (<= 1 __VERIFIER_assert_~cond)) [2022-04-08 09:15:10,388 INFO L885 garLoopResultBuilder]: At program point L6-2(lines 5 10) the Hoare annotation is: true [2022-04-08 09:15:10,388 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 7) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-04-08 09:15:10,391 INFO L719 BasicCegarLoop]: Path program histogram: [2, 2, 2] [2022-04-08 09:15:10,392 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-08 09:15:10,395 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-08 09:15:10,397 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-08 09:15:10,401 INFO L163 areAnnotationChecker]: CFG has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-08 09:15:10,410 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.04 09:15:10 BoogieIcfgContainer [2022-04-08 09:15:10,410 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-08 09:15:10,411 INFO L158 Benchmark]: Toolchain (without parser) took 2750.91ms. Allocated memory is still 174.1MB. Free memory was 126.1MB in the beginning and 62.6MB in the end (delta: 63.5MB). Peak memory consumption was 64.1MB. Max. memory is 8.0GB. [2022-04-08 09:15:10,411 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 174.1MB. Free memory was 142.5MB in the beginning and 142.4MB in the end (delta: 88.2kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 09:15:10,411 INFO L158 Benchmark]: CACSL2BoogieTranslator took 193.93ms. Allocated memory is still 174.1MB. Free memory was 125.8MB in the beginning and 153.2MB in the end (delta: -27.4MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-08 09:15:10,412 INFO L158 Benchmark]: Boogie Preprocessor took 29.47ms. Allocated memory is still 174.1MB. Free memory was 153.2MB in the beginning and 151.9MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-08 09:15:10,412 INFO L158 Benchmark]: RCFGBuilder took 198.39ms. Allocated memory is still 174.1MB. Free memory was 151.6MB in the beginning and 141.9MB in the end (delta: 9.7MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-08 09:15:10,412 INFO L158 Benchmark]: TraceAbstraction took 2323.19ms. Allocated memory is still 174.1MB. Free memory was 141.4MB in the beginning and 62.6MB in the end (delta: 78.9MB). Peak memory consumption was 80.2MB. Max. memory is 8.0GB. [2022-04-08 09:15:10,414 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.14ms. Allocated memory is still 174.1MB. Free memory was 142.5MB in the beginning and 142.4MB in the end (delta: 88.2kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 193.93ms. Allocated memory is still 174.1MB. Free memory was 125.8MB in the beginning and 153.2MB in the end (delta: -27.4MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 29.47ms. Allocated memory is still 174.1MB. Free memory was 153.2MB in the beginning and 151.9MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 198.39ms. Allocated memory is still 174.1MB. Free memory was 151.6MB in the beginning and 141.9MB in the end (delta: 9.7MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 2323.19ms. Allocated memory is still 174.1MB. Free memory was 141.4MB in the beginning and 62.6MB in the end (delta: 78.9MB). Peak memory consumption was 80.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 - PositiveResult [Line: 7]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 26 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.2s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 29 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 25 mSDsluCounter, 93 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 47 mSDsCounter, 9 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 51 IncrementalHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9 mSolverCounterUnsat, 46 mSDtfsCounter, 51 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 56 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=23occurred in iteration=0, InterpolantAutomatonStates: 14, 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, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 23 LocationsWithAnnotation, 35 PreInvPairs, 45 NumberOfFragments, 86 HoareAnnotationTreeSize, 35 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 23 FomulaSimplificationsInter, 14 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: x % 2 == 0 - ProcedureContractResult [Line: 12]: Procedure Contract for f Derived contract for procedure f: !(\old(z) % 2 == 0) || \result % 2 == 0 - ProcedureContractResult [Line: 16]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 5]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: 1 RESULT: Ultimate proved your program to be correct! [2022-04-08 09:15:10,449 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...