/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/divbin2_unwindbound2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 11:41:53,834 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 11:41:53,836 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 11:41:53,865 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 11:41:53,865 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 11:41:53,866 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 11:41:53,868 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 11:41:53,872 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 11:41:53,874 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 11:41:53,878 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 11:41:53,879 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 11:41:53,880 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 11:41:53,880 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 11:41:53,883 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 11:41:53,883 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 11:41:53,885 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 11:41:53,885 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 11:41:53,886 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 11:41:53,887 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 11:41:53,891 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 11:41:53,891 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 11:41:53,893 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 11:41:53,893 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 11:41:53,894 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 11:41:53,895 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 11:41:53,896 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 11:41:53,897 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 11:41:53,897 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 11:41:53,897 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 11:41:53,898 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 11:41:53,899 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 11:41:53,899 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 11:41:53,900 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 11:41:53,900 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 11:41:53,901 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 11:41:53,901 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 11:41:53,901 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 11:41:53,902 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 11:41:53,902 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 11:41:53,902 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 11:41:53,902 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 11:41:53,904 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 11:41:53,904 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-08 11:41:53,913 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 11:41:53,914 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 11:41:53,914 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 11:41:53,915 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 11:41:53,915 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 11:41:53,915 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 11:41:53,915 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 11:41:53,915 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 11:41:53,915 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 11:41:53,916 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 11:41:53,916 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 11:41:53,916 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 11:41:53,916 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 11:41:53,916 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 11:41:53,916 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 11:41:53,916 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 11:41:53,916 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 11:41:53,916 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 11:41:53,916 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 11:41:53,916 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 11:41:53,917 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 11:41:53,917 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-08 11:41:53,917 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-08 11:41:54,123 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 11:41:54,151 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 11:41:54,153 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 11:41:54,154 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 11:41:54,155 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 11:41:54,156 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/divbin2_unwindbound2.i [2022-04-08 11:41:54,202 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7cd16ba55/c09af43a734b4fc49064c0dd05a1a2b7/FLAGd89d17f32 [2022-04-08 11:41:54,587 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 11:41:54,587 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/divbin2_unwindbound2.i [2022-04-08 11:41:54,594 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7cd16ba55/c09af43a734b4fc49064c0dd05a1a2b7/FLAGd89d17f32 [2022-04-08 11:41:54,606 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7cd16ba55/c09af43a734b4fc49064c0dd05a1a2b7 [2022-04-08 11:41:54,608 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 11:41:54,608 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 11:41:54,609 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 11:41:54,610 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 11:41:54,612 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 11:41:54,613 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 11:41:54" (1/1) ... [2022-04-08 11:41:54,614 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4fa475db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 11:41:54, skipping insertion in model container [2022-04-08 11:41:54,614 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 11:41:54" (1/1) ... [2022-04-08 11:41:54,618 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 11:41:54,646 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 11:41:54,766 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/divbin2_unwindbound2.i[951,964] [2022-04-08 11:41:54,788 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 11:41:54,794 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 11:41:54,802 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/divbin2_unwindbound2.i[951,964] [2022-04-08 11:41:54,806 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 11:41:54,816 INFO L208 MainTranslator]: Completed translation [2022-04-08 11:41:54,816 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 11:41:54 WrapperNode [2022-04-08 11:41:54,816 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 11:41:54,817 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 11:41:54,817 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 11:41:54,818 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 11:41:54,826 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 11:41:54" (1/1) ... [2022-04-08 11:41:54,826 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 11:41:54" (1/1) ... [2022-04-08 11:41:54,831 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 11:41:54" (1/1) ... [2022-04-08 11:41:54,832 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 11:41:54" (1/1) ... [2022-04-08 11:41:54,836 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 11:41:54" (1/1) ... [2022-04-08 11:41:54,842 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 11:41:54" (1/1) ... [2022-04-08 11:41:54,843 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 11:41:54" (1/1) ... [2022-04-08 11:41:54,844 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 11:41:54,845 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 11:41:54,845 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 11:41:54,845 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 11:41:54,846 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 11:41:54" (1/1) ... [2022-04-08 11:41:54,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 11:41:54,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:41:54,866 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-08 11:41:54,871 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-08 11:41:54,908 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 11:41:54,908 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 11:41:54,908 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 11:41:54,908 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-08 11:41:54,909 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 11:41:54,909 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 11:41:54,909 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 11:41:54,909 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 11:41:54,909 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-08 11:41:54,909 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-08 11:41:54,909 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 11:41:54,909 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 11:41:54,909 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-08 11:41:54,909 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-08 11:41:54,910 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 11:41:54,910 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 11:41:54,910 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 11:41:54,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 11:41:54,910 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 11:41:54,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 11:41:54,910 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 11:41:54,910 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 11:41:54,968 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 11:41:54,969 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 11:41:55,125 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 11:41:55,130 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 11:41:55,130 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-08 11:41:55,131 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 11:41:55 BoogieIcfgContainer [2022-04-08 11:41:55,132 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 11:41:55,133 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 11:41:55,133 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 11:41:55,135 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 11:41:55,136 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 11:41:54" (1/3) ... [2022-04-08 11:41:55,136 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45924d45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 11:41:55, skipping insertion in model container [2022-04-08 11:41:55,136 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 11:41:54" (2/3) ... [2022-04-08 11:41:55,136 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45924d45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 11:41:55, skipping insertion in model container [2022-04-08 11:41:55,136 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 11:41:55" (3/3) ... [2022-04-08 11:41:55,137 INFO L111 eAbstractionObserver]: Analyzing ICFG divbin2_unwindbound2.i [2022-04-08 11:41:55,158 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 11:41:55,159 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 11:41:55,207 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 11:41:55,212 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-08 11:41:55,212 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 11:41:55,229 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 11:41:55,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-08 11:41:55,240 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:41:55,240 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 11:41:55,240 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:41:55,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:41:55,247 INFO L85 PathProgramCache]: Analyzing trace with hash -2126508982, now seen corresponding path program 1 times [2022-04-08 11:41:55,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:41:55,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1877922387] [2022-04-08 11:41:55,261 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 11:41:55,261 INFO L85 PathProgramCache]: Analyzing trace with hash -2126508982, now seen corresponding path program 2 times [2022-04-08 11:41:55,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:41:55,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909941176] [2022-04-08 11:41:55,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:41:55,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:41:55,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:41:55,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 11:41:55,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:41:55,428 INFO L290 TraceCheckUtils]: 0: Hoare triple {34#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);~counter~0 := 0; {29#true} is VALID [2022-04-08 11:41:55,429 INFO L290 TraceCheckUtils]: 1: Hoare triple {29#true} assume true; {29#true} is VALID [2022-04-08 11:41:55,429 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {29#true} {29#true} #82#return; {29#true} is VALID [2022-04-08 11:41:55,431 INFO L272 TraceCheckUtils]: 0: Hoare triple {29#true} call ULTIMATE.init(); {34#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 11:41:55,432 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);~counter~0 := 0; {29#true} is VALID [2022-04-08 11:41:55,432 INFO L290 TraceCheckUtils]: 2: Hoare triple {29#true} assume true; {29#true} is VALID [2022-04-08 11:41:55,432 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29#true} {29#true} #82#return; {29#true} is VALID [2022-04-08 11:41:55,432 INFO L272 TraceCheckUtils]: 4: Hoare triple {29#true} call #t~ret4 := main(); {29#true} is VALID [2022-04-08 11:41:55,432 INFO L290 TraceCheckUtils]: 5: Hoare triple {29#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {29#true} is VALID [2022-04-08 11:41:55,433 INFO L290 TraceCheckUtils]: 6: Hoare triple {29#true} assume !true; {30#false} is VALID [2022-04-08 11:41:55,433 INFO L290 TraceCheckUtils]: 7: Hoare triple {30#false} assume !true; {30#false} is VALID [2022-04-08 11:41:55,433 INFO L272 TraceCheckUtils]: 8: Hoare triple {30#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {30#false} is VALID [2022-04-08 11:41:55,434 INFO L290 TraceCheckUtils]: 9: Hoare triple {30#false} ~cond := #in~cond; {30#false} is VALID [2022-04-08 11:41:55,434 INFO L290 TraceCheckUtils]: 10: Hoare triple {30#false} assume 0 == ~cond; {30#false} is VALID [2022-04-08 11:41:55,434 INFO L290 TraceCheckUtils]: 11: Hoare triple {30#false} assume !false; {30#false} is VALID [2022-04-08 11:41:55,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 11:41:55,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:41:55,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909941176] [2022-04-08 11:41:55,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909941176] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:41:55,436 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:41:55,436 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 11:41:55,439 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:41:55,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1877922387] [2022-04-08 11:41:55,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1877922387] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:41:55,440 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:41:55,440 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 11:41:55,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940396040] [2022-04-08 11:41:55,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:41:55,445 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-08 11:41:55,446 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:41:55,448 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 11:41:55,467 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:41:55,467 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-08 11:41:55,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:41:55,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-08 11:41:55,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 11:41:55,491 INFO L87 Difference]: Start difference. First operand has 26 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 11:41:55,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:41:55,597 INFO L93 Difference]: Finished difference Result 44 states and 60 transitions. [2022-04-08 11:41:55,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-08 11:41:55,598 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-08 11:41:55,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:41:55,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 11:41:55,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2022-04-08 11:41:55,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 11:41:55,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2022-04-08 11:41:55,615 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 60 transitions. [2022-04-08 11:41:55,676 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:41:55,684 INFO L225 Difference]: With dead ends: 44 [2022-04-08 11:41:55,684 INFO L226 Difference]: Without dead ends: 22 [2022-04-08 11:41:55,686 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 11:41:55,689 INFO L913 BasicCegarLoop]: 30 mSDtfsCounter, 6 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 11:41:55,690 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 34 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 11:41:55,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-08 11:41:55,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2022-04-08 11:41:55,717 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:41:55,718 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 21 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 11:41:55,718 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 21 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 11:41:55,718 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 21 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 11:41:55,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:41:55,722 INFO L93 Difference]: Finished difference Result 22 states and 27 transitions. [2022-04-08 11:41:55,722 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2022-04-08 11:41:55,722 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:41:55,723 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:41:55,723 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 22 states. [2022-04-08 11:41:55,724 INFO L87 Difference]: Start difference. First operand has 21 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 22 states. [2022-04-08 11:41:55,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:41:55,726 INFO L93 Difference]: Finished difference Result 22 states and 27 transitions. [2022-04-08 11:41:55,726 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2022-04-08 11:41:55,726 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:41:55,726 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:41:55,727 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:41:55,727 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:41:55,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 11:41:55,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2022-04-08 11:41:55,729 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 26 transitions. Word has length 12 [2022-04-08 11:41:55,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:41:55,729 INFO L478 AbstractCegarLoop]: Abstraction has 21 states and 26 transitions. [2022-04-08 11:41:55,730 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 11:41:55,731 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 26 transitions. [2022-04-08 11:41:55,754 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:41:55,754 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 26 transitions. [2022-04-08 11:41:55,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-08 11:41:55,758 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:41:55,758 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 11:41:55,758 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 11:41:55,759 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:41:55,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:41:55,759 INFO L85 PathProgramCache]: Analyzing trace with hash 941422680, now seen corresponding path program 1 times [2022-04-08 11:41:55,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:41:55,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1104567620] [2022-04-08 11:41:55,761 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 11:41:55,761 INFO L85 PathProgramCache]: Analyzing trace with hash 941422680, now seen corresponding path program 2 times [2022-04-08 11:41:55,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:41:55,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385780080] [2022-04-08 11:41:55,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:41:55,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:41:55,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:41:55,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 11:41:55,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:41:55,864 INFO L290 TraceCheckUtils]: 0: Hoare triple {218#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);~counter~0 := 0; {216#(<= ~counter~0 0)} is VALID [2022-04-08 11:41:55,864 INFO L290 TraceCheckUtils]: 1: Hoare triple {216#(<= ~counter~0 0)} assume true; {216#(<= ~counter~0 0)} is VALID [2022-04-08 11:41:55,865 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {216#(<= ~counter~0 0)} {211#true} #82#return; {216#(<= ~counter~0 0)} is VALID [2022-04-08 11:41:55,866 INFO L272 TraceCheckUtils]: 0: Hoare triple {211#true} call ULTIMATE.init(); {218#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 11:41:55,867 INFO L290 TraceCheckUtils]: 1: Hoare triple {218#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);~counter~0 := 0; {216#(<= ~counter~0 0)} is VALID [2022-04-08 11:41:55,867 INFO L290 TraceCheckUtils]: 2: Hoare triple {216#(<= ~counter~0 0)} assume true; {216#(<= ~counter~0 0)} is VALID [2022-04-08 11:41:55,868 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {216#(<= ~counter~0 0)} {211#true} #82#return; {216#(<= ~counter~0 0)} is VALID [2022-04-08 11:41:55,868 INFO L272 TraceCheckUtils]: 4: Hoare triple {216#(<= ~counter~0 0)} call #t~ret4 := main(); {216#(<= ~counter~0 0)} is VALID [2022-04-08 11:41:55,868 INFO L290 TraceCheckUtils]: 5: Hoare triple {216#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {216#(<= ~counter~0 0)} is VALID [2022-04-08 11:41:55,869 INFO L290 TraceCheckUtils]: 6: Hoare triple {216#(<= ~counter~0 0)} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {217#(<= |main_#t~post2| 0)} is VALID [2022-04-08 11:41:55,869 INFO L290 TraceCheckUtils]: 7: Hoare triple {217#(<= |main_#t~post2| 0)} assume !(#t~post2 < 2);havoc #t~post2; {212#false} is VALID [2022-04-08 11:41:55,870 INFO L290 TraceCheckUtils]: 8: Hoare triple {212#false} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {212#false} is VALID [2022-04-08 11:41:55,870 INFO L290 TraceCheckUtils]: 9: Hoare triple {212#false} assume !(#t~post3 < 2);havoc #t~post3; {212#false} is VALID [2022-04-08 11:41:55,870 INFO L272 TraceCheckUtils]: 10: Hoare triple {212#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {212#false} is VALID [2022-04-08 11:41:55,870 INFO L290 TraceCheckUtils]: 11: Hoare triple {212#false} ~cond := #in~cond; {212#false} is VALID [2022-04-08 11:41:55,870 INFO L290 TraceCheckUtils]: 12: Hoare triple {212#false} assume 0 == ~cond; {212#false} is VALID [2022-04-08 11:41:55,871 INFO L290 TraceCheckUtils]: 13: Hoare triple {212#false} assume !false; {212#false} is VALID [2022-04-08 11:41:55,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 11:41:55,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:41:55,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385780080] [2022-04-08 11:41:55,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385780080] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:41:55,874 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:41:55,874 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 11:41:55,874 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:41:55,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1104567620] [2022-04-08 11:41:55,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1104567620] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:41:55,875 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:41:55,875 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 11:41:55,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663410420] [2022-04-08 11:41:55,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:41:55,876 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-08 11:41:55,876 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:41:55,877 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 11:41:55,887 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-08 11:41:55,887 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 11:41:55,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:41:55,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 11:41:55,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 11:41:55,888 INFO L87 Difference]: Start difference. First operand 21 states and 26 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 11:41:55,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:41:55,989 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2022-04-08 11:41:55,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 11:41:55,989 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-08 11:41:55,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:41:55,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 11:41:55,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 44 transitions. [2022-04-08 11:41:55,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 11:41:55,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 44 transitions. [2022-04-08 11:41:55,992 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 44 transitions. [2022-04-08 11:41:56,022 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:41:56,023 INFO L225 Difference]: With dead ends: 35 [2022-04-08 11:41:56,023 INFO L226 Difference]: Without dead ends: 23 [2022-04-08 11:41:56,023 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 11:41:56,024 INFO L913 BasicCegarLoop]: 24 mSDtfsCounter, 6 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 11:41:56,024 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 53 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 11:41:56,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-08 11:41:56,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-04-08 11:41:56,031 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:41:56,031 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 23 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 11:41:56,031 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 23 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 11:41:56,031 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 23 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 11:41:56,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:41:56,032 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2022-04-08 11:41:56,032 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2022-04-08 11:41:56,033 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:41:56,033 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:41:56,033 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 23 states. [2022-04-08 11:41:56,033 INFO L87 Difference]: Start difference. First operand has 23 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 23 states. [2022-04-08 11:41:56,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:41:56,034 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2022-04-08 11:41:56,034 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2022-04-08 11:41:56,034 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:41:56,034 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:41:56,035 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:41:56,035 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:41:56,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 11:41:56,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2022-04-08 11:41:56,036 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 28 transitions. Word has length 14 [2022-04-08 11:41:56,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:41:56,036 INFO L478 AbstractCegarLoop]: Abstraction has 23 states and 28 transitions. [2022-04-08 11:41:56,036 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 11:41:56,036 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 28 transitions. [2022-04-08 11:41:56,057 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:41:56,057 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2022-04-08 11:41:56,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-08 11:41:56,057 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:41:56,057 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 11:41:56,057 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-08 11:41:56,057 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:41:56,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:41:56,058 INFO L85 PathProgramCache]: Analyzing trace with hash -1209133518, now seen corresponding path program 1 times [2022-04-08 11:41:56,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:41:56,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1119941023] [2022-04-08 11:41:56,058 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 11:41:56,059 INFO L85 PathProgramCache]: Analyzing trace with hash -1209133518, now seen corresponding path program 2 times [2022-04-08 11:41:56,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:41:56,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422373145] [2022-04-08 11:41:56,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:41:56,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:41:56,069 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:41:56,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [562135628] [2022-04-08 11:41:56,070 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 11:41:56,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:41:56,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:41:56,071 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 11:41:56,104 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-08 11:41:56,110 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-08 11:41:56,110 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:41:56,111 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 11:41:56,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:41:56,120 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:41:56,224 INFO L272 TraceCheckUtils]: 0: Hoare triple {385#true} call ULTIMATE.init(); {385#true} is VALID [2022-04-08 11:41:56,225 INFO L290 TraceCheckUtils]: 1: Hoare triple {385#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);~counter~0 := 0; {393#(<= ~counter~0 0)} is VALID [2022-04-08 11:41:56,225 INFO L290 TraceCheckUtils]: 2: Hoare triple {393#(<= ~counter~0 0)} assume true; {393#(<= ~counter~0 0)} is VALID [2022-04-08 11:41:56,226 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {393#(<= ~counter~0 0)} {385#true} #82#return; {393#(<= ~counter~0 0)} is VALID [2022-04-08 11:41:56,226 INFO L272 TraceCheckUtils]: 4: Hoare triple {393#(<= ~counter~0 0)} call #t~ret4 := main(); {393#(<= ~counter~0 0)} is VALID [2022-04-08 11:41:56,227 INFO L290 TraceCheckUtils]: 5: Hoare triple {393#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {393#(<= ~counter~0 0)} is VALID [2022-04-08 11:41:56,227 INFO L290 TraceCheckUtils]: 6: Hoare triple {393#(<= ~counter~0 0)} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {409#(<= ~counter~0 1)} is VALID [2022-04-08 11:41:56,227 INFO L290 TraceCheckUtils]: 7: Hoare triple {409#(<= ~counter~0 1)} assume !!(#t~post2 < 2);havoc #t~post2; {409#(<= ~counter~0 1)} is VALID [2022-04-08 11:41:56,228 INFO L290 TraceCheckUtils]: 8: Hoare triple {409#(<= ~counter~0 1)} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {409#(<= ~counter~0 1)} is VALID [2022-04-08 11:41:56,228 INFO L290 TraceCheckUtils]: 9: Hoare triple {409#(<= ~counter~0 1)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {419#(<= |main_#t~post3| 1)} is VALID [2022-04-08 11:41:56,229 INFO L290 TraceCheckUtils]: 10: Hoare triple {419#(<= |main_#t~post3| 1)} assume !(#t~post3 < 2);havoc #t~post3; {386#false} is VALID [2022-04-08 11:41:56,229 INFO L272 TraceCheckUtils]: 11: Hoare triple {386#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {386#false} is VALID [2022-04-08 11:41:56,229 INFO L290 TraceCheckUtils]: 12: Hoare triple {386#false} ~cond := #in~cond; {386#false} is VALID [2022-04-08 11:41:56,229 INFO L290 TraceCheckUtils]: 13: Hoare triple {386#false} assume 0 == ~cond; {386#false} is VALID [2022-04-08 11:41:56,229 INFO L290 TraceCheckUtils]: 14: Hoare triple {386#false} assume !false; {386#false} is VALID [2022-04-08 11:41:56,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 11:41:56,229 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 11:41:56,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:41:56,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422373145] [2022-04-08 11:41:56,230 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:41:56,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [562135628] [2022-04-08 11:41:56,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [562135628] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:41:56,230 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:41:56,230 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 11:41:56,231 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:41:56,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1119941023] [2022-04-08 11:41:56,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1119941023] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:41:56,231 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:41:56,231 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 11:41:56,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274911814] [2022-04-08 11:41:56,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:41:56,231 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-08 11:41:56,232 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:41:56,232 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 11:41:56,242 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:41:56,242 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 11:41:56,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:41:56,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 11:41:56,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-08 11:41:56,242 INFO L87 Difference]: Start difference. First operand 23 states and 28 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 11:41:56,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:41:56,302 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2022-04-08 11:41:56,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 11:41:56,302 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-08 11:41:56,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:41:56,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 11:41:56,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-04-08 11:41:56,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 11:41:56,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-04-08 11:41:56,304 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 40 transitions. [2022-04-08 11:41:56,329 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:41:56,330 INFO L225 Difference]: With dead ends: 34 [2022-04-08 11:41:56,330 INFO L226 Difference]: Without dead ends: 27 [2022-04-08 11:41:56,330 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-08 11:41:56,331 INFO L913 BasicCegarLoop]: 23 mSDtfsCounter, 3 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 11:41:56,331 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 81 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 11:41:56,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-08 11:41:56,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2022-04-08 11:41:56,339 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:41:56,339 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 26 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 states have internal predecessors, (26), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 11:41:56,339 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 26 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 states have internal predecessors, (26), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 11:41:56,340 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 26 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 states have internal predecessors, (26), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 11:41:56,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:41:56,341 INFO L93 Difference]: Finished difference Result 27 states and 33 transitions. [2022-04-08 11:41:56,341 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2022-04-08 11:41:56,341 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:41:56,341 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:41:56,341 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 states have internal predecessors, (26), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 27 states. [2022-04-08 11:41:56,342 INFO L87 Difference]: Start difference. First operand has 26 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 states have internal predecessors, (26), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 27 states. [2022-04-08 11:41:56,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:41:56,343 INFO L93 Difference]: Finished difference Result 27 states and 33 transitions. [2022-04-08 11:41:56,343 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2022-04-08 11:41:56,343 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:41:56,343 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:41:56,343 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:41:56,343 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:41:56,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 states have internal predecessors, (26), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 11:41:56,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2022-04-08 11:41:56,344 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 15 [2022-04-08 11:41:56,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:41:56,344 INFO L478 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2022-04-08 11:41:56,345 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 11:41:56,345 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 32 transitions. [2022-04-08 11:41:56,366 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:41:56,366 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2022-04-08 11:41:56,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-08 11:41:56,366 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:41:56,367 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 11:41:56,395 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-08 11:41:56,583 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:41:56,584 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:41:56,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:41:56,584 INFO L85 PathProgramCache]: Analyzing trace with hash -1207346058, now seen corresponding path program 1 times [2022-04-08 11:41:56,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:41:56,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1631314250] [2022-04-08 11:41:56,593 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 11:41:56,593 INFO L85 PathProgramCache]: Analyzing trace with hash -1207346058, now seen corresponding path program 2 times [2022-04-08 11:41:56,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:41:56,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221748921] [2022-04-08 11:41:56,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:41:56,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:41:56,603 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:41:56,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [681836141] [2022-04-08 11:41:56,603 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 11:41:56,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:41:56,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:41:56,604 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 11:41:56,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-08 11:41:56,641 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-08 11:41:56,642 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:41:56,642 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-08 11:41:56,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:41:56,648 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:41:56,853 INFO L272 TraceCheckUtils]: 0: Hoare triple {608#true} call ULTIMATE.init(); {608#true} is VALID [2022-04-08 11:41:56,853 INFO L290 TraceCheckUtils]: 1: Hoare triple {608#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);~counter~0 := 0; {608#true} is VALID [2022-04-08 11:41:56,853 INFO L290 TraceCheckUtils]: 2: Hoare triple {608#true} assume true; {608#true} is VALID [2022-04-08 11:41:56,853 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {608#true} {608#true} #82#return; {608#true} is VALID [2022-04-08 11:41:56,854 INFO L272 TraceCheckUtils]: 4: Hoare triple {608#true} call #t~ret4 := main(); {608#true} is VALID [2022-04-08 11:41:56,854 INFO L290 TraceCheckUtils]: 5: Hoare triple {608#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {628#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:41:56,855 INFO L290 TraceCheckUtils]: 6: Hoare triple {628#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {628#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:41:56,855 INFO L290 TraceCheckUtils]: 7: Hoare triple {628#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post2 < 2);havoc #t~post2; {628#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:41:56,856 INFO L290 TraceCheckUtils]: 8: Hoare triple {628#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {638#(and (= main_~b~0 1) (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:41:56,856 INFO L290 TraceCheckUtils]: 9: Hoare triple {638#(and (= main_~b~0 1) (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0))} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {638#(and (= main_~b~0 1) (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:41:56,857 INFO L290 TraceCheckUtils]: 10: Hoare triple {638#(and (= main_~b~0 1) (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post3 < 2);havoc #t~post3; {638#(and (= main_~b~0 1) (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:41:56,858 INFO L272 TraceCheckUtils]: 11: Hoare triple {638#(and (= main_~b~0 1) (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {648#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 11:41:56,858 INFO L290 TraceCheckUtils]: 12: Hoare triple {648#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {652#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:41:56,858 INFO L290 TraceCheckUtils]: 13: Hoare triple {652#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {609#false} is VALID [2022-04-08 11:41:56,859 INFO L290 TraceCheckUtils]: 14: Hoare triple {609#false} assume !false; {609#false} is VALID [2022-04-08 11:41:56,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 11:41:56,859 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 11:41:56,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:41:56,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221748921] [2022-04-08 11:41:56,859 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:41:56,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [681836141] [2022-04-08 11:41:56,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [681836141] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:41:56,859 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:41:56,859 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 11:41:56,860 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:41:56,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1631314250] [2022-04-08 11:41:56,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1631314250] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:41:56,860 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:41:56,860 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 11:41:56,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962464596] [2022-04-08 11:41:56,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:41:56,862 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 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 15 [2022-04-08 11:41:56,862 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:41:56,862 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 11:41:56,874 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:41:56,874 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 11:41:56,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:41:56,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 11:41:56,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-04-08 11:41:56,875 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 11:41:57,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:41:57,052 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2022-04-08 11:41:57,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 11:41:57,052 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 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 15 [2022-04-08 11:41:57,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:41:57,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 11:41:57,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 42 transitions. [2022-04-08 11:41:57,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 11:41:57,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 42 transitions. [2022-04-08 11:41:57,055 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 42 transitions. [2022-04-08 11:41:57,088 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:41:57,089 INFO L225 Difference]: With dead ends: 35 [2022-04-08 11:41:57,089 INFO L226 Difference]: Without dead ends: 32 [2022-04-08 11:41:57,089 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-04-08 11:41:57,090 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 9 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 11:41:57,090 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 88 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 11:41:57,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-08 11:41:57,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-08 11:41:57,105 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:41:57,105 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 11:41:57,105 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 11:41:57,105 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 11:41:57,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:41:57,106 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2022-04-08 11:41:57,106 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2022-04-08 11:41:57,107 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:41:57,107 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:41:57,107 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 32 states. [2022-04-08 11:41:57,107 INFO L87 Difference]: Start difference. First operand has 32 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 32 states. [2022-04-08 11:41:57,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:41:57,108 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2022-04-08 11:41:57,108 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2022-04-08 11:41:57,109 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:41:57,109 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:41:57,109 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:41:57,109 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:41:57,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 11:41:57,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2022-04-08 11:41:57,110 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 15 [2022-04-08 11:41:57,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:41:57,110 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2022-04-08 11:41:57,110 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 11:41:57,110 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 38 transitions. [2022-04-08 11:41:57,140 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:41:57,140 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2022-04-08 11:41:57,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-08 11:41:57,140 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:41:57,141 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 11:41:57,184 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-08 11:41:57,368 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-04-08 11:41:57,369 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:41:57,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:41:57,369 INFO L85 PathProgramCache]: Analyzing trace with hash -352921097, now seen corresponding path program 1 times [2022-04-08 11:41:57,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:41:57,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1798675159] [2022-04-08 11:41:57,389 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 11:41:57,389 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 11:41:57,389 INFO L85 PathProgramCache]: Analyzing trace with hash -352921097, now seen corresponding path program 2 times [2022-04-08 11:41:57,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:41:57,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683795438] [2022-04-08 11:41:57,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:41:57,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:41:57,399 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:41:57,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1889269846] [2022-04-08 11:41:57,399 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 11:41:57,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:41:57,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:41:57,400 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 11:41:57,402 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-08 11:41:57,432 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-08 11:41:57,432 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:41:57,433 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 11:41:57,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:41:57,440 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:41:57,551 INFO L272 TraceCheckUtils]: 0: Hoare triple {858#true} call ULTIMATE.init(); {858#true} is VALID [2022-04-08 11:41:57,551 INFO L290 TraceCheckUtils]: 1: Hoare triple {858#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);~counter~0 := 0; {858#true} is VALID [2022-04-08 11:41:57,551 INFO L290 TraceCheckUtils]: 2: Hoare triple {858#true} assume true; {858#true} is VALID [2022-04-08 11:41:57,551 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {858#true} {858#true} #82#return; {858#true} is VALID [2022-04-08 11:41:57,551 INFO L272 TraceCheckUtils]: 4: Hoare triple {858#true} call #t~ret4 := main(); {858#true} is VALID [2022-04-08 11:41:57,552 INFO L290 TraceCheckUtils]: 5: Hoare triple {858#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {878#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:41:57,553 INFO L290 TraceCheckUtils]: 6: Hoare triple {878#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {878#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:41:57,553 INFO L290 TraceCheckUtils]: 7: Hoare triple {878#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post2 < 2);havoc #t~post2; {878#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:41:57,554 INFO L290 TraceCheckUtils]: 8: Hoare triple {878#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {878#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:41:57,554 INFO L290 TraceCheckUtils]: 9: Hoare triple {878#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {878#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:41:57,563 INFO L290 TraceCheckUtils]: 10: Hoare triple {878#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !(#t~post2 < 2);havoc #t~post2; {878#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:41:57,564 INFO L290 TraceCheckUtils]: 11: Hoare triple {878#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {878#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:41:57,564 INFO L290 TraceCheckUtils]: 12: Hoare triple {878#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !(#t~post3 < 2);havoc #t~post3; {878#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:41:57,565 INFO L272 TraceCheckUtils]: 13: Hoare triple {878#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {903#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 11:41:57,566 INFO L290 TraceCheckUtils]: 14: Hoare triple {903#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {907#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:41:57,566 INFO L290 TraceCheckUtils]: 15: Hoare triple {907#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {859#false} is VALID [2022-04-08 11:41:57,566 INFO L290 TraceCheckUtils]: 16: Hoare triple {859#false} assume !false; {859#false} is VALID [2022-04-08 11:41:57,566 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-08 11:41:57,566 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 11:41:57,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:41:57,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683795438] [2022-04-08 11:41:57,567 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:41:57,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1889269846] [2022-04-08 11:41:57,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1889269846] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:41:57,567 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:41:57,567 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 11:41:57,567 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:41:57,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1798675159] [2022-04-08 11:41:57,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1798675159] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:41:57,567 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:41:57,567 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 11:41:57,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119530295] [2022-04-08 11:41:57,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:41:57,568 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (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 17 [2022-04-08 11:41:57,568 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:41:57,568 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 11:41:57,584 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-08 11:41:57,584 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 11:41:57,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:41:57,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 11:41:57,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 11:41:57,585 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 11:41:59,704 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-08 11:41:59,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:41:59,788 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2022-04-08 11:41:59,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 11:41:59,788 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (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 17 [2022-04-08 11:41:59,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:41:59,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 11:41:59,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-04-08 11:41:59,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 11:41:59,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-04-08 11:41:59,791 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 41 transitions. [2022-04-08 11:41:59,838 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:41:59,839 INFO L225 Difference]: With dead ends: 44 [2022-04-08 11:41:59,839 INFO L226 Difference]: Without dead ends: 41 [2022-04-08 11:41:59,839 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 11:41:59,840 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 9 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-04-08 11:41:59,840 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 66 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 1 Unknown, 0 Unchecked, 2.0s Time] [2022-04-08 11:41:59,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-04-08 11:41:59,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 32. [2022-04-08 11:41:59,854 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:41:59,854 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand has 32 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 11:41:59,854 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand has 32 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 11:41:59,854 INFO L87 Difference]: Start difference. First operand 41 states. Second operand has 32 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 11:41:59,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:41:59,856 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2022-04-08 11:41:59,856 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2022-04-08 11:41:59,856 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:41:59,856 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:41:59,857 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 41 states. [2022-04-08 11:41:59,857 INFO L87 Difference]: Start difference. First operand has 32 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 41 states. [2022-04-08 11:41:59,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:41:59,858 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2022-04-08 11:41:59,858 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2022-04-08 11:41:59,858 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:41:59,858 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:41:59,858 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:41:59,858 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:41:59,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 11:41:59,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2022-04-08 11:41:59,860 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 17 [2022-04-08 11:41:59,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:41:59,860 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2022-04-08 11:41:59,860 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 11:41:59,860 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 38 transitions. [2022-04-08 11:41:59,897 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:41:59,897 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2022-04-08 11:41:59,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-08 11:41:59,897 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:41:59,898 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 11:41:59,916 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-08 11:42:00,113 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:42:00,114 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:42:00,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:42:00,114 INFO L85 PathProgramCache]: Analyzing trace with hash 1626008211, now seen corresponding path program 1 times [2022-04-08 11:42:00,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:42:00,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1050036426] [2022-04-08 11:42:00,115 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 11:42:00,115 INFO L85 PathProgramCache]: Analyzing trace with hash 1626008211, now seen corresponding path program 2 times [2022-04-08 11:42:00,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:42:00,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413448051] [2022-04-08 11:42:00,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:42:00,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:42:00,131 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:42:00,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [688808043] [2022-04-08 11:42:00,131 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 11:42:00,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:42:00,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:42:00,132 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 11:42:00,140 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-08 11:42:00,182 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 11:42:00,182 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:42:00,183 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-08 11:42:00,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:42:00,189 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:42:00,272 INFO L272 TraceCheckUtils]: 0: Hoare triple {1149#true} call ULTIMATE.init(); {1149#true} is VALID [2022-04-08 11:42:00,272 INFO L290 TraceCheckUtils]: 1: Hoare triple {1149#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);~counter~0 := 0; {1149#true} is VALID [2022-04-08 11:42:00,272 INFO L290 TraceCheckUtils]: 2: Hoare triple {1149#true} assume true; {1149#true} is VALID [2022-04-08 11:42:00,273 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1149#true} {1149#true} #82#return; {1149#true} is VALID [2022-04-08 11:42:00,273 INFO L272 TraceCheckUtils]: 4: Hoare triple {1149#true} call #t~ret4 := main(); {1149#true} is VALID [2022-04-08 11:42:00,273 INFO L290 TraceCheckUtils]: 5: Hoare triple {1149#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {1169#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} is VALID [2022-04-08 11:42:00,273 INFO L290 TraceCheckUtils]: 6: Hoare triple {1169#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {1169#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} is VALID [2022-04-08 11:42:00,274 INFO L290 TraceCheckUtils]: 7: Hoare triple {1169#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} assume !!(#t~post2 < 2);havoc #t~post2; {1169#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} is VALID [2022-04-08 11:42:00,276 INFO L290 TraceCheckUtils]: 8: Hoare triple {1169#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {1169#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} is VALID [2022-04-08 11:42:00,276 INFO L290 TraceCheckUtils]: 9: Hoare triple {1169#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {1169#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} is VALID [2022-04-08 11:42:00,277 INFO L290 TraceCheckUtils]: 10: Hoare triple {1169#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} assume !!(#t~post3 < 2);havoc #t~post3; {1169#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} is VALID [2022-04-08 11:42:00,277 INFO L272 TraceCheckUtils]: 11: Hoare triple {1169#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1149#true} is VALID [2022-04-08 11:42:00,277 INFO L290 TraceCheckUtils]: 12: Hoare triple {1149#true} ~cond := #in~cond; {1149#true} is VALID [2022-04-08 11:42:00,277 INFO L290 TraceCheckUtils]: 13: Hoare triple {1149#true} assume !(0 == ~cond); {1149#true} is VALID [2022-04-08 11:42:00,277 INFO L290 TraceCheckUtils]: 14: Hoare triple {1149#true} assume true; {1149#true} is VALID [2022-04-08 11:42:00,278 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1149#true} {1169#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} #78#return; {1169#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} is VALID [2022-04-08 11:42:00,278 INFO L290 TraceCheckUtils]: 16: Hoare triple {1169#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} assume !!(~b~0 % 4294967296 != ~B~0 % 4294967296);~q~0 := 2 * ~q~0;~b~0 := (if ~b~0 % 4294967296 < 0 && 0 != ~b~0 % 4294967296 % 2 then 1 + ~b~0 % 4294967296 / 2 else ~b~0 % 4294967296 / 2); {1150#false} is VALID [2022-04-08 11:42:00,278 INFO L290 TraceCheckUtils]: 17: Hoare triple {1150#false} assume ~r~0 % 4294967296 >= ~b~0 % 4294967296;~q~0 := 1 + ~q~0;~r~0 := ~r~0 - ~b~0; {1150#false} is VALID [2022-04-08 11:42:00,279 INFO L290 TraceCheckUtils]: 18: Hoare triple {1150#false} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {1150#false} is VALID [2022-04-08 11:42:00,279 INFO L290 TraceCheckUtils]: 19: Hoare triple {1150#false} assume !(#t~post3 < 2);havoc #t~post3; {1150#false} is VALID [2022-04-08 11:42:00,279 INFO L272 TraceCheckUtils]: 20: Hoare triple {1150#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1150#false} is VALID [2022-04-08 11:42:00,279 INFO L290 TraceCheckUtils]: 21: Hoare triple {1150#false} ~cond := #in~cond; {1150#false} is VALID [2022-04-08 11:42:00,279 INFO L290 TraceCheckUtils]: 22: Hoare triple {1150#false} assume 0 == ~cond; {1150#false} is VALID [2022-04-08 11:42:00,279 INFO L290 TraceCheckUtils]: 23: Hoare triple {1150#false} assume !false; {1150#false} is VALID [2022-04-08 11:42:00,279 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 11:42:00,279 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 11:42:00,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:42:00,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413448051] [2022-04-08 11:42:00,280 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:42:00,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [688808043] [2022-04-08 11:42:00,280 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [688808043] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:42:00,280 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:42:00,280 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 11:42:00,280 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:42:00,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1050036426] [2022-04-08 11:42:00,280 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1050036426] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:42:00,280 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:42:00,280 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 11:42:00,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797304360] [2022-04-08 11:42:00,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:42:00,281 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2022-04-08 11:42:00,281 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:42:00,281 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 11:42:00,297 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:42:00,297 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-08 11:42:00,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:42:00,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-08 11:42:00,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 11:42:00,298 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 11:42:00,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:42:00,366 INFO L93 Difference]: Finished difference Result 58 states and 70 transitions. [2022-04-08 11:42:00,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-08 11:42:00,366 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2022-04-08 11:42:00,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:42:00,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 11:42:00,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2022-04-08 11:42:00,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 11:42:00,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2022-04-08 11:42:00,368 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 50 transitions. [2022-04-08 11:42:00,406 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:42:00,407 INFO L225 Difference]: With dead ends: 58 [2022-04-08 11:42:00,407 INFO L226 Difference]: Without dead ends: 33 [2022-04-08 11:42:00,407 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 11:42:00,408 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 0 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 11:42:00,408 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 42 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 11:42:00,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-08 11:42:00,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-04-08 11:42:00,423 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:42:00,423 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 33 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 11:42:00,424 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 33 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 11:42:00,424 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 33 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 11:42:00,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:42:00,425 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2022-04-08 11:42:00,425 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2022-04-08 11:42:00,425 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:42:00,425 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:42:00,425 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 33 states. [2022-04-08 11:42:00,426 INFO L87 Difference]: Start difference. First operand has 33 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 33 states. [2022-04-08 11:42:00,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:42:00,427 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2022-04-08 11:42:00,427 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2022-04-08 11:42:00,427 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:42:00,427 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:42:00,427 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:42:00,427 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:42:00,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 11:42:00,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2022-04-08 11:42:00,428 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 24 [2022-04-08 11:42:00,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:42:00,428 INFO L478 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2022-04-08 11:42:00,428 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 11:42:00,428 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 39 transitions. [2022-04-08 11:42:00,466 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:42:00,466 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2022-04-08 11:42:00,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-08 11:42:00,467 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:42:00,467 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 11:42:00,484 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-08 11:42:00,683 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:42:00,684 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:42:00,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:42:00,685 INFO L85 PathProgramCache]: Analyzing trace with hash 76649582, now seen corresponding path program 1 times [2022-04-08 11:42:00,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:42:00,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [393361753] [2022-04-08 11:42:00,710 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 11:42:00,711 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 11:42:00,711 INFO L85 PathProgramCache]: Analyzing trace with hash 76649582, now seen corresponding path program 2 times [2022-04-08 11:42:00,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:42:00,711 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314385136] [2022-04-08 11:42:00,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:42:00,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:42:00,721 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:42:00,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [524347130] [2022-04-08 11:42:00,722 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 11:42:00,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:42:00,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:42:00,725 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 11:42:00,750 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-08 11:42:00,786 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 11:42:00,786 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:42:00,786 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 11:42:00,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:42:00,799 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:42:00,911 INFO L272 TraceCheckUtils]: 0: Hoare triple {1471#true} call ULTIMATE.init(); {1471#true} is VALID [2022-04-08 11:42:00,914 INFO L290 TraceCheckUtils]: 1: Hoare triple {1471#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);~counter~0 := 0; {1479#(<= ~counter~0 0)} is VALID [2022-04-08 11:42:00,914 INFO L290 TraceCheckUtils]: 2: Hoare triple {1479#(<= ~counter~0 0)} assume true; {1479#(<= ~counter~0 0)} is VALID [2022-04-08 11:42:00,915 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1479#(<= ~counter~0 0)} {1471#true} #82#return; {1479#(<= ~counter~0 0)} is VALID [2022-04-08 11:42:00,915 INFO L272 TraceCheckUtils]: 4: Hoare triple {1479#(<= ~counter~0 0)} call #t~ret4 := main(); {1479#(<= ~counter~0 0)} is VALID [2022-04-08 11:42:00,915 INFO L290 TraceCheckUtils]: 5: Hoare triple {1479#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {1479#(<= ~counter~0 0)} is VALID [2022-04-08 11:42:00,916 INFO L290 TraceCheckUtils]: 6: Hoare triple {1479#(<= ~counter~0 0)} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {1495#(<= ~counter~0 1)} is VALID [2022-04-08 11:42:00,916 INFO L290 TraceCheckUtils]: 7: Hoare triple {1495#(<= ~counter~0 1)} assume !!(#t~post2 < 2);havoc #t~post2; {1495#(<= ~counter~0 1)} is VALID [2022-04-08 11:42:00,916 INFO L290 TraceCheckUtils]: 8: Hoare triple {1495#(<= ~counter~0 1)} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {1495#(<= ~counter~0 1)} is VALID [2022-04-08 11:42:00,917 INFO L290 TraceCheckUtils]: 9: Hoare triple {1495#(<= ~counter~0 1)} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {1505#(<= |main_#t~post2| 1)} is VALID [2022-04-08 11:42:00,917 INFO L290 TraceCheckUtils]: 10: Hoare triple {1505#(<= |main_#t~post2| 1)} assume !(#t~post2 < 2);havoc #t~post2; {1472#false} is VALID [2022-04-08 11:42:00,917 INFO L290 TraceCheckUtils]: 11: Hoare triple {1472#false} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {1472#false} is VALID [2022-04-08 11:42:00,917 INFO L290 TraceCheckUtils]: 12: Hoare triple {1472#false} assume !!(#t~post3 < 2);havoc #t~post3; {1472#false} is VALID [2022-04-08 11:42:00,917 INFO L272 TraceCheckUtils]: 13: Hoare triple {1472#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1472#false} is VALID [2022-04-08 11:42:00,918 INFO L290 TraceCheckUtils]: 14: Hoare triple {1472#false} ~cond := #in~cond; {1472#false} is VALID [2022-04-08 11:42:00,918 INFO L290 TraceCheckUtils]: 15: Hoare triple {1472#false} assume !(0 == ~cond); {1472#false} is VALID [2022-04-08 11:42:00,918 INFO L290 TraceCheckUtils]: 16: Hoare triple {1472#false} assume true; {1472#false} is VALID [2022-04-08 11:42:00,918 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1472#false} {1472#false} #78#return; {1472#false} is VALID [2022-04-08 11:42:00,918 INFO L290 TraceCheckUtils]: 18: Hoare triple {1472#false} assume !!(~b~0 % 4294967296 != ~B~0 % 4294967296);~q~0 := 2 * ~q~0;~b~0 := (if ~b~0 % 4294967296 < 0 && 0 != ~b~0 % 4294967296 % 2 then 1 + ~b~0 % 4294967296 / 2 else ~b~0 % 4294967296 / 2); {1472#false} is VALID [2022-04-08 11:42:00,918 INFO L290 TraceCheckUtils]: 19: Hoare triple {1472#false} assume ~r~0 % 4294967296 >= ~b~0 % 4294967296;~q~0 := 1 + ~q~0;~r~0 := ~r~0 - ~b~0; {1472#false} is VALID [2022-04-08 11:42:00,918 INFO L290 TraceCheckUtils]: 20: Hoare triple {1472#false} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {1472#false} is VALID [2022-04-08 11:42:00,918 INFO L290 TraceCheckUtils]: 21: Hoare triple {1472#false} assume !(#t~post3 < 2);havoc #t~post3; {1472#false} is VALID [2022-04-08 11:42:00,918 INFO L272 TraceCheckUtils]: 22: Hoare triple {1472#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1472#false} is VALID [2022-04-08 11:42:00,918 INFO L290 TraceCheckUtils]: 23: Hoare triple {1472#false} ~cond := #in~cond; {1472#false} is VALID [2022-04-08 11:42:00,918 INFO L290 TraceCheckUtils]: 24: Hoare triple {1472#false} assume 0 == ~cond; {1472#false} is VALID [2022-04-08 11:42:00,918 INFO L290 TraceCheckUtils]: 25: Hoare triple {1472#false} assume !false; {1472#false} is VALID [2022-04-08 11:42:00,919 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 11:42:00,919 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 11:42:01,059 INFO L290 TraceCheckUtils]: 25: Hoare triple {1472#false} assume !false; {1472#false} is VALID [2022-04-08 11:42:01,059 INFO L290 TraceCheckUtils]: 24: Hoare triple {1472#false} assume 0 == ~cond; {1472#false} is VALID [2022-04-08 11:42:01,059 INFO L290 TraceCheckUtils]: 23: Hoare triple {1472#false} ~cond := #in~cond; {1472#false} is VALID [2022-04-08 11:42:01,059 INFO L272 TraceCheckUtils]: 22: Hoare triple {1472#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1472#false} is VALID [2022-04-08 11:42:01,059 INFO L290 TraceCheckUtils]: 21: Hoare triple {1472#false} assume !(#t~post3 < 2);havoc #t~post3; {1472#false} is VALID [2022-04-08 11:42:01,059 INFO L290 TraceCheckUtils]: 20: Hoare triple {1472#false} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {1472#false} is VALID [2022-04-08 11:42:01,060 INFO L290 TraceCheckUtils]: 19: Hoare triple {1472#false} assume ~r~0 % 4294967296 >= ~b~0 % 4294967296;~q~0 := 1 + ~q~0;~r~0 := ~r~0 - ~b~0; {1472#false} is VALID [2022-04-08 11:42:01,060 INFO L290 TraceCheckUtils]: 18: Hoare triple {1472#false} assume !!(~b~0 % 4294967296 != ~B~0 % 4294967296);~q~0 := 2 * ~q~0;~b~0 := (if ~b~0 % 4294967296 < 0 && 0 != ~b~0 % 4294967296 % 2 then 1 + ~b~0 % 4294967296 / 2 else ~b~0 % 4294967296 / 2); {1472#false} is VALID [2022-04-08 11:42:01,060 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1471#true} {1472#false} #78#return; {1472#false} is VALID [2022-04-08 11:42:01,060 INFO L290 TraceCheckUtils]: 16: Hoare triple {1471#true} assume true; {1471#true} is VALID [2022-04-08 11:42:01,060 INFO L290 TraceCheckUtils]: 15: Hoare triple {1471#true} assume !(0 == ~cond); {1471#true} is VALID [2022-04-08 11:42:01,060 INFO L290 TraceCheckUtils]: 14: Hoare triple {1471#true} ~cond := #in~cond; {1471#true} is VALID [2022-04-08 11:42:01,060 INFO L272 TraceCheckUtils]: 13: Hoare triple {1472#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1471#true} is VALID [2022-04-08 11:42:01,060 INFO L290 TraceCheckUtils]: 12: Hoare triple {1472#false} assume !!(#t~post3 < 2);havoc #t~post3; {1472#false} is VALID [2022-04-08 11:42:01,060 INFO L290 TraceCheckUtils]: 11: Hoare triple {1472#false} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {1472#false} is VALID [2022-04-08 11:42:01,061 INFO L290 TraceCheckUtils]: 10: Hoare triple {1505#(<= |main_#t~post2| 1)} assume !(#t~post2 < 2);havoc #t~post2; {1472#false} is VALID [2022-04-08 11:42:01,061 INFO L290 TraceCheckUtils]: 9: Hoare triple {1495#(<= ~counter~0 1)} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {1505#(<= |main_#t~post2| 1)} is VALID [2022-04-08 11:42:01,061 INFO L290 TraceCheckUtils]: 8: Hoare triple {1495#(<= ~counter~0 1)} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {1495#(<= ~counter~0 1)} is VALID [2022-04-08 11:42:01,062 INFO L290 TraceCheckUtils]: 7: Hoare triple {1495#(<= ~counter~0 1)} assume !!(#t~post2 < 2);havoc #t~post2; {1495#(<= ~counter~0 1)} is VALID [2022-04-08 11:42:01,062 INFO L290 TraceCheckUtils]: 6: Hoare triple {1479#(<= ~counter~0 0)} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {1495#(<= ~counter~0 1)} is VALID [2022-04-08 11:42:01,062 INFO L290 TraceCheckUtils]: 5: Hoare triple {1479#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {1479#(<= ~counter~0 0)} is VALID [2022-04-08 11:42:01,063 INFO L272 TraceCheckUtils]: 4: Hoare triple {1479#(<= ~counter~0 0)} call #t~ret4 := main(); {1479#(<= ~counter~0 0)} is VALID [2022-04-08 11:42:01,063 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1479#(<= ~counter~0 0)} {1471#true} #82#return; {1479#(<= ~counter~0 0)} is VALID [2022-04-08 11:42:01,063 INFO L290 TraceCheckUtils]: 2: Hoare triple {1479#(<= ~counter~0 0)} assume true; {1479#(<= ~counter~0 0)} is VALID [2022-04-08 11:42:01,064 INFO L290 TraceCheckUtils]: 1: Hoare triple {1471#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);~counter~0 := 0; {1479#(<= ~counter~0 0)} is VALID [2022-04-08 11:42:01,064 INFO L272 TraceCheckUtils]: 0: Hoare triple {1471#true} call ULTIMATE.init(); {1471#true} is VALID [2022-04-08 11:42:01,064 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-08 11:42:01,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:42:01,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314385136] [2022-04-08 11:42:01,064 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:42:01,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [524347130] [2022-04-08 11:42:01,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [524347130] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 11:42:01,065 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 11:42:01,065 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2022-04-08 11:42:01,065 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:42:01,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [393361753] [2022-04-08 11:42:01,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [393361753] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:42:01,065 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:42:01,065 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 11:42:01,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389625979] [2022-04-08 11:42:01,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:42:01,066 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 26 [2022-04-08 11:42:01,066 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:42:01,066 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 11:42:01,083 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:42:01,083 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 11:42:01,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:42:01,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 11:42:01,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-08 11:42:01,084 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 11:42:01,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:42:01,182 INFO L93 Difference]: Finished difference Result 56 states and 67 transitions. [2022-04-08 11:42:01,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 11:42:01,182 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 26 [2022-04-08 11:42:01,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:42:01,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 11:42:01,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 47 transitions. [2022-04-08 11:42:01,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 11:42:01,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 47 transitions. [2022-04-08 11:42:01,184 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 47 transitions. [2022-04-08 11:42:01,219 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:42:01,220 INFO L225 Difference]: With dead ends: 56 [2022-04-08 11:42:01,220 INFO L226 Difference]: Without dead ends: 35 [2022-04-08 11:42:01,220 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-08 11:42:01,220 INFO L913 BasicCegarLoop]: 24 mSDtfsCounter, 2 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 11:42:01,221 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 66 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 11:42:01,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-08 11:42:01,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-04-08 11:42:01,239 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:42:01,239 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 35 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 27 states have internal predecessors, (33), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 11:42:01,239 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 35 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 27 states have internal predecessors, (33), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 11:42:01,239 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 35 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 27 states have internal predecessors, (33), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 11:42:01,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:42:01,240 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2022-04-08 11:42:01,240 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2022-04-08 11:42:01,240 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:42:01,241 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:42:01,241 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 27 states have internal predecessors, (33), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 35 states. [2022-04-08 11:42:01,241 INFO L87 Difference]: Start difference. First operand has 35 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 27 states have internal predecessors, (33), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 35 states. [2022-04-08 11:42:01,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:42:01,242 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2022-04-08 11:42:01,242 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2022-04-08 11:42:01,242 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:42:01,242 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:42:01,242 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:42:01,242 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:42:01,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 27 states have internal predecessors, (33), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 11:42:01,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2022-04-08 11:42:01,243 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 26 [2022-04-08 11:42:01,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:42:01,243 INFO L478 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2022-04-08 11:42:01,243 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 11:42:01,243 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 41 transitions. [2022-04-08 11:42:01,280 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:42:01,280 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2022-04-08 11:42:01,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-08 11:42:01,280 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:42:01,280 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 11:42:01,297 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-08 11:42:01,491 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:42:01,491 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:42:01,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:42:01,492 INFO L85 PathProgramCache]: Analyzing trace with hash -1817538190, now seen corresponding path program 1 times [2022-04-08 11:42:01,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:42:01,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [611659244] [2022-04-08 11:42:01,501 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 11:42:01,502 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 11:42:01,502 INFO L85 PathProgramCache]: Analyzing trace with hash -1817538190, now seen corresponding path program 2 times [2022-04-08 11:42:01,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:42:01,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200926291] [2022-04-08 11:42:01,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:42:01,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:42:01,512 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:42:01,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [324723837] [2022-04-08 11:42:01,512 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 11:42:01,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:42:01,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:42:01,513 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 11:42:01,514 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-08 11:42:01,551 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 11:42:01,551 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:42:01,552 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-08 11:42:01,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:42:01,565 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:42:01,736 INFO L272 TraceCheckUtils]: 0: Hoare triple {1885#true} call ULTIMATE.init(); {1885#true} is VALID [2022-04-08 11:42:01,737 INFO L290 TraceCheckUtils]: 1: Hoare triple {1885#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);~counter~0 := 0; {1893#(<= 0 ~counter~0)} is VALID [2022-04-08 11:42:01,737 INFO L290 TraceCheckUtils]: 2: Hoare triple {1893#(<= 0 ~counter~0)} assume true; {1893#(<= 0 ~counter~0)} is VALID [2022-04-08 11:42:01,737 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1893#(<= 0 ~counter~0)} {1885#true} #82#return; {1893#(<= 0 ~counter~0)} is VALID [2022-04-08 11:42:01,738 INFO L272 TraceCheckUtils]: 4: Hoare triple {1893#(<= 0 ~counter~0)} call #t~ret4 := main(); {1893#(<= 0 ~counter~0)} is VALID [2022-04-08 11:42:01,738 INFO L290 TraceCheckUtils]: 5: Hoare triple {1893#(<= 0 ~counter~0)} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {1893#(<= 0 ~counter~0)} is VALID [2022-04-08 11:42:01,738 INFO L290 TraceCheckUtils]: 6: Hoare triple {1893#(<= 0 ~counter~0)} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {1909#(<= 1 ~counter~0)} is VALID [2022-04-08 11:42:01,739 INFO L290 TraceCheckUtils]: 7: Hoare triple {1909#(<= 1 ~counter~0)} assume !!(#t~post2 < 2);havoc #t~post2; {1909#(<= 1 ~counter~0)} is VALID [2022-04-08 11:42:01,739 INFO L290 TraceCheckUtils]: 8: Hoare triple {1909#(<= 1 ~counter~0)} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {1909#(<= 1 ~counter~0)} is VALID [2022-04-08 11:42:01,740 INFO L290 TraceCheckUtils]: 9: Hoare triple {1909#(<= 1 ~counter~0)} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {1919#(<= 2 ~counter~0)} is VALID [2022-04-08 11:42:01,740 INFO L290 TraceCheckUtils]: 10: Hoare triple {1919#(<= 2 ~counter~0)} assume !!(#t~post2 < 2);havoc #t~post2; {1919#(<= 2 ~counter~0)} is VALID [2022-04-08 11:42:01,740 INFO L290 TraceCheckUtils]: 11: Hoare triple {1919#(<= 2 ~counter~0)} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {1919#(<= 2 ~counter~0)} is VALID [2022-04-08 11:42:01,741 INFO L290 TraceCheckUtils]: 12: Hoare triple {1919#(<= 2 ~counter~0)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {1929#(<= 2 |main_#t~post3|)} is VALID [2022-04-08 11:42:01,741 INFO L290 TraceCheckUtils]: 13: Hoare triple {1929#(<= 2 |main_#t~post3|)} assume !!(#t~post3 < 2);havoc #t~post3; {1886#false} is VALID [2022-04-08 11:42:01,741 INFO L272 TraceCheckUtils]: 14: Hoare triple {1886#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1886#false} is VALID [2022-04-08 11:42:01,741 INFO L290 TraceCheckUtils]: 15: Hoare triple {1886#false} ~cond := #in~cond; {1886#false} is VALID [2022-04-08 11:42:01,741 INFO L290 TraceCheckUtils]: 16: Hoare triple {1886#false} assume !(0 == ~cond); {1886#false} is VALID [2022-04-08 11:42:01,741 INFO L290 TraceCheckUtils]: 17: Hoare triple {1886#false} assume true; {1886#false} is VALID [2022-04-08 11:42:01,741 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1886#false} {1886#false} #78#return; {1886#false} is VALID [2022-04-08 11:42:01,741 INFO L290 TraceCheckUtils]: 19: Hoare triple {1886#false} assume !!(~b~0 % 4294967296 != ~B~0 % 4294967296);~q~0 := 2 * ~q~0;~b~0 := (if ~b~0 % 4294967296 < 0 && 0 != ~b~0 % 4294967296 % 2 then 1 + ~b~0 % 4294967296 / 2 else ~b~0 % 4294967296 / 2); {1886#false} is VALID [2022-04-08 11:42:01,741 INFO L290 TraceCheckUtils]: 20: Hoare triple {1886#false} assume ~r~0 % 4294967296 >= ~b~0 % 4294967296;~q~0 := 1 + ~q~0;~r~0 := ~r~0 - ~b~0; {1886#false} is VALID [2022-04-08 11:42:01,741 INFO L290 TraceCheckUtils]: 21: Hoare triple {1886#false} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {1886#false} is VALID [2022-04-08 11:42:01,742 INFO L290 TraceCheckUtils]: 22: Hoare triple {1886#false} assume !(#t~post3 < 2);havoc #t~post3; {1886#false} is VALID [2022-04-08 11:42:01,742 INFO L272 TraceCheckUtils]: 23: Hoare triple {1886#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1886#false} is VALID [2022-04-08 11:42:01,742 INFO L290 TraceCheckUtils]: 24: Hoare triple {1886#false} ~cond := #in~cond; {1886#false} is VALID [2022-04-08 11:42:01,742 INFO L290 TraceCheckUtils]: 25: Hoare triple {1886#false} assume 0 == ~cond; {1886#false} is VALID [2022-04-08 11:42:01,742 INFO L290 TraceCheckUtils]: 26: Hoare triple {1886#false} assume !false; {1886#false} is VALID [2022-04-08 11:42:01,742 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-08 11:42:01,742 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 11:42:01,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:42:01,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200926291] [2022-04-08 11:42:01,742 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:42:01,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [324723837] [2022-04-08 11:42:01,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [324723837] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:42:01,742 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:42:01,742 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 11:42:01,743 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:42:01,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [611659244] [2022-04-08 11:42:01,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [611659244] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:42:01,743 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:42:01,743 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 11:42:01,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548918187] [2022-04-08 11:42:01,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:42:01,743 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 27 [2022-04-08 11:42:01,743 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:42:01,744 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 11:42:01,764 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:42:01,764 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 11:42:01,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:42:01,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 11:42:01,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-08 11:42:01,765 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 11:42:01,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:42:01,839 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2022-04-08 11:42:01,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 11:42:01,840 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 27 [2022-04-08 11:42:01,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:42:01,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 11:42:01,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 32 transitions. [2022-04-08 11:42:01,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 11:42:01,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 32 transitions. [2022-04-08 11:42:01,842 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 32 transitions. [2022-04-08 11:42:01,865 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:42:01,865 INFO L225 Difference]: With dead ends: 37 [2022-04-08 11:42:01,865 INFO L226 Difference]: Without dead ends: 0 [2022-04-08 11:42:01,865 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-04-08 11:42:01,866 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 5 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 11:42:01,866 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 33 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 11:42:01,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-08 11:42:01,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-08 11:42:01,866 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:42:01,866 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 11:42:01,867 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 11:42:01,867 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 11:42:01,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:42:01,867 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 11:42:01,867 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 11:42:01,867 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:42:01,867 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:42:01,867 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-08 11:42:01,867 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-08 11:42:01,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:42:01,867 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 11:42:01,867 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 11:42:01,867 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:42:01,867 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:42:01,867 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:42:01,867 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:42:01,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 11:42:01,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-08 11:42:01,868 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 27 [2022-04-08 11:42:01,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:42:01,868 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-08 11:42:01,868 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 11:42:01,868 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-08 11:42:01,868 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:42:01,868 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 11:42:01,868 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:42:01,870 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-08 11:42:01,887 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-04-08 11:42:02,077 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:42:02,079 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-08 11:42:02,475 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 12) no Hoare annotation was computed. [2022-04-08 11:42:02,475 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 12) no Hoare annotation was computed. [2022-04-08 11:42:02,475 INFO L882 garLoopResultBuilder]: For program point L12-1(line 12) no Hoare annotation was computed. [2022-04-08 11:42:02,475 INFO L882 garLoopResultBuilder]: For program point L16(line 16) no Hoare annotation was computed. [2022-04-08 11:42:02,476 INFO L882 garLoopResultBuilder]: For program point L16-2(lines 15 17) no Hoare annotation was computed. [2022-04-08 11:42:02,476 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 15 17) no Hoare annotation was computed. [2022-04-08 11:42:02,476 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 15 17) no Hoare annotation was computed. [2022-04-08 11:42:02,476 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 26 50) the Hoare annotation is: true [2022-04-08 11:42:02,476 INFO L885 garLoopResultBuilder]: At program point L48(line 48) the Hoare annotation is: true [2022-04-08 11:42:02,476 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 26 50) the Hoare annotation is: true [2022-04-08 11:42:02,476 INFO L878 garLoopResultBuilder]: At program point L38(lines 38 47) the Hoare annotation is: (let ((.cse0 (= main_~A~0 main_~r~0)) (.cse1 (= main_~q~0 0))) (or (not (<= |old(~counter~0)| 0)) (and (<= 2 ~counter~0) .cse0 (<= 2 |main_#t~post3|) .cse1) (and .cse0 (= main_~B~0 main_~b~0) .cse1 (= main_~B~0 1)) (not (<= 0 |old(~counter~0)|)))) [2022-04-08 11:42:02,476 INFO L878 garLoopResultBuilder]: At program point L38-2(lines 38 47) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (and (= main_~A~0 main_~r~0) (= main_~q~0 0)) (not (<= 0 |old(~counter~0)|))) [2022-04-08 11:42:02,476 INFO L878 garLoopResultBuilder]: At program point L34-1(lines 34 37) the Hoare annotation is: (let ((.cse0 (= main_~A~0 main_~r~0)) (.cse1 (= main_~q~0 0))) (or (and (<= 2 ~counter~0) .cse0 .cse1) (not (<= |old(~counter~0)| 0)) (and (<= |main_#t~post2| 0) .cse0 (<= 1 ~counter~0) (= main_~B~0 main_~b~0) .cse1 (= main_~B~0 1)) (not (<= 0 |old(~counter~0)|)))) [2022-04-08 11:42:02,476 INFO L878 garLoopResultBuilder]: At program point L34-3(lines 34 37) the Hoare annotation is: (let ((.cse0 (= main_~A~0 main_~r~0)) (.cse1 (= main_~q~0 0))) (or (not (<= |old(~counter~0)| 0)) (and .cse0 (<= 0 ~counter~0) (= main_~B~0 main_~b~0) .cse1 (= main_~B~0 1)) (and .cse0 (<= 1 ~counter~0) .cse1) (not (<= 0 |old(~counter~0)|)))) [2022-04-08 11:42:02,476 INFO L878 garLoopResultBuilder]: At program point mainENTRY(lines 26 50) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (and (<= 0 ~counter~0) (<= ~counter~0 0)) (not (<= 0 |old(~counter~0)|))) [2022-04-08 11:42:02,476 INFO L878 garLoopResultBuilder]: At program point L43(lines 43 46) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (not (<= 0 |old(~counter~0)|))) [2022-04-08 11:42:02,476 INFO L878 garLoopResultBuilder]: At program point L43-2(lines 26 50) the Hoare annotation is: (let ((.cse0 (= main_~A~0 main_~r~0)) (.cse1 (= main_~q~0 0))) (or (and (<= 2 ~counter~0) .cse0 .cse1) (not (<= |old(~counter~0)| 0)) (and .cse0 (= main_~B~0 main_~b~0) .cse1 (= main_~B~0 1)) (not (<= 0 |old(~counter~0)|)))) [2022-04-08 11:42:02,476 INFO L878 garLoopResultBuilder]: At program point L39(line 39) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (and (= main_~A~0 main_~r~0) (= main_~B~0 main_~b~0) (= main_~q~0 0) (= main_~B~0 1)) (not (<= 0 |old(~counter~0)|))) [2022-04-08 11:42:02,477 INFO L878 garLoopResultBuilder]: At program point L39-1(lines 38 47) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (and (= main_~A~0 main_~r~0) (= main_~B~0 main_~b~0) (= main_~q~0 0) (= main_~B~0 1)) (not (<= 0 |old(~counter~0)|))) [2022-04-08 11:42:02,477 INFO L878 garLoopResultBuilder]: At program point L35(line 35) the Hoare annotation is: (let ((.cse0 (= main_~A~0 main_~r~0)) (.cse1 (= main_~q~0 0))) (or (and .cse0 (<= 1 ~counter~0) (= main_~B~0 main_~b~0) .cse1 (= main_~B~0 1)) (and (<= 2 ~counter~0) .cse0 .cse1) (not (<= |old(~counter~0)| 0)) (not (<= 0 |old(~counter~0)|)))) [2022-04-08 11:42:02,477 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: (and (<= 0 ~counter~0) (<= ~counter~0 0)) [2022-04-08 11:42:02,477 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-08 11:42:02,477 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: (and (<= 0 ~counter~0) (<= ~counter~0 0)) [2022-04-08 11:42:02,477 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-08 11:42:02,477 INFO L878 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: (and (<= 0 ~counter~0) (<= ~counter~0 0)) [2022-04-08 11:42:02,477 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-08 11:42:02,477 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-08 11:42:02,477 INFO L878 garLoopResultBuilder]: At program point L19-2(lines 18 24) the Hoare annotation is: (or (not (<= 1 |__VERIFIER_assert_#in~cond|)) (<= 1 __VERIFIER_assert_~cond)) [2022-04-08 11:42:02,477 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 18 24) the Hoare annotation is: true [2022-04-08 11:42:02,477 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 18 24) the Hoare annotation is: (or (not (<= 1 |__VERIFIER_assert_#in~cond|)) (<= 1 __VERIFIER_assert_~cond)) [2022-04-08 11:42:02,477 INFO L878 garLoopResultBuilder]: At program point L20(lines 20 21) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-04-08 11:42:02,477 INFO L878 garLoopResultBuilder]: At program point L19(lines 19 22) the Hoare annotation is: (or (not (<= 1 |__VERIFIER_assert_#in~cond|)) (<= 1 __VERIFIER_assert_~cond)) [2022-04-08 11:42:02,477 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 21) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-04-08 11:42:02,479 INFO L719 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 2, 2, 2, 2] [2022-04-08 11:42:02,480 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-08 11:42:02,482 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-08 11:42:02,482 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-08 11:42:02,483 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-08 11:42:02,485 WARN L170 areAnnotationChecker]: L12-1 has no Hoare annotation [2022-04-08 11:42:02,486 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-08 11:42:02,486 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-08 11:42:02,490 WARN L170 areAnnotationChecker]: L16-2 has no Hoare annotation [2022-04-08 11:42:02,507 INFO L163 areAnnotationChecker]: CFG has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-08 11:42:02,520 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.04 11:42:02 BoogieIcfgContainer [2022-04-08 11:42:02,520 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-08 11:42:02,521 INFO L158 Benchmark]: Toolchain (without parser) took 7912.22ms. Allocated memory was 191.9MB in the beginning and 238.0MB in the end (delta: 46.1MB). Free memory was 136.8MB in the beginning and 153.4MB in the end (delta: -16.6MB). Peak memory consumption was 30.6MB. Max. memory is 8.0GB. [2022-04-08 11:42:02,521 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 191.9MB. Free memory is still 152.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 11:42:02,521 INFO L158 Benchmark]: CACSL2BoogieTranslator took 207.16ms. Allocated memory was 191.9MB in the beginning and 238.0MB in the end (delta: 46.1MB). Free memory was 136.6MB in the beginning and 210.5MB in the end (delta: -73.9MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-04-08 11:42:02,521 INFO L158 Benchmark]: Boogie Preprocessor took 26.86ms. Allocated memory is still 238.0MB. Free memory was 210.5MB in the beginning and 209.2MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-08 11:42:02,522 INFO L158 Benchmark]: RCFGBuilder took 286.94ms. Allocated memory is still 238.0MB. Free memory was 209.2MB in the beginning and 196.8MB in the end (delta: 12.4MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-08 11:42:02,522 INFO L158 Benchmark]: TraceAbstraction took 7387.17ms. Allocated memory is still 238.0MB. Free memory was 196.6MB in the beginning and 153.4MB in the end (delta: 43.2MB). Peak memory consumption was 44.3MB. Max. memory is 8.0GB. [2022-04-08 11:42:02,523 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 191.9MB. Free memory is still 152.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 207.16ms. Allocated memory was 191.9MB in the beginning and 238.0MB in the end (delta: 46.1MB). Free memory was 136.6MB in the beginning and 210.5MB in the end (delta: -73.9MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * Boogie Preprocessor took 26.86ms. Allocated memory is still 238.0MB. Free memory was 210.5MB in the beginning and 209.2MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 286.94ms. Allocated memory is still 238.0MB. Free memory was 209.2MB in the beginning and 196.8MB in the end (delta: 12.4MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 7387.17ms. Allocated memory is still 238.0MB. Free memory was 196.6MB in the beginning and 153.4MB in the end (delta: 43.2MB). Peak memory consumption was 44.3MB. 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: 21]: 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, 33 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.3s, OverallIterations: 8, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 3.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.4s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 42 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 40 mSDsluCounter, 463 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 285 mSDsCounter, 17 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 183 IncrementalHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 17 mSolverCounterUnsat, 178 mSDtfsCounter, 183 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 159 GetRequests, 131 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=35occurred in iteration=7, InterpolantAutomatonStates: 40, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 11 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 26 LocationsWithAnnotation, 122 PreInvPairs, 160 NumberOfFragments, 330 HoareAnnotationTreeSize, 122 FomulaSimplifications, 3 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 26 FomulaSimplificationsInter, 239 FormulaSimplificationTreeSizeReductionInter, 0.3s 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: 34]: Loop Invariant Derived loop invariant: ((!(\old(counter) <= 0) || ((((A == r && 0 <= counter) && B == b) && q == 0) && B == 1)) || ((A == r && 1 <= counter) && q == 0)) || !(0 <= \old(counter)) - ProcedureContractResult [Line: 26]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 18]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: !(1 <= \old(cond)) || 1 <= cond RESULT: Ultimate proved your program to be correct! [2022-04-08 11:42:02,550 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...