/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/divbin2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 10:44:20,105 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 10:44:20,107 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 10:44:20,149 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 10:44:20,150 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 10:44:20,151 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 10:44:20,155 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 10:44:20,160 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 10:44:20,161 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 10:44:20,166 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 10:44:20,167 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 10:44:20,168 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 10:44:20,168 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 10:44:20,170 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 10:44:20,171 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 10:44:20,174 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 10:44:20,175 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 10:44:20,176 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 10:44:20,179 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 10:44:20,183 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 10:44:20,187 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 10:44:20,189 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 10:44:20,189 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 10:44:20,190 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 10:44:20,191 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 10:44:20,193 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 10:44:20,193 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 10:44:20,193 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 10:44:20,194 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 10:44:20,194 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 10:44:20,195 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 10:44:20,195 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 10:44:20,196 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 10:44:20,196 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 10:44:20,197 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 10:44:20,197 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 10:44:20,198 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 10:44:20,198 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 10:44:20,198 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 10:44:20,199 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 10:44:20,203 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 10:44:20,206 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 10:44:20,206 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 10:44:20,220 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 10:44:20,220 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 10:44:20,221 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 10:44:20,222 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 10:44:20,222 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 10:44:20,222 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 10:44:20,222 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 10:44:20,222 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 10:44:20,222 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 10:44:20,223 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 10:44:20,223 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 10:44:20,223 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 10:44:20,224 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 10:44:20,224 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 10:44:20,224 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 10:44:20,224 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 10:44:20,224 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 10:44:20,224 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 10:44:20,224 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 10:44:20,224 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 10:44:20,225 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 10:44:20,225 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-28 10:44:20,225 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 10:44:20,457 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 10:44:20,480 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 10:44:20,482 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 10:44:20,483 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 10:44:20,487 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 10:44:20,488 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench/divbin2.i [2022-04-28 10:44:20,545 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/199537f81/95f26cf3696c4b11b95e791ed5279558/FLAG67eb3ce39 [2022-04-28 10:44:20,843 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 10:44:20,844 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/divbin2.i [2022-04-28 10:44:20,849 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/199537f81/95f26cf3696c4b11b95e791ed5279558/FLAG67eb3ce39 [2022-04-28 10:44:21,275 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/199537f81/95f26cf3696c4b11b95e791ed5279558 [2022-04-28 10:44:21,278 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 10:44:21,279 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 10:44:21,281 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 10:44:21,281 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 10:44:21,286 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 10:44:21,287 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 10:44:21" (1/1) ... [2022-04-28 10:44:21,288 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6fd86927 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:44:21, skipping insertion in model container [2022-04-28 10:44:21,288 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 10:44:21" (1/1) ... [2022-04-28 10:44:21,294 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 10:44:21,320 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 10:44:21,463 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/divbin2.i[951,964] [2022-04-28 10:44:21,488 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 10:44:21,506 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 10:44:21,518 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/divbin2.i[951,964] [2022-04-28 10:44:21,522 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 10:44:21,531 INFO L208 MainTranslator]: Completed translation [2022-04-28 10:44:21,532 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:44:21 WrapperNode [2022-04-28 10:44:21,532 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 10:44:21,533 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 10:44:21,533 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 10:44:21,534 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 10:44:21,544 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:44:21" (1/1) ... [2022-04-28 10:44:21,544 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:44:21" (1/1) ... [2022-04-28 10:44:21,551 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:44:21" (1/1) ... [2022-04-28 10:44:21,552 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:44:21" (1/1) ... [2022-04-28 10:44:21,559 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:44:21" (1/1) ... [2022-04-28 10:44:21,563 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:44:21" (1/1) ... [2022-04-28 10:44:21,564 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:44:21" (1/1) ... [2022-04-28 10:44:21,566 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 10:44:21,566 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 10:44:21,567 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 10:44:21,567 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 10:44:21,567 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:44:21" (1/1) ... [2022-04-28 10:44:21,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 10:44:21,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:44:21,595 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 10:44:21,597 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 10:44:21,621 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 10:44:21,621 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 10:44:21,621 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 10:44:21,621 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 10:44:21,621 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 10:44:21,621 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 10:44:21,622 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 10:44:21,622 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 10:44:21,622 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-28 10:44:21,622 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-28 10:44:21,622 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 10:44:21,622 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 10:44:21,622 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-28 10:44:21,622 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 10:44:21,623 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 10:44:21,623 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 10:44:21,623 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 10:44:21,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 10:44:21,623 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 10:44:21,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 10:44:21,623 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 10:44:21,623 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 10:44:21,674 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 10:44:21,675 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 10:44:21,811 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 10:44:21,819 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 10:44:21,820 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-28 10:44:21,822 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 10:44:21 BoogieIcfgContainer [2022-04-28 10:44:21,822 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 10:44:21,823 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 10:44:21,823 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 10:44:21,837 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 10:44:21,838 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 10:44:21" (1/3) ... [2022-04-28 10:44:21,838 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@564fbd62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 10:44:21, skipping insertion in model container [2022-04-28 10:44:21,839 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:44:21" (2/3) ... [2022-04-28 10:44:21,839 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@564fbd62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 10:44:21, skipping insertion in model container [2022-04-28 10:44:21,839 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 10:44:21" (3/3) ... [2022-04-28 10:44:21,840 INFO L111 eAbstractionObserver]: Analyzing ICFG divbin2.i [2022-04-28 10:44:21,852 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 10:44:21,852 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 10:44:21,930 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 10:44:21,939 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@60836133, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@11171db6 [2022-04-28 10:44:21,939 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 10:44:21,951 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 15 states have (on average 1.6) internal successors, (24), 16 states have internal predecessors, (24), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 10:44:21,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-28 10:44:21,967 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:44:21,968 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:44:21,969 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:44:21,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:44:21,975 INFO L85 PathProgramCache]: Analyzing trace with hash 1443343444, now seen corresponding path program 1 times [2022-04-28 10:44:21,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:44:21,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [699663925] [2022-04-28 10:44:21,998 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 10:44:21,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1443343444, now seen corresponding path program 2 times [2022-04-28 10:44:22,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:44:22,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008128626] [2022-04-28 10:44:22,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:44:22,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:44:22,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:44:22,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:44:22,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:44:22,214 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#(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); {27#true} is VALID [2022-04-28 10:44:22,215 INFO L290 TraceCheckUtils]: 1: Hoare triple {27#true} assume true; {27#true} is VALID [2022-04-28 10:44:22,215 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {27#true} {27#true} #80#return; {27#true} is VALID [2022-04-28 10:44:22,218 INFO L272 TraceCheckUtils]: 0: Hoare triple {27#true} call ULTIMATE.init(); {32#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:44:22,219 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#(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); {27#true} is VALID [2022-04-28 10:44:22,219 INFO L290 TraceCheckUtils]: 2: Hoare triple {27#true} assume true; {27#true} is VALID [2022-04-28 10:44:22,219 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27#true} {27#true} #80#return; {27#true} is VALID [2022-04-28 10:44:22,219 INFO L272 TraceCheckUtils]: 4: Hoare triple {27#true} call #t~ret2 := main(); {27#true} is VALID [2022-04-28 10:44:22,220 INFO L290 TraceCheckUtils]: 5: Hoare triple {27#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {27#true} is VALID [2022-04-28 10:44:22,221 INFO L290 TraceCheckUtils]: 6: Hoare triple {27#true} assume false; {28#false} is VALID [2022-04-28 10:44:22,221 INFO L290 TraceCheckUtils]: 7: Hoare triple {28#false} assume !true; {28#false} is VALID [2022-04-28 10:44:22,222 INFO L272 TraceCheckUtils]: 8: Hoare triple {28#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {28#false} is VALID [2022-04-28 10:44:22,222 INFO L290 TraceCheckUtils]: 9: Hoare triple {28#false} ~cond := #in~cond; {28#false} is VALID [2022-04-28 10:44:22,223 INFO L290 TraceCheckUtils]: 10: Hoare triple {28#false} assume 0 == ~cond; {28#false} is VALID [2022-04-28 10:44:22,223 INFO L290 TraceCheckUtils]: 11: Hoare triple {28#false} assume !false; {28#false} is VALID [2022-04-28 10:44:22,223 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 10:44:22,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:44:22,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008128626] [2022-04-28 10:44:22,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008128626] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:44:22,226 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:44:22,226 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 10:44:22,229 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:44:22,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [699663925] [2022-04-28 10:44:22,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [699663925] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:44:22,230 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:44:22,230 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 10:44:22,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057191819] [2022-04-28 10:44:22,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:44:22,235 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-28 10:44:22,237 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:44:22,240 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:44:22,262 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:44:22,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 10:44:22,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:44:22,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 10:44:22,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 10:44:22,296 INFO L87 Difference]: Start difference. First operand has 24 states, 15 states have (on average 1.6) internal successors, (24), 16 states have internal predecessors, (24), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:44:22,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:44:22,428 INFO L93 Difference]: Finished difference Result 40 states and 55 transitions. [2022-04-28 10:44:22,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 10:44:22,429 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-28 10:44:22,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:44:22,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:44:22,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2022-04-28 10:44:22,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:44:22,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2022-04-28 10:44:22,448 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 55 transitions. [2022-04-28 10:44:22,512 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:44:22,522 INFO L225 Difference]: With dead ends: 40 [2022-04-28 10:44:22,523 INFO L226 Difference]: Without dead ends: 19 [2022-04-28 10:44:22,526 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 10:44:22,532 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 16 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:44:22,534 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 28 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 10:44:22,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-04-28 10:44:22,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-04-28 10:44:22,564 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:44:22,565 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand has 19 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 13 states have internal predecessors, (16), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 10:44:22,565 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand has 19 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 13 states have internal predecessors, (16), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 10:44:22,566 INFO L87 Difference]: Start difference. First operand 19 states. Second operand has 19 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 13 states have internal predecessors, (16), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 10:44:22,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:44:22,569 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2022-04-28 10:44:22,569 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2022-04-28 10:44:22,569 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:44:22,569 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:44:22,570 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 13 states have internal predecessors, (16), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 19 states. [2022-04-28 10:44:22,570 INFO L87 Difference]: Start difference. First operand has 19 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 13 states have internal predecessors, (16), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 19 states. [2022-04-28 10:44:22,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:44:22,572 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2022-04-28 10:44:22,572 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2022-04-28 10:44:22,573 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:44:22,573 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:44:22,573 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:44:22,573 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:44:22,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 13 states have internal predecessors, (16), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 10:44:22,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2022-04-28 10:44:22,577 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 12 [2022-04-28 10:44:22,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:44:22,577 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2022-04-28 10:44:22,577 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:44:22,577 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 22 transitions. [2022-04-28 10:44:22,610 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:44:22,610 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2022-04-28 10:44:22,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-28 10:44:22,615 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:44:22,615 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:44:22,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 10:44:22,616 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:44:22,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:44:22,616 INFO L85 PathProgramCache]: Analyzing trace with hash -1532818659, now seen corresponding path program 1 times [2022-04-28 10:44:22,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:44:22,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1765152005] [2022-04-28 10:44:22,617 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 10:44:22,617 INFO L85 PathProgramCache]: Analyzing trace with hash -1532818659, now seen corresponding path program 2 times [2022-04-28 10:44:22,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:44:22,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267242959] [2022-04-28 10:44:22,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:44:22,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:44:22,658 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 10:44:22,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [747103039] [2022-04-28 10:44:22,658 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:44:22,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:44:22,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:44:22,664 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 10:44:22,695 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 10:44:22,727 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 10:44:22,727 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:44:22,730 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-28 10:44:22,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:44:22,744 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:44:23,113 INFO L272 TraceCheckUtils]: 0: Hoare triple {191#true} call ULTIMATE.init(); {191#true} is VALID [2022-04-28 10:44:23,115 INFO L290 TraceCheckUtils]: 1: Hoare triple {191#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); {191#true} is VALID [2022-04-28 10:44:23,115 INFO L290 TraceCheckUtils]: 2: Hoare triple {191#true} assume true; {191#true} is VALID [2022-04-28 10:44:23,115 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {191#true} {191#true} #80#return; {191#true} is VALID [2022-04-28 10:44:23,115 INFO L272 TraceCheckUtils]: 4: Hoare triple {191#true} call #t~ret2 := main(); {191#true} is VALID [2022-04-28 10:44:23,116 INFO L290 TraceCheckUtils]: 5: Hoare triple {191#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {211#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 10:44:23,117 INFO L290 TraceCheckUtils]: 6: Hoare triple {211#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !false; {211#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 10:44:23,119 INFO L290 TraceCheckUtils]: 7: Hoare triple {211#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {218#(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 10:44:23,120 INFO L290 TraceCheckUtils]: 8: Hoare triple {218#(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; {218#(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 10:44:23,121 INFO L272 TraceCheckUtils]: 9: Hoare triple {218#(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)); {225#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:44:23,121 INFO L290 TraceCheckUtils]: 10: Hoare triple {225#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {229#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:44:23,122 INFO L290 TraceCheckUtils]: 11: Hoare triple {229#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {192#false} is VALID [2022-04-28 10:44:23,122 INFO L290 TraceCheckUtils]: 12: Hoare triple {192#false} assume !false; {192#false} is VALID [2022-04-28 10:44:23,122 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 10:44:23,123 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 10:44:23,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:44:23,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267242959] [2022-04-28 10:44:23,123 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 10:44:23,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [747103039] [2022-04-28 10:44:23,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [747103039] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:44:23,124 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:44:23,125 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 10:44:23,125 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:44:23,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1765152005] [2022-04-28 10:44:23,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1765152005] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:44:23,126 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:44:23,126 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 10:44:23,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598799034] [2022-04-28 10:44:23,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:44:23,127 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-28 10:44:23,127 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:44:23,127 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:44:23,140 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:44:23,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 10:44:23,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:44:23,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 10:44:23,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-04-28 10:44:23,141 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:44:23,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:44:23,293 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2022-04-28 10:44:23,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 10:44:23,294 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-28 10:44:23,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:44:23,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:44:23,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 36 transitions. [2022-04-28 10:44:23,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:44:23,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 36 transitions. [2022-04-28 10:44:23,299 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 36 transitions. [2022-04-28 10:44:23,337 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:44:23,338 INFO L225 Difference]: With dead ends: 31 [2022-04-28 10:44:23,339 INFO L226 Difference]: Without dead ends: 28 [2022-04-28 10:44:23,339 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 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 10:44:23,340 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 9 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:44:23,341 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 56 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 10:44:23,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-04-28 10:44:23,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-04-28 10:44:23,357 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:44:23,358 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 28 states, 19 states have (on average 1.263157894736842) internal successors, (24), 20 states have internal predecessors, (24), 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 10:44:23,358 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 28 states, 19 states have (on average 1.263157894736842) internal successors, (24), 20 states have internal predecessors, (24), 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 10:44:23,358 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 28 states, 19 states have (on average 1.263157894736842) internal successors, (24), 20 states have internal predecessors, (24), 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 10:44:23,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:44:23,360 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2022-04-28 10:44:23,361 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2022-04-28 10:44:23,361 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:44:23,361 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:44:23,362 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 19 states have (on average 1.263157894736842) internal successors, (24), 20 states have internal predecessors, (24), 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 28 states. [2022-04-28 10:44:23,362 INFO L87 Difference]: Start difference. First operand has 28 states, 19 states have (on average 1.263157894736842) internal successors, (24), 20 states have internal predecessors, (24), 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 28 states. [2022-04-28 10:44:23,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:44:23,364 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2022-04-28 10:44:23,364 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2022-04-28 10:44:23,364 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:44:23,365 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:44:23,365 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:44:23,365 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:44:23,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 19 states have (on average 1.263157894736842) internal successors, (24), 20 states have internal predecessors, (24), 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 10:44:23,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2022-04-28 10:44:23,367 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 13 [2022-04-28 10:44:23,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:44:23,367 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2022-04-28 10:44:23,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:44:23,368 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 32 transitions. [2022-04-28 10:44:23,403 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:44:23,403 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2022-04-28 10:44:23,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-28 10:44:23,404 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:44:23,404 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:44:23,431 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-28 10:44:23,627 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 10:44:23,628 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:44:23,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:44:23,628 INFO L85 PathProgramCache]: Analyzing trace with hash 909386808, now seen corresponding path program 1 times [2022-04-28 10:44:23,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:44:23,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1946769200] [2022-04-28 10:44:23,646 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:44:23,646 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:44:23,646 INFO L85 PathProgramCache]: Analyzing trace with hash 909386808, now seen corresponding path program 2 times [2022-04-28 10:44:23,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:44:23,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707458739] [2022-04-28 10:44:23,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:44:23,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:44:23,668 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 10:44:23,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [204370088] [2022-04-28 10:44:23,668 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:44:23,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:44:23,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:44:23,672 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 10:44:23,673 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 10:44:23,710 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 10:44:23,711 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:44:23,711 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 10:44:23,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:44:23,719 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:44:23,828 INFO L272 TraceCheckUtils]: 0: Hoare triple {411#true} call ULTIMATE.init(); {411#true} is VALID [2022-04-28 10:44:23,828 INFO L290 TraceCheckUtils]: 1: Hoare triple {411#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); {411#true} is VALID [2022-04-28 10:44:23,829 INFO L290 TraceCheckUtils]: 2: Hoare triple {411#true} assume true; {411#true} is VALID [2022-04-28 10:44:23,829 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {411#true} {411#true} #80#return; {411#true} is VALID [2022-04-28 10:44:23,829 INFO L272 TraceCheckUtils]: 4: Hoare triple {411#true} call #t~ret2 := main(); {411#true} is VALID [2022-04-28 10:44:23,830 INFO L290 TraceCheckUtils]: 5: Hoare triple {411#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {431#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 10:44:23,830 INFO L290 TraceCheckUtils]: 6: Hoare triple {431#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !false; {431#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 10:44:23,831 INFO L290 TraceCheckUtils]: 7: Hoare triple {431#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {431#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 10:44:23,831 INFO L290 TraceCheckUtils]: 8: Hoare triple {431#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !false; {431#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 10:44:23,832 INFO L290 TraceCheckUtils]: 9: Hoare triple {431#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {431#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 10:44:23,832 INFO L290 TraceCheckUtils]: 10: Hoare triple {431#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !false; {431#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 10:44:23,833 INFO L272 TraceCheckUtils]: 11: Hoare triple {431#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {450#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:44:23,834 INFO L290 TraceCheckUtils]: 12: Hoare triple {450#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {454#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:44:23,834 INFO L290 TraceCheckUtils]: 13: Hoare triple {454#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {412#false} is VALID [2022-04-28 10:44:23,834 INFO L290 TraceCheckUtils]: 14: Hoare triple {412#false} assume !false; {412#false} is VALID [2022-04-28 10:44:23,834 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 10:44:23,835 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 10:44:23,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:44:23,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707458739] [2022-04-28 10:44:23,835 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 10:44:23,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [204370088] [2022-04-28 10:44:23,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [204370088] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:44:23,835 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:44:23,835 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 10:44:23,836 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:44:23,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1946769200] [2022-04-28 10:44:23,836 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1946769200] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:44:23,836 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:44:23,836 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 10:44:23,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578662282] [2022-04-28 10:44:23,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:44:23,837 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-28 10:44:23,837 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:44:23,837 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:44:23,850 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:44:23,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 10:44:23,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:44:23,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 10:44:23,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 10:44:23,851 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:44:23,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:44:23,999 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2022-04-28 10:44:24,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 10:44:24,000 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-28 10:44:24,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:44:24,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:44:24,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 35 transitions. [2022-04-28 10:44:24,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:44:24,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 35 transitions. [2022-04-28 10:44:24,006 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 35 transitions. [2022-04-28 10:44:24,057 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:44:24,059 INFO L225 Difference]: With dead ends: 39 [2022-04-28 10:44:24,059 INFO L226 Difference]: Without dead ends: 36 [2022-04-28 10:44:24,059 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 10:44:24,060 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 7 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:44:24,061 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 52 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 10:44:24,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-28 10:44:24,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 27. [2022-04-28 10:44:24,078 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:44:24,078 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 27 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 19 states have internal predecessors, (23), 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 10:44:24,079 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 27 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 19 states have internal predecessors, (23), 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 10:44:24,079 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 27 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 19 states have internal predecessors, (23), 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 10:44:24,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:44:24,083 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2022-04-28 10:44:24,083 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2022-04-28 10:44:24,084 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:44:24,084 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:44:24,085 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 19 states have internal predecessors, (23), 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 36 states. [2022-04-28 10:44:24,086 INFO L87 Difference]: Start difference. First operand has 27 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 19 states have internal predecessors, (23), 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 36 states. [2022-04-28 10:44:24,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:44:24,096 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2022-04-28 10:44:24,096 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2022-04-28 10:44:24,100 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:44:24,100 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:44:24,100 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:44:24,100 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:44:24,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 19 states have internal predecessors, (23), 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 10:44:24,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2022-04-28 10:44:24,104 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 15 [2022-04-28 10:44:24,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:44:24,104 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2022-04-28 10:44:24,104 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:44:24,104 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 31 transitions. [2022-04-28 10:44:24,139 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:44:24,140 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-28 10:44:24,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-28 10:44:24,140 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:44:24,140 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:44:24,165 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-28 10:44:24,355 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 10:44:24,356 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:44:24,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:44:24,356 INFO L85 PathProgramCache]: Analyzing trace with hash 1729767853, now seen corresponding path program 1 times [2022-04-28 10:44:24,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:44:24,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1966831999] [2022-04-28 10:44:24,357 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:44:24,357 INFO L85 PathProgramCache]: Analyzing trace with hash 1729767853, now seen corresponding path program 2 times [2022-04-28 10:44:24,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:44:24,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560757584] [2022-04-28 10:44:24,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:44:24,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:44:24,376 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 10:44:24,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1544378330] [2022-04-28 10:44:24,376 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:44:24,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:44:24,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:44:24,378 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 10:44:24,379 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 10:44:24,417 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:44:24,417 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:44:24,418 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-28 10:44:24,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:44:24,424 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:44:24,498 INFO L272 TraceCheckUtils]: 0: Hoare triple {666#true} call ULTIMATE.init(); {666#true} is VALID [2022-04-28 10:44:24,498 INFO L290 TraceCheckUtils]: 1: Hoare triple {666#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); {666#true} is VALID [2022-04-28 10:44:24,498 INFO L290 TraceCheckUtils]: 2: Hoare triple {666#true} assume true; {666#true} is VALID [2022-04-28 10:44:24,499 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {666#true} {666#true} #80#return; {666#true} is VALID [2022-04-28 10:44:24,499 INFO L272 TraceCheckUtils]: 4: Hoare triple {666#true} call #t~ret2 := main(); {666#true} is VALID [2022-04-28 10:44:24,502 INFO L290 TraceCheckUtils]: 5: Hoare triple {666#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {686#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} is VALID [2022-04-28 10:44:24,505 INFO L290 TraceCheckUtils]: 6: Hoare triple {686#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} assume !false; {686#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} is VALID [2022-04-28 10:44:24,506 INFO L290 TraceCheckUtils]: 7: Hoare triple {686#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {686#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} is VALID [2022-04-28 10:44:24,507 INFO L290 TraceCheckUtils]: 8: Hoare triple {686#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} assume !false; {686#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} is VALID [2022-04-28 10:44:24,507 INFO L272 TraceCheckUtils]: 9: Hoare triple {686#(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)); {666#true} is VALID [2022-04-28 10:44:24,507 INFO L290 TraceCheckUtils]: 10: Hoare triple {666#true} ~cond := #in~cond; {666#true} is VALID [2022-04-28 10:44:24,507 INFO L290 TraceCheckUtils]: 11: Hoare triple {666#true} assume !(0 == ~cond); {666#true} is VALID [2022-04-28 10:44:24,507 INFO L290 TraceCheckUtils]: 12: Hoare triple {666#true} assume true; {666#true} is VALID [2022-04-28 10:44:24,508 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {666#true} {686#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} #76#return; {686#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} is VALID [2022-04-28 10:44:24,509 INFO L290 TraceCheckUtils]: 14: Hoare triple {686#(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); {667#false} is VALID [2022-04-28 10:44:24,509 INFO L290 TraceCheckUtils]: 15: Hoare triple {667#false} assume ~r~0 % 4294967296 >= ~b~0 % 4294967296;~q~0 := 1 + ~q~0;~r~0 := ~r~0 - ~b~0; {667#false} is VALID [2022-04-28 10:44:24,509 INFO L290 TraceCheckUtils]: 16: Hoare triple {667#false} assume !false; {667#false} is VALID [2022-04-28 10:44:24,509 INFO L272 TraceCheckUtils]: 17: Hoare triple {667#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {667#false} is VALID [2022-04-28 10:44:24,509 INFO L290 TraceCheckUtils]: 18: Hoare triple {667#false} ~cond := #in~cond; {667#false} is VALID [2022-04-28 10:44:24,510 INFO L290 TraceCheckUtils]: 19: Hoare triple {667#false} assume 0 == ~cond; {667#false} is VALID [2022-04-28 10:44:24,510 INFO L290 TraceCheckUtils]: 20: Hoare triple {667#false} assume !false; {667#false} is VALID [2022-04-28 10:44:24,510 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 10:44:24,510 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 10:44:24,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:44:24,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560757584] [2022-04-28 10:44:24,511 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 10:44:24,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1544378330] [2022-04-28 10:44:24,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1544378330] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:44:24,511 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:44:24,511 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 10:44:24,511 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:44:24,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1966831999] [2022-04-28 10:44:24,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1966831999] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:44:24,512 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:44:24,512 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 10:44:24,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381256607] [2022-04-28 10:44:24,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:44:24,512 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2022-04-28 10:44:24,512 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:44:24,513 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 10:44:24,531 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:44:24,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 10:44:24,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:44:24,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 10:44:24,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 10:44:24,532 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 10:44:24,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:44:24,591 INFO L93 Difference]: Finished difference Result 51 states and 60 transitions. [2022-04-28 10:44:24,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 10:44:24,591 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2022-04-28 10:44:24,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:44:24,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 10:44:24,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2022-04-28 10:44:24,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 10:44:24,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2022-04-28 10:44:24,594 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 42 transitions. [2022-04-28 10:44:24,630 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 10:44:24,633 INFO L225 Difference]: With dead ends: 51 [2022-04-28 10:44:24,633 INFO L226 Difference]: Without dead ends: 29 [2022-04-28 10:44:24,634 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 19 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 10:44:24,635 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:44:24,636 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 34 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 10:44:24,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-28 10:44:24,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-04-28 10:44:24,649 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:44:24,650 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 29 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 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 10:44:24,650 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 29 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 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 10:44:24,650 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 29 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 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 10:44:24,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:44:24,651 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2022-04-28 10:44:24,651 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2022-04-28 10:44:24,652 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:44:24,652 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:44:24,652 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 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 29 states. [2022-04-28 10:44:24,652 INFO L87 Difference]: Start difference. First operand has 29 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 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 29 states. [2022-04-28 10:44:24,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:44:24,654 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2022-04-28 10:44:24,654 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2022-04-28 10:44:24,654 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:44:24,654 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:44:24,654 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:44:24,654 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:44:24,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 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 10:44:24,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2022-04-28 10:44:24,655 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 21 [2022-04-28 10:44:24,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:44:24,656 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2022-04-28 10:44:24,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 10:44:24,656 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 33 transitions. [2022-04-28 10:44:24,696 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:44:24,696 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2022-04-28 10:44:24,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 10:44:24,697 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:44:24,697 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:44:24,722 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 10:44:24,911 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 10:44:24,912 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:44:24,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:44:24,912 INFO L85 PathProgramCache]: Analyzing trace with hash 700053448, now seen corresponding path program 1 times [2022-04-28 10:44:24,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:44:24,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [205966098] [2022-04-28 10:44:24,916 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:44:24,916 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:44:24,916 INFO L85 PathProgramCache]: Analyzing trace with hash 700053448, now seen corresponding path program 2 times [2022-04-28 10:44:24,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:44:24,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150462113] [2022-04-28 10:44:24,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:44:24,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:44:24,928 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 10:44:24,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1361712829] [2022-04-28 10:44:24,928 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:44:24,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:44:24,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:44:24,930 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 10:44:24,943 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 10:44:24,987 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:44:24,987 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:44:24,988 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-28 10:44:25,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:44:25,001 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:44:25,883 INFO L272 TraceCheckUtils]: 0: Hoare triple {949#true} call ULTIMATE.init(); {949#true} is VALID [2022-04-28 10:44:25,884 INFO L290 TraceCheckUtils]: 1: Hoare triple {949#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); {949#true} is VALID [2022-04-28 10:44:25,884 INFO L290 TraceCheckUtils]: 2: Hoare triple {949#true} assume true; {949#true} is VALID [2022-04-28 10:44:25,884 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {949#true} {949#true} #80#return; {949#true} is VALID [2022-04-28 10:44:25,884 INFO L272 TraceCheckUtils]: 4: Hoare triple {949#true} call #t~ret2 := main(); {949#true} is VALID [2022-04-28 10:44:25,885 INFO L290 TraceCheckUtils]: 5: Hoare triple {949#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {969#(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 10:44:25,885 INFO L290 TraceCheckUtils]: 6: Hoare triple {969#(and (= main_~A~0 main_~r~0) (= main_~B~0 main_~b~0) (= main_~q~0 0) (= main_~B~0 1))} assume !false; {969#(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 10:44:25,886 INFO L290 TraceCheckUtils]: 7: Hoare triple {969#(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; {976#(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 10:44:25,886 INFO L290 TraceCheckUtils]: 8: Hoare triple {976#(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; {976#(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 10:44:25,887 INFO L290 TraceCheckUtils]: 9: Hoare triple {976#(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); {983#(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 10:44:25,887 INFO L290 TraceCheckUtils]: 10: Hoare triple {983#(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; {983#(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 10:44:25,887 INFO L272 TraceCheckUtils]: 11: Hoare triple {983#(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)); {949#true} is VALID [2022-04-28 10:44:25,888 INFO L290 TraceCheckUtils]: 12: Hoare triple {949#true} ~cond := #in~cond; {949#true} is VALID [2022-04-28 10:44:25,888 INFO L290 TraceCheckUtils]: 13: Hoare triple {949#true} assume !(0 == ~cond); {949#true} is VALID [2022-04-28 10:44:25,888 INFO L290 TraceCheckUtils]: 14: Hoare triple {949#true} assume true; {949#true} is VALID [2022-04-28 10:44:25,888 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {949#true} {983#(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))} #76#return; {983#(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 10:44:25,890 INFO L290 TraceCheckUtils]: 16: Hoare triple {983#(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); {1005#(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 10:44:25,891 INFO L290 TraceCheckUtils]: 17: Hoare triple {1005#(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; {1009#(and (= main_~b~0 1) (<= 1 (mod (+ main_~b~0 main_~r~0) 4294967296)) (= (+ (- 1) main_~q~0) 0) (= main_~A~0 (+ main_~b~0 main_~r~0)) (not (<= 2 (mod (+ main_~b~0 main_~r~0) 4294967296))))} is VALID [2022-04-28 10:44:25,892 INFO L290 TraceCheckUtils]: 18: Hoare triple {1009#(and (= main_~b~0 1) (<= 1 (mod (+ main_~b~0 main_~r~0) 4294967296)) (= (+ (- 1) main_~q~0) 0) (= main_~A~0 (+ main_~b~0 main_~r~0)) (not (<= 2 (mod (+ main_~b~0 main_~r~0) 4294967296))))} assume !false; {1009#(and (= main_~b~0 1) (<= 1 (mod (+ main_~b~0 main_~r~0) 4294967296)) (= (+ (- 1) main_~q~0) 0) (= main_~A~0 (+ main_~b~0 main_~r~0)) (not (<= 2 (mod (+ main_~b~0 main_~r~0) 4294967296))))} is VALID [2022-04-28 10:44:25,894 INFO L272 TraceCheckUtils]: 19: Hoare triple {1009#(and (= main_~b~0 1) (<= 1 (mod (+ main_~b~0 main_~r~0) 4294967296)) (= (+ (- 1) main_~q~0) 0) (= main_~A~0 (+ main_~b~0 main_~r~0)) (not (<= 2 (mod (+ main_~b~0 main_~r~0) 4294967296))))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1016#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:44:25,895 INFO L290 TraceCheckUtils]: 20: Hoare triple {1016#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1020#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:44:25,895 INFO L290 TraceCheckUtils]: 21: Hoare triple {1020#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {950#false} is VALID [2022-04-28 10:44:25,895 INFO L290 TraceCheckUtils]: 22: Hoare triple {950#false} assume !false; {950#false} is VALID [2022-04-28 10:44:25,896 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 10:44:25,896 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:45:06,405 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 10:45:12,822 INFO L290 TraceCheckUtils]: 22: Hoare triple {950#false} assume !false; {950#false} is VALID [2022-04-28 10:45:12,823 INFO L290 TraceCheckUtils]: 21: Hoare triple {1020#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {950#false} is VALID [2022-04-28 10:45:12,845 INFO L290 TraceCheckUtils]: 20: Hoare triple {1016#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1020#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:45:12,846 INFO L272 TraceCheckUtils]: 19: Hoare triple {1036#(= (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)); {1016#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:45:12,846 INFO L290 TraceCheckUtils]: 18: Hoare triple {1036#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} assume !false; {1036#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} is VALID [2022-04-28 10:45:14,862 WARN L290 TraceCheckUtils]: 17: Hoare triple {1036#(= (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; {1036#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} is UNKNOWN [2022-04-28 10:45:16,922 WARN L290 TraceCheckUtils]: 16: Hoare triple {1046#(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); {1036#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} is UNKNOWN [2022-04-28 10:45:16,923 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {949#true} {1046#(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)))} #76#return; {1046#(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 10:45:16,923 INFO L290 TraceCheckUtils]: 14: Hoare triple {949#true} assume true; {949#true} is VALID [2022-04-28 10:45:16,924 INFO L290 TraceCheckUtils]: 13: Hoare triple {949#true} assume !(0 == ~cond); {949#true} is VALID [2022-04-28 10:45:16,924 INFO L290 TraceCheckUtils]: 12: Hoare triple {949#true} ~cond := #in~cond; {949#true} is VALID [2022-04-28 10:45:16,924 INFO L272 TraceCheckUtils]: 11: Hoare triple {1046#(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)); {949#true} is VALID [2022-04-28 10:45:16,931 INFO L290 TraceCheckUtils]: 10: Hoare triple {1046#(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; {1046#(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 10:45:16,932 INFO L290 TraceCheckUtils]: 9: Hoare triple {1068#(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); {1046#(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 10:45:16,933 INFO L290 TraceCheckUtils]: 8: Hoare triple {1068#(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; {1068#(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 10:45:19,034 WARN L290 TraceCheckUtils]: 7: Hoare triple {1075#(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; {1068#(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 10:45:19,036 INFO L290 TraceCheckUtils]: 6: Hoare triple {1075#(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; {1075#(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 10:45:19,037 INFO L290 TraceCheckUtils]: 5: Hoare triple {949#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {1075#(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 10:45:19,037 INFO L272 TraceCheckUtils]: 4: Hoare triple {949#true} call #t~ret2 := main(); {949#true} is VALID [2022-04-28 10:45:19,037 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {949#true} {949#true} #80#return; {949#true} is VALID [2022-04-28 10:45:19,037 INFO L290 TraceCheckUtils]: 2: Hoare triple {949#true} assume true; {949#true} is VALID [2022-04-28 10:45:19,037 INFO L290 TraceCheckUtils]: 1: Hoare triple {949#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); {949#true} is VALID [2022-04-28 10:45:19,037 INFO L272 TraceCheckUtils]: 0: Hoare triple {949#true} call ULTIMATE.init(); {949#true} is VALID [2022-04-28 10:45:19,037 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 10:45:19,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:45:19,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150462113] [2022-04-28 10:45:19,038 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 10:45:19,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1361712829] [2022-04-28 10:45:19,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1361712829] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:45:19,038 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 10:45:19,038 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 13 [2022-04-28 10:45:19,039 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:45:19,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [205966098] [2022-04-28 10:45:19,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [205966098] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:45:19,039 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:45:19,039 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 10:45:19,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109434937] [2022-04-28 10:45:19,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:45:19,040 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 23 [2022-04-28 10:45:19,040 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:45:19,040 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 10:45:19,098 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:45:19,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 10:45:19,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:45:19,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 10:45:19,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=96, Unknown=2, NotChecked=20, Total=156 [2022-04-28 10:45:19,100 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 10:45:21,795 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 10:45:23,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:45:23,071 INFO L93 Difference]: Finished difference Result 66 states and 77 transitions. [2022-04-28 10:45:23,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 10:45:23,072 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 23 [2022-04-28 10:45:23,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:45:23,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 10:45:23,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 56 transitions. [2022-04-28 10:45:23,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 10:45:23,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 56 transitions. [2022-04-28 10:45:23,077 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 56 transitions. [2022-04-28 10:45:23,249 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:45:23,250 INFO L225 Difference]: With dead ends: 66 [2022-04-28 10:45:23,250 INFO L226 Difference]: Without dead ends: 46 [2022-04-28 10:45:23,250 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=42, Invalid=116, Unknown=2, NotChecked=22, Total=182 [2022-04-28 10:45:23,251 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 8 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-04-28 10:45:23,252 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 110 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 97 Invalid, 1 Unknown, 0 Unchecked, 3.3s Time] [2022-04-28 10:45:23,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-04-28 10:45:23,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-04-28 10:45:23,291 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:45:23,291 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand has 46 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 34 states have internal predecessors, (39), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 10:45:23,292 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand has 46 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 34 states have internal predecessors, (39), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 10:45:23,292 INFO L87 Difference]: Start difference. First operand 46 states. Second operand has 46 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 34 states have internal predecessors, (39), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 10:45:23,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:45:23,294 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2022-04-28 10:45:23,294 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2022-04-28 10:45:23,295 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:45:23,295 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:45:23,295 INFO L74 IsIncluded]: Start isIncluded. First operand has 46 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 34 states have internal predecessors, (39), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 46 states. [2022-04-28 10:45:23,296 INFO L87 Difference]: Start difference. First operand has 46 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 34 states have internal predecessors, (39), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 46 states. [2022-04-28 10:45:23,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:45:23,298 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2022-04-28 10:45:23,298 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2022-04-28 10:45:23,298 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:45:23,299 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:45:23,299 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:45:23,299 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:45:23,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 34 states have internal predecessors, (39), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 10:45:23,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 51 transitions. [2022-04-28 10:45:23,300 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 51 transitions. Word has length 23 [2022-04-28 10:45:23,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:45:23,301 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 51 transitions. [2022-04-28 10:45:23,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 10:45:23,301 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 51 transitions. [2022-04-28 10:45:23,507 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:45:23,507 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2022-04-28 10:45:23,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-28 10:45:23,507 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:45:23,508 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:45:23,525 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 10:45:23,715 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 10:45:23,716 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:45:23,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:45:23,716 INFO L85 PathProgramCache]: Analyzing trace with hash -1013011677, now seen corresponding path program 3 times [2022-04-28 10:45:23,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:45:23,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1106074960] [2022-04-28 10:45:23,719 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:45:23,719 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:45:23,719 INFO L85 PathProgramCache]: Analyzing trace with hash -1013011677, now seen corresponding path program 4 times [2022-04-28 10:45:23,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:45:23,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098039156] [2022-04-28 10:45:23,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:45:23,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:45:23,740 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 10:45:23,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1229742830] [2022-04-28 10:45:23,741 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:45:23,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:45:23,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:45:23,744 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 10:45:23,744 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process