/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_valuebound10.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 11:44:59,923 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 11:44:59,924 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 11:44:59,989 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 11:44:59,989 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 11:44:59,990 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 11:44:59,992 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 11:44:59,994 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 11:44:59,995 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 11:44:59,999 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 11:44:59,999 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 11:45:00,000 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 11:45:00,001 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 11:45:00,002 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 11:45:00,003 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 11:45:00,005 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 11:45:00,005 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 11:45:00,006 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 11:45:00,008 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 11:45:00,011 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 11:45:00,013 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 11:45:00,014 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 11:45:00,014 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 11:45:00,015 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 11:45:00,016 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 11:45:00,021 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 11:45:00,021 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 11:45:00,021 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 11:45:00,022 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 11:45:00,022 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 11:45:00,023 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 11:45:00,023 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 11:45:00,024 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 11:45:00,025 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 11:45:00,025 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 11:45:00,026 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 11:45:00,026 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 11:45:00,026 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 11:45:00,026 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 11:45:00,026 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 11:45:00,027 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 11:45:00,028 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 11:45:00,029 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-28 11:45:00,037 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 11:45:00,037 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 11:45:00,038 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 11:45:00,038 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 11:45:00,038 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 11:45:00,038 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 11:45:00,038 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 11:45:00,038 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 11:45:00,039 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 11:45:00,039 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 11:45:00,039 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 11:45:00,039 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 11:45:00,039 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 11:45:00,039 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 11:45:00,040 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 11:45:00,040 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 11:45:00,040 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 11:45:00,040 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 11:45:00,040 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 11:45:00,040 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 11:45:00,040 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 11:45:00,040 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-28 11:45:00,040 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-28 11:45:00,257 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 11:45:00,274 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 11:45:00,276 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 11:45:00,277 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 11:45:00,277 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 11:45:00,278 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/divbin2_valuebound10.i [2022-04-28 11:45:00,334 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cdb61e6d7/3ccb7e1f61ad49e48768b28336cb639f/FLAGe656c4050 [2022-04-28 11:45:00,715 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 11:45:00,715 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/divbin2_valuebound10.i [2022-04-28 11:45:00,720 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cdb61e6d7/3ccb7e1f61ad49e48768b28336cb639f/FLAGe656c4050 [2022-04-28 11:45:00,735 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cdb61e6d7/3ccb7e1f61ad49e48768b28336cb639f [2022-04-28 11:45:00,737 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 11:45:00,738 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 11:45:00,740 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 11:45:00,740 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 11:45:00,743 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 11:45:00,744 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 11:45:00" (1/1) ... [2022-04-28 11:45:00,745 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@708a3ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:45:00, skipping insertion in model container [2022-04-28 11:45:00,745 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 11:45:00" (1/1) ... [2022-04-28 11:45:00,750 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 11:45:00,760 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 11:45:00,929 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_valuebound10.i[951,964] [2022-04-28 11:45:00,967 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 11:45:00,973 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 11:45:01,000 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_valuebound10.i[951,964] [2022-04-28 11:45:01,011 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 11:45:01,021 INFO L208 MainTranslator]: Completed translation [2022-04-28 11:45:01,021 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:45:01 WrapperNode [2022-04-28 11:45:01,021 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 11:45:01,022 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 11:45:01,022 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 11:45:01,023 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 11:45:01,029 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:45:01" (1/1) ... [2022-04-28 11:45:01,030 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:45:01" (1/1) ... [2022-04-28 11:45:01,034 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:45:01" (1/1) ... [2022-04-28 11:45:01,035 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:45:01" (1/1) ... [2022-04-28 11:45:01,045 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:45:01" (1/1) ... [2022-04-28 11:45:01,050 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:45:01" (1/1) ... [2022-04-28 11:45:01,054 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:45:01" (1/1) ... [2022-04-28 11:45:01,056 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 11:45:01,057 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 11:45:01,057 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 11:45:01,057 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 11:45:01,058 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:45:01" (1/1) ... [2022-04-28 11:45:01,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 11:45:01,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:45:01,077 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-28 11:45:01,089 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-28 11:45:01,114 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 11:45:01,114 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 11:45:01,114 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 11:45:01,114 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 11:45:01,114 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 11:45:01,115 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 11:45:01,115 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 11:45:01,115 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 11:45:01,115 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-28 11:45:01,115 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-28 11:45:01,115 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 11:45:01,115 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 11:45:01,116 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-28 11:45:01,116 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 11:45:01,116 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 11:45:01,117 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 11:45:01,117 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 11:45:01,117 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 11:45:01,117 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 11:45:01,117 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 11:45:01,117 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 11:45:01,117 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 11:45:01,194 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 11:45:01,196 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 11:45:01,305 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 11:45:01,310 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 11:45:01,310 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-28 11:45:01,312 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 11:45:01 BoogieIcfgContainer [2022-04-28 11:45:01,312 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 11:45:01,313 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 11:45:01,313 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 11:45:01,315 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 11:45:01,315 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 11:45:00" (1/3) ... [2022-04-28 11:45:01,316 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4318fbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 11:45:01, skipping insertion in model container [2022-04-28 11:45:01,316 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:45:01" (2/3) ... [2022-04-28 11:45:01,316 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4318fbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 11:45:01, skipping insertion in model container [2022-04-28 11:45:01,316 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 11:45:01" (3/3) ... [2022-04-28 11:45:01,317 INFO L111 eAbstractionObserver]: Analyzing ICFG divbin2_valuebound10.i [2022-04-28 11:45:01,326 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 11:45:01,326 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 11:45:01,353 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 11:45:01,357 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2fa929e9, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5129466f [2022-04-28 11:45:01,358 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 11:45:01,363 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 20 states have internal predecessors, (29), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 11:45:01,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-28 11:45:01,367 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:45:01,367 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:45:01,368 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:45:01,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:45:01,371 INFO L85 PathProgramCache]: Analyzing trace with hash 1171333446, now seen corresponding path program 1 times [2022-04-28 11:45:01,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:45:01,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [618350692] [2022-04-28 11:45:01,383 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 11:45:01,383 INFO L85 PathProgramCache]: Analyzing trace with hash 1171333446, now seen corresponding path program 2 times [2022-04-28 11:45:01,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:45:01,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028012542] [2022-04-28 11:45:01,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:45:01,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:45:01,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:45:01,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 11:45:01,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:45:01,493 INFO L290 TraceCheckUtils]: 0: Hoare triple {42#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {33#true} is VALID [2022-04-28 11:45:01,493 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#true} assume true; {33#true} is VALID [2022-04-28 11:45:01,493 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {33#true} {33#true} #84#return; {33#true} is VALID [2022-04-28 11:45:01,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 11:45:01,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:45:01,500 INFO L290 TraceCheckUtils]: 0: Hoare triple {33#true} ~cond := #in~cond; {33#true} is VALID [2022-04-28 11:45:01,500 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#true} assume 0 == ~cond;assume false; {34#false} is VALID [2022-04-28 11:45:01,500 INFO L290 TraceCheckUtils]: 2: Hoare triple {34#false} assume true; {34#false} is VALID [2022-04-28 11:45:01,501 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34#false} {33#true} #78#return; {34#false} is VALID [2022-04-28 11:45:01,501 INFO L272 TraceCheckUtils]: 0: Hoare triple {33#true} call ULTIMATE.init(); {42#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 11:45:01,502 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {33#true} is VALID [2022-04-28 11:45:01,502 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#true} assume true; {33#true} is VALID [2022-04-28 11:45:01,502 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#true} {33#true} #84#return; {33#true} is VALID [2022-04-28 11:45:01,502 INFO L272 TraceCheckUtils]: 4: Hoare triple {33#true} call #t~ret2 := main(); {33#true} is VALID [2022-04-28 11:45:01,502 INFO L290 TraceCheckUtils]: 5: Hoare triple {33#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1; {33#true} is VALID [2022-04-28 11:45:01,502 INFO L272 TraceCheckUtils]: 6: Hoare triple {33#true} call assume_abort_if_not((if ~A~0 % 4294967296 >= 0 && ~A~0 % 4294967296 <= 10 then 1 else 0)); {33#true} is VALID [2022-04-28 11:45:01,502 INFO L290 TraceCheckUtils]: 7: Hoare triple {33#true} ~cond := #in~cond; {33#true} is VALID [2022-04-28 11:45:01,503 INFO L290 TraceCheckUtils]: 8: Hoare triple {33#true} assume 0 == ~cond;assume false; {34#false} is VALID [2022-04-28 11:45:01,503 INFO L290 TraceCheckUtils]: 9: Hoare triple {34#false} assume true; {34#false} is VALID [2022-04-28 11:45:01,503 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {34#false} {33#true} #78#return; {34#false} is VALID [2022-04-28 11:45:01,503 INFO L290 TraceCheckUtils]: 11: Hoare triple {34#false} ~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {34#false} is VALID [2022-04-28 11:45:01,504 INFO L290 TraceCheckUtils]: 12: Hoare triple {34#false} assume !true; {34#false} is VALID [2022-04-28 11:45:01,504 INFO L290 TraceCheckUtils]: 13: Hoare triple {34#false} assume !true; {34#false} is VALID [2022-04-28 11:45:01,504 INFO L272 TraceCheckUtils]: 14: Hoare triple {34#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {34#false} is VALID [2022-04-28 11:45:01,504 INFO L290 TraceCheckUtils]: 15: Hoare triple {34#false} ~cond := #in~cond; {34#false} is VALID [2022-04-28 11:45:01,504 INFO L290 TraceCheckUtils]: 16: Hoare triple {34#false} assume 0 == ~cond; {34#false} is VALID [2022-04-28 11:45:01,504 INFO L290 TraceCheckUtils]: 17: Hoare triple {34#false} assume !false; {34#false} is VALID [2022-04-28 11:45:01,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 11:45:01,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:45:01,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028012542] [2022-04-28 11:45:01,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028012542] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:45:01,506 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:45:01,506 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 11:45:01,508 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:45:01,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [618350692] [2022-04-28 11:45:01,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [618350692] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:45:01,508 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:45:01,508 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 11:45:01,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828934907] [2022-04-28 11:45:01,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:45:01,512 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-28 11:45:01,513 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:45:01,515 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 11:45:01,530 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:45:01,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 11:45:01,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:45:01,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 11:45:01,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 11:45:01,544 INFO L87 Difference]: Start difference. First operand has 30 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 20 states have internal predecessors, (29), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 11:45:01,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:45:01,609 INFO L93 Difference]: Finished difference Result 51 states and 70 transitions. [2022-04-28 11:45:01,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 11:45:01,610 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-28 11:45:01,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:45:01,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 11:45:01,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2022-04-28 11:45:01,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 11:45:01,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2022-04-28 11:45:01,622 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 70 transitions. [2022-04-28 11:45:01,680 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:45:01,686 INFO L225 Difference]: With dead ends: 51 [2022-04-28 11:45:01,686 INFO L226 Difference]: Without dead ends: 25 [2022-04-28 11:45:01,689 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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-28 11:45:01,692 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 20 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 11:45:01,693 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 33 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 11:45:01,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-28 11:45:01,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-04-28 11:45:01,731 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:45:01,732 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 25 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 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-28 11:45:01,733 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 25 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 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-28 11:45:01,734 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 25 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 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-28 11:45:01,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:45:01,743 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2022-04-28 11:45:01,744 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-04-28 11:45:01,744 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:45:01,744 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:45:01,746 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 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 25 states. [2022-04-28 11:45:01,746 INFO L87 Difference]: Start difference. First operand has 25 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 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 25 states. [2022-04-28 11:45:01,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:45:01,753 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2022-04-28 11:45:01,753 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-04-28 11:45:01,753 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:45:01,754 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:45:01,754 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:45:01,754 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:45:01,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 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-28 11:45:01,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2022-04-28 11:45:01,757 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 18 [2022-04-28 11:45:01,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:45:01,757 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2022-04-28 11:45:01,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 11:45:01,758 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 28 transitions. [2022-04-28 11:45:01,817 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-28 11:45:01,817 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-04-28 11:45:01,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-28 11:45:01,818 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:45:01,818 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:45:01,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 11:45:01,818 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:45:01,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:45:01,819 INFO L85 PathProgramCache]: Analyzing trace with hash -73515422, now seen corresponding path program 1 times [2022-04-28 11:45:01,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:45:01,819 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1073861938] [2022-04-28 11:45:01,820 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 11:45:01,820 INFO L85 PathProgramCache]: Analyzing trace with hash -73515422, now seen corresponding path program 2 times [2022-04-28 11:45:01,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:45:01,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63505897] [2022-04-28 11:45:01,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:45:01,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:45:01,833 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:45:01,834 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1633315509] [2022-04-28 11:45:01,834 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:45:01,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:45:01,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:45:01,850 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 11:45:01,851 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-28 11:45:01,897 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 11:45:01,897 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:45:01,899 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-28 11:45:01,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:45:01,910 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:45:02,204 INFO L272 TraceCheckUtils]: 0: Hoare triple {247#true} call ULTIMATE.init(); {247#true} is VALID [2022-04-28 11:45:02,204 INFO L290 TraceCheckUtils]: 1: Hoare triple {247#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); {247#true} is VALID [2022-04-28 11:45:02,204 INFO L290 TraceCheckUtils]: 2: Hoare triple {247#true} assume true; {247#true} is VALID [2022-04-28 11:45:02,204 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {247#true} {247#true} #84#return; {247#true} is VALID [2022-04-28 11:45:02,205 INFO L272 TraceCheckUtils]: 4: Hoare triple {247#true} call #t~ret2 := main(); {247#true} is VALID [2022-04-28 11:45:02,205 INFO L290 TraceCheckUtils]: 5: Hoare triple {247#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1; {247#true} is VALID [2022-04-28 11:45:02,205 INFO L272 TraceCheckUtils]: 6: Hoare triple {247#true} call assume_abort_if_not((if ~A~0 % 4294967296 >= 0 && ~A~0 % 4294967296 <= 10 then 1 else 0)); {247#true} is VALID [2022-04-28 11:45:02,205 INFO L290 TraceCheckUtils]: 7: Hoare triple {247#true} ~cond := #in~cond; {247#true} is VALID [2022-04-28 11:45:02,205 INFO L290 TraceCheckUtils]: 8: Hoare triple {247#true} assume !(0 == ~cond); {247#true} is VALID [2022-04-28 11:45:02,205 INFO L290 TraceCheckUtils]: 9: Hoare triple {247#true} assume true; {247#true} is VALID [2022-04-28 11:45:02,206 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {247#true} {247#true} #78#return; {247#true} is VALID [2022-04-28 11:45:02,206 INFO L290 TraceCheckUtils]: 11: Hoare triple {247#true} ~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {285#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:45:02,207 INFO L290 TraceCheckUtils]: 12: Hoare triple {285#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !false; {285#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:45:02,207 INFO L290 TraceCheckUtils]: 13: Hoare triple {285#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {292#(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-28 11:45:02,208 INFO L290 TraceCheckUtils]: 14: Hoare triple {292#(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 !false; {292#(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-28 11:45:02,209 INFO L272 TraceCheckUtils]: 15: Hoare triple {292#(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)); {299#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:45:02,210 INFO L290 TraceCheckUtils]: 16: Hoare triple {299#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {303#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:45:02,210 INFO L290 TraceCheckUtils]: 17: Hoare triple {303#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {248#false} is VALID [2022-04-28 11:45:02,210 INFO L290 TraceCheckUtils]: 18: Hoare triple {248#false} assume !false; {248#false} is VALID [2022-04-28 11:45:02,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 11:45:02,211 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 11:45:02,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:45:02,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63505897] [2022-04-28 11:45:02,211 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:45:02,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1633315509] [2022-04-28 11:45:02,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1633315509] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:45:02,212 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:45:02,212 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 11:45:02,212 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:45:02,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1073861938] [2022-04-28 11:45:02,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1073861938] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:45:02,213 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:45:02,213 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 11:45:02,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517446994] [2022-04-28 11:45:02,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:45:02,214 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2022-04-28 11:45:02,214 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:45:02,214 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 11:45:02,229 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:45:02,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 11:45:02,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:45:02,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 11:45:02,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-04-28 11:45:02,230 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 11:45:02,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:45:02,385 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2022-04-28 11:45:02,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 11:45:02,386 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2022-04-28 11:45:02,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:45:02,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 11:45:02,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 42 transitions. [2022-04-28 11:45:02,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 11:45:02,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 42 transitions. [2022-04-28 11:45:02,390 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 42 transitions. [2022-04-28 11:45:02,420 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-28 11:45:02,422 INFO L225 Difference]: With dead ends: 37 [2022-04-28 11:45:02,422 INFO L226 Difference]: Without dead ends: 34 [2022-04-28 11:45:02,422 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 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-28 11:45:02,423 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 8 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 11:45:02,423 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 92 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 11:45:02,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-28 11:45:02,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-04-28 11:45:02,433 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:45:02,433 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 34 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 11:45:02,433 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 34 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 11:45:02,433 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 34 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 11:45:02,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:45:02,435 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-04-28 11:45:02,435 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2022-04-28 11:45:02,435 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:45:02,436 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:45:02,436 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 34 states. [2022-04-28 11:45:02,436 INFO L87 Difference]: Start difference. First operand has 34 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 34 states. [2022-04-28 11:45:02,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:45:02,438 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-04-28 11:45:02,438 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2022-04-28 11:45:02,438 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:45:02,438 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:45:02,438 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:45:02,438 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:45:02,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 11:45:02,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2022-04-28 11:45:02,440 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 19 [2022-04-28 11:45:02,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:45:02,440 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2022-04-28 11:45:02,440 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 11:45:02,440 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 38 transitions. [2022-04-28 11:45:02,472 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-28 11:45:02,472 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2022-04-28 11:45:02,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-28 11:45:02,475 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:45:02,475 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:45:02,495 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-28 11:45:02,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:45:02,680 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:45:02,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:45:02,680 INFO L85 PathProgramCache]: Analyzing trace with hash -1211706883, now seen corresponding path program 1 times [2022-04-28 11:45:02,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:45:02,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1802304935] [2022-04-28 11:45:02,697 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:45:02,697 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:45:02,697 INFO L85 PathProgramCache]: Analyzing trace with hash -1211706883, now seen corresponding path program 2 times [2022-04-28 11:45:02,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:45:02,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300447896] [2022-04-28 11:45:02,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:45:02,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:45:02,709 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:45:02,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1319639147] [2022-04-28 11:45:02,710 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:45:02,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:45:02,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:45:02,711 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 11:45:02,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-28 11:45:02,752 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 11:45:02,752 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:45:02,753 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-28 11:45:02,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:45:02,761 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:45:03,041 INFO L272 TraceCheckUtils]: 0: Hoare triple {521#true} call ULTIMATE.init(); {521#true} is VALID [2022-04-28 11:45:03,042 INFO L290 TraceCheckUtils]: 1: Hoare triple {521#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); {521#true} is VALID [2022-04-28 11:45:03,042 INFO L290 TraceCheckUtils]: 2: Hoare triple {521#true} assume true; {521#true} is VALID [2022-04-28 11:45:03,042 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {521#true} {521#true} #84#return; {521#true} is VALID [2022-04-28 11:45:03,042 INFO L272 TraceCheckUtils]: 4: Hoare triple {521#true} call #t~ret2 := main(); {521#true} is VALID [2022-04-28 11:45:03,042 INFO L290 TraceCheckUtils]: 5: Hoare triple {521#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1; {521#true} is VALID [2022-04-28 11:45:03,042 INFO L272 TraceCheckUtils]: 6: Hoare triple {521#true} call assume_abort_if_not((if ~A~0 % 4294967296 >= 0 && ~A~0 % 4294967296 <= 10 then 1 else 0)); {521#true} is VALID [2022-04-28 11:45:03,047 INFO L290 TraceCheckUtils]: 7: Hoare triple {521#true} ~cond := #in~cond; {547#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 11:45:03,047 INFO L290 TraceCheckUtils]: 8: Hoare triple {547#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {551#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 11:45:03,049 INFO L290 TraceCheckUtils]: 9: Hoare triple {551#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {551#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 11:45:03,059 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {551#(not (= |assume_abort_if_not_#in~cond| 0))} {521#true} #78#return; {558#(<= (mod main_~A~0 4294967296) 10)} is VALID [2022-04-28 11:45:03,063 INFO L290 TraceCheckUtils]: 11: Hoare triple {558#(<= (mod main_~A~0 4294967296) 10)} ~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {562#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~A~0 4294967296) 10))} is VALID [2022-04-28 11:45:03,063 INFO L290 TraceCheckUtils]: 12: Hoare triple {562#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~A~0 4294967296) 10))} assume !false; {562#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~A~0 4294967296) 10))} is VALID [2022-04-28 11:45:03,064 INFO L290 TraceCheckUtils]: 13: Hoare triple {562#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~A~0 4294967296) 10))} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {562#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~A~0 4294967296) 10))} is VALID [2022-04-28 11:45:03,064 INFO L290 TraceCheckUtils]: 14: Hoare triple {562#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~A~0 4294967296) 10))} assume !false; {562#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~A~0 4294967296) 10))} is VALID [2022-04-28 11:45:03,065 INFO L290 TraceCheckUtils]: 15: Hoare triple {562#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~A~0 4294967296) 10))} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {562#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~A~0 4294967296) 10))} is VALID [2022-04-28 11:45:03,065 INFO L290 TraceCheckUtils]: 16: Hoare triple {562#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~A~0 4294967296) 10))} assume !false; {562#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~A~0 4294967296) 10))} is VALID [2022-04-28 11:45:03,066 INFO L272 TraceCheckUtils]: 17: Hoare triple {562#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~A~0 4294967296) 10))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {581#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:45:03,066 INFO L290 TraceCheckUtils]: 18: Hoare triple {581#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {585#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:45:03,067 INFO L290 TraceCheckUtils]: 19: Hoare triple {585#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {522#false} is VALID [2022-04-28 11:45:03,067 INFO L290 TraceCheckUtils]: 20: Hoare triple {522#false} assume !false; {522#false} is VALID [2022-04-28 11:45:03,067 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-28 11:45:03,067 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 11:45:03,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:45:03,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300447896] [2022-04-28 11:45:03,068 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:45:03,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1319639147] [2022-04-28 11:45:03,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1319639147] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:45:03,068 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:45:03,068 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 11:45:03,068 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:45:03,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1802304935] [2022-04-28 11:45:03,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1802304935] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:45:03,069 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:45:03,069 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 11:45:03,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042321656] [2022-04-28 11:45:03,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:45:03,069 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2022-04-28 11:45:03,069 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:45:03,070 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 11:45:03,096 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:45:03,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 11:45:03,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:45:03,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 11:45:03,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-04-28 11:45:03,098 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 11:45:03,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:45:03,313 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2022-04-28 11:45:03,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 11:45:03,314 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2022-04-28 11:45:03,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:45:03,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 11:45:03,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 41 transitions. [2022-04-28 11:45:03,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 11:45:03,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 41 transitions. [2022-04-28 11:45:03,323 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 41 transitions. [2022-04-28 11:45:03,356 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-28 11:45:03,358 INFO L225 Difference]: With dead ends: 45 [2022-04-28 11:45:03,358 INFO L226 Difference]: Without dead ends: 42 [2022-04-28 11:45:03,359 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-04-28 11:45:03,366 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 21 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 11:45:03,367 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 88 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 11:45:03,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-04-28 11:45:03,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 33. [2022-04-28 11:45:03,391 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:45:03,392 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand has 33 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 23 states have internal predecessors, (27), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 11:45:03,393 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand has 33 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 23 states have internal predecessors, (27), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 11:45:03,393 INFO L87 Difference]: Start difference. First operand 42 states. Second operand has 33 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 23 states have internal predecessors, (27), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 11:45:03,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:45:03,400 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2022-04-28 11:45:03,400 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2022-04-28 11:45:03,403 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:45:03,403 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:45:03,403 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 23 states have internal predecessors, (27), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 42 states. [2022-04-28 11:45:03,403 INFO L87 Difference]: Start difference. First operand has 33 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 23 states have internal predecessors, (27), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 42 states. [2022-04-28 11:45:03,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:45:03,405 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2022-04-28 11:45:03,405 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2022-04-28 11:45:03,405 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:45:03,405 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:45:03,405 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:45:03,405 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:45:03,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 23 states have internal predecessors, (27), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 11:45:03,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2022-04-28 11:45:03,407 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 21 [2022-04-28 11:45:03,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:45:03,407 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2022-04-28 11:45:03,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 11:45:03,407 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 37 transitions. [2022-04-28 11:45:03,444 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:45:03,444 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2022-04-28 11:45:03,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-28 11:45:03,446 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:45:03,446 INFO L195 NwaCegarLoop]: 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, 1] [2022-04-28 11:45:03,484 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-28 11:45:03,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-28 11:45:03,664 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:45:03,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:45:03,665 INFO L85 PathProgramCache]: Analyzing trace with hash 947727214, now seen corresponding path program 1 times [2022-04-28 11:45:03,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:45:03,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1379324824] [2022-04-28 11:45:03,665 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:45:03,666 INFO L85 PathProgramCache]: Analyzing trace with hash 947727214, now seen corresponding path program 2 times [2022-04-28 11:45:03,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:45:03,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929424663] [2022-04-28 11:45:03,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:45:03,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:45:03,687 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:45:03,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1171320221] [2022-04-28 11:45:03,688 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:45:03,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:45:03,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:45:03,689 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-28 11:45:03,701 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-28 11:45:03,744 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:45:03,744 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:45:03,745 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-28 11:45:03,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:45:03,750 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:45:03,813 INFO L272 TraceCheckUtils]: 0: Hoare triple {835#true} call ULTIMATE.init(); {835#true} is VALID [2022-04-28 11:45:03,813 INFO L290 TraceCheckUtils]: 1: Hoare triple {835#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); {835#true} is VALID [2022-04-28 11:45:03,813 INFO L290 TraceCheckUtils]: 2: Hoare triple {835#true} assume true; {835#true} is VALID [2022-04-28 11:45:03,813 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {835#true} {835#true} #84#return; {835#true} is VALID [2022-04-28 11:45:03,813 INFO L272 TraceCheckUtils]: 4: Hoare triple {835#true} call #t~ret2 := main(); {835#true} is VALID [2022-04-28 11:45:03,814 INFO L290 TraceCheckUtils]: 5: Hoare triple {835#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1; {835#true} is VALID [2022-04-28 11:45:03,814 INFO L272 TraceCheckUtils]: 6: Hoare triple {835#true} call assume_abort_if_not((if ~A~0 % 4294967296 >= 0 && ~A~0 % 4294967296 <= 10 then 1 else 0)); {835#true} is VALID [2022-04-28 11:45:03,814 INFO L290 TraceCheckUtils]: 7: Hoare triple {835#true} ~cond := #in~cond; {835#true} is VALID [2022-04-28 11:45:03,814 INFO L290 TraceCheckUtils]: 8: Hoare triple {835#true} assume !(0 == ~cond); {835#true} is VALID [2022-04-28 11:45:03,814 INFO L290 TraceCheckUtils]: 9: Hoare triple {835#true} assume true; {835#true} is VALID [2022-04-28 11:45:03,814 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {835#true} {835#true} #78#return; {835#true} is VALID [2022-04-28 11:45:03,815 INFO L290 TraceCheckUtils]: 11: Hoare triple {835#true} ~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {873#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} is VALID [2022-04-28 11:45:03,815 INFO L290 TraceCheckUtils]: 12: Hoare triple {873#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} assume !false; {873#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} is VALID [2022-04-28 11:45:03,815 INFO L290 TraceCheckUtils]: 13: Hoare triple {873#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {873#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} is VALID [2022-04-28 11:45:03,816 INFO L290 TraceCheckUtils]: 14: Hoare triple {873#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} assume !false; {873#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} is VALID [2022-04-28 11:45:03,816 INFO L272 TraceCheckUtils]: 15: Hoare triple {873#(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)); {835#true} is VALID [2022-04-28 11:45:03,816 INFO L290 TraceCheckUtils]: 16: Hoare triple {835#true} ~cond := #in~cond; {835#true} is VALID [2022-04-28 11:45:03,816 INFO L290 TraceCheckUtils]: 17: Hoare triple {835#true} assume !(0 == ~cond); {835#true} is VALID [2022-04-28 11:45:03,816 INFO L290 TraceCheckUtils]: 18: Hoare triple {835#true} assume true; {835#true} is VALID [2022-04-28 11:45:03,817 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {835#true} {873#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} #80#return; {873#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} is VALID [2022-04-28 11:45:03,817 INFO L290 TraceCheckUtils]: 20: Hoare triple {873#(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); {836#false} is VALID [2022-04-28 11:45:03,818 INFO L290 TraceCheckUtils]: 21: Hoare triple {836#false} assume ~r~0 % 4294967296 >= ~b~0 % 4294967296;~q~0 := 1 + ~q~0;~r~0 := ~r~0 - ~b~0; {836#false} is VALID [2022-04-28 11:45:03,818 INFO L290 TraceCheckUtils]: 22: Hoare triple {836#false} assume !false; {836#false} is VALID [2022-04-28 11:45:03,818 INFO L272 TraceCheckUtils]: 23: Hoare triple {836#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {836#false} is VALID [2022-04-28 11:45:03,818 INFO L290 TraceCheckUtils]: 24: Hoare triple {836#false} ~cond := #in~cond; {836#false} is VALID [2022-04-28 11:45:03,818 INFO L290 TraceCheckUtils]: 25: Hoare triple {836#false} assume 0 == ~cond; {836#false} is VALID [2022-04-28 11:45:03,818 INFO L290 TraceCheckUtils]: 26: Hoare triple {836#false} assume !false; {836#false} is VALID [2022-04-28 11:45:03,819 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-28 11:45:03,819 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 11:45:03,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:45:03,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929424663] [2022-04-28 11:45:03,819 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:45:03,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1171320221] [2022-04-28 11:45:03,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1171320221] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:45:03,819 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:45:03,819 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 11:45:03,820 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:45:03,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1379324824] [2022-04-28 11:45:03,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1379324824] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:45:03,820 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:45:03,820 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 11:45:03,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122811456] [2022-04-28 11:45:03,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:45:03,821 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 27 [2022-04-28 11:45:03,821 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:45:03,821 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 11:45:03,841 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:45:03,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 11:45:03,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:45:03,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 11:45:03,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 11:45:03,842 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 11:45:03,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:45:03,900 INFO L93 Difference]: Finished difference Result 57 states and 66 transitions. [2022-04-28 11:45:03,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 11:45:03,900 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 27 [2022-04-28 11:45:03,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:45:03,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 11:45:03,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 48 transitions. [2022-04-28 11:45:03,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 11:45:03,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 48 transitions. [2022-04-28 11:45:03,902 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 48 transitions. [2022-04-28 11:45:03,929 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:45:03,930 INFO L225 Difference]: With dead ends: 57 [2022-04-28 11:45:03,930 INFO L226 Difference]: Without dead ends: 35 [2022-04-28 11:45:03,931 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 25 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-28 11:45:03,931 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 11:45:03,932 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 45 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 11:45:03,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-28 11:45:03,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-04-28 11:45:03,947 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:45:03,948 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 35 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 11:45:03,948 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 35 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 11:45:03,948 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 35 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 11:45:03,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:45:03,949 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2022-04-28 11:45:03,949 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2022-04-28 11:45:03,949 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:45:03,949 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:45:03,950 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 35 states. [2022-04-28 11:45:03,950 INFO L87 Difference]: Start difference. First operand has 35 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 35 states. [2022-04-28 11:45:03,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:45:03,951 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2022-04-28 11:45:03,951 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2022-04-28 11:45:03,951 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:45:03,951 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:45:03,951 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:45:03,951 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:45:03,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 11:45:03,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2022-04-28 11:45:03,952 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 27 [2022-04-28 11:45:03,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:45:03,953 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2022-04-28 11:45:03,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 11:45:03,953 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 39 transitions. [2022-04-28 11:45:03,985 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-28 11:45:03,986 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2022-04-28 11:45:03,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-28 11:45:03,986 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:45:03,986 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:45:04,021 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-28 11:45:04,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:45:04,204 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:45:04,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:45:04,205 INFO L85 PathProgramCache]: Analyzing trace with hash 1574040585, now seen corresponding path program 1 times [2022-04-28 11:45:04,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:45:04,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1960881499] [2022-04-28 11:45:04,210 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:45:04,210 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:45:04,210 INFO L85 PathProgramCache]: Analyzing trace with hash 1574040585, now seen corresponding path program 2 times [2022-04-28 11:45:04,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:45:04,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633677457] [2022-04-28 11:45:04,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:45:04,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:45:04,229 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:45:04,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [248654988] [2022-04-28 11:45:04,229 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:45:04,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:45:04,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:45:04,244 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-28 11:45:04,245 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-28 11:45:04,294 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:45:04,295 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:45:04,295 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-28 11:45:04,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:45:04,308 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:45:05,136 INFO L272 TraceCheckUtils]: 0: Hoare triple {1172#true} call ULTIMATE.init(); {1172#true} is VALID [2022-04-28 11:45:05,137 INFO L290 TraceCheckUtils]: 1: Hoare triple {1172#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); {1172#true} is VALID [2022-04-28 11:45:05,137 INFO L290 TraceCheckUtils]: 2: Hoare triple {1172#true} assume true; {1172#true} is VALID [2022-04-28 11:45:05,137 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1172#true} {1172#true} #84#return; {1172#true} is VALID [2022-04-28 11:45:05,137 INFO L272 TraceCheckUtils]: 4: Hoare triple {1172#true} call #t~ret2 := main(); {1172#true} is VALID [2022-04-28 11:45:05,137 INFO L290 TraceCheckUtils]: 5: Hoare triple {1172#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1; {1172#true} is VALID [2022-04-28 11:45:05,137 INFO L272 TraceCheckUtils]: 6: Hoare triple {1172#true} call assume_abort_if_not((if ~A~0 % 4294967296 >= 0 && ~A~0 % 4294967296 <= 10 then 1 else 0)); {1172#true} is VALID [2022-04-28 11:45:05,137 INFO L290 TraceCheckUtils]: 7: Hoare triple {1172#true} ~cond := #in~cond; {1172#true} is VALID [2022-04-28 11:45:05,137 INFO L290 TraceCheckUtils]: 8: Hoare triple {1172#true} assume !(0 == ~cond); {1172#true} is VALID [2022-04-28 11:45:05,138 INFO L290 TraceCheckUtils]: 9: Hoare triple {1172#true} assume true; {1172#true} is VALID [2022-04-28 11:45:05,138 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1172#true} {1172#true} #78#return; {1172#true} is VALID [2022-04-28 11:45:05,140 INFO L290 TraceCheckUtils]: 11: Hoare triple {1172#true} ~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {1210#(and (= main_~A~0 main_~r~0) (= main_~B~0 main_~b~0) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 11:45:05,141 INFO L290 TraceCheckUtils]: 12: Hoare triple {1210#(and (= main_~A~0 main_~r~0) (= main_~B~0 main_~b~0) (= main_~q~0 0) (= main_~B~0 1))} assume !false; {1210#(and (= main_~A~0 main_~r~0) (= main_~B~0 main_~b~0) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 11:45:05,141 INFO L290 TraceCheckUtils]: 13: Hoare triple {1210#(and (= main_~A~0 main_~r~0) (= main_~B~0 main_~b~0) (= main_~q~0 0) (= main_~B~0 1))} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {1217#(and (= main_~A~0 main_~r~0) (<= (mod main_~B~0 4294967296) (mod main_~r~0 4294967296)) (= main_~q~0 0) (= main_~B~0 1) (= (* main_~B~0 2) main_~b~0))} is VALID [2022-04-28 11:45:05,142 INFO L290 TraceCheckUtils]: 14: Hoare triple {1217#(and (= main_~A~0 main_~r~0) (<= (mod main_~B~0 4294967296) (mod main_~r~0 4294967296)) (= main_~q~0 0) (= main_~B~0 1) (= (* main_~B~0 2) main_~b~0))} assume !false; {1217#(and (= main_~A~0 main_~r~0) (<= (mod main_~B~0 4294967296) (mod main_~r~0 4294967296)) (= main_~q~0 0) (= main_~B~0 1) (= (* main_~B~0 2) main_~b~0))} is VALID [2022-04-28 11:45:05,142 INFO L290 TraceCheckUtils]: 15: Hoare triple {1217#(and (= main_~A~0 main_~r~0) (<= (mod main_~B~0 4294967296) (mod main_~r~0 4294967296)) (= main_~q~0 0) (= main_~B~0 1) (= (* main_~B~0 2) main_~b~0))} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {1224#(and (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (<= (mod main_~B~0 4294967296) (mod main_~r~0 4294967296)) (= main_~q~0 0) (= main_~B~0 1) (= (* main_~B~0 2) main_~b~0))} is VALID [2022-04-28 11:45:05,143 INFO L290 TraceCheckUtils]: 16: Hoare triple {1224#(and (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (<= (mod main_~B~0 4294967296) (mod main_~r~0 4294967296)) (= main_~q~0 0) (= main_~B~0 1) (= (* main_~B~0 2) main_~b~0))} assume !false; {1224#(and (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (<= (mod main_~B~0 4294967296) (mod main_~r~0 4294967296)) (= main_~q~0 0) (= main_~B~0 1) (= (* main_~B~0 2) main_~b~0))} is VALID [2022-04-28 11:45:05,143 INFO L272 TraceCheckUtils]: 17: Hoare triple {1224#(and (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (<= (mod main_~B~0 4294967296) (mod main_~r~0 4294967296)) (= main_~q~0 0) (= main_~B~0 1) (= (* main_~B~0 2) main_~b~0))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1172#true} is VALID [2022-04-28 11:45:05,143 INFO L290 TraceCheckUtils]: 18: Hoare triple {1172#true} ~cond := #in~cond; {1172#true} is VALID [2022-04-28 11:45:05,143 INFO L290 TraceCheckUtils]: 19: Hoare triple {1172#true} assume !(0 == ~cond); {1172#true} is VALID [2022-04-28 11:45:05,143 INFO L290 TraceCheckUtils]: 20: Hoare triple {1172#true} assume true; {1172#true} is VALID [2022-04-28 11:45:05,144 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1172#true} {1224#(and (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (<= (mod main_~B~0 4294967296) (mod main_~r~0 4294967296)) (= main_~q~0 0) (= main_~B~0 1) (= (* main_~B~0 2) main_~b~0))} #80#return; {1224#(and (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (<= (mod main_~B~0 4294967296) (mod main_~r~0 4294967296)) (= main_~q~0 0) (= main_~B~0 1) (= (* main_~B~0 2) main_~b~0))} is VALID [2022-04-28 11:45:05,145 INFO L290 TraceCheckUtils]: 22: Hoare triple {1224#(and (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (<= (mod main_~B~0 4294967296) (mod main_~r~0 4294967296)) (= main_~q~0 0) (= main_~B~0 1) (= (* main_~B~0 2) main_~b~0))} 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); {1246#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (not (<= 2 (mod main_~r~0 4294967296))) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-28 11:45:05,147 INFO L290 TraceCheckUtils]: 23: Hoare triple {1246#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (not (<= 2 (mod main_~r~0 4294967296))) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} assume ~r~0 % 4294967296 >= ~b~0 % 4294967296;~q~0 := 1 + ~q~0;~r~0 := ~r~0 - ~b~0; {1250#(and (= (+ main_~A~0 (* (- 1) main_~b~0)) main_~r~0) (= main_~b~0 1) (not (<= 2 (mod main_~A~0 4294967296))) (= (+ (- 1) main_~q~0) 0) (<= 1 (mod main_~A~0 4294967296)))} is VALID [2022-04-28 11:45:05,147 INFO L290 TraceCheckUtils]: 24: Hoare triple {1250#(and (= (+ main_~A~0 (* (- 1) main_~b~0)) main_~r~0) (= main_~b~0 1) (not (<= 2 (mod main_~A~0 4294967296))) (= (+ (- 1) main_~q~0) 0) (<= 1 (mod main_~A~0 4294967296)))} assume !false; {1250#(and (= (+ main_~A~0 (* (- 1) main_~b~0)) main_~r~0) (= main_~b~0 1) (not (<= 2 (mod main_~A~0 4294967296))) (= (+ (- 1) main_~q~0) 0) (<= 1 (mod main_~A~0 4294967296)))} is VALID [2022-04-28 11:45:05,158 INFO L272 TraceCheckUtils]: 25: Hoare triple {1250#(and (= (+ main_~A~0 (* (- 1) main_~b~0)) main_~r~0) (= main_~b~0 1) (not (<= 2 (mod main_~A~0 4294967296))) (= (+ (- 1) main_~q~0) 0) (<= 1 (mod main_~A~0 4294967296)))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1257#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:45:05,159 INFO L290 TraceCheckUtils]: 26: Hoare triple {1257#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1261#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:45:05,159 INFO L290 TraceCheckUtils]: 27: Hoare triple {1261#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1173#false} is VALID [2022-04-28 11:45:05,159 INFO L290 TraceCheckUtils]: 28: Hoare triple {1173#false} assume !false; {1173#false} is VALID [2022-04-28 11:45:05,159 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 11:45:05,159 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:45:37,333 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 (mod (* c_main_~b~0 2) 4294967296)) (.cse1 (mod c_main_~r~0 4294967296))) (or (= .cse0 (mod c_main_~B~0 4294967296)) (not (<= (mod c_main_~b~0 4294967296) .cse1)) (= (mod c_main_~A~0 4294967296) (mod (+ (* (div .cse0 2) (* c_main_~q~0 2)) c_main_~r~0) 4294967296)) (<= .cse0 .cse1))) is different from true [2022-04-28 11:45:45,821 INFO L290 TraceCheckUtils]: 28: Hoare triple {1173#false} assume !false; {1173#false} is VALID [2022-04-28 11:45:45,822 INFO L290 TraceCheckUtils]: 27: Hoare triple {1261#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1173#false} is VALID [2022-04-28 11:45:45,822 INFO L290 TraceCheckUtils]: 26: Hoare triple {1257#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1261#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:45:45,823 INFO L272 TraceCheckUtils]: 25: Hoare triple {1277#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1257#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:45:45,824 INFO L290 TraceCheckUtils]: 24: Hoare triple {1277#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} assume !false; {1277#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} is VALID [2022-04-28 11:45:47,831 WARN L290 TraceCheckUtils]: 23: Hoare triple {1277#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} assume ~r~0 % 4294967296 >= ~b~0 % 4294967296;~q~0 := 1 + ~q~0;~r~0 := ~r~0 - ~b~0; {1277#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} is UNKNOWN [2022-04-28 11:45:49,838 WARN L290 TraceCheckUtils]: 22: Hoare triple {1287#(or (= (mod main_~B~0 4294967296) (mod main_~b~0 4294967296)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* (div (mod main_~b~0 4294967296) 2) (* main_~q~0 2))) 4294967296)))} 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); {1277#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} is UNKNOWN [2022-04-28 11:45:49,839 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1172#true} {1287#(or (= (mod main_~B~0 4294967296) (mod main_~b~0 4294967296)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* (div (mod main_~b~0 4294967296) 2) (* main_~q~0 2))) 4294967296)))} #80#return; {1287#(or (= (mod main_~B~0 4294967296) (mod main_~b~0 4294967296)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* (div (mod main_~b~0 4294967296) 2) (* main_~q~0 2))) 4294967296)))} is VALID [2022-04-28 11:45:49,840 INFO L290 TraceCheckUtils]: 20: Hoare triple {1172#true} assume true; {1172#true} is VALID [2022-04-28 11:45:49,840 INFO L290 TraceCheckUtils]: 19: Hoare triple {1172#true} assume !(0 == ~cond); {1172#true} is VALID [2022-04-28 11:45:49,840 INFO L290 TraceCheckUtils]: 18: Hoare triple {1172#true} ~cond := #in~cond; {1172#true} is VALID [2022-04-28 11:45:49,840 INFO L272 TraceCheckUtils]: 17: Hoare triple {1287#(or (= (mod main_~B~0 4294967296) (mod main_~b~0 4294967296)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* (div (mod main_~b~0 4294967296) 2) (* main_~q~0 2))) 4294967296)))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1172#true} is VALID [2022-04-28 11:45:49,840 INFO L290 TraceCheckUtils]: 16: Hoare triple {1287#(or (= (mod main_~B~0 4294967296) (mod main_~b~0 4294967296)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* (div (mod main_~b~0 4294967296) 2) (* main_~q~0 2))) 4294967296)))} assume !false; {1287#(or (= (mod main_~B~0 4294967296) (mod main_~b~0 4294967296)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* (div (mod main_~b~0 4294967296) 2) (* main_~q~0 2))) 4294967296)))} is VALID [2022-04-28 11:45:49,841 INFO L290 TraceCheckUtils]: 15: Hoare triple {1309#(or (= (mod main_~B~0 4294967296) (mod main_~b~0 4294967296)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* (div (mod main_~b~0 4294967296) 2) (* main_~q~0 2))) 4294967296)) (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296)))} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {1287#(or (= (mod main_~B~0 4294967296) (mod main_~b~0 4294967296)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* (div (mod main_~b~0 4294967296) 2) (* main_~q~0 2))) 4294967296)))} is VALID [2022-04-28 11:45:49,841 INFO L290 TraceCheckUtils]: 14: Hoare triple {1309#(or (= (mod main_~B~0 4294967296) (mod main_~b~0 4294967296)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* (div (mod main_~b~0 4294967296) 2) (* main_~q~0 2))) 4294967296)) (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296)))} assume !false; {1309#(or (= (mod main_~B~0 4294967296) (mod main_~b~0 4294967296)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* (div (mod main_~b~0 4294967296) 2) (* main_~q~0 2))) 4294967296)) (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296)))} is VALID [2022-04-28 11:45:51,984 WARN L290 TraceCheckUtils]: 13: Hoare triple {1316#(or (= (mod main_~A~0 4294967296) (mod (+ (* (* main_~q~0 2) (div (mod (* main_~b~0 2) 4294967296) 2)) main_~r~0) 4294967296)) (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (<= (mod (* main_~b~0 2) 4294967296) (mod main_~r~0 4294967296)) (= (mod (* main_~b~0 2) 4294967296) (mod main_~B~0 4294967296)))} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {1309#(or (= (mod main_~B~0 4294967296) (mod main_~b~0 4294967296)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* (div (mod main_~b~0 4294967296) 2) (* main_~q~0 2))) 4294967296)) (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296)))} is UNKNOWN [2022-04-28 11:45:51,985 INFO L290 TraceCheckUtils]: 12: Hoare triple {1316#(or (= (mod main_~A~0 4294967296) (mod (+ (* (* main_~q~0 2) (div (mod (* main_~b~0 2) 4294967296) 2)) main_~r~0) 4294967296)) (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (<= (mod (* main_~b~0 2) 4294967296) (mod main_~r~0 4294967296)) (= (mod (* main_~b~0 2) 4294967296) (mod main_~B~0 4294967296)))} assume !false; {1316#(or (= (mod main_~A~0 4294967296) (mod (+ (* (* main_~q~0 2) (div (mod (* main_~b~0 2) 4294967296) 2)) main_~r~0) 4294967296)) (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (<= (mod (* main_~b~0 2) 4294967296) (mod main_~r~0 4294967296)) (= (mod (* main_~b~0 2) 4294967296) (mod main_~B~0 4294967296)))} is VALID [2022-04-28 11:45:51,986 INFO L290 TraceCheckUtils]: 11: Hoare triple {1172#true} ~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {1316#(or (= (mod main_~A~0 4294967296) (mod (+ (* (* main_~q~0 2) (div (mod (* main_~b~0 2) 4294967296) 2)) main_~r~0) 4294967296)) (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (<= (mod (* main_~b~0 2) 4294967296) (mod main_~r~0 4294967296)) (= (mod (* main_~b~0 2) 4294967296) (mod main_~B~0 4294967296)))} is VALID [2022-04-28 11:45:51,986 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1172#true} {1172#true} #78#return; {1172#true} is VALID [2022-04-28 11:45:51,986 INFO L290 TraceCheckUtils]: 9: Hoare triple {1172#true} assume true; {1172#true} is VALID [2022-04-28 11:45:51,986 INFO L290 TraceCheckUtils]: 8: Hoare triple {1172#true} assume !(0 == ~cond); {1172#true} is VALID [2022-04-28 11:45:51,986 INFO L290 TraceCheckUtils]: 7: Hoare triple {1172#true} ~cond := #in~cond; {1172#true} is VALID [2022-04-28 11:45:51,986 INFO L272 TraceCheckUtils]: 6: Hoare triple {1172#true} call assume_abort_if_not((if ~A~0 % 4294967296 >= 0 && ~A~0 % 4294967296 <= 10 then 1 else 0)); {1172#true} is VALID [2022-04-28 11:45:51,987 INFO L290 TraceCheckUtils]: 5: Hoare triple {1172#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1; {1172#true} is VALID [2022-04-28 11:45:51,987 INFO L272 TraceCheckUtils]: 4: Hoare triple {1172#true} call #t~ret2 := main(); {1172#true} is VALID [2022-04-28 11:45:51,987 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1172#true} {1172#true} #84#return; {1172#true} is VALID [2022-04-28 11:45:51,987 INFO L290 TraceCheckUtils]: 2: Hoare triple {1172#true} assume true; {1172#true} is VALID [2022-04-28 11:45:51,987 INFO L290 TraceCheckUtils]: 1: Hoare triple {1172#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); {1172#true} is VALID [2022-04-28 11:45:51,987 INFO L272 TraceCheckUtils]: 0: Hoare triple {1172#true} call ULTIMATE.init(); {1172#true} is VALID [2022-04-28 11:45:51,987 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-04-28 11:45:51,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:45:51,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633677457] [2022-04-28 11:45:51,988 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:45:51,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [248654988] [2022-04-28 11:45:51,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [248654988] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:45:51,988 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:45:51,988 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 13 [2022-04-28 11:45:51,988 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:45:51,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1960881499] [2022-04-28 11:45:51,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1960881499] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:45:51,988 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:45:51,988 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 11:45:51,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805439308] [2022-04-28 11:45:51,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:45:51,989 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29 [2022-04-28 11:45:51,989 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:45:51,989 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 11:45:52,064 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:45:52,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 11:45:52,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:45:52,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 11:45:52,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=97, Unknown=1, NotChecked=20, Total=156 [2022-04-28 11:45:52,065 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 11:45:54,730 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-28 11:45:55,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:45:55,761 INFO L93 Difference]: Finished difference Result 72 states and 83 transitions. [2022-04-28 11:45:55,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 11:45:55,761 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29 [2022-04-28 11:45:55,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:45:55,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 11:45:55,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 62 transitions. [2022-04-28 11:45:55,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 11:45:55,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 62 transitions. [2022-04-28 11:45:55,765 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 62 transitions. [2022-04-28 11:45:55,946 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:45:55,947 INFO L225 Difference]: With dead ends: 72 [2022-04-28 11:45:55,947 INFO L226 Difference]: Without dead ends: 52 [2022-04-28 11:45:55,947 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=42, Invalid=117, Unknown=1, NotChecked=22, Total=182 [2022-04-28 11:45:55,947 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 8 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-04-28 11:45:55,948 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 148 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 107 Invalid, 1 Unknown, 0 Unchecked, 3.1s Time] [2022-04-28 11:45:55,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-28 11:45:55,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2022-04-28 11:45:55,980 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:45:55,980 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 52 states, 37 states have (on average 1.162162162162162) internal successors, (43), 38 states have internal predecessors, (43), 8 states have call successors, (8), 7 states have call predecessors, (8), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 11:45:55,980 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 52 states, 37 states have (on average 1.162162162162162) internal successors, (43), 38 states have internal predecessors, (43), 8 states have call successors, (8), 7 states have call predecessors, (8), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 11:45:55,980 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 52 states, 37 states have (on average 1.162162162162162) internal successors, (43), 38 states have internal predecessors, (43), 8 states have call successors, (8), 7 states have call predecessors, (8), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 11:45:55,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:45:55,981 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions. [2022-04-28 11:45:55,982 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2022-04-28 11:45:55,982 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:45:55,982 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:45:55,982 INFO L74 IsIncluded]: Start isIncluded. First operand has 52 states, 37 states have (on average 1.162162162162162) internal successors, (43), 38 states have internal predecessors, (43), 8 states have call successors, (8), 7 states have call predecessors, (8), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 52 states. [2022-04-28 11:45:55,982 INFO L87 Difference]: Start difference. First operand has 52 states, 37 states have (on average 1.162162162162162) internal successors, (43), 38 states have internal predecessors, (43), 8 states have call successors, (8), 7 states have call predecessors, (8), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 52 states. [2022-04-28 11:45:55,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:45:55,983 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions. [2022-04-28 11:45:55,983 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2022-04-28 11:45:55,984 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:45:55,984 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:45:55,984 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:45:55,984 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:45:55,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 37 states have (on average 1.162162162162162) internal successors, (43), 38 states have internal predecessors, (43), 8 states have call successors, (8), 7 states have call predecessors, (8), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 11:45:55,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2022-04-28 11:45:55,985 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 29 [2022-04-28 11:45:55,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:45:55,985 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2022-04-28 11:45:55,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 11:45:55,985 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 57 transitions. [2022-04-28 11:45:56,284 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:45:56,284 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2022-04-28 11:45:56,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-28 11:45:56,284 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:45:56,284 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 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-28 11:45:56,301 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-28 11:45:56,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:45:56,485 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:45:56,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:45:56,485 INFO L85 PathProgramCache]: Analyzing trace with hash -2129198620, now seen corresponding path program 3 times [2022-04-28 11:45:56,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:45:56,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1647673962] [2022-04-28 11:45:56,488 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:45:56,489 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:45:56,489 INFO L85 PathProgramCache]: Analyzing trace with hash -2129198620, now seen corresponding path program 4 times [2022-04-28 11:45:56,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:45:56,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985935059] [2022-04-28 11:45:56,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:45:56,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:45:56,498 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:45:56,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1150458720] [2022-04-28 11:45:56,498 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 11:45:56,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:45:56,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:45:56,551 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-28 11:45:56,552 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process