/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/phases_2-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 09:19:45,743 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 09:19:45,744 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 09:19:45,784 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 09:19:45,784 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 09:19:45,785 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 09:19:45,789 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 09:19:45,792 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 09:19:45,793 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 09:19:45,793 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 09:19:45,794 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 09:19:45,795 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 09:19:45,795 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 09:19:45,796 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 09:19:45,797 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 09:19:45,797 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 09:19:45,798 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 09:19:45,799 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 09:19:45,800 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 09:19:45,801 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 09:19:45,803 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 09:19:45,803 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 09:19:45,804 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 09:19:45,805 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 09:19:45,806 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 09:19:45,809 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 09:19:45,809 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 09:19:45,809 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 09:19:45,810 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 09:19:45,810 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 09:19:45,811 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 09:19:45,811 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 09:19:45,812 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 09:19:45,813 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 09:19:45,813 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 09:19:45,814 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 09:19:45,814 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 09:19:45,815 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 09:19:45,815 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 09:19:45,815 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 09:19:45,816 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 09:19:45,817 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 09:19:45,817 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-28 09:19:45,826 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 09:19:45,827 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 09:19:45,828 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 09:19:45,828 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 09:19:45,828 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 09:19:45,828 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 09:19:45,828 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 09:19:45,828 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 09:19:45,829 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 09:19:45,829 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 09:19:45,829 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 09:19:45,829 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 09:19:45,829 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 09:19:45,829 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 09:19:45,830 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 09:19:45,830 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 09:19:45,830 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 09:19:45,830 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 09:19:45,830 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 09:19:45,831 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 09:19:45,831 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 09:19:45,831 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-28 09:19:45,831 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-28 09:19:46,073 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 09:19:46,103 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 09:19:46,105 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 09:19:46,107 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 09:19:46,108 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 09:19:46,109 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/phases_2-2.c [2022-04-28 09:19:46,184 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a1046824/70a69fbe25094665bfbfcb45b61e9c53/FLAG3865fcf35 [2022-04-28 09:19:46,561 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 09:19:46,561 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/phases_2-2.c [2022-04-28 09:19:46,565 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a1046824/70a69fbe25094665bfbfcb45b61e9c53/FLAG3865fcf35 [2022-04-28 09:19:46,575 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a1046824/70a69fbe25094665bfbfcb45b61e9c53 [2022-04-28 09:19:46,576 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 09:19:46,578 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 09:19:46,579 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 09:19:46,579 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 09:19:46,582 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 09:19:46,583 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 09:19:46" (1/1) ... [2022-04-28 09:19:46,584 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@277548c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:19:46, skipping insertion in model container [2022-04-28 09:19:46,584 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 09:19:46" (1/1) ... [2022-04-28 09:19:46,590 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 09:19:46,601 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 09:19:46,781 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/phases_2-2.c[459,472] [2022-04-28 09:19:46,802 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 09:19:46,811 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 09:19:46,824 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/phases_2-2.c[459,472] [2022-04-28 09:19:46,833 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 09:19:46,849 INFO L208 MainTranslator]: Completed translation [2022-04-28 09:19:46,849 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:19:46 WrapperNode [2022-04-28 09:19:46,850 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 09:19:46,851 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 09:19:46,851 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 09:19:46,851 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 09:19:46,861 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:19:46" (1/1) ... [2022-04-28 09:19:46,861 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:19:46" (1/1) ... [2022-04-28 09:19:46,867 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:19:46" (1/1) ... [2022-04-28 09:19:46,867 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:19:46" (1/1) ... [2022-04-28 09:19:46,873 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:19:46" (1/1) ... [2022-04-28 09:19:46,878 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:19:46" (1/1) ... [2022-04-28 09:19:46,883 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:19:46" (1/1) ... [2022-04-28 09:19:46,888 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 09:19:46,889 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 09:19:46,889 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 09:19:46,890 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 09:19:46,891 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:19:46" (1/1) ... [2022-04-28 09:19:46,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 09:19:46,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:19:46,918 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-28 09:19:46,925 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-28 09:19:46,950 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 09:19:46,950 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 09:19:46,950 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 09:19:46,950 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 09:19:46,950 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 09:19:46,951 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 09:19:46,951 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 09:19:46,951 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 09:19:46,951 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 09:19:46,951 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 09:19:46,951 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 09:19:46,951 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-28 09:19:46,951 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 09:19:46,951 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 09:19:46,951 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 09:19:46,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 09:19:46,952 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 09:19:46,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 09:19:46,952 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 09:19:46,952 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 09:19:46,997 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 09:19:46,998 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 09:19:47,106 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 09:19:47,112 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 09:19:47,112 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 09:19:47,113 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 09:19:47 BoogieIcfgContainer [2022-04-28 09:19:47,114 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 09:19:47,115 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 09:19:47,115 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 09:19:47,118 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 09:19:47,118 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 09:19:46" (1/3) ... [2022-04-28 09:19:47,119 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77b949a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 09:19:47, skipping insertion in model container [2022-04-28 09:19:47,119 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:19:46" (2/3) ... [2022-04-28 09:19:47,119 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77b949a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 09:19:47, skipping insertion in model container [2022-04-28 09:19:47,119 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 09:19:47" (3/3) ... [2022-04-28 09:19:47,120 INFO L111 eAbstractionObserver]: Analyzing ICFG phases_2-2.c [2022-04-28 09:19:47,132 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 09:19:47,132 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 09:19:47,178 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 09:19:47,194 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4c262dce, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@70f72dd2 [2022-04-28 09:19:47,194 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 09:19:47,206 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 12 states have (on average 1.5) internal successors, (18), 14 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 09:19:47,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-28 09:19:47,215 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:19:47,216 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:19:47,216 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:19:47,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:19:47,221 INFO L85 PathProgramCache]: Analyzing trace with hash -36402350, now seen corresponding path program 1 times [2022-04-28 09:19:47,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:19:47,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [979957217] [2022-04-28 09:19:47,245 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 09:19:47,245 INFO L85 PathProgramCache]: Analyzing trace with hash -36402350, now seen corresponding path program 2 times [2022-04-28 09:19:47,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:19:47,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235234629] [2022-04-28 09:19:47,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:19:47,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:19:47,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:19:47,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:19:47,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:19:47,745 INFO L290 TraceCheckUtils]: 0: Hoare triple {33#(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(13, 2);call #Ultimate.allocInit(12, 3); {23#true} is VALID [2022-04-28 09:19:47,746 INFO L290 TraceCheckUtils]: 1: Hoare triple {23#true} assume true; {23#true} is VALID [2022-04-28 09:19:47,746 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23#true} {23#true} #54#return; {23#true} is VALID [2022-04-28 09:19:47,757 INFO L272 TraceCheckUtils]: 0: Hoare triple {23#true} call ULTIMATE.init(); {33#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:19:47,757 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#(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(13, 2);call #Ultimate.allocInit(12, 3); {23#true} is VALID [2022-04-28 09:19:47,757 INFO L290 TraceCheckUtils]: 2: Hoare triple {23#true} assume true; {23#true} is VALID [2022-04-28 09:19:47,757 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23#true} {23#true} #54#return; {23#true} is VALID [2022-04-28 09:19:47,758 INFO L272 TraceCheckUtils]: 4: Hoare triple {23#true} call #t~ret6 := main(); {23#true} is VALID [2022-04-28 09:19:47,758 INFO L290 TraceCheckUtils]: 5: Hoare triple {23#true} ~x~0 := 1;~y~0 := #t~nondet4;havoc #t~nondet4; {28#(= (+ (- 1) main_~x~0) 0)} is VALID [2022-04-28 09:19:47,759 INFO L290 TraceCheckUtils]: 6: Hoare triple {28#(= (+ (- 1) main_~x~0) 0)} assume !!(~y~0 % 4294967296 > 0); {29#(and (= (+ (- 1) main_~x~0) 0) (<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0))} is VALID [2022-04-28 09:19:47,760 INFO L290 TraceCheckUtils]: 7: Hoare triple {29#(and (= (+ (- 1) main_~x~0) 0) (<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0))} assume !(~x~0 % 4294967296 < ~y~0 % 4294967296); {30#(and (<= (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) (+ (* (div main_~y~0 4294967296) 4294967296) main_~x~0)) (= main_~x~0 1) (<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0))} is VALID [2022-04-28 09:19:47,762 INFO L272 TraceCheckUtils]: 8: Hoare triple {30#(and (<= (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) (+ (* (div main_~y~0 4294967296) 4294967296) main_~x~0)) (= main_~x~0 1) (<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0))} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~y~0 % 4294967296 then 1 else 0)); {31#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 09:19:47,763 INFO L290 TraceCheckUtils]: 9: Hoare triple {31#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {32#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 09:19:47,763 INFO L290 TraceCheckUtils]: 10: Hoare triple {32#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {24#false} is VALID [2022-04-28 09:19:47,763 INFO L290 TraceCheckUtils]: 11: Hoare triple {24#false} assume !false; {24#false} is VALID [2022-04-28 09:19:47,764 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-28 09:19:47,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:19:47,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235234629] [2022-04-28 09:19:47,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235234629] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:19:47,765 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:19:47,766 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 09:19:47,768 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:19:47,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [979957217] [2022-04-28 09:19:47,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [979957217] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:19:47,769 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:19:47,769 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 09:19:47,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259820427] [2022-04-28 09:19:47,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:19:47,775 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-28 09:19:47,776 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:19:47,779 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:19:47,800 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:19:47,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 09:19:47,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:19:47,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 09:19:47,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-04-28 09:19:47,828 INFO L87 Difference]: Start difference. First operand has 20 states, 12 states have (on average 1.5) internal successors, (18), 14 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:19:48,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:19:48,329 INFO L93 Difference]: Finished difference Result 42 states and 52 transitions. [2022-04-28 09:19:48,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 09:19:48,329 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-28 09:19:48,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:19:48,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:19:48,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 52 transitions. [2022-04-28 09:19:48,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:19:48,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 52 transitions. [2022-04-28 09:19:48,343 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 52 transitions. [2022-04-28 09:19:48,395 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:19:48,401 INFO L225 Difference]: With dead ends: 42 [2022-04-28 09:19:48,401 INFO L226 Difference]: Without dead ends: 16 [2022-04-28 09:19:48,404 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2022-04-28 09:19:48,407 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 31 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 09:19:48,407 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 50 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 09:19:48,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-04-28 09:19:48,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-04-28 09:19:48,433 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:19:48,434 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:19:48,434 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:19:48,435 INFO L87 Difference]: Start difference. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:19:48,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:19:48,437 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2022-04-28 09:19:48,437 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2022-04-28 09:19:48,437 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:19:48,437 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:19:48,438 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 16 states. [2022-04-28 09:19:48,438 INFO L87 Difference]: Start difference. First operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 16 states. [2022-04-28 09:19:48,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:19:48,440 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2022-04-28 09:19:48,441 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2022-04-28 09:19:48,441 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:19:48,441 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:19:48,441 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:19:48,441 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:19:48,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:19:48,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2022-04-28 09:19:48,444 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 12 [2022-04-28 09:19:48,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:19:48,444 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2022-04-28 09:19:48,445 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:19:48,445 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 18 transitions. [2022-04-28 09:19:48,464 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-28 09:19:48,464 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2022-04-28 09:19:48,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-28 09:19:48,465 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:19:48,465 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:19:48,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 09:19:48,466 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:19:48,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:19:48,467 INFO L85 PathProgramCache]: Analyzing trace with hash 476304909, now seen corresponding path program 1 times [2022-04-28 09:19:48,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:19:48,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [857441671] [2022-04-28 09:19:48,493 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:19:48,493 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:19:48,493 INFO L85 PathProgramCache]: Analyzing trace with hash 476304909, now seen corresponding path program 2 times [2022-04-28 09:19:48,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:19:48,497 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521256883] [2022-04-28 09:19:48,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:19:48,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:19:48,526 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 09:19:48,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1601608360] [2022-04-28 09:19:48,527 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 09:19:48,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:19:48,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:19:48,532 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-28 09:19:48,533 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-28 09:19:48,575 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 09:19:48,576 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:19:48,577 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 09:19:48,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:19:48,588 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:19:49,221 INFO L272 TraceCheckUtils]: 0: Hoare triple {196#true} call ULTIMATE.init(); {196#true} is VALID [2022-04-28 09:19:49,221 INFO L290 TraceCheckUtils]: 1: Hoare triple {196#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(13, 2);call #Ultimate.allocInit(12, 3); {196#true} is VALID [2022-04-28 09:19:49,221 INFO L290 TraceCheckUtils]: 2: Hoare triple {196#true} assume true; {196#true} is VALID [2022-04-28 09:19:49,221 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {196#true} {196#true} #54#return; {196#true} is VALID [2022-04-28 09:19:49,222 INFO L272 TraceCheckUtils]: 4: Hoare triple {196#true} call #t~ret6 := main(); {196#true} is VALID [2022-04-28 09:19:49,222 INFO L290 TraceCheckUtils]: 5: Hoare triple {196#true} ~x~0 := 1;~y~0 := #t~nondet4;havoc #t~nondet4; {216#(= main_~x~0 1)} is VALID [2022-04-28 09:19:49,223 INFO L290 TraceCheckUtils]: 6: Hoare triple {216#(= main_~x~0 1)} assume !!(~y~0 % 4294967296 > 0); {216#(= main_~x~0 1)} is VALID [2022-04-28 09:19:49,223 INFO L290 TraceCheckUtils]: 7: Hoare triple {216#(= main_~x~0 1)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {223#(and (= main_~x~0 1) (< (mod main_~x~0 4294967296) (mod main_~y~0 4294967296)))} is VALID [2022-04-28 09:19:49,224 INFO L290 TraceCheckUtils]: 8: Hoare triple {223#(and (= main_~x~0 1) (< (mod main_~x~0 4294967296) (mod main_~y~0 4294967296)))} assume !(~x~0 % 4294967296 < (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % (~x~0 % 4294967296) then (if ~x~0 % 4294967296 < 0 then ~y~0 % 4294967296 / (~x~0 % 4294967296) - 1 else 1 + ~y~0 % 4294967296 / (~x~0 % 4294967296)) else ~y~0 % 4294967296 / (~x~0 % 4294967296)) % 4294967296);#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {227#(and (< 1 (mod main_~y~0 4294967296)) (= main_~x~0 2))} is VALID [2022-04-28 09:19:49,225 INFO L290 TraceCheckUtils]: 9: Hoare triple {227#(and (< 1 (mod main_~y~0 4294967296)) (= main_~x~0 2))} assume !(~x~0 % 4294967296 < ~y~0 % 4294967296); {231#(and (< 1 (mod main_~y~0 4294967296)) (not (< (mod main_~x~0 4294967296) (mod main_~y~0 4294967296))) (= main_~x~0 2))} is VALID [2022-04-28 09:19:49,226 INFO L272 TraceCheckUtils]: 10: Hoare triple {231#(and (< 1 (mod main_~y~0 4294967296)) (not (< (mod main_~x~0 4294967296) (mod main_~y~0 4294967296))) (= main_~x~0 2))} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~y~0 % 4294967296 then 1 else 0)); {235#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:19:49,227 INFO L290 TraceCheckUtils]: 11: Hoare triple {235#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {239#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:19:49,227 INFO L290 TraceCheckUtils]: 12: Hoare triple {239#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {197#false} is VALID [2022-04-28 09:19:49,227 INFO L290 TraceCheckUtils]: 13: Hoare triple {197#false} assume !false; {197#false} is VALID [2022-04-28 09:19:49,228 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-28 09:19:49,228 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:19:50,163 INFO L290 TraceCheckUtils]: 13: Hoare triple {197#false} assume !false; {197#false} is VALID [2022-04-28 09:19:50,164 INFO L290 TraceCheckUtils]: 12: Hoare triple {239#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {197#false} is VALID [2022-04-28 09:19:50,165 INFO L290 TraceCheckUtils]: 11: Hoare triple {235#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {239#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:19:50,165 INFO L272 TraceCheckUtils]: 10: Hoare triple {255#(= (mod main_~x~0 4294967296) (mod main_~y~0 4294967296))} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~y~0 % 4294967296 then 1 else 0)); {235#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:19:50,166 INFO L290 TraceCheckUtils]: 9: Hoare triple {259#(or (< (mod main_~x~0 4294967296) (mod main_~y~0 4294967296)) (= (mod main_~x~0 4294967296) (mod main_~y~0 4294967296)))} assume !(~x~0 % 4294967296 < ~y~0 % 4294967296); {255#(= (mod main_~x~0 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-28 09:19:50,167 INFO L290 TraceCheckUtils]: 8: Hoare triple {263#(or (< (mod (+ main_~x~0 1) 4294967296) (mod main_~y~0 4294967296)) (= (mod main_~y~0 4294967296) (mod (+ main_~x~0 1) 4294967296)))} assume !(~x~0 % 4294967296 < (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % (~x~0 % 4294967296) then (if ~x~0 % 4294967296 < 0 then ~y~0 % 4294967296 / (~x~0 % 4294967296) - 1 else 1 + ~y~0 % 4294967296 / (~x~0 % 4294967296)) else ~y~0 % 4294967296 / (~x~0 % 4294967296)) % 4294967296);#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {259#(or (< (mod main_~x~0 4294967296) (mod main_~y~0 4294967296)) (= (mod main_~x~0 4294967296) (mod main_~y~0 4294967296)))} is VALID [2022-04-28 09:19:50,168 INFO L290 TraceCheckUtils]: 7: Hoare triple {196#true} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {263#(or (< (mod (+ main_~x~0 1) 4294967296) (mod main_~y~0 4294967296)) (= (mod main_~y~0 4294967296) (mod (+ main_~x~0 1) 4294967296)))} is VALID [2022-04-28 09:19:50,169 INFO L290 TraceCheckUtils]: 6: Hoare triple {196#true} assume !!(~y~0 % 4294967296 > 0); {196#true} is VALID [2022-04-28 09:19:50,169 INFO L290 TraceCheckUtils]: 5: Hoare triple {196#true} ~x~0 := 1;~y~0 := #t~nondet4;havoc #t~nondet4; {196#true} is VALID [2022-04-28 09:19:50,169 INFO L272 TraceCheckUtils]: 4: Hoare triple {196#true} call #t~ret6 := main(); {196#true} is VALID [2022-04-28 09:19:50,169 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {196#true} {196#true} #54#return; {196#true} is VALID [2022-04-28 09:19:50,169 INFO L290 TraceCheckUtils]: 2: Hoare triple {196#true} assume true; {196#true} is VALID [2022-04-28 09:19:50,170 INFO L290 TraceCheckUtils]: 1: Hoare triple {196#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(13, 2);call #Ultimate.allocInit(12, 3); {196#true} is VALID [2022-04-28 09:19:50,170 INFO L272 TraceCheckUtils]: 0: Hoare triple {196#true} call ULTIMATE.init(); {196#true} is VALID [2022-04-28 09:19:50,170 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:19:50,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:19:50,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521256883] [2022-04-28 09:19:50,171 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 09:19:50,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1601608360] [2022-04-28 09:19:50,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1601608360] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-28 09:19:50,171 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-28 09:19:50,171 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 11 [2022-04-28 09:19:50,172 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:19:50,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [857441671] [2022-04-28 09:19:50,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [857441671] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:19:50,173 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:19:50,173 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 09:19:50,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452453156] [2022-04-28 09:19:50,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:19:50,174 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-28 09:19:50,174 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:19:50,174 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:19:50,188 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:19:50,188 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 09:19:50,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:19:50,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 09:19:50,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-04-28 09:19:50,189 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:20:04,131 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 13.87s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 09:20:16,177 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 12.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 09:20:20,467 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.29s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 09:20:20,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:20:20,553 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2022-04-28 09:20:20,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 09:20:20,553 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-28 09:20:20,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:20:20,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:20:20,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 21 transitions. [2022-04-28 09:20:20,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:20:20,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 21 transitions. [2022-04-28 09:20:20,556 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 21 transitions. [2022-04-28 09:20:20,583 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:20:20,584 INFO L225 Difference]: With dead ends: 22 [2022-04-28 09:20:20,585 INFO L226 Difference]: Without dead ends: 17 [2022-04-28 09:20:20,585 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2022-04-28 09:20:20,586 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 2 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 30.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 30.2s IncrementalHoareTripleChecker+Time [2022-04-28 09:20:20,586 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 51 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 3 Unknown, 0 Unchecked, 30.2s Time] [2022-04-28 09:20:20,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-28 09:20:20,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-04-28 09:20:20,595 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:20:20,595 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:20:20,595 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:20:20,595 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:20:20,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:20:20,597 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-28 09:20:20,597 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-28 09:20:20,597 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:20:20,597 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:20:20,598 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-28 09:20:20,598 INFO L87 Difference]: Start difference. First operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-28 09:20:20,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:20:20,599 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-28 09:20:20,599 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-28 09:20:20,599 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:20:20,599 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:20:20,600 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:20:20,600 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:20:20,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:20:20,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-04-28 09:20:20,601 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 14 [2022-04-28 09:20:20,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:20:20,601 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-04-28 09:20:20,602 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:20:20,602 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 19 transitions. [2022-04-28 09:20:20,626 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:20:20,627 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-28 09:20:20,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-28 09:20:20,627 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:20:20,627 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:20:20,656 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-28 09:20:20,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:20:20,848 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:20:20,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:20:20,848 INFO L85 PathProgramCache]: Analyzing trace with hash -790516534, now seen corresponding path program 1 times [2022-04-28 09:20:20,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:20:20,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [613610860] [2022-04-28 09:20:20,857 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:20:20,857 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:20:20,857 INFO L85 PathProgramCache]: Analyzing trace with hash -790516534, now seen corresponding path program 2 times [2022-04-28 09:20:20,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:20:20,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032954397] [2022-04-28 09:20:20,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:20:20,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:20:20,869 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 09:20:20,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1939050747] [2022-04-28 09:20:20,870 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 09:20:20,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:20:20,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:20:20,874 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 09:20:20,876 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-28 09:20:20,932 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 09:20:20,933 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:20:20,934 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-28 09:20:20,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:20:20,943 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:20:21,278 INFO L272 TraceCheckUtils]: 0: Hoare triple {406#true} call ULTIMATE.init(); {406#true} is VALID [2022-04-28 09:20:21,278 INFO L290 TraceCheckUtils]: 1: Hoare triple {406#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(13, 2);call #Ultimate.allocInit(12, 3); {406#true} is VALID [2022-04-28 09:20:21,279 INFO L290 TraceCheckUtils]: 2: Hoare triple {406#true} assume true; {406#true} is VALID [2022-04-28 09:20:21,279 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {406#true} {406#true} #54#return; {406#true} is VALID [2022-04-28 09:20:21,279 INFO L272 TraceCheckUtils]: 4: Hoare triple {406#true} call #t~ret6 := main(); {406#true} is VALID [2022-04-28 09:20:21,279 INFO L290 TraceCheckUtils]: 5: Hoare triple {406#true} ~x~0 := 1;~y~0 := #t~nondet4;havoc #t~nondet4; {426#(= main_~x~0 1)} is VALID [2022-04-28 09:20:21,283 INFO L290 TraceCheckUtils]: 6: Hoare triple {426#(= main_~x~0 1)} assume !!(~y~0 % 4294967296 > 0); {426#(= main_~x~0 1)} is VALID [2022-04-28 09:20:21,284 INFO L290 TraceCheckUtils]: 7: Hoare triple {426#(= main_~x~0 1)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {433#(and (= main_~x~0 1) (< (mod main_~x~0 4294967296) (mod main_~y~0 4294967296)))} is VALID [2022-04-28 09:20:21,284 INFO L290 TraceCheckUtils]: 8: Hoare triple {433#(and (= main_~x~0 1) (< (mod main_~x~0 4294967296) (mod main_~y~0 4294967296)))} assume !(~x~0 % 4294967296 < (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % (~x~0 % 4294967296) then (if ~x~0 % 4294967296 < 0 then ~y~0 % 4294967296 / (~x~0 % 4294967296) - 1 else 1 + ~y~0 % 4294967296 / (~x~0 % 4294967296)) else ~y~0 % 4294967296 / (~x~0 % 4294967296)) % 4294967296);#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {407#false} is VALID [2022-04-28 09:20:21,285 INFO L290 TraceCheckUtils]: 9: Hoare triple {407#false} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {407#false} is VALID [2022-04-28 09:20:21,285 INFO L290 TraceCheckUtils]: 10: Hoare triple {407#false} assume ~x~0 % 4294967296 < (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % (~x~0 % 4294967296) then (if ~x~0 % 4294967296 < 0 then ~y~0 % 4294967296 / (~x~0 % 4294967296) - 1 else 1 + ~y~0 % 4294967296 / (~x~0 % 4294967296)) else ~y~0 % 4294967296 / (~x~0 % 4294967296)) % 4294967296;~x~0 := ~x~0 * ~x~0; {407#false} is VALID [2022-04-28 09:20:21,285 INFO L290 TraceCheckUtils]: 11: Hoare triple {407#false} assume !(~x~0 % 4294967296 < ~y~0 % 4294967296); {407#false} is VALID [2022-04-28 09:20:21,285 INFO L272 TraceCheckUtils]: 12: Hoare triple {407#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~y~0 % 4294967296 then 1 else 0)); {407#false} is VALID [2022-04-28 09:20:21,285 INFO L290 TraceCheckUtils]: 13: Hoare triple {407#false} ~cond := #in~cond; {407#false} is VALID [2022-04-28 09:20:21,286 INFO L290 TraceCheckUtils]: 14: Hoare triple {407#false} assume 0 == ~cond; {407#false} is VALID [2022-04-28 09:20:21,286 INFO L290 TraceCheckUtils]: 15: Hoare triple {407#false} assume !false; {407#false} is VALID [2022-04-28 09:20:21,286 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 09:20:21,286 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 09:20:21,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:20:21,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032954397] [2022-04-28 09:20:21,287 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 09:20:21,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1939050747] [2022-04-28 09:20:21,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1939050747] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:20:21,287 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:20:21,287 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 09:20:21,287 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:20:21,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [613610860] [2022-04-28 09:20:21,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [613610860] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:20:21,288 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:20:21,288 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 09:20:21,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240189168] [2022-04-28 09:20:21,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:20:21,288 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-28 09:20:21,289 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:20:21,289 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:20:21,304 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:20:21,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 09:20:21,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:20:21,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 09:20:21,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-04-28 09:20:21,306 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:20:21,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:20:21,336 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2022-04-28 09:20:21,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 09:20:21,336 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-28 09:20:21,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:20:21,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:20:21,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2022-04-28 09:20:21,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:20:21,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2022-04-28 09:20:21,339 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 19 transitions. [2022-04-28 09:20:21,358 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:20:21,359 INFO L225 Difference]: With dead ends: 18 [2022-04-28 09:20:21,359 INFO L226 Difference]: Without dead ends: 0 [2022-04-28 09:20:21,359 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-04-28 09:20:21,360 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 1 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 09:20:21,360 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 17 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 09:20:21,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-28 09:20:21,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-28 09:20:21,361 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:20:21,361 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-28 09:20:21,361 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-28 09:20:21,362 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-28 09:20:21,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:20:21,362 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 09:20:21,362 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 09:20:21,362 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:20:21,362 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:20:21,362 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-28 09:20:21,362 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-28 09:20:21,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:20:21,363 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 09:20:21,363 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 09:20:21,363 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:20:21,363 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:20:21,363 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:20:21,363 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:20:21,363 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-28 09:20:21,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-28 09:20:21,363 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 16 [2022-04-28 09:20:21,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:20:21,364 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-28 09:20:21,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:20:21,364 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-28 09:20:21,364 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-28 09:20:21,364 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 09:20:21,364 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:20:21,366 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 09:20:21,393 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-28 09:20:21,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-28 09:20:21,581 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-28 09:20:21,719 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2022-04-28 09:20:21,720 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2022-04-28 09:20:21,720 INFO L899 garLoopResultBuilder]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2022-04-28 09:20:21,720 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 5 7) no Hoare annotation was computed. [2022-04-28 09:20:21,720 INFO L899 garLoopResultBuilder]: For program point L6(line 6) no Hoare annotation was computed. [2022-04-28 09:20:21,720 INFO L899 garLoopResultBuilder]: For program point L6-2(lines 5 7) no Hoare annotation was computed. [2022-04-28 09:20:21,720 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 5 7) no Hoare annotation was computed. [2022-04-28 09:20:21,720 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 17 32) the Hoare annotation is: true [2022-04-28 09:20:21,720 INFO L902 garLoopResultBuilder]: At program point mainEXIT(lines 17 32) the Hoare annotation is: true [2022-04-28 09:20:21,721 INFO L895 garLoopResultBuilder]: At program point L24(lines 24 28) the Hoare annotation is: (and (= main_~x~0 1) (< (mod main_~x~0 4294967296) (mod main_~y~0 4294967296))) [2022-04-28 09:20:21,721 INFO L895 garLoopResultBuilder]: At program point L24-2(lines 23 29) the Hoare annotation is: (and (= main_~x~0 1) (<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)) [2022-04-28 09:20:21,721 INFO L895 garLoopResultBuilder]: At program point L21(line 21) the Hoare annotation is: (= main_~x~0 1) [2022-04-28 09:20:21,721 INFO L895 garLoopResultBuilder]: At program point L23-2(lines 23 29) the Hoare annotation is: (= (mod main_~x~0 4294967296) (mod main_~y~0 4294967296)) [2022-04-28 09:20:21,721 INFO L902 garLoopResultBuilder]: At program point mainFINAL(lines 17 32) the Hoare annotation is: true [2022-04-28 09:20:21,721 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-28 09:20:21,721 INFO L895 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-28 09:20:21,721 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-28 09:20:21,721 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-28 09:20:21,721 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-28 09:20:21,722 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-28 09:20:21,722 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-28 09:20:21,722 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 10 15) the Hoare annotation is: true [2022-04-28 09:20:21,722 INFO L895 garLoopResultBuilder]: At program point L12(line 12) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-28 09:20:21,722 INFO L895 garLoopResultBuilder]: At program point L11(lines 11 13) the Hoare annotation is: (and (or (not (<= 1 |__VERIFIER_assert_#in~cond|)) (<= 1 __VERIFIER_assert_~cond)) (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0)))) [2022-04-28 09:20:21,722 INFO L895 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 10 15) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2022-04-28 09:20:21,722 INFO L895 garLoopResultBuilder]: At program point L11-2(lines 10 15) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2022-04-28 09:20:21,722 INFO L895 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 12) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-28 09:20:21,725 INFO L356 BasicCegarLoop]: Path program histogram: [2, 2, 2] [2022-04-28 09:20:21,727 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 09:20:21,729 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 09:20:21,730 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-28 09:20:21,731 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-28 09:20:21,731 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2022-04-28 09:20:21,731 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2022-04-28 09:20:21,734 WARN L170 areAnnotationChecker]: L6-2 has no Hoare annotation [2022-04-28 09:20:21,739 INFO L163 areAnnotationChecker]: CFG has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-28 09:20:21,747 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 09:20:21 BoogieIcfgContainer [2022-04-28 09:20:21,747 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 09:20:21,748 INFO L158 Benchmark]: Toolchain (without parser) took 35170.23ms. Allocated memory was 180.4MB in the beginning and 219.2MB in the end (delta: 38.8MB). Free memory was 134.4MB in the beginning and 89.5MB in the end (delta: 45.0MB). Peak memory consumption was 84.6MB. Max. memory is 8.0GB. [2022-04-28 09:20:21,748 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 180.4MB. Free memory is still 150.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 09:20:21,748 INFO L158 Benchmark]: CACSL2BoogieTranslator took 271.06ms. Allocated memory is still 180.4MB. Free memory was 134.3MB in the beginning and 159.5MB in the end (delta: -25.2MB). Peak memory consumption was 11.6MB. Max. memory is 8.0GB. [2022-04-28 09:20:21,749 INFO L158 Benchmark]: Boogie Preprocessor took 38.07ms. Allocated memory is still 180.4MB. Free memory was 159.5MB in the beginning and 158.1MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-28 09:20:21,749 INFO L158 Benchmark]: RCFGBuilder took 224.22ms. Allocated memory is still 180.4MB. Free memory was 158.1MB in the beginning and 147.0MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-28 09:20:21,749 INFO L158 Benchmark]: TraceAbstraction took 34632.13ms. Allocated memory was 180.4MB in the beginning and 219.2MB in the end (delta: 38.8MB). Free memory was 146.5MB in the beginning and 89.5MB in the end (delta: 57.0MB). Peak memory consumption was 96.1MB. Max. memory is 8.0GB. [2022-04-28 09:20:21,750 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 180.4MB. Free memory is still 150.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 271.06ms. Allocated memory is still 180.4MB. Free memory was 134.3MB in the beginning and 159.5MB in the end (delta: -25.2MB). Peak memory consumption was 11.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 38.07ms. Allocated memory is still 180.4MB. Free memory was 159.5MB in the beginning and 158.1MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 224.22ms. Allocated memory is still 180.4MB. Free memory was 158.1MB in the beginning and 147.0MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 34632.13ms. Allocated memory was 180.4MB in the beginning and 219.2MB in the end (delta: 38.8MB). Free memory was 146.5MB in the beginning and 89.5MB in the end (delta: 57.0MB). Peak memory consumption was 96.1MB. 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: 12]: 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, 27 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 34.6s, OverallIterations: 3, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 31.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 3 mSolverCounterUnknown, 35 SdHoareTripleChecker+Valid, 30.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 34 mSDsluCounter, 118 SdHoareTripleChecker+Invalid, 30.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 83 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 136 IncrementalHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 35 mSDtfsCounter, 136 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 59 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=20occurred in iteration=0, InterpolantAutomatonStates: 20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 20 LocationsWithAnnotation, 38 PreInvPairs, 57 NumberOfFragments, 90 HoareAnnotationTreeSize, 38 FomulaSimplifications, 35 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 20 FomulaSimplificationsInter, 127 FormulaSimplificationTreeSizeReductionInter, 0.1s 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: 23]: Loop Invariant Derived loop invariant: x == 1 && y / 4294967296 * 4294967296 + 1 <= y - ProcedureContractResult [Line: 17]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 10]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: \old(cond) == 0 || !(cond == 0) RESULT: Ultimate proved your program to be correct! [2022-04-28 09:20:21,771 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...