/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/divbin_unwindbound50.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 14:27:52,278 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 14:27:52,280 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 14:27:52,315 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 14:27:52,316 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 14:27:52,317 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 14:27:52,319 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 14:27:52,321 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 14:27:52,323 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 14:27:52,326 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 14:27:52,327 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 14:27:52,328 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 14:27:52,328 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 14:27:52,330 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 14:27:52,331 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 14:27:52,334 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 14:27:52,334 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 14:27:52,335 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 14:27:52,336 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 14:27:52,341 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 14:27:52,342 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 14:27:52,343 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 14:27:52,344 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 14:27:52,344 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 14:27:52,346 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 14:27:52,351 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 14:27:52,351 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 14:27:52,351 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 14:27:52,352 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 14:27:52,352 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 14:27:52,354 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 14:27:52,354 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 14:27:52,355 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 14:27:52,356 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 14:27:52,356 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 14:27:52,357 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 14:27:52,357 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 14:27:52,357 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 14:27:52,357 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 14:27:52,358 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 14:27:52,359 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 14:27:52,360 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 14:27:52,360 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-15 14:27:52,369 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 14:27:52,370 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 14:27:52,371 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 14:27:52,371 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 14:27:52,371 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 14:27:52,372 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 14:27:52,372 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 14:27:52,372 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 14:27:52,372 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 14:27:52,373 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 14:27:52,373 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 14:27:52,373 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 14:27:52,373 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 14:27:52,373 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 14:27:52,373 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 14:27:52,373 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 14:27:52,373 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 14:27:52,374 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 14:27:52,374 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 14:27:52,374 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 14:27:52,374 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 14:27:52,374 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-15 14:27:52,374 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-15 14:27:52,577 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 14:27:52,601 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 14:27:52,603 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 14:27:52,604 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 14:27:52,605 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 14:27:52,606 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/divbin_unwindbound50.i [2022-04-15 14:27:52,670 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6af202b19/ec311fcf5a634ac98a3d1c49330386f8/FLAGb03ef9879 [2022-04-15 14:27:52,996 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 14:27:52,996 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/divbin_unwindbound50.i [2022-04-15 14:27:53,001 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6af202b19/ec311fcf5a634ac98a3d1c49330386f8/FLAGb03ef9879 [2022-04-15 14:27:53,009 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6af202b19/ec311fcf5a634ac98a3d1c49330386f8 [2022-04-15 14:27:53,011 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 14:27:53,012 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 14:27:53,015 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 14:27:53,016 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 14:27:53,019 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 14:27:53,020 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 02:27:53" (1/1) ... [2022-04-15 14:27:53,020 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ef0c990 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:27:53, skipping insertion in model container [2022-04-15 14:27:53,020 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 02:27:53" (1/1) ... [2022-04-15 14:27:53,027 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 14:27:53,036 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 14:27:53,143 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/divbin_unwindbound50.i[950,963] [2022-04-15 14:27:53,158 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 14:27:53,164 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 14:27:53,172 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/divbin_unwindbound50.i[950,963] [2022-04-15 14:27:53,177 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 14:27:53,186 INFO L208 MainTranslator]: Completed translation [2022-04-15 14:27:53,186 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:27:53 WrapperNode [2022-04-15 14:27:53,186 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 14:27:53,187 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 14:27:53,187 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 14:27:53,187 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 14:27:53,194 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:27:53" (1/1) ... [2022-04-15 14:27:53,194 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:27:53" (1/1) ... [2022-04-15 14:27:53,199 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:27:53" (1/1) ... [2022-04-15 14:27:53,199 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:27:53" (1/1) ... [2022-04-15 14:27:53,203 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:27:53" (1/1) ... [2022-04-15 14:27:53,207 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:27:53" (1/1) ... [2022-04-15 14:27:53,208 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:27:53" (1/1) ... [2022-04-15 14:27:53,209 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 14:27:53,210 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 14:27:53,210 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 14:27:53,210 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 14:27:53,211 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:27:53" (1/1) ... [2022-04-15 14:27:53,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 14:27:53,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 14:27:53,241 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-15 14:27:53,243 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-15 14:27:53,265 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 14:27:53,266 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 14:27:53,266 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 14:27:53,266 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 14:27:53,266 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 14:27:53,266 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 14:27:53,266 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 14:27:53,266 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 14:27:53,266 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-15 14:27:53,266 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-15 14:27:53,266 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 14:27:53,266 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 14:27:53,266 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-15 14:27:53,267 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 14:27:53,267 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 14:27:53,267 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 14:27:53,267 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 14:27:53,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 14:27:53,267 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 14:27:53,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 14:27:53,267 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 14:27:53,267 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 14:27:53,315 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 14:27:53,316 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 14:27:53,438 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 14:27:53,443 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 14:27:53,443 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-15 14:27:53,445 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 02:27:53 BoogieIcfgContainer [2022-04-15 14:27:53,445 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 14:27:53,446 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 14:27:53,446 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 14:27:53,449 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 14:27:53,449 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 02:27:53" (1/3) ... [2022-04-15 14:27:53,450 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@281e8087 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 02:27:53, skipping insertion in model container [2022-04-15 14:27:53,450 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:27:53" (2/3) ... [2022-04-15 14:27:53,450 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@281e8087 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 02:27:53, skipping insertion in model container [2022-04-15 14:27:53,450 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 02:27:53" (3/3) ... [2022-04-15 14:27:53,451 INFO L111 eAbstractionObserver]: Analyzing ICFG divbin_unwindbound50.i [2022-04-15 14:27:53,454 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 14:27:53,455 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 14:27:53,501 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 14:27:53,522 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-15 14:27:53,522 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 14:27:53,540 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 22 states have internal predecessors, (31), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 14:27:53,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-15 14:27:53,549 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 14:27:53,550 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 14:27:53,550 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 14:27:53,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 14:27:53,554 INFO L85 PathProgramCache]: Analyzing trace with hash 878397729, now seen corresponding path program 1 times [2022-04-15 14:27:53,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 14:27:53,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1893405971] [2022-04-15 14:27:53,568 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 14:27:53,568 INFO L85 PathProgramCache]: Analyzing trace with hash 878397729, now seen corresponding path program 2 times [2022-04-15 14:27:53,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 14:27:53,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738178242] [2022-04-15 14:27:53,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 14:27:53,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 14:27:53,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:27:53,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 14:27:53,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:27:53,733 INFO L290 TraceCheckUtils]: 0: Hoare triple {49#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~counter~0 := 0; {36#true} is VALID [2022-04-15 14:27:53,733 INFO L290 TraceCheckUtils]: 1: Hoare triple {36#true} assume true; {36#true} is VALID [2022-04-15 14:27:53,734 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {36#true} {36#true} #89#return; {36#true} is VALID [2022-04-15 14:27:53,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 14:27:53,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:27:53,744 INFO L290 TraceCheckUtils]: 0: Hoare triple {36#true} ~cond := #in~cond; {36#true} is VALID [2022-04-15 14:27:53,745 INFO L290 TraceCheckUtils]: 1: Hoare triple {36#true} assume 0 == ~cond;assume false; {37#false} is VALID [2022-04-15 14:27:53,745 INFO L290 TraceCheckUtils]: 2: Hoare triple {37#false} assume true; {37#false} is VALID [2022-04-15 14:27:53,745 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37#false} {36#true} #81#return; {37#false} is VALID [2022-04-15 14:27:53,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-15 14:27:53,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:27:53,752 INFO L290 TraceCheckUtils]: 0: Hoare triple {36#true} ~cond := #in~cond; {36#true} is VALID [2022-04-15 14:27:53,752 INFO L290 TraceCheckUtils]: 1: Hoare triple {36#true} assume 0 == ~cond;assume false; {37#false} is VALID [2022-04-15 14:27:53,753 INFO L290 TraceCheckUtils]: 2: Hoare triple {37#false} assume true; {37#false} is VALID [2022-04-15 14:27:53,753 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37#false} {37#false} #83#return; {37#false} is VALID [2022-04-15 14:27:53,754 INFO L272 TraceCheckUtils]: 0: Hoare triple {36#true} call ULTIMATE.init(); {49#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 14:27:53,754 INFO L290 TraceCheckUtils]: 1: Hoare triple {49#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~counter~0 := 0; {36#true} is VALID [2022-04-15 14:27:53,754 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#true} assume true; {36#true} is VALID [2022-04-15 14:27:53,754 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#true} {36#true} #89#return; {36#true} is VALID [2022-04-15 14:27:53,755 INFO L272 TraceCheckUtils]: 4: Hoare triple {36#true} call #t~ret5 := main(); {36#true} is VALID [2022-04-15 14:27:53,755 INFO L290 TraceCheckUtils]: 5: Hoare triple {36#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 := #t~nondet2;havoc #t~nondet2; {36#true} is VALID [2022-04-15 14:27:53,755 INFO L272 TraceCheckUtils]: 6: Hoare triple {36#true} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {36#true} is VALID [2022-04-15 14:27:53,755 INFO L290 TraceCheckUtils]: 7: Hoare triple {36#true} ~cond := #in~cond; {36#true} is VALID [2022-04-15 14:27:53,756 INFO L290 TraceCheckUtils]: 8: Hoare triple {36#true} assume 0 == ~cond;assume false; {37#false} is VALID [2022-04-15 14:27:53,756 INFO L290 TraceCheckUtils]: 9: Hoare triple {37#false} assume true; {37#false} is VALID [2022-04-15 14:27:53,756 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {37#false} {36#true} #81#return; {37#false} is VALID [2022-04-15 14:27:53,756 INFO L272 TraceCheckUtils]: 11: Hoare triple {37#false} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {36#true} is VALID [2022-04-15 14:27:53,756 INFO L290 TraceCheckUtils]: 12: Hoare triple {36#true} ~cond := #in~cond; {36#true} is VALID [2022-04-15 14:27:53,757 INFO L290 TraceCheckUtils]: 13: Hoare triple {36#true} assume 0 == ~cond;assume false; {37#false} is VALID [2022-04-15 14:27:53,757 INFO L290 TraceCheckUtils]: 14: Hoare triple {37#false} assume true; {37#false} is VALID [2022-04-15 14:27:53,757 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {37#false} {37#false} #83#return; {37#false} is VALID [2022-04-15 14:27:53,757 INFO L290 TraceCheckUtils]: 16: Hoare triple {37#false} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {37#false} is VALID [2022-04-15 14:27:53,757 INFO L290 TraceCheckUtils]: 17: Hoare triple {37#false} assume !true; {37#false} is VALID [2022-04-15 14:27:53,757 INFO L290 TraceCheckUtils]: 18: Hoare triple {37#false} assume !true; {37#false} is VALID [2022-04-15 14:27:53,758 INFO L272 TraceCheckUtils]: 19: Hoare triple {37#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {37#false} is VALID [2022-04-15 14:27:53,758 INFO L290 TraceCheckUtils]: 20: Hoare triple {37#false} ~cond := #in~cond; {37#false} is VALID [2022-04-15 14:27:53,758 INFO L290 TraceCheckUtils]: 21: Hoare triple {37#false} assume 0 == ~cond; {37#false} is VALID [2022-04-15 14:27:53,758 INFO L290 TraceCheckUtils]: 22: Hoare triple {37#false} assume !false; {37#false} is VALID [2022-04-15 14:27:53,758 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 14:27:53,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 14:27:53,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738178242] [2022-04-15 14:27:53,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738178242] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:27:53,760 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:27:53,760 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 14:27:53,762 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 14:27:53,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1893405971] [2022-04-15 14:27:53,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1893405971] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:27:53,763 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:27:53,763 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 14:27:53,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230211414] [2022-04-15 14:27:53,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 14:27:53,767 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-15 14:27:53,769 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 14:27:53,771 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 14:27:53,791 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:27:53,792 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 14:27:53,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 14:27:53,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 14:27:53,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 14:27:53,809 INFO L87 Difference]: Start difference. First operand has 33 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 22 states have internal predecessors, (31), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 14:27:53,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:27:53,982 INFO L93 Difference]: Finished difference Result 60 states and 84 transitions. [2022-04-15 14:27:53,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 14:27:53,983 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-15 14:27:53,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 14:27:53,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 14:27:53,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 84 transitions. [2022-04-15 14:27:53,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 14:27:53,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 84 transitions. [2022-04-15 14:27:53,994 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 84 transitions. [2022-04-15 14:27:54,069 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:27:54,078 INFO L225 Difference]: With dead ends: 60 [2022-04-15 14:27:54,079 INFO L226 Difference]: Without dead ends: 29 [2022-04-15 14:27:54,081 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 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-15 14:27:54,084 INFO L913 BasicCegarLoop]: 36 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 14:27:54,085 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 40 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 14:27:54,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-15 14:27:54,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2022-04-15 14:27:54,108 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 14:27:54,108 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 28 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 14:27:54,109 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 28 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 14:27:54,109 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 28 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 14:27:54,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:27:54,112 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2022-04-15 14:27:54,113 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-04-15 14:27:54,113 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:27:54,113 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:27:54,113 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 29 states. [2022-04-15 14:27:54,114 INFO L87 Difference]: Start difference. First operand has 28 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 29 states. [2022-04-15 14:27:54,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:27:54,117 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2022-04-15 14:27:54,117 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-04-15 14:27:54,117 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:27:54,117 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:27:54,117 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 14:27:54,117 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 14:27:54,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 14:27:54,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2022-04-15 14:27:54,129 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 23 [2022-04-15 14:27:54,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 14:27:54,130 INFO L478 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2022-04-15 14:27:54,130 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 14:27:54,130 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 34 transitions. [2022-04-15 14:27:54,157 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:27:54,158 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2022-04-15 14:27:54,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-15 14:27:54,158 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 14:27:54,159 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 14:27:54,159 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 14:27:54,159 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 14:27:54,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 14:27:54,160 INFO L85 PathProgramCache]: Analyzing trace with hash 994169231, now seen corresponding path program 1 times [2022-04-15 14:27:54,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 14:27:54,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [907101645] [2022-04-15 14:27:54,161 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 14:27:54,161 INFO L85 PathProgramCache]: Analyzing trace with hash 994169231, now seen corresponding path program 2 times [2022-04-15 14:27:54,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 14:27:54,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815814515] [2022-04-15 14:27:54,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 14:27:54,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 14:27:54,177 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 14:27:54,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1669814850] [2022-04-15 14:27:54,178 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 14:27:54,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 14:27:54,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 14:27:54,180 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-15 14:27:54,184 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-15 14:27:54,236 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-15 14:27:54,236 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 14:27:54,238 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-15 14:27:54,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:27:54,266 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 14:27:54,452 INFO L272 TraceCheckUtils]: 0: Hoare triple {286#true} call ULTIMATE.init(); {286#true} is VALID [2022-04-15 14:27:54,452 INFO L290 TraceCheckUtils]: 1: Hoare triple {286#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(9, 2);~counter~0 := 0; {294#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:54,453 INFO L290 TraceCheckUtils]: 2: Hoare triple {294#(<= ~counter~0 0)} assume true; {294#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:54,454 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {294#(<= ~counter~0 0)} {286#true} #89#return; {294#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:54,454 INFO L272 TraceCheckUtils]: 4: Hoare triple {294#(<= ~counter~0 0)} call #t~ret5 := main(); {294#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:54,454 INFO L290 TraceCheckUtils]: 5: Hoare triple {294#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := #t~nondet2;havoc #t~nondet2; {294#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:54,455 INFO L272 TraceCheckUtils]: 6: Hoare triple {294#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {294#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:54,455 INFO L290 TraceCheckUtils]: 7: Hoare triple {294#(<= ~counter~0 0)} ~cond := #in~cond; {294#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:54,456 INFO L290 TraceCheckUtils]: 8: Hoare triple {294#(<= ~counter~0 0)} assume !(0 == ~cond); {294#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:54,456 INFO L290 TraceCheckUtils]: 9: Hoare triple {294#(<= ~counter~0 0)} assume true; {294#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:54,457 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {294#(<= ~counter~0 0)} {294#(<= ~counter~0 0)} #81#return; {294#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:54,457 INFO L272 TraceCheckUtils]: 11: Hoare triple {294#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {294#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:54,458 INFO L290 TraceCheckUtils]: 12: Hoare triple {294#(<= ~counter~0 0)} ~cond := #in~cond; {294#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:54,458 INFO L290 TraceCheckUtils]: 13: Hoare triple {294#(<= ~counter~0 0)} assume !(0 == ~cond); {294#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:54,459 INFO L290 TraceCheckUtils]: 14: Hoare triple {294#(<= ~counter~0 0)} assume true; {294#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:54,459 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {294#(<= ~counter~0 0)} {294#(<= ~counter~0 0)} #83#return; {294#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:54,460 INFO L290 TraceCheckUtils]: 16: Hoare triple {294#(<= ~counter~0 0)} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {294#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:54,460 INFO L290 TraceCheckUtils]: 17: Hoare triple {294#(<= ~counter~0 0)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {343#(<= |main_#t~post3| 0)} is VALID [2022-04-15 14:27:54,461 INFO L290 TraceCheckUtils]: 18: Hoare triple {343#(<= |main_#t~post3| 0)} assume !(#t~post3 < 50);havoc #t~post3; {287#false} is VALID [2022-04-15 14:27:54,461 INFO L290 TraceCheckUtils]: 19: Hoare triple {287#false} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {287#false} is VALID [2022-04-15 14:27:54,461 INFO L290 TraceCheckUtils]: 20: Hoare triple {287#false} assume !(#t~post4 < 50);havoc #t~post4; {287#false} is VALID [2022-04-15 14:27:54,461 INFO L272 TraceCheckUtils]: 21: Hoare triple {287#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {287#false} is VALID [2022-04-15 14:27:54,461 INFO L290 TraceCheckUtils]: 22: Hoare triple {287#false} ~cond := #in~cond; {287#false} is VALID [2022-04-15 14:27:54,462 INFO L290 TraceCheckUtils]: 23: Hoare triple {287#false} assume 0 == ~cond; {287#false} is VALID [2022-04-15 14:27:54,462 INFO L290 TraceCheckUtils]: 24: Hoare triple {287#false} assume !false; {287#false} is VALID [2022-04-15 14:27:54,462 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 14:27:54,462 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 14:27:54,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 14:27:54,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815814515] [2022-04-15 14:27:54,463 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 14:27:54,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1669814850] [2022-04-15 14:27:54,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1669814850] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:27:54,463 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:27:54,463 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 14:27:54,464 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 14:27:54,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [907101645] [2022-04-15 14:27:54,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [907101645] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:27:54,465 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:27:54,465 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 14:27:54,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841752241] [2022-04-15 14:27:54,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 14:27:54,466 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 25 [2022-04-15 14:27:54,466 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 14:27:54,466 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 14:27:54,481 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-15 14:27:54,482 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 14:27:54,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 14:27:54,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 14:27:54,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 14:27:54,483 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 14:27:54,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:27:54,585 INFO L93 Difference]: Finished difference Result 42 states and 52 transitions. [2022-04-15 14:27:54,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 14:27:54,585 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 25 [2022-04-15 14:27:54,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 14:27:54,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 14:27:54,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 52 transitions. [2022-04-15 14:27:54,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 14:27:54,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 52 transitions. [2022-04-15 14:27:54,598 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 52 transitions. [2022-04-15 14:27:54,636 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:27:54,638 INFO L225 Difference]: With dead ends: 42 [2022-04-15 14:27:54,638 INFO L226 Difference]: Without dead ends: 30 [2022-04-15 14:27:54,640 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 14:27:54,642 INFO L913 BasicCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 14:27:54,646 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 81 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 14:27:54,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-15 14:27:54,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-04-15 14:27:54,667 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 14:27:54,668 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 30 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 14:27:54,668 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 30 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 14:27:54,669 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 30 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 14:27:54,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:27:54,673 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2022-04-15 14:27:54,673 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2022-04-15 14:27:54,674 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:27:54,677 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:27:54,679 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 30 states. [2022-04-15 14:27:54,683 INFO L87 Difference]: Start difference. First operand has 30 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 30 states. [2022-04-15 14:27:54,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:27:54,688 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2022-04-15 14:27:54,689 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2022-04-15 14:27:54,689 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:27:54,689 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:27:54,689 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 14:27:54,689 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 14:27:54,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 14:27:54,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2022-04-15 14:27:54,691 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 25 [2022-04-15 14:27:54,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 14:27:54,691 INFO L478 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2022-04-15 14:27:54,691 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 14:27:54,691 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 36 transitions. [2022-04-15 14:27:54,736 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-15 14:27:54,736 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2022-04-15 14:27:54,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-15 14:27:54,742 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 14:27:54,742 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 14:27:54,764 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-15 14:27:54,950 WARN L460 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-15 14:27:54,951 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 14:27:54,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 14:27:54,951 INFO L85 PathProgramCache]: Analyzing trace with hash 422434646, now seen corresponding path program 1 times [2022-04-15 14:27:54,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 14:27:54,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1481764316] [2022-04-15 14:27:54,952 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 14:27:54,952 INFO L85 PathProgramCache]: Analyzing trace with hash 422434646, now seen corresponding path program 2 times [2022-04-15 14:27:54,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 14:27:54,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655811799] [2022-04-15 14:27:54,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 14:27:54,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 14:27:54,972 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 14:27:54,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [495049084] [2022-04-15 14:27:54,973 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 14:27:54,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 14:27:54,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 14:27:54,982 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-15 14:27:54,983 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-15 14:27:55,021 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-15 14:27:55,022 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 14:27:55,022 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 14:27:55,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:27:55,043 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 14:27:55,175 INFO L272 TraceCheckUtils]: 0: Hoare triple {568#true} call ULTIMATE.init(); {568#true} is VALID [2022-04-15 14:27:55,176 INFO L290 TraceCheckUtils]: 1: Hoare triple {568#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(9, 2);~counter~0 := 0; {576#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:55,176 INFO L290 TraceCheckUtils]: 2: Hoare triple {576#(<= ~counter~0 0)} assume true; {576#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:55,176 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {576#(<= ~counter~0 0)} {568#true} #89#return; {576#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:55,177 INFO L272 TraceCheckUtils]: 4: Hoare triple {576#(<= ~counter~0 0)} call #t~ret5 := main(); {576#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:55,177 INFO L290 TraceCheckUtils]: 5: Hoare triple {576#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := #t~nondet2;havoc #t~nondet2; {576#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:55,178 INFO L272 TraceCheckUtils]: 6: Hoare triple {576#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {576#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:55,178 INFO L290 TraceCheckUtils]: 7: Hoare triple {576#(<= ~counter~0 0)} ~cond := #in~cond; {576#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:55,178 INFO L290 TraceCheckUtils]: 8: Hoare triple {576#(<= ~counter~0 0)} assume !(0 == ~cond); {576#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:55,179 INFO L290 TraceCheckUtils]: 9: Hoare triple {576#(<= ~counter~0 0)} assume true; {576#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:55,179 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {576#(<= ~counter~0 0)} {576#(<= ~counter~0 0)} #81#return; {576#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:55,180 INFO L272 TraceCheckUtils]: 11: Hoare triple {576#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {576#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:55,180 INFO L290 TraceCheckUtils]: 12: Hoare triple {576#(<= ~counter~0 0)} ~cond := #in~cond; {576#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:55,180 INFO L290 TraceCheckUtils]: 13: Hoare triple {576#(<= ~counter~0 0)} assume !(0 == ~cond); {576#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:55,181 INFO L290 TraceCheckUtils]: 14: Hoare triple {576#(<= ~counter~0 0)} assume true; {576#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:55,181 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {576#(<= ~counter~0 0)} {576#(<= ~counter~0 0)} #83#return; {576#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:55,182 INFO L290 TraceCheckUtils]: 16: Hoare triple {576#(<= ~counter~0 0)} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {576#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:55,182 INFO L290 TraceCheckUtils]: 17: Hoare triple {576#(<= ~counter~0 0)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {625#(<= ~counter~0 1)} is VALID [2022-04-15 14:27:55,183 INFO L290 TraceCheckUtils]: 18: Hoare triple {625#(<= ~counter~0 1)} assume !!(#t~post3 < 50);havoc #t~post3; {625#(<= ~counter~0 1)} is VALID [2022-04-15 14:27:55,183 INFO L290 TraceCheckUtils]: 19: Hoare triple {625#(<= ~counter~0 1)} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {625#(<= ~counter~0 1)} is VALID [2022-04-15 14:27:55,183 INFO L290 TraceCheckUtils]: 20: Hoare triple {625#(<= ~counter~0 1)} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {635#(<= |main_#t~post4| 1)} is VALID [2022-04-15 14:27:55,184 INFO L290 TraceCheckUtils]: 21: Hoare triple {635#(<= |main_#t~post4| 1)} assume !(#t~post4 < 50);havoc #t~post4; {569#false} is VALID [2022-04-15 14:27:55,184 INFO L272 TraceCheckUtils]: 22: Hoare triple {569#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {569#false} is VALID [2022-04-15 14:27:55,184 INFO L290 TraceCheckUtils]: 23: Hoare triple {569#false} ~cond := #in~cond; {569#false} is VALID [2022-04-15 14:27:55,184 INFO L290 TraceCheckUtils]: 24: Hoare triple {569#false} assume 0 == ~cond; {569#false} is VALID [2022-04-15 14:27:55,184 INFO L290 TraceCheckUtils]: 25: Hoare triple {569#false} assume !false; {569#false} is VALID [2022-04-15 14:27:55,185 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 14:27:55,185 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 14:27:55,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 14:27:55,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655811799] [2022-04-15 14:27:55,185 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 14:27:55,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [495049084] [2022-04-15 14:27:55,185 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [495049084] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:27:55,185 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:27:55,185 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 14:27:55,186 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 14:27:55,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1481764316] [2022-04-15 14:27:55,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1481764316] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:27:55,186 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:27:55,186 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 14:27:55,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803583952] [2022-04-15 14:27:55,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 14:27:55,186 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2022-04-15 14:27:55,187 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 14:27:55,187 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 14:27:55,203 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-15 14:27:55,203 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 14:27:55,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 14:27:55,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 14:27:55,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-15 14:27:55,204 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 14:27:55,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:27:55,277 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2022-04-15 14:27:55,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 14:27:55,277 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2022-04-15 14:27:55,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 14:27:55,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 14:27:55,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 48 transitions. [2022-04-15 14:27:55,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 14:27:55,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 48 transitions. [2022-04-15 14:27:55,280 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 48 transitions. [2022-04-15 14:27:55,311 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:27:55,313 INFO L225 Difference]: With dead ends: 41 [2022-04-15 14:27:55,314 INFO L226 Difference]: Without dead ends: 34 [2022-04-15 14:27:55,314 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-15 14:27:55,319 INFO L913 BasicCegarLoop]: 31 mSDtfsCounter, 7 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 14:27:55,322 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 82 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 14:27:55,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-15 14:27:55,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2022-04-15 14:27:55,336 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 14:27:55,336 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 33 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 14:27:55,338 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 33 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 14:27:55,338 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 33 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 14:27:55,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:27:55,341 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2022-04-15 14:27:55,341 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2022-04-15 14:27:55,342 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:27:55,342 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:27:55,342 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 34 states. [2022-04-15 14:27:55,343 INFO L87 Difference]: Start difference. First operand has 33 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 34 states. [2022-04-15 14:27:55,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:27:55,349 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2022-04-15 14:27:55,350 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2022-04-15 14:27:55,351 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:27:55,351 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:27:55,351 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 14:27:55,351 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 14:27:55,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 14:27:55,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2022-04-15 14:27:55,354 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 40 transitions. Word has length 26 [2022-04-15 14:27:55,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 14:27:55,354 INFO L478 AbstractCegarLoop]: Abstraction has 33 states and 40 transitions. [2022-04-15 14:27:55,355 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 14:27:55,355 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 40 transitions. [2022-04-15 14:27:55,387 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:27:55,388 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2022-04-15 14:27:55,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-15 14:27:55,389 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 14:27:55,390 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 14:27:55,409 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-15 14:27:55,603 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-15 14:27:55,603 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 14:27:55,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 14:27:55,604 INFO L85 PathProgramCache]: Analyzing trace with hash 424222106, now seen corresponding path program 1 times [2022-04-15 14:27:55,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 14:27:55,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [535536743] [2022-04-15 14:27:55,604 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 14:27:55,604 INFO L85 PathProgramCache]: Analyzing trace with hash 424222106, now seen corresponding path program 2 times [2022-04-15 14:27:55,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 14:27:55,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593482029] [2022-04-15 14:27:55,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 14:27:55,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 14:27:55,619 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 14:27:55,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1409700044] [2022-04-15 14:27:55,620 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 14:27:55,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 14:27:55,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 14:27:55,621 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-15 14:27:55,622 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-15 14:27:55,661 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-15 14:27:55,661 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 14:27:55,662 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-15 14:27:55,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:27:55,672 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 14:27:56,115 INFO L272 TraceCheckUtils]: 0: Hoare triple {866#true} call ULTIMATE.init(); {866#true} is VALID [2022-04-15 14:27:56,115 INFO L290 TraceCheckUtils]: 1: Hoare triple {866#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(9, 2);~counter~0 := 0; {866#true} is VALID [2022-04-15 14:27:56,115 INFO L290 TraceCheckUtils]: 2: Hoare triple {866#true} assume true; {866#true} is VALID [2022-04-15 14:27:56,116 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {866#true} {866#true} #89#return; {866#true} is VALID [2022-04-15 14:27:56,116 INFO L272 TraceCheckUtils]: 4: Hoare triple {866#true} call #t~ret5 := main(); {866#true} is VALID [2022-04-15 14:27:56,116 INFO L290 TraceCheckUtils]: 5: Hoare triple {866#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 := #t~nondet2;havoc #t~nondet2; {866#true} is VALID [2022-04-15 14:27:56,116 INFO L272 TraceCheckUtils]: 6: Hoare triple {866#true} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {866#true} is VALID [2022-04-15 14:27:56,116 INFO L290 TraceCheckUtils]: 7: Hoare triple {866#true} ~cond := #in~cond; {866#true} is VALID [2022-04-15 14:27:56,116 INFO L290 TraceCheckUtils]: 8: Hoare triple {866#true} assume !(0 == ~cond); {866#true} is VALID [2022-04-15 14:27:56,116 INFO L290 TraceCheckUtils]: 9: Hoare triple {866#true} assume true; {866#true} is VALID [2022-04-15 14:27:56,116 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {866#true} {866#true} #81#return; {866#true} is VALID [2022-04-15 14:27:56,117 INFO L272 TraceCheckUtils]: 11: Hoare triple {866#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {866#true} is VALID [2022-04-15 14:27:56,117 INFO L290 TraceCheckUtils]: 12: Hoare triple {866#true} ~cond := #in~cond; {866#true} is VALID [2022-04-15 14:27:56,117 INFO L290 TraceCheckUtils]: 13: Hoare triple {866#true} assume !(0 == ~cond); {866#true} is VALID [2022-04-15 14:27:56,117 INFO L290 TraceCheckUtils]: 14: Hoare triple {866#true} assume true; {866#true} is VALID [2022-04-15 14:27:56,117 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {866#true} {866#true} #83#return; {866#true} is VALID [2022-04-15 14:27:56,118 INFO L290 TraceCheckUtils]: 16: Hoare triple {866#true} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {919#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 14:27:56,120 INFO L290 TraceCheckUtils]: 17: Hoare triple {919#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {919#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 14:27:56,121 INFO L290 TraceCheckUtils]: 18: Hoare triple {919#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post3 < 50);havoc #t~post3; {919#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 14:27:56,121 INFO L290 TraceCheckUtils]: 19: Hoare triple {919#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {929#(and (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-15 14:27:56,122 INFO L290 TraceCheckUtils]: 20: Hoare triple {929#(and (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0))} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {929#(and (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-15 14:27:56,122 INFO L290 TraceCheckUtils]: 21: Hoare triple {929#(and (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post4 < 50);havoc #t~post4; {929#(and (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-15 14:27:56,123 INFO L272 TraceCheckUtils]: 22: Hoare triple {929#(and (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)); {939#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 14:27:56,124 INFO L290 TraceCheckUtils]: 23: Hoare triple {939#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {943#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 14:27:56,124 INFO L290 TraceCheckUtils]: 24: Hoare triple {943#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {867#false} is VALID [2022-04-15 14:27:56,124 INFO L290 TraceCheckUtils]: 25: Hoare triple {867#false} assume !false; {867#false} is VALID [2022-04-15 14:27:56,124 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 14:27:56,125 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 14:27:56,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 14:27:56,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593482029] [2022-04-15 14:27:56,125 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 14:27:56,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1409700044] [2022-04-15 14:27:56,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1409700044] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:27:56,125 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:27:56,125 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 14:27:56,125 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 14:27:56,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [535536743] [2022-04-15 14:27:56,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [535536743] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:27:56,126 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:27:56,126 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 14:27:56,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210716477] [2022-04-15 14:27:56,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 14:27:56,126 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 26 [2022-04-15 14:27:56,126 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 14:27:56,127 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 14:27:56,142 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-15 14:27:56,143 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 14:27:56,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 14:27:56,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 14:27:56,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-04-15 14:27:56,143 INFO L87 Difference]: Start difference. First operand 33 states and 40 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 14:27:56,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:27:56,338 INFO L93 Difference]: Finished difference Result 50 states and 63 transitions. [2022-04-15 14:27:56,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 14:27:56,339 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 26 [2022-04-15 14:27:56,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 14:27:56,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 14:27:56,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 57 transitions. [2022-04-15 14:27:56,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 14:27:56,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 57 transitions. [2022-04-15 14:27:56,362 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 57 transitions. [2022-04-15 14:27:56,422 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:27:56,427 INFO L225 Difference]: With dead ends: 50 [2022-04-15 14:27:56,427 INFO L226 Difference]: Without dead ends: 46 [2022-04-15 14:27:56,428 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 21 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-15 14:27:56,430 INFO L913 BasicCegarLoop]: 28 mSDtfsCounter, 18 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 14:27:56,431 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 104 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 14:27:56,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-04-15 14:27:56,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 39. [2022-04-15 14:27:56,451 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 14:27:56,452 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand has 39 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 28 states have internal predecessors, (34), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 14:27:56,453 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand has 39 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 28 states have internal predecessors, (34), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 14:27:56,453 INFO L87 Difference]: Start difference. First operand 46 states. Second operand has 39 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 28 states have internal predecessors, (34), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 14:27:56,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:27:56,458 INFO L93 Difference]: Finished difference Result 46 states and 55 transitions. [2022-04-15 14:27:56,458 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 55 transitions. [2022-04-15 14:27:56,459 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:27:56,459 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:27:56,459 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 28 states have internal predecessors, (34), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 46 states. [2022-04-15 14:27:56,460 INFO L87 Difference]: Start difference. First operand has 39 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 28 states have internal predecessors, (34), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 46 states. [2022-04-15 14:27:56,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:27:56,462 INFO L93 Difference]: Finished difference Result 46 states and 55 transitions. [2022-04-15 14:27:56,462 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 55 transitions. [2022-04-15 14:27:56,462 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:27:56,463 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:27:56,463 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 14:27:56,463 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 14:27:56,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 28 states have internal predecessors, (34), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 14:27:56,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 46 transitions. [2022-04-15 14:27:56,465 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 46 transitions. Word has length 26 [2022-04-15 14:27:56,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 14:27:56,466 INFO L478 AbstractCegarLoop]: Abstraction has 39 states and 46 transitions. [2022-04-15 14:27:56,466 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 14:27:56,467 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 46 transitions. [2022-04-15 14:27:56,500 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:27:56,500 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2022-04-15 14:27:56,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-15 14:27:56,501 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 14:27:56,501 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 14:27:56,519 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-15 14:27:56,719 WARN L460 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-15 14:27:56,720 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 14:27:56,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 14:27:56,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1733722638, now seen corresponding path program 1 times [2022-04-15 14:27:56,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 14:27:56,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2009402088] [2022-04-15 14:27:56,721 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 14:27:56,721 INFO L85 PathProgramCache]: Analyzing trace with hash -1733722638, now seen corresponding path program 2 times [2022-04-15 14:27:56,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 14:27:56,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855189155] [2022-04-15 14:27:56,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 14:27:56,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 14:27:56,740 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 14:27:56,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [469129454] [2022-04-15 14:27:56,741 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 14:27:56,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 14:27:56,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 14:27:56,742 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-15 14:27:56,743 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-15 14:27:56,791 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 14:27:56,791 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 14:27:56,792 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 14:27:56,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:27:56,801 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 14:27:56,968 INFO L272 TraceCheckUtils]: 0: Hoare triple {1221#true} call ULTIMATE.init(); {1221#true} is VALID [2022-04-15 14:27:56,969 INFO L290 TraceCheckUtils]: 1: Hoare triple {1221#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(9, 2);~counter~0 := 0; {1229#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:56,969 INFO L290 TraceCheckUtils]: 2: Hoare triple {1229#(<= ~counter~0 0)} assume true; {1229#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:56,970 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1229#(<= ~counter~0 0)} {1221#true} #89#return; {1229#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:56,971 INFO L272 TraceCheckUtils]: 4: Hoare triple {1229#(<= ~counter~0 0)} call #t~ret5 := main(); {1229#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:56,972 INFO L290 TraceCheckUtils]: 5: Hoare triple {1229#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := #t~nondet2;havoc #t~nondet2; {1229#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:56,982 INFO L272 TraceCheckUtils]: 6: Hoare triple {1229#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {1229#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:56,983 INFO L290 TraceCheckUtils]: 7: Hoare triple {1229#(<= ~counter~0 0)} ~cond := #in~cond; {1229#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:56,983 INFO L290 TraceCheckUtils]: 8: Hoare triple {1229#(<= ~counter~0 0)} assume !(0 == ~cond); {1229#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:56,984 INFO L290 TraceCheckUtils]: 9: Hoare triple {1229#(<= ~counter~0 0)} assume true; {1229#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:56,984 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1229#(<= ~counter~0 0)} {1229#(<= ~counter~0 0)} #81#return; {1229#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:56,984 INFO L272 TraceCheckUtils]: 11: Hoare triple {1229#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {1229#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:56,985 INFO L290 TraceCheckUtils]: 12: Hoare triple {1229#(<= ~counter~0 0)} ~cond := #in~cond; {1229#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:56,985 INFO L290 TraceCheckUtils]: 13: Hoare triple {1229#(<= ~counter~0 0)} assume !(0 == ~cond); {1229#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:56,985 INFO L290 TraceCheckUtils]: 14: Hoare triple {1229#(<= ~counter~0 0)} assume true; {1229#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:56,986 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1229#(<= ~counter~0 0)} {1229#(<= ~counter~0 0)} #83#return; {1229#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:56,986 INFO L290 TraceCheckUtils]: 16: Hoare triple {1229#(<= ~counter~0 0)} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {1229#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:56,986 INFO L290 TraceCheckUtils]: 17: Hoare triple {1229#(<= ~counter~0 0)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {1278#(<= ~counter~0 1)} is VALID [2022-04-15 14:27:56,987 INFO L290 TraceCheckUtils]: 18: Hoare triple {1278#(<= ~counter~0 1)} assume !!(#t~post3 < 50);havoc #t~post3; {1278#(<= ~counter~0 1)} is VALID [2022-04-15 14:27:56,987 INFO L290 TraceCheckUtils]: 19: Hoare triple {1278#(<= ~counter~0 1)} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {1278#(<= ~counter~0 1)} is VALID [2022-04-15 14:27:56,987 INFO L290 TraceCheckUtils]: 20: Hoare triple {1278#(<= ~counter~0 1)} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {1288#(<= ~counter~0 2)} is VALID [2022-04-15 14:27:56,988 INFO L290 TraceCheckUtils]: 21: Hoare triple {1288#(<= ~counter~0 2)} assume !!(#t~post4 < 50);havoc #t~post4; {1288#(<= ~counter~0 2)} is VALID [2022-04-15 14:27:56,988 INFO L272 TraceCheckUtils]: 22: Hoare triple {1288#(<= ~counter~0 2)} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1288#(<= ~counter~0 2)} is VALID [2022-04-15 14:27:56,989 INFO L290 TraceCheckUtils]: 23: Hoare triple {1288#(<= ~counter~0 2)} ~cond := #in~cond; {1288#(<= ~counter~0 2)} is VALID [2022-04-15 14:27:56,989 INFO L290 TraceCheckUtils]: 24: Hoare triple {1288#(<= ~counter~0 2)} assume !(0 == ~cond); {1288#(<= ~counter~0 2)} is VALID [2022-04-15 14:27:56,995 INFO L290 TraceCheckUtils]: 25: Hoare triple {1288#(<= ~counter~0 2)} assume true; {1288#(<= ~counter~0 2)} is VALID [2022-04-15 14:27:56,997 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1288#(<= ~counter~0 2)} {1288#(<= ~counter~0 2)} #85#return; {1288#(<= ~counter~0 2)} is VALID [2022-04-15 14:27:56,997 INFO L290 TraceCheckUtils]: 27: Hoare triple {1288#(<= ~counter~0 2)} 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); {1288#(<= ~counter~0 2)} is VALID [2022-04-15 14:27:56,997 INFO L290 TraceCheckUtils]: 28: Hoare triple {1288#(<= ~counter~0 2)} assume ~r~0 % 4294967296 >= ~b~0 % 4294967296;~q~0 := 1 + ~q~0;~r~0 := ~r~0 - ~b~0; {1288#(<= ~counter~0 2)} is VALID [2022-04-15 14:27:56,998 INFO L290 TraceCheckUtils]: 29: Hoare triple {1288#(<= ~counter~0 2)} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {1316#(<= |main_#t~post4| 2)} is VALID [2022-04-15 14:27:56,998 INFO L290 TraceCheckUtils]: 30: Hoare triple {1316#(<= |main_#t~post4| 2)} assume !(#t~post4 < 50);havoc #t~post4; {1222#false} is VALID [2022-04-15 14:27:56,998 INFO L272 TraceCheckUtils]: 31: Hoare triple {1222#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1222#false} is VALID [2022-04-15 14:27:56,999 INFO L290 TraceCheckUtils]: 32: Hoare triple {1222#false} ~cond := #in~cond; {1222#false} is VALID [2022-04-15 14:27:56,999 INFO L290 TraceCheckUtils]: 33: Hoare triple {1222#false} assume 0 == ~cond; {1222#false} is VALID [2022-04-15 14:27:56,999 INFO L290 TraceCheckUtils]: 34: Hoare triple {1222#false} assume !false; {1222#false} is VALID [2022-04-15 14:27:56,999 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 14:27:56,999 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 14:27:57,190 INFO L290 TraceCheckUtils]: 34: Hoare triple {1222#false} assume !false; {1222#false} is VALID [2022-04-15 14:27:57,190 INFO L290 TraceCheckUtils]: 33: Hoare triple {1222#false} assume 0 == ~cond; {1222#false} is VALID [2022-04-15 14:27:57,190 INFO L290 TraceCheckUtils]: 32: Hoare triple {1222#false} ~cond := #in~cond; {1222#false} is VALID [2022-04-15 14:27:57,191 INFO L272 TraceCheckUtils]: 31: Hoare triple {1222#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1222#false} is VALID [2022-04-15 14:27:57,191 INFO L290 TraceCheckUtils]: 30: Hoare triple {1344#(< |main_#t~post4| 50)} assume !(#t~post4 < 50);havoc #t~post4; {1222#false} is VALID [2022-04-15 14:27:57,192 INFO L290 TraceCheckUtils]: 29: Hoare triple {1348#(< ~counter~0 50)} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {1344#(< |main_#t~post4| 50)} is VALID [2022-04-15 14:27:57,193 INFO L290 TraceCheckUtils]: 28: Hoare triple {1348#(< ~counter~0 50)} assume ~r~0 % 4294967296 >= ~b~0 % 4294967296;~q~0 := 1 + ~q~0;~r~0 := ~r~0 - ~b~0; {1348#(< ~counter~0 50)} is VALID [2022-04-15 14:27:57,193 INFO L290 TraceCheckUtils]: 27: Hoare triple {1348#(< ~counter~0 50)} 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); {1348#(< ~counter~0 50)} is VALID [2022-04-15 14:27:57,194 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1221#true} {1348#(< ~counter~0 50)} #85#return; {1348#(< ~counter~0 50)} is VALID [2022-04-15 14:27:57,194 INFO L290 TraceCheckUtils]: 25: Hoare triple {1221#true} assume true; {1221#true} is VALID [2022-04-15 14:27:57,194 INFO L290 TraceCheckUtils]: 24: Hoare triple {1221#true} assume !(0 == ~cond); {1221#true} is VALID [2022-04-15 14:27:57,194 INFO L290 TraceCheckUtils]: 23: Hoare triple {1221#true} ~cond := #in~cond; {1221#true} is VALID [2022-04-15 14:27:57,194 INFO L272 TraceCheckUtils]: 22: Hoare triple {1348#(< ~counter~0 50)} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1221#true} is VALID [2022-04-15 14:27:57,194 INFO L290 TraceCheckUtils]: 21: Hoare triple {1348#(< ~counter~0 50)} assume !!(#t~post4 < 50);havoc #t~post4; {1348#(< ~counter~0 50)} is VALID [2022-04-15 14:27:57,195 INFO L290 TraceCheckUtils]: 20: Hoare triple {1376#(< ~counter~0 49)} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {1348#(< ~counter~0 50)} is VALID [2022-04-15 14:27:57,195 INFO L290 TraceCheckUtils]: 19: Hoare triple {1376#(< ~counter~0 49)} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {1376#(< ~counter~0 49)} is VALID [2022-04-15 14:27:57,195 INFO L290 TraceCheckUtils]: 18: Hoare triple {1376#(< ~counter~0 49)} assume !!(#t~post3 < 50);havoc #t~post3; {1376#(< ~counter~0 49)} is VALID [2022-04-15 14:27:57,196 INFO L290 TraceCheckUtils]: 17: Hoare triple {1386#(< ~counter~0 48)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {1376#(< ~counter~0 49)} is VALID [2022-04-15 14:27:57,196 INFO L290 TraceCheckUtils]: 16: Hoare triple {1386#(< ~counter~0 48)} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {1386#(< ~counter~0 48)} is VALID [2022-04-15 14:27:57,197 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1221#true} {1386#(< ~counter~0 48)} #83#return; {1386#(< ~counter~0 48)} is VALID [2022-04-15 14:27:57,197 INFO L290 TraceCheckUtils]: 14: Hoare triple {1221#true} assume true; {1221#true} is VALID [2022-04-15 14:27:57,197 INFO L290 TraceCheckUtils]: 13: Hoare triple {1221#true} assume !(0 == ~cond); {1221#true} is VALID [2022-04-15 14:27:57,197 INFO L290 TraceCheckUtils]: 12: Hoare triple {1221#true} ~cond := #in~cond; {1221#true} is VALID [2022-04-15 14:27:57,197 INFO L272 TraceCheckUtils]: 11: Hoare triple {1386#(< ~counter~0 48)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {1221#true} is VALID [2022-04-15 14:27:57,197 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1221#true} {1386#(< ~counter~0 48)} #81#return; {1386#(< ~counter~0 48)} is VALID [2022-04-15 14:27:57,198 INFO L290 TraceCheckUtils]: 9: Hoare triple {1221#true} assume true; {1221#true} is VALID [2022-04-15 14:27:57,198 INFO L290 TraceCheckUtils]: 8: Hoare triple {1221#true} assume !(0 == ~cond); {1221#true} is VALID [2022-04-15 14:27:57,198 INFO L290 TraceCheckUtils]: 7: Hoare triple {1221#true} ~cond := #in~cond; {1221#true} is VALID [2022-04-15 14:27:57,198 INFO L272 TraceCheckUtils]: 6: Hoare triple {1386#(< ~counter~0 48)} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {1221#true} is VALID [2022-04-15 14:27:57,198 INFO L290 TraceCheckUtils]: 5: Hoare triple {1386#(< ~counter~0 48)} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := #t~nondet2;havoc #t~nondet2; {1386#(< ~counter~0 48)} is VALID [2022-04-15 14:27:57,199 INFO L272 TraceCheckUtils]: 4: Hoare triple {1386#(< ~counter~0 48)} call #t~ret5 := main(); {1386#(< ~counter~0 48)} is VALID [2022-04-15 14:27:57,199 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1386#(< ~counter~0 48)} {1221#true} #89#return; {1386#(< ~counter~0 48)} is VALID [2022-04-15 14:27:57,199 INFO L290 TraceCheckUtils]: 2: Hoare triple {1386#(< ~counter~0 48)} assume true; {1386#(< ~counter~0 48)} is VALID [2022-04-15 14:27:57,200 INFO L290 TraceCheckUtils]: 1: Hoare triple {1221#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(9, 2);~counter~0 := 0; {1386#(< ~counter~0 48)} is VALID [2022-04-15 14:27:57,200 INFO L272 TraceCheckUtils]: 0: Hoare triple {1221#true} call ULTIMATE.init(); {1221#true} is VALID [2022-04-15 14:27:57,200 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 14:27:57,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 14:27:57,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855189155] [2022-04-15 14:27:57,200 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 14:27:57,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [469129454] [2022-04-15 14:27:57,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [469129454] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 14:27:57,201 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 14:27:57,201 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-04-15 14:27:57,201 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 14:27:57,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2009402088] [2022-04-15 14:27:57,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2009402088] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:27:57,201 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:27:57,201 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 14:27:57,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841314890] [2022-04-15 14:27:57,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 14:27:57,202 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 35 [2022-04-15 14:27:57,202 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 14:27:57,202 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-15 14:27:57,222 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-15 14:27:57,222 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 14:27:57,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 14:27:57,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 14:27:57,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-15 14:27:57,223 INFO L87 Difference]: Start difference. First operand 39 states and 46 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-15 14:27:57,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:27:57,370 INFO L93 Difference]: Finished difference Result 64 states and 75 transitions. [2022-04-15 14:27:57,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 14:27:57,370 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 35 [2022-04-15 14:27:57,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 14:27:57,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-15 14:27:57,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 63 transitions. [2022-04-15 14:27:57,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-15 14:27:57,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 63 transitions. [2022-04-15 14:27:57,373 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 63 transitions. [2022-04-15 14:27:57,412 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:27:57,413 INFO L225 Difference]: With dead ends: 64 [2022-04-15 14:27:57,413 INFO L226 Difference]: Without dead ends: 57 [2022-04-15 14:27:57,414 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2022-04-15 14:27:57,414 INFO L913 BasicCegarLoop]: 32 mSDtfsCounter, 14 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 14:27:57,414 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 115 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 14:27:57,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-04-15 14:27:57,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 51. [2022-04-15 14:27:57,445 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 14:27:57,445 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand has 51 states, 37 states have (on average 1.2432432432432432) internal successors, (46), 38 states have internal predecessors, (46), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 14:27:57,446 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand has 51 states, 37 states have (on average 1.2432432432432432) internal successors, (46), 38 states have internal predecessors, (46), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 14:27:57,446 INFO L87 Difference]: Start difference. First operand 57 states. Second operand has 51 states, 37 states have (on average 1.2432432432432432) internal successors, (46), 38 states have internal predecessors, (46), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 14:27:57,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:27:57,447 INFO L93 Difference]: Finished difference Result 57 states and 68 transitions. [2022-04-15 14:27:57,447 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 68 transitions. [2022-04-15 14:27:57,448 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:27:57,448 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:27:57,448 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 37 states have (on average 1.2432432432432432) internal successors, (46), 38 states have internal predecessors, (46), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 57 states. [2022-04-15 14:27:57,448 INFO L87 Difference]: Start difference. First operand has 51 states, 37 states have (on average 1.2432432432432432) internal successors, (46), 38 states have internal predecessors, (46), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 57 states. [2022-04-15 14:27:57,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:27:57,450 INFO L93 Difference]: Finished difference Result 57 states and 68 transitions. [2022-04-15 14:27:57,450 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 68 transitions. [2022-04-15 14:27:57,450 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:27:57,450 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:27:57,450 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 14:27:57,450 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 14:27:57,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 37 states have (on average 1.2432432432432432) internal successors, (46), 38 states have internal predecessors, (46), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 14:27:57,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 60 transitions. [2022-04-15 14:27:57,452 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 60 transitions. Word has length 35 [2022-04-15 14:27:57,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 14:27:57,452 INFO L478 AbstractCegarLoop]: Abstraction has 51 states and 60 transitions. [2022-04-15 14:27:57,452 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-15 14:27:57,452 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 51 states and 60 transitions. [2022-04-15 14:27:57,500 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:27:57,500 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 60 transitions. [2022-04-15 14:27:57,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-15 14:27:57,501 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 14:27:57,501 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 14:27:57,520 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-15 14:27:57,711 WARN L460 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-15 14:27:57,712 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 14:27:57,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 14:27:57,712 INFO L85 PathProgramCache]: Analyzing trace with hash -1731935178, now seen corresponding path program 1 times [2022-04-15 14:27:57,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 14:27:57,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1833779423] [2022-04-15 14:27:57,713 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 14:27:57,713 INFO L85 PathProgramCache]: Analyzing trace with hash -1731935178, now seen corresponding path program 2 times [2022-04-15 14:27:57,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 14:27:57,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217594432] [2022-04-15 14:27:57,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 14:27:57,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 14:27:57,730 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 14:27:57,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [267624673] [2022-04-15 14:27:57,730 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 14:27:57,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 14:27:57,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 14:27:57,731 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-15 14:27:57,732 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-15 14:27:57,768 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 14:27:57,768 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 14:27:57,769 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-15 14:27:57,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:27:57,778 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 14:27:57,839 INFO L272 TraceCheckUtils]: 0: Hoare triple {1786#true} call ULTIMATE.init(); {1786#true} is VALID [2022-04-15 14:27:57,839 INFO L290 TraceCheckUtils]: 1: Hoare triple {1786#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(9, 2);~counter~0 := 0; {1786#true} is VALID [2022-04-15 14:27:57,839 INFO L290 TraceCheckUtils]: 2: Hoare triple {1786#true} assume true; {1786#true} is VALID [2022-04-15 14:27:57,840 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1786#true} {1786#true} #89#return; {1786#true} is VALID [2022-04-15 14:27:57,840 INFO L272 TraceCheckUtils]: 4: Hoare triple {1786#true} call #t~ret5 := main(); {1786#true} is VALID [2022-04-15 14:27:57,840 INFO L290 TraceCheckUtils]: 5: Hoare triple {1786#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 := #t~nondet2;havoc #t~nondet2; {1786#true} is VALID [2022-04-15 14:27:57,840 INFO L272 TraceCheckUtils]: 6: Hoare triple {1786#true} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {1786#true} is VALID [2022-04-15 14:27:57,840 INFO L290 TraceCheckUtils]: 7: Hoare triple {1786#true} ~cond := #in~cond; {1786#true} is VALID [2022-04-15 14:27:57,840 INFO L290 TraceCheckUtils]: 8: Hoare triple {1786#true} assume !(0 == ~cond); {1786#true} is VALID [2022-04-15 14:27:57,840 INFO L290 TraceCheckUtils]: 9: Hoare triple {1786#true} assume true; {1786#true} is VALID [2022-04-15 14:27:57,840 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1786#true} {1786#true} #81#return; {1786#true} is VALID [2022-04-15 14:27:57,840 INFO L272 TraceCheckUtils]: 11: Hoare triple {1786#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {1786#true} is VALID [2022-04-15 14:27:57,840 INFO L290 TraceCheckUtils]: 12: Hoare triple {1786#true} ~cond := #in~cond; {1786#true} is VALID [2022-04-15 14:27:57,841 INFO L290 TraceCheckUtils]: 13: Hoare triple {1786#true} assume !(0 == ~cond); {1786#true} is VALID [2022-04-15 14:27:57,841 INFO L290 TraceCheckUtils]: 14: Hoare triple {1786#true} assume true; {1786#true} is VALID [2022-04-15 14:27:57,841 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1786#true} {1786#true} #83#return; {1786#true} is VALID [2022-04-15 14:27:57,841 INFO L290 TraceCheckUtils]: 16: Hoare triple {1786#true} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {1839#(= main_~B~0 main_~b~0)} is VALID [2022-04-15 14:27:57,844 INFO L290 TraceCheckUtils]: 17: Hoare triple {1839#(= main_~B~0 main_~b~0)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {1839#(= main_~B~0 main_~b~0)} is VALID [2022-04-15 14:27:57,845 INFO L290 TraceCheckUtils]: 18: Hoare triple {1839#(= main_~B~0 main_~b~0)} assume !!(#t~post3 < 50);havoc #t~post3; {1839#(= main_~B~0 main_~b~0)} is VALID [2022-04-15 14:27:57,845 INFO L290 TraceCheckUtils]: 19: Hoare triple {1839#(= main_~B~0 main_~b~0)} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {1839#(= main_~B~0 main_~b~0)} is VALID [2022-04-15 14:27:57,846 INFO L290 TraceCheckUtils]: 20: Hoare triple {1839#(= main_~B~0 main_~b~0)} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {1839#(= main_~B~0 main_~b~0)} is VALID [2022-04-15 14:27:57,846 INFO L290 TraceCheckUtils]: 21: Hoare triple {1839#(= main_~B~0 main_~b~0)} assume !!(#t~post4 < 50);havoc #t~post4; {1839#(= main_~B~0 main_~b~0)} is VALID [2022-04-15 14:27:57,846 INFO L272 TraceCheckUtils]: 22: Hoare triple {1839#(= main_~B~0 main_~b~0)} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1786#true} is VALID [2022-04-15 14:27:57,846 INFO L290 TraceCheckUtils]: 23: Hoare triple {1786#true} ~cond := #in~cond; {1786#true} is VALID [2022-04-15 14:27:57,846 INFO L290 TraceCheckUtils]: 24: Hoare triple {1786#true} assume !(0 == ~cond); {1786#true} is VALID [2022-04-15 14:27:57,846 INFO L290 TraceCheckUtils]: 25: Hoare triple {1786#true} assume true; {1786#true} is VALID [2022-04-15 14:27:57,847 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1786#true} {1839#(= main_~B~0 main_~b~0)} #85#return; {1839#(= main_~B~0 main_~b~0)} is VALID [2022-04-15 14:27:57,847 INFO L290 TraceCheckUtils]: 27: Hoare triple {1839#(= main_~B~0 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); {1787#false} is VALID [2022-04-15 14:27:57,847 INFO L290 TraceCheckUtils]: 28: Hoare triple {1787#false} assume ~r~0 % 4294967296 >= ~b~0 % 4294967296;~q~0 := 1 + ~q~0;~r~0 := ~r~0 - ~b~0; {1787#false} is VALID [2022-04-15 14:27:57,848 INFO L290 TraceCheckUtils]: 29: Hoare triple {1787#false} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {1787#false} is VALID [2022-04-15 14:27:57,848 INFO L290 TraceCheckUtils]: 30: Hoare triple {1787#false} assume !!(#t~post4 < 50);havoc #t~post4; {1787#false} is VALID [2022-04-15 14:27:57,848 INFO L272 TraceCheckUtils]: 31: Hoare triple {1787#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1787#false} is VALID [2022-04-15 14:27:57,848 INFO L290 TraceCheckUtils]: 32: Hoare triple {1787#false} ~cond := #in~cond; {1787#false} is VALID [2022-04-15 14:27:57,848 INFO L290 TraceCheckUtils]: 33: Hoare triple {1787#false} assume 0 == ~cond; {1787#false} is VALID [2022-04-15 14:27:57,848 INFO L290 TraceCheckUtils]: 34: Hoare triple {1787#false} assume !false; {1787#false} is VALID [2022-04-15 14:27:57,849 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 14:27:57,849 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 14:27:57,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 14:27:57,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217594432] [2022-04-15 14:27:57,849 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 14:27:57,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [267624673] [2022-04-15 14:27:57,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [267624673] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:27:57,849 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:27:57,850 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 14:27:57,850 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 14:27:57,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1833779423] [2022-04-15 14:27:57,850 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1833779423] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:27:57,850 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:27:57,850 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 14:27:57,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649508267] [2022-04-15 14:27:57,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 14:27:57,850 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 35 [2022-04-15 14:27:57,851 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 14:27:57,851 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 14:27:57,869 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-15 14:27:57,869 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 14:27:57,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 14:27:57,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 14:27:57,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 14:27:57,877 INFO L87 Difference]: Start difference. First operand 51 states and 60 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 14:27:57,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:27:57,952 INFO L93 Difference]: Finished difference Result 72 states and 85 transitions. [2022-04-15 14:27:57,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 14:27:57,952 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 35 [2022-04-15 14:27:57,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 14:27:57,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 14:27:57,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 58 transitions. [2022-04-15 14:27:57,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 14:27:57,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 58 transitions. [2022-04-15 14:27:57,955 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 58 transitions. [2022-04-15 14:27:57,991 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:27:57,992 INFO L225 Difference]: With dead ends: 72 [2022-04-15 14:27:57,992 INFO L226 Difference]: Without dead ends: 40 [2022-04-15 14:27:57,992 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 33 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-15 14:27:57,993 INFO L913 BasicCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 14:27:57,993 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 55 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 14:27:57,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-04-15 14:27:58,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2022-04-15 14:27:58,011 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 14:27:58,011 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand has 40 states, 28 states have (on average 1.25) internal successors, (35), 29 states have internal predecessors, (35), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 14:27:58,011 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand has 40 states, 28 states have (on average 1.25) internal successors, (35), 29 states have internal predecessors, (35), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 14:27:58,011 INFO L87 Difference]: Start difference. First operand 40 states. Second operand has 40 states, 28 states have (on average 1.25) internal successors, (35), 29 states have internal predecessors, (35), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 14:27:58,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:27:58,013 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2022-04-15 14:27:58,013 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 47 transitions. [2022-04-15 14:27:58,013 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:27:58,013 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:27:58,013 INFO L74 IsIncluded]: Start isIncluded. First operand has 40 states, 28 states have (on average 1.25) internal successors, (35), 29 states have internal predecessors, (35), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 40 states. [2022-04-15 14:27:58,013 INFO L87 Difference]: Start difference. First operand has 40 states, 28 states have (on average 1.25) internal successors, (35), 29 states have internal predecessors, (35), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 40 states. [2022-04-15 14:27:58,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:27:58,014 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2022-04-15 14:27:58,015 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 47 transitions. [2022-04-15 14:27:58,015 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:27:58,015 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:27:58,015 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 14:27:58,015 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 14:27:58,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 28 states have (on average 1.25) internal successors, (35), 29 states have internal predecessors, (35), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 14:27:58,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 47 transitions. [2022-04-15 14:27:58,016 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 47 transitions. Word has length 35 [2022-04-15 14:27:58,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 14:27:58,016 INFO L478 AbstractCegarLoop]: Abstraction has 40 states and 47 transitions. [2022-04-15 14:27:58,016 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 14:27:58,017 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 47 transitions. [2022-04-15 14:27:58,057 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:27:58,058 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 47 transitions. [2022-04-15 14:27:58,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-15 14:27:58,058 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 14:27:58,058 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 14:27:58,075 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-04-15 14:27:58,263 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 14:27:58,265 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 14:27:58,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 14:27:58,266 INFO L85 PathProgramCache]: Analyzing trace with hash -1874551443, now seen corresponding path program 1 times [2022-04-15 14:27:58,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 14:27:58,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [567894869] [2022-04-15 14:27:58,266 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 14:27:58,266 INFO L85 PathProgramCache]: Analyzing trace with hash -1874551443, now seen corresponding path program 2 times [2022-04-15 14:27:58,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 14:27:58,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63335882] [2022-04-15 14:27:58,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 14:27:58,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 14:27:58,294 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 14:27:58,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2089962908] [2022-04-15 14:27:58,294 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 14:27:58,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 14:27:58,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 14:27:58,295 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 14:27:58,296 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-15 14:27:58,342 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 14:27:58,343 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 14:27:58,344 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 14:27:58,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:27:58,351 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 14:27:58,483 INFO L272 TraceCheckUtils]: 0: Hoare triple {2197#true} call ULTIMATE.init(); {2197#true} is VALID [2022-04-15 14:27:58,484 INFO L290 TraceCheckUtils]: 1: Hoare triple {2197#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(9, 2);~counter~0 := 0; {2205#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:58,484 INFO L290 TraceCheckUtils]: 2: Hoare triple {2205#(<= ~counter~0 0)} assume true; {2205#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:58,485 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2205#(<= ~counter~0 0)} {2197#true} #89#return; {2205#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:58,485 INFO L272 TraceCheckUtils]: 4: Hoare triple {2205#(<= ~counter~0 0)} call #t~ret5 := main(); {2205#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:58,486 INFO L290 TraceCheckUtils]: 5: Hoare triple {2205#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := #t~nondet2;havoc #t~nondet2; {2205#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:58,486 INFO L272 TraceCheckUtils]: 6: Hoare triple {2205#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {2205#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:58,487 INFO L290 TraceCheckUtils]: 7: Hoare triple {2205#(<= ~counter~0 0)} ~cond := #in~cond; {2205#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:58,487 INFO L290 TraceCheckUtils]: 8: Hoare triple {2205#(<= ~counter~0 0)} assume !(0 == ~cond); {2205#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:58,487 INFO L290 TraceCheckUtils]: 9: Hoare triple {2205#(<= ~counter~0 0)} assume true; {2205#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:58,488 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2205#(<= ~counter~0 0)} {2205#(<= ~counter~0 0)} #81#return; {2205#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:58,488 INFO L272 TraceCheckUtils]: 11: Hoare triple {2205#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {2205#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:58,489 INFO L290 TraceCheckUtils]: 12: Hoare triple {2205#(<= ~counter~0 0)} ~cond := #in~cond; {2205#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:58,489 INFO L290 TraceCheckUtils]: 13: Hoare triple {2205#(<= ~counter~0 0)} assume !(0 == ~cond); {2205#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:58,490 INFO L290 TraceCheckUtils]: 14: Hoare triple {2205#(<= ~counter~0 0)} assume true; {2205#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:58,490 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2205#(<= ~counter~0 0)} {2205#(<= ~counter~0 0)} #83#return; {2205#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:58,490 INFO L290 TraceCheckUtils]: 16: Hoare triple {2205#(<= ~counter~0 0)} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {2205#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:58,491 INFO L290 TraceCheckUtils]: 17: Hoare triple {2205#(<= ~counter~0 0)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {2254#(<= ~counter~0 1)} is VALID [2022-04-15 14:27:58,491 INFO L290 TraceCheckUtils]: 18: Hoare triple {2254#(<= ~counter~0 1)} assume !!(#t~post3 < 50);havoc #t~post3; {2254#(<= ~counter~0 1)} is VALID [2022-04-15 14:27:58,492 INFO L290 TraceCheckUtils]: 19: Hoare triple {2254#(<= ~counter~0 1)} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {2254#(<= ~counter~0 1)} is VALID [2022-04-15 14:27:58,492 INFO L290 TraceCheckUtils]: 20: Hoare triple {2254#(<= ~counter~0 1)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {2264#(<= |main_#t~post3| 1)} is VALID [2022-04-15 14:27:58,492 INFO L290 TraceCheckUtils]: 21: Hoare triple {2264#(<= |main_#t~post3| 1)} assume !(#t~post3 < 50);havoc #t~post3; {2198#false} is VALID [2022-04-15 14:27:58,492 INFO L290 TraceCheckUtils]: 22: Hoare triple {2198#false} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {2198#false} is VALID [2022-04-15 14:27:58,493 INFO L290 TraceCheckUtils]: 23: Hoare triple {2198#false} assume !!(#t~post4 < 50);havoc #t~post4; {2198#false} is VALID [2022-04-15 14:27:58,493 INFO L272 TraceCheckUtils]: 24: Hoare triple {2198#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {2198#false} is VALID [2022-04-15 14:27:58,493 INFO L290 TraceCheckUtils]: 25: Hoare triple {2198#false} ~cond := #in~cond; {2198#false} is VALID [2022-04-15 14:27:58,493 INFO L290 TraceCheckUtils]: 26: Hoare triple {2198#false} assume !(0 == ~cond); {2198#false} is VALID [2022-04-15 14:27:58,493 INFO L290 TraceCheckUtils]: 27: Hoare triple {2198#false} assume true; {2198#false} is VALID [2022-04-15 14:27:58,493 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2198#false} {2198#false} #85#return; {2198#false} is VALID [2022-04-15 14:27:58,493 INFO L290 TraceCheckUtils]: 29: Hoare triple {2198#false} assume !!(~b~0 % 4294967296 != ~B~0 % 4294967296);~q~0 := 2 * ~q~0;~b~0 := (if ~b~0 % 4294967296 < 0 && 0 != ~b~0 % 4294967296 % 2 then 1 + ~b~0 % 4294967296 / 2 else ~b~0 % 4294967296 / 2); {2198#false} is VALID [2022-04-15 14:27:58,493 INFO L290 TraceCheckUtils]: 30: Hoare triple {2198#false} assume ~r~0 % 4294967296 >= ~b~0 % 4294967296;~q~0 := 1 + ~q~0;~r~0 := ~r~0 - ~b~0; {2198#false} is VALID [2022-04-15 14:27:58,493 INFO L290 TraceCheckUtils]: 31: Hoare triple {2198#false} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {2198#false} is VALID [2022-04-15 14:27:58,493 INFO L290 TraceCheckUtils]: 32: Hoare triple {2198#false} assume !(#t~post4 < 50);havoc #t~post4; {2198#false} is VALID [2022-04-15 14:27:58,494 INFO L272 TraceCheckUtils]: 33: Hoare triple {2198#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {2198#false} is VALID [2022-04-15 14:27:58,494 INFO L290 TraceCheckUtils]: 34: Hoare triple {2198#false} ~cond := #in~cond; {2198#false} is VALID [2022-04-15 14:27:58,494 INFO L290 TraceCheckUtils]: 35: Hoare triple {2198#false} assume 0 == ~cond; {2198#false} is VALID [2022-04-15 14:27:58,494 INFO L290 TraceCheckUtils]: 36: Hoare triple {2198#false} assume !false; {2198#false} is VALID [2022-04-15 14:27:58,494 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-15 14:27:58,494 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 14:27:58,673 INFO L290 TraceCheckUtils]: 36: Hoare triple {2198#false} assume !false; {2198#false} is VALID [2022-04-15 14:27:58,673 INFO L290 TraceCheckUtils]: 35: Hoare triple {2198#false} assume 0 == ~cond; {2198#false} is VALID [2022-04-15 14:27:58,673 INFO L290 TraceCheckUtils]: 34: Hoare triple {2198#false} ~cond := #in~cond; {2198#false} is VALID [2022-04-15 14:27:58,673 INFO L272 TraceCheckUtils]: 33: Hoare triple {2198#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {2198#false} is VALID [2022-04-15 14:27:58,673 INFO L290 TraceCheckUtils]: 32: Hoare triple {2198#false} assume !(#t~post4 < 50);havoc #t~post4; {2198#false} is VALID [2022-04-15 14:27:58,673 INFO L290 TraceCheckUtils]: 31: Hoare triple {2198#false} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {2198#false} is VALID [2022-04-15 14:27:58,673 INFO L290 TraceCheckUtils]: 30: Hoare triple {2198#false} assume ~r~0 % 4294967296 >= ~b~0 % 4294967296;~q~0 := 1 + ~q~0;~r~0 := ~r~0 - ~b~0; {2198#false} is VALID [2022-04-15 14:27:58,673 INFO L290 TraceCheckUtils]: 29: Hoare triple {2198#false} assume !!(~b~0 % 4294967296 != ~B~0 % 4294967296);~q~0 := 2 * ~q~0;~b~0 := (if ~b~0 % 4294967296 < 0 && 0 != ~b~0 % 4294967296 % 2 then 1 + ~b~0 % 4294967296 / 2 else ~b~0 % 4294967296 / 2); {2198#false} is VALID [2022-04-15 14:27:58,674 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2197#true} {2198#false} #85#return; {2198#false} is VALID [2022-04-15 14:27:58,674 INFO L290 TraceCheckUtils]: 27: Hoare triple {2197#true} assume true; {2197#true} is VALID [2022-04-15 14:27:58,674 INFO L290 TraceCheckUtils]: 26: Hoare triple {2197#true} assume !(0 == ~cond); {2197#true} is VALID [2022-04-15 14:27:58,674 INFO L290 TraceCheckUtils]: 25: Hoare triple {2197#true} ~cond := #in~cond; {2197#true} is VALID [2022-04-15 14:27:58,674 INFO L272 TraceCheckUtils]: 24: Hoare triple {2198#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {2197#true} is VALID [2022-04-15 14:27:58,674 INFO L290 TraceCheckUtils]: 23: Hoare triple {2198#false} assume !!(#t~post4 < 50);havoc #t~post4; {2198#false} is VALID [2022-04-15 14:27:58,674 INFO L290 TraceCheckUtils]: 22: Hoare triple {2198#false} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {2198#false} is VALID [2022-04-15 14:27:58,676 INFO L290 TraceCheckUtils]: 21: Hoare triple {2358#(< |main_#t~post3| 50)} assume !(#t~post3 < 50);havoc #t~post3; {2198#false} is VALID [2022-04-15 14:27:58,676 INFO L290 TraceCheckUtils]: 20: Hoare triple {2362#(< ~counter~0 50)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {2358#(< |main_#t~post3| 50)} is VALID [2022-04-15 14:27:58,677 INFO L290 TraceCheckUtils]: 19: Hoare triple {2362#(< ~counter~0 50)} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {2362#(< ~counter~0 50)} is VALID [2022-04-15 14:27:58,677 INFO L290 TraceCheckUtils]: 18: Hoare triple {2362#(< ~counter~0 50)} assume !!(#t~post3 < 50);havoc #t~post3; {2362#(< ~counter~0 50)} is VALID [2022-04-15 14:27:58,677 INFO L290 TraceCheckUtils]: 17: Hoare triple {2372#(< ~counter~0 49)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {2362#(< ~counter~0 50)} is VALID [2022-04-15 14:27:58,678 INFO L290 TraceCheckUtils]: 16: Hoare triple {2372#(< ~counter~0 49)} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {2372#(< ~counter~0 49)} is VALID [2022-04-15 14:27:58,678 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2197#true} {2372#(< ~counter~0 49)} #83#return; {2372#(< ~counter~0 49)} is VALID [2022-04-15 14:27:58,678 INFO L290 TraceCheckUtils]: 14: Hoare triple {2197#true} assume true; {2197#true} is VALID [2022-04-15 14:27:58,679 INFO L290 TraceCheckUtils]: 13: Hoare triple {2197#true} assume !(0 == ~cond); {2197#true} is VALID [2022-04-15 14:27:58,679 INFO L290 TraceCheckUtils]: 12: Hoare triple {2197#true} ~cond := #in~cond; {2197#true} is VALID [2022-04-15 14:27:58,679 INFO L272 TraceCheckUtils]: 11: Hoare triple {2372#(< ~counter~0 49)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {2197#true} is VALID [2022-04-15 14:27:58,679 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2197#true} {2372#(< ~counter~0 49)} #81#return; {2372#(< ~counter~0 49)} is VALID [2022-04-15 14:27:58,679 INFO L290 TraceCheckUtils]: 9: Hoare triple {2197#true} assume true; {2197#true} is VALID [2022-04-15 14:27:58,679 INFO L290 TraceCheckUtils]: 8: Hoare triple {2197#true} assume !(0 == ~cond); {2197#true} is VALID [2022-04-15 14:27:58,679 INFO L290 TraceCheckUtils]: 7: Hoare triple {2197#true} ~cond := #in~cond; {2197#true} is VALID [2022-04-15 14:27:58,680 INFO L272 TraceCheckUtils]: 6: Hoare triple {2372#(< ~counter~0 49)} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {2197#true} is VALID [2022-04-15 14:27:58,680 INFO L290 TraceCheckUtils]: 5: Hoare triple {2372#(< ~counter~0 49)} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := #t~nondet2;havoc #t~nondet2; {2372#(< ~counter~0 49)} is VALID [2022-04-15 14:27:58,680 INFO L272 TraceCheckUtils]: 4: Hoare triple {2372#(< ~counter~0 49)} call #t~ret5 := main(); {2372#(< ~counter~0 49)} is VALID [2022-04-15 14:27:58,681 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2372#(< ~counter~0 49)} {2197#true} #89#return; {2372#(< ~counter~0 49)} is VALID [2022-04-15 14:27:58,681 INFO L290 TraceCheckUtils]: 2: Hoare triple {2372#(< ~counter~0 49)} assume true; {2372#(< ~counter~0 49)} is VALID [2022-04-15 14:27:58,681 INFO L290 TraceCheckUtils]: 1: Hoare triple {2197#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(9, 2);~counter~0 := 0; {2372#(< ~counter~0 49)} is VALID [2022-04-15 14:27:58,681 INFO L272 TraceCheckUtils]: 0: Hoare triple {2197#true} call ULTIMATE.init(); {2197#true} is VALID [2022-04-15 14:27:58,682 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-15 14:27:58,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 14:27:58,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63335882] [2022-04-15 14:27:58,682 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 14:27:58,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2089962908] [2022-04-15 14:27:58,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2089962908] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 14:27:58,682 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 14:27:58,682 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-15 14:27:58,682 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 14:27:58,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [567894869] [2022-04-15 14:27:58,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [567894869] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:27:58,683 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:27:58,683 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 14:27:58,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033649671] [2022-04-15 14:27:58,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 14:27:58,683 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 37 [2022-04-15 14:27:58,683 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 14:27:58,684 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-15 14:27:58,706 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-15 14:27:58,706 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 14:27:58,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 14:27:58,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 14:27:58,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-15 14:27:58,707 INFO L87 Difference]: Start difference. First operand 40 states and 47 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-15 14:27:58,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:27:58,797 INFO L93 Difference]: Finished difference Result 63 states and 75 transitions. [2022-04-15 14:27:58,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 14:27:58,797 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 37 [2022-04-15 14:27:58,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 14:27:58,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-15 14:27:58,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 55 transitions. [2022-04-15 14:27:58,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-15 14:27:58,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 55 transitions. [2022-04-15 14:27:58,799 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 55 transitions. [2022-04-15 14:27:58,834 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-15 14:27:58,835 INFO L225 Difference]: With dead ends: 63 [2022-04-15 14:27:58,835 INFO L226 Difference]: Without dead ends: 42 [2022-04-15 14:27:58,835 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-04-15 14:27:58,836 INFO L913 BasicCegarLoop]: 32 mSDtfsCounter, 6 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 14:27:58,836 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 82 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 14:27:58,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-04-15 14:27:58,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2022-04-15 14:27:58,859 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 14:27:58,859 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand has 42 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 31 states have internal predecessors, (37), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 14:27:58,860 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand has 42 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 31 states have internal predecessors, (37), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 14:27:58,860 INFO L87 Difference]: Start difference. First operand 42 states. Second operand has 42 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 31 states have internal predecessors, (37), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 14:27:58,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:27:58,861 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2022-04-15 14:27:58,861 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2022-04-15 14:27:58,861 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:27:58,861 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:27:58,861 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 31 states have internal predecessors, (37), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 42 states. [2022-04-15 14:27:58,862 INFO L87 Difference]: Start difference. First operand has 42 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 31 states have internal predecessors, (37), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 42 states. [2022-04-15 14:27:58,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:27:58,863 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2022-04-15 14:27:58,863 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2022-04-15 14:27:58,863 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:27:58,863 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:27:58,863 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 14:27:58,863 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 14:27:58,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 31 states have internal predecessors, (37), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 14:27:58,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 49 transitions. [2022-04-15 14:27:58,864 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 49 transitions. Word has length 37 [2022-04-15 14:27:58,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 14:27:58,864 INFO L478 AbstractCegarLoop]: Abstraction has 42 states and 49 transitions. [2022-04-15 14:27:58,865 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-15 14:27:58,865 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 49 transitions. [2022-04-15 14:27:58,900 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:27:58,901 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2022-04-15 14:27:58,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-15 14:27:58,901 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 14:27:58,901 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 14:27:58,920 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-15 14:27:59,103 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 14:27:59,104 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 14:27:59,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 14:27:59,104 INFO L85 PathProgramCache]: Analyzing trace with hash 815990494, now seen corresponding path program 1 times [2022-04-15 14:27:59,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 14:27:59,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1505447807] [2022-04-15 14:27:59,104 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 14:27:59,105 INFO L85 PathProgramCache]: Analyzing trace with hash 815990494, now seen corresponding path program 2 times [2022-04-15 14:27:59,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 14:27:59,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287810915] [2022-04-15 14:27:59,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 14:27:59,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 14:27:59,120 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 14:27:59,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1589746119] [2022-04-15 14:27:59,120 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 14:27:59,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 14:27:59,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 14:27:59,121 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 14:27:59,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-15 14:27:59,157 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 14:27:59,158 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 14:27:59,158 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-15 14:27:59,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:27:59,175 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 14:27:59,360 INFO L272 TraceCheckUtils]: 0: Hoare triple {2722#true} call ULTIMATE.init(); {2722#true} is VALID [2022-04-15 14:27:59,361 INFO L290 TraceCheckUtils]: 1: Hoare triple {2722#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(9, 2);~counter~0 := 0; {2730#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:59,361 INFO L290 TraceCheckUtils]: 2: Hoare triple {2730#(<= ~counter~0 0)} assume true; {2730#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:59,361 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2730#(<= ~counter~0 0)} {2722#true} #89#return; {2730#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:59,362 INFO L272 TraceCheckUtils]: 4: Hoare triple {2730#(<= ~counter~0 0)} call #t~ret5 := main(); {2730#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:59,362 INFO L290 TraceCheckUtils]: 5: Hoare triple {2730#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := #t~nondet2;havoc #t~nondet2; {2730#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:59,362 INFO L272 TraceCheckUtils]: 6: Hoare triple {2730#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {2730#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:59,362 INFO L290 TraceCheckUtils]: 7: Hoare triple {2730#(<= ~counter~0 0)} ~cond := #in~cond; {2730#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:59,363 INFO L290 TraceCheckUtils]: 8: Hoare triple {2730#(<= ~counter~0 0)} assume !(0 == ~cond); {2730#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:59,363 INFO L290 TraceCheckUtils]: 9: Hoare triple {2730#(<= ~counter~0 0)} assume true; {2730#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:59,363 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2730#(<= ~counter~0 0)} {2730#(<= ~counter~0 0)} #81#return; {2730#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:59,364 INFO L272 TraceCheckUtils]: 11: Hoare triple {2730#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {2730#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:59,364 INFO L290 TraceCheckUtils]: 12: Hoare triple {2730#(<= ~counter~0 0)} ~cond := #in~cond; {2730#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:59,364 INFO L290 TraceCheckUtils]: 13: Hoare triple {2730#(<= ~counter~0 0)} assume !(0 == ~cond); {2730#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:59,364 INFO L290 TraceCheckUtils]: 14: Hoare triple {2730#(<= ~counter~0 0)} assume true; {2730#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:59,365 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2730#(<= ~counter~0 0)} {2730#(<= ~counter~0 0)} #83#return; {2730#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:59,365 INFO L290 TraceCheckUtils]: 16: Hoare triple {2730#(<= ~counter~0 0)} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {2730#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:59,366 INFO L290 TraceCheckUtils]: 17: Hoare triple {2730#(<= ~counter~0 0)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {2779#(<= ~counter~0 1)} is VALID [2022-04-15 14:27:59,366 INFO L290 TraceCheckUtils]: 18: Hoare triple {2779#(<= ~counter~0 1)} assume !!(#t~post3 < 50);havoc #t~post3; {2779#(<= ~counter~0 1)} is VALID [2022-04-15 14:27:59,366 INFO L290 TraceCheckUtils]: 19: Hoare triple {2779#(<= ~counter~0 1)} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {2779#(<= ~counter~0 1)} is VALID [2022-04-15 14:27:59,367 INFO L290 TraceCheckUtils]: 20: Hoare triple {2779#(<= ~counter~0 1)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {2789#(<= ~counter~0 2)} is VALID [2022-04-15 14:27:59,367 INFO L290 TraceCheckUtils]: 21: Hoare triple {2789#(<= ~counter~0 2)} assume !!(#t~post3 < 50);havoc #t~post3; {2789#(<= ~counter~0 2)} is VALID [2022-04-15 14:27:59,367 INFO L290 TraceCheckUtils]: 22: Hoare triple {2789#(<= ~counter~0 2)} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {2789#(<= ~counter~0 2)} is VALID [2022-04-15 14:27:59,367 INFO L290 TraceCheckUtils]: 23: Hoare triple {2789#(<= ~counter~0 2)} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {2799#(<= ~counter~0 3)} is VALID [2022-04-15 14:27:59,368 INFO L290 TraceCheckUtils]: 24: Hoare triple {2799#(<= ~counter~0 3)} assume !!(#t~post4 < 50);havoc #t~post4; {2799#(<= ~counter~0 3)} is VALID [2022-04-15 14:27:59,369 INFO L272 TraceCheckUtils]: 25: Hoare triple {2799#(<= ~counter~0 3)} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {2799#(<= ~counter~0 3)} is VALID [2022-04-15 14:27:59,370 INFO L290 TraceCheckUtils]: 26: Hoare triple {2799#(<= ~counter~0 3)} ~cond := #in~cond; {2799#(<= ~counter~0 3)} is VALID [2022-04-15 14:27:59,370 INFO L290 TraceCheckUtils]: 27: Hoare triple {2799#(<= ~counter~0 3)} assume !(0 == ~cond); {2799#(<= ~counter~0 3)} is VALID [2022-04-15 14:27:59,370 INFO L290 TraceCheckUtils]: 28: Hoare triple {2799#(<= ~counter~0 3)} assume true; {2799#(<= ~counter~0 3)} is VALID [2022-04-15 14:27:59,371 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {2799#(<= ~counter~0 3)} {2799#(<= ~counter~0 3)} #85#return; {2799#(<= ~counter~0 3)} is VALID [2022-04-15 14:27:59,371 INFO L290 TraceCheckUtils]: 30: Hoare triple {2799#(<= ~counter~0 3)} 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); {2799#(<= ~counter~0 3)} is VALID [2022-04-15 14:27:59,371 INFO L290 TraceCheckUtils]: 31: Hoare triple {2799#(<= ~counter~0 3)} assume ~r~0 % 4294967296 >= ~b~0 % 4294967296;~q~0 := 1 + ~q~0;~r~0 := ~r~0 - ~b~0; {2799#(<= ~counter~0 3)} is VALID [2022-04-15 14:27:59,371 INFO L290 TraceCheckUtils]: 32: Hoare triple {2799#(<= ~counter~0 3)} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {2827#(<= |main_#t~post4| 3)} is VALID [2022-04-15 14:27:59,372 INFO L290 TraceCheckUtils]: 33: Hoare triple {2827#(<= |main_#t~post4| 3)} assume !(#t~post4 < 50);havoc #t~post4; {2723#false} is VALID [2022-04-15 14:27:59,372 INFO L272 TraceCheckUtils]: 34: Hoare triple {2723#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {2723#false} is VALID [2022-04-15 14:27:59,372 INFO L290 TraceCheckUtils]: 35: Hoare triple {2723#false} ~cond := #in~cond; {2723#false} is VALID [2022-04-15 14:27:59,372 INFO L290 TraceCheckUtils]: 36: Hoare triple {2723#false} assume 0 == ~cond; {2723#false} is VALID [2022-04-15 14:27:59,372 INFO L290 TraceCheckUtils]: 37: Hoare triple {2723#false} assume !false; {2723#false} is VALID [2022-04-15 14:27:59,372 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 14:27:59,372 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 14:27:59,583 INFO L290 TraceCheckUtils]: 37: Hoare triple {2723#false} assume !false; {2723#false} is VALID [2022-04-15 14:27:59,583 INFO L290 TraceCheckUtils]: 36: Hoare triple {2723#false} assume 0 == ~cond; {2723#false} is VALID [2022-04-15 14:27:59,583 INFO L290 TraceCheckUtils]: 35: Hoare triple {2723#false} ~cond := #in~cond; {2723#false} is VALID [2022-04-15 14:27:59,583 INFO L272 TraceCheckUtils]: 34: Hoare triple {2723#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {2723#false} is VALID [2022-04-15 14:27:59,583 INFO L290 TraceCheckUtils]: 33: Hoare triple {2855#(< |main_#t~post4| 50)} assume !(#t~post4 < 50);havoc #t~post4; {2723#false} is VALID [2022-04-15 14:27:59,584 INFO L290 TraceCheckUtils]: 32: Hoare triple {2859#(< ~counter~0 50)} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {2855#(< |main_#t~post4| 50)} is VALID [2022-04-15 14:27:59,584 INFO L290 TraceCheckUtils]: 31: Hoare triple {2859#(< ~counter~0 50)} assume ~r~0 % 4294967296 >= ~b~0 % 4294967296;~q~0 := 1 + ~q~0;~r~0 := ~r~0 - ~b~0; {2859#(< ~counter~0 50)} is VALID [2022-04-15 14:27:59,584 INFO L290 TraceCheckUtils]: 30: Hoare triple {2859#(< ~counter~0 50)} 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); {2859#(< ~counter~0 50)} is VALID [2022-04-15 14:27:59,585 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {2722#true} {2859#(< ~counter~0 50)} #85#return; {2859#(< ~counter~0 50)} is VALID [2022-04-15 14:27:59,585 INFO L290 TraceCheckUtils]: 28: Hoare triple {2722#true} assume true; {2722#true} is VALID [2022-04-15 14:27:59,585 INFO L290 TraceCheckUtils]: 27: Hoare triple {2722#true} assume !(0 == ~cond); {2722#true} is VALID [2022-04-15 14:27:59,585 INFO L290 TraceCheckUtils]: 26: Hoare triple {2722#true} ~cond := #in~cond; {2722#true} is VALID [2022-04-15 14:27:59,585 INFO L272 TraceCheckUtils]: 25: Hoare triple {2859#(< ~counter~0 50)} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {2722#true} is VALID [2022-04-15 14:27:59,585 INFO L290 TraceCheckUtils]: 24: Hoare triple {2859#(< ~counter~0 50)} assume !!(#t~post4 < 50);havoc #t~post4; {2859#(< ~counter~0 50)} is VALID [2022-04-15 14:27:59,586 INFO L290 TraceCheckUtils]: 23: Hoare triple {2887#(< ~counter~0 49)} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {2859#(< ~counter~0 50)} is VALID [2022-04-15 14:27:59,586 INFO L290 TraceCheckUtils]: 22: Hoare triple {2887#(< ~counter~0 49)} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {2887#(< ~counter~0 49)} is VALID [2022-04-15 14:27:59,586 INFO L290 TraceCheckUtils]: 21: Hoare triple {2887#(< ~counter~0 49)} assume !!(#t~post3 < 50);havoc #t~post3; {2887#(< ~counter~0 49)} is VALID [2022-04-15 14:27:59,587 INFO L290 TraceCheckUtils]: 20: Hoare triple {2897#(< ~counter~0 48)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {2887#(< ~counter~0 49)} is VALID [2022-04-15 14:27:59,587 INFO L290 TraceCheckUtils]: 19: Hoare triple {2897#(< ~counter~0 48)} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {2897#(< ~counter~0 48)} is VALID [2022-04-15 14:27:59,587 INFO L290 TraceCheckUtils]: 18: Hoare triple {2897#(< ~counter~0 48)} assume !!(#t~post3 < 50);havoc #t~post3; {2897#(< ~counter~0 48)} is VALID [2022-04-15 14:27:59,588 INFO L290 TraceCheckUtils]: 17: Hoare triple {2907#(< ~counter~0 47)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {2897#(< ~counter~0 48)} is VALID [2022-04-15 14:27:59,588 INFO L290 TraceCheckUtils]: 16: Hoare triple {2907#(< ~counter~0 47)} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {2907#(< ~counter~0 47)} is VALID [2022-04-15 14:27:59,589 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2722#true} {2907#(< ~counter~0 47)} #83#return; {2907#(< ~counter~0 47)} is VALID [2022-04-15 14:27:59,589 INFO L290 TraceCheckUtils]: 14: Hoare triple {2722#true} assume true; {2722#true} is VALID [2022-04-15 14:27:59,589 INFO L290 TraceCheckUtils]: 13: Hoare triple {2722#true} assume !(0 == ~cond); {2722#true} is VALID [2022-04-15 14:27:59,589 INFO L290 TraceCheckUtils]: 12: Hoare triple {2722#true} ~cond := #in~cond; {2722#true} is VALID [2022-04-15 14:27:59,589 INFO L272 TraceCheckUtils]: 11: Hoare triple {2907#(< ~counter~0 47)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {2722#true} is VALID [2022-04-15 14:27:59,589 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2722#true} {2907#(< ~counter~0 47)} #81#return; {2907#(< ~counter~0 47)} is VALID [2022-04-15 14:27:59,589 INFO L290 TraceCheckUtils]: 9: Hoare triple {2722#true} assume true; {2722#true} is VALID [2022-04-15 14:27:59,590 INFO L290 TraceCheckUtils]: 8: Hoare triple {2722#true} assume !(0 == ~cond); {2722#true} is VALID [2022-04-15 14:27:59,590 INFO L290 TraceCheckUtils]: 7: Hoare triple {2722#true} ~cond := #in~cond; {2722#true} is VALID [2022-04-15 14:27:59,590 INFO L272 TraceCheckUtils]: 6: Hoare triple {2907#(< ~counter~0 47)} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {2722#true} is VALID [2022-04-15 14:27:59,591 INFO L290 TraceCheckUtils]: 5: Hoare triple {2907#(< ~counter~0 47)} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := #t~nondet2;havoc #t~nondet2; {2907#(< ~counter~0 47)} is VALID [2022-04-15 14:27:59,591 INFO L272 TraceCheckUtils]: 4: Hoare triple {2907#(< ~counter~0 47)} call #t~ret5 := main(); {2907#(< ~counter~0 47)} is VALID [2022-04-15 14:27:59,591 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2907#(< ~counter~0 47)} {2722#true} #89#return; {2907#(< ~counter~0 47)} is VALID [2022-04-15 14:27:59,592 INFO L290 TraceCheckUtils]: 2: Hoare triple {2907#(< ~counter~0 47)} assume true; {2907#(< ~counter~0 47)} is VALID [2022-04-15 14:27:59,592 INFO L290 TraceCheckUtils]: 1: Hoare triple {2722#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(9, 2);~counter~0 := 0; {2907#(< ~counter~0 47)} is VALID [2022-04-15 14:27:59,592 INFO L272 TraceCheckUtils]: 0: Hoare triple {2722#true} call ULTIMATE.init(); {2722#true} is VALID [2022-04-15 14:27:59,593 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 14:27:59,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 14:27:59,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287810915] [2022-04-15 14:27:59,593 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 14:27:59,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1589746119] [2022-04-15 14:27:59,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1589746119] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 14:27:59,593 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 14:27:59,593 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-04-15 14:27:59,593 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 14:27:59,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1505447807] [2022-04-15 14:27:59,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1505447807] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:27:59,593 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:27:59,594 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 14:27:59,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007467547] [2022-04-15 14:27:59,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 14:27:59,594 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 38 [2022-04-15 14:27:59,594 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 14:27:59,594 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-15 14:27:59,620 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-15 14:27:59,620 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 14:27:59,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 14:27:59,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 14:27:59,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2022-04-15 14:27:59,621 INFO L87 Difference]: Start difference. First operand 42 states and 49 transitions. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-15 14:27:59,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:27:59,793 INFO L93 Difference]: Finished difference Result 67 states and 78 transitions. [2022-04-15 14:27:59,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 14:27:59,793 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 38 [2022-04-15 14:27:59,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 14:27:59,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-15 14:27:59,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 66 transitions. [2022-04-15 14:27:59,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-15 14:27:59,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 66 transitions. [2022-04-15 14:27:59,796 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 66 transitions. [2022-04-15 14:27:59,840 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:27:59,841 INFO L225 Difference]: With dead ends: 67 [2022-04-15 14:27:59,841 INFO L226 Difference]: Without dead ends: 60 [2022-04-15 14:27:59,842 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2022-04-15 14:27:59,842 INFO L913 BasicCegarLoop]: 32 mSDtfsCounter, 30 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 14:27:59,842 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 96 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 14:27:59,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-04-15 14:27:59,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 54. [2022-04-15 14:27:59,878 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 14:27:59,879 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand has 54 states, 40 states have (on average 1.225) internal successors, (49), 41 states have internal predecessors, (49), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 14:27:59,884 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand has 54 states, 40 states have (on average 1.225) internal successors, (49), 41 states have internal predecessors, (49), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 14:27:59,885 INFO L87 Difference]: Start difference. First operand 60 states. Second operand has 54 states, 40 states have (on average 1.225) internal successors, (49), 41 states have internal predecessors, (49), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 14:27:59,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:27:59,887 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions. [2022-04-15 14:27:59,887 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 71 transitions. [2022-04-15 14:27:59,887 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:27:59,887 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:27:59,887 INFO L74 IsIncluded]: Start isIncluded. First operand has 54 states, 40 states have (on average 1.225) internal successors, (49), 41 states have internal predecessors, (49), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 60 states. [2022-04-15 14:27:59,888 INFO L87 Difference]: Start difference. First operand has 54 states, 40 states have (on average 1.225) internal successors, (49), 41 states have internal predecessors, (49), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 60 states. [2022-04-15 14:27:59,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:27:59,889 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions. [2022-04-15 14:27:59,889 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 71 transitions. [2022-04-15 14:27:59,889 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:27:59,889 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:27:59,889 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 14:27:59,889 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 14:27:59,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 40 states have (on average 1.225) internal successors, (49), 41 states have internal predecessors, (49), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 14:27:59,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 63 transitions. [2022-04-15 14:27:59,891 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 63 transitions. Word has length 38 [2022-04-15 14:27:59,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 14:27:59,891 INFO L478 AbstractCegarLoop]: Abstraction has 54 states and 63 transitions. [2022-04-15 14:27:59,891 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-15 14:27:59,891 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 54 states and 63 transitions. [2022-04-15 14:27:59,954 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:27:59,954 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2022-04-15 14:27:59,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-15 14:27:59,954 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 14:27:59,954 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 14:27:59,973 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-15 14:28:00,163 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 14:28:00,163 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 14:28:00,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 14:28:00,164 INFO L85 PathProgramCache]: Analyzing trace with hash 817777954, now seen corresponding path program 1 times [2022-04-15 14:28:00,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 14:28:00,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [807205201] [2022-04-15 14:28:00,164 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 14:28:00,164 INFO L85 PathProgramCache]: Analyzing trace with hash 817777954, now seen corresponding path program 2 times [2022-04-15 14:28:00,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 14:28:00,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498811274] [2022-04-15 14:28:00,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 14:28:00,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 14:28:00,185 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 14:28:00,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1062299792] [2022-04-15 14:28:00,186 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 14:28:00,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 14:28:00,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 14:28:00,187 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 14:28:00,188 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process