/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/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/divbin_unwindbound50.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 05:26:08,962 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 05:26:08,963 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 05:26:08,998 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 05:26:08,999 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 05:26:09,000 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 05:26:09,002 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 05:26:09,004 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 05:26:09,006 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 05:26:09,009 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 05:26:09,009 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 05:26:09,010 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 05:26:09,011 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 05:26:09,012 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 05:26:09,013 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 05:26:09,015 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 05:26:09,016 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 05:26:09,016 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 05:26:09,018 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 05:26:09,021 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 05:26:09,023 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 05:26:09,024 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 05:26:09,025 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 05:26:09,025 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 05:26:09,026 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 05:26:09,031 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 05:26:09,031 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 05:26:09,031 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 05:26:09,031 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 05:26:09,032 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 05:26:09,033 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 05:26:09,033 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 05:26:09,034 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 05:26:09,035 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 05:26:09,035 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 05:26:09,036 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 05:26:09,036 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 05:26:09,036 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 05:26:09,036 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 05:26:09,037 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 05:26:09,037 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 05:26:09,038 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 05:26:09,038 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-08 05:26:09,047 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 05:26:09,047 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 05:26:09,048 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 05:26:09,048 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-08 05:26:09,048 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 05:26:09,048 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-08 05:26:09,048 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 05:26:09,048 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 05:26:09,048 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 05:26:09,049 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 05:26:09,049 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-08 05:26:09,049 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 05:26:09,049 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 05:26:09,049 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 05:26:09,049 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 05:26:09,050 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 05:26:09,050 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 05:26:09,050 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 05:26:09,050 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 05:26:09,050 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 05:26:09,050 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 05:26:09,050 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 05:26:09,050 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 05:26:09,050 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 05:26:09,050 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-08 05:26:09,051 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-08 05:26:09,229 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 05:26:09,247 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 05:26:09,249 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 05:26:09,250 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 05:26:09,250 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 05:26:09,251 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-08 05:26:09,299 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d38d52ee1/d04e8051f5dc4522b7a0b57cc12a1ddc/FLAGff74278ca [2022-04-08 05:26:09,592 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 05:26:09,592 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/divbin_unwindbound50.i [2022-04-08 05:26:09,599 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d38d52ee1/d04e8051f5dc4522b7a0b57cc12a1ddc/FLAGff74278ca [2022-04-08 05:26:10,024 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d38d52ee1/d04e8051f5dc4522b7a0b57cc12a1ddc [2022-04-08 05:26:10,026 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 05:26:10,026 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 05:26:10,028 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 05:26:10,028 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 05:26:10,031 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 05:26:10,031 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 05:26:10" (1/1) ... [2022-04-08 05:26:10,032 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1038492 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 05:26:10, skipping insertion in model container [2022-04-08 05:26:10,032 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 05:26:10" (1/1) ... [2022-04-08 05:26:10,037 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 05:26:10,048 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 05:26:10,171 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-08 05:26:10,192 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 05:26:10,197 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 05:26:10,213 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-08 05:26:10,230 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 05:26:10,239 INFO L208 MainTranslator]: Completed translation [2022-04-08 05:26:10,239 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 05:26:10 WrapperNode [2022-04-08 05:26:10,239 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 05:26:10,240 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 05:26:10,240 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 05:26:10,240 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 05:26:10,249 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 05:26:10" (1/1) ... [2022-04-08 05:26:10,249 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 05:26:10" (1/1) ... [2022-04-08 05:26:10,254 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 05:26:10" (1/1) ... [2022-04-08 05:26:10,254 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 05:26:10" (1/1) ... [2022-04-08 05:26:10,266 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 05:26:10" (1/1) ... [2022-04-08 05:26:10,271 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 05:26:10" (1/1) ... [2022-04-08 05:26:10,274 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 05:26:10" (1/1) ... [2022-04-08 05:26:10,277 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 05:26:10,278 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 05:26:10,278 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 05:26:10,278 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 05:26:10,279 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 05:26:10" (1/1) ... [2022-04-08 05:26:10,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 05:26:10,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 05:26:10,300 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-08 05:26:10,305 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-08 05:26:10,332 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 05:26:10,332 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 05:26:10,332 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 05:26:10,332 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-08 05:26:10,332 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 05:26:10,332 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 05:26:10,333 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 05:26:10,333 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 05:26:10,333 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-08 05:26:10,333 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-08 05:26:10,333 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 05:26:10,334 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 05:26:10,334 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-08 05:26:10,334 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-08 05:26:10,334 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 05:26:10,334 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 05:26:10,334 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 05:26:10,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 05:26:10,335 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 05:26:10,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 05:26:10,335 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 05:26:10,335 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 05:26:10,421 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 05:26:10,422 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 05:26:10,558 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 05:26:10,563 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 05:26:10,563 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-08 05:26:10,564 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 05:26:10 BoogieIcfgContainer [2022-04-08 05:26:10,564 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 05:26:10,565 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 05:26:10,565 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 05:26:10,571 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 05:26:10,572 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 05:26:10" (1/3) ... [2022-04-08 05:26:10,572 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6def1f6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 05:26:10, skipping insertion in model container [2022-04-08 05:26:10,572 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 05:26:10" (2/3) ... [2022-04-08 05:26:10,572 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6def1f6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 05:26:10, skipping insertion in model container [2022-04-08 05:26:10,573 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 05:26:10" (3/3) ... [2022-04-08 05:26:10,574 INFO L111 eAbstractionObserver]: Analyzing ICFG divbin_unwindbound50.i [2022-04-08 05:26:10,577 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 05:26:10,577 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 05:26:10,602 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 05:26:10,606 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-08 05:26:10,606 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 05:26:10,625 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-08 05:26:10,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-08 05:26:10,631 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 05:26:10,631 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-08 05:26:10,632 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 05:26:10,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 05:26:10,635 INFO L85 PathProgramCache]: Analyzing trace with hash 878397729, now seen corresponding path program 1 times [2022-04-08 05:26:10,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 05:26:10,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [882638865] [2022-04-08 05:26:10,650 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 05:26:10,650 INFO L85 PathProgramCache]: Analyzing trace with hash 878397729, now seen corresponding path program 2 times [2022-04-08 05:26:10,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 05:26:10,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023056126] [2022-04-08 05:26:10,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 05:26:10,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 05:26:10,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 05:26:10,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 05:26:10,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 05:26:10,827 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-08 05:26:10,827 INFO L290 TraceCheckUtils]: 1: Hoare triple {36#true} assume true; {36#true} is VALID [2022-04-08 05:26:10,827 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {36#true} {36#true} #89#return; {36#true} is VALID [2022-04-08 05:26:10,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-08 05:26:10,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 05:26:10,848 INFO L290 TraceCheckUtils]: 0: Hoare triple {36#true} ~cond := #in~cond; {36#true} is VALID [2022-04-08 05:26:10,848 INFO L290 TraceCheckUtils]: 1: Hoare triple {36#true} assume 0 == ~cond;assume false; {37#false} is VALID [2022-04-08 05:26:10,848 INFO L290 TraceCheckUtils]: 2: Hoare triple {37#false} assume true; {37#false} is VALID [2022-04-08 05:26:10,849 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37#false} {36#true} #81#return; {37#false} is VALID [2022-04-08 05:26:10,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-08 05:26:10,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 05:26:10,857 INFO L290 TraceCheckUtils]: 0: Hoare triple {36#true} ~cond := #in~cond; {36#true} is VALID [2022-04-08 05:26:10,857 INFO L290 TraceCheckUtils]: 1: Hoare triple {36#true} assume 0 == ~cond;assume false; {37#false} is VALID [2022-04-08 05:26:10,858 INFO L290 TraceCheckUtils]: 2: Hoare triple {37#false} assume true; {37#false} is VALID [2022-04-08 05:26:10,858 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37#false} {37#false} #83#return; {37#false} is VALID [2022-04-08 05:26:10,859 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-08 05:26:10,859 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-08 05:26:10,859 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#true} assume true; {36#true} is VALID [2022-04-08 05:26:10,859 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#true} {36#true} #89#return; {36#true} is VALID [2022-04-08 05:26:10,859 INFO L272 TraceCheckUtils]: 4: Hoare triple {36#true} call #t~ret5 := main(); {36#true} is VALID [2022-04-08 05:26:10,860 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-08 05:26:10,860 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-08 05:26:10,860 INFO L290 TraceCheckUtils]: 7: Hoare triple {36#true} ~cond := #in~cond; {36#true} is VALID [2022-04-08 05:26:10,861 INFO L290 TraceCheckUtils]: 8: Hoare triple {36#true} assume 0 == ~cond;assume false; {37#false} is VALID [2022-04-08 05:26:10,861 INFO L290 TraceCheckUtils]: 9: Hoare triple {37#false} assume true; {37#false} is VALID [2022-04-08 05:26:10,861 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {37#false} {36#true} #81#return; {37#false} is VALID [2022-04-08 05:26:10,862 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-08 05:26:10,862 INFO L290 TraceCheckUtils]: 12: Hoare triple {36#true} ~cond := #in~cond; {36#true} is VALID [2022-04-08 05:26:10,862 INFO L290 TraceCheckUtils]: 13: Hoare triple {36#true} assume 0 == ~cond;assume false; {37#false} is VALID [2022-04-08 05:26:10,863 INFO L290 TraceCheckUtils]: 14: Hoare triple {37#false} assume true; {37#false} is VALID [2022-04-08 05:26:10,863 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {37#false} {37#false} #83#return; {37#false} is VALID [2022-04-08 05:26:10,863 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-08 05:26:10,863 INFO L290 TraceCheckUtils]: 17: Hoare triple {37#false} assume !true; {37#false} is VALID [2022-04-08 05:26:10,863 INFO L290 TraceCheckUtils]: 18: Hoare triple {37#false} assume !true; {37#false} is VALID [2022-04-08 05:26:10,863 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-08 05:26:10,864 INFO L290 TraceCheckUtils]: 20: Hoare triple {37#false} ~cond := #in~cond; {37#false} is VALID [2022-04-08 05:26:10,864 INFO L290 TraceCheckUtils]: 21: Hoare triple {37#false} assume 0 == ~cond; {37#false} is VALID [2022-04-08 05:26:10,864 INFO L290 TraceCheckUtils]: 22: Hoare triple {37#false} assume !false; {37#false} is VALID [2022-04-08 05:26:10,864 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-08 05:26:10,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 05:26:10,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023056126] [2022-04-08 05:26:10,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023056126] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 05:26:10,867 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 05:26:10,867 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 05:26:10,869 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 05:26:10,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [882638865] [2022-04-08 05:26:10,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [882638865] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 05:26:10,870 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 05:26:10,870 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 05:26:10,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064994333] [2022-04-08 05:26:10,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 05:26:10,876 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-08 05:26:10,877 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 05:26:10,880 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-08 05:26:10,911 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-08 05:26:10,911 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-08 05:26:10,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 05:26:10,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-08 05:26:10,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 05:26:10,933 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-08 05:26:11,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:26:11,093 INFO L93 Difference]: Finished difference Result 60 states and 84 transitions. [2022-04-08 05:26:11,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-08 05:26:11,094 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-08 05:26:11,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 05:26:11,095 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-08 05:26:11,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 84 transitions. [2022-04-08 05:26:11,104 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-08 05:26:11,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 84 transitions. [2022-04-08 05:26:11,115 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 84 transitions. [2022-04-08 05:26:11,205 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-08 05:26:11,214 INFO L225 Difference]: With dead ends: 60 [2022-04-08 05:26:11,214 INFO L226 Difference]: Without dead ends: 29 [2022-04-08 05:26:11,216 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-08 05:26:11,218 INFO L913 BasicCegarLoop]: 36 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2022-04-08 05:26:11,220 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.0s Time] [2022-04-08 05:26:11,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-08 05:26:11,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2022-04-08 05:26:11,250 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 05:26:11,251 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-08 05:26:11,251 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-08 05:26:11,252 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-08 05:26:11,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:26:11,256 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2022-04-08 05:26:11,256 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-04-08 05:26:11,256 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:26:11,256 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:26:11,257 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-08 05:26:11,258 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-08 05:26:11,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:26:11,261 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2022-04-08 05:26:11,262 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-04-08 05:26:11,262 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:26:11,262 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:26:11,262 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 05:26:11,263 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 05:26:11,264 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-08 05:26:11,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2022-04-08 05:26:11,272 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 23 [2022-04-08 05:26:11,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 05:26:11,272 INFO L478 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2022-04-08 05:26:11,272 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-08 05:26:11,272 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 34 transitions. [2022-04-08 05:26:11,298 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-08 05:26:11,298 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2022-04-08 05:26:11,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-08 05:26:11,299 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 05:26:11,299 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-08 05:26:11,300 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 05:26:11,300 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 05:26:11,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 05:26:11,301 INFO L85 PathProgramCache]: Analyzing trace with hash 994169231, now seen corresponding path program 1 times [2022-04-08 05:26:11,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 05:26:11,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [539018661] [2022-04-08 05:26:11,302 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 05:26:11,302 INFO L85 PathProgramCache]: Analyzing trace with hash 994169231, now seen corresponding path program 2 times [2022-04-08 05:26:11,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 05:26:11,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277557819] [2022-04-08 05:26:11,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 05:26:11,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 05:26:11,342 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 05:26:11,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1337883817] [2022-04-08 05:26:11,345 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 05:26:11,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 05:26:11,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 05:26:11,346 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 05:26:11,350 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-08 05:26:11,389 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-08 05:26:11,390 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 05:26:11,391 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-08 05:26:11,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 05:26:11,417 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 05:26:11,555 INFO L272 TraceCheckUtils]: 0: Hoare triple {286#true} call ULTIMATE.init(); {286#true} is VALID [2022-04-08 05:26:11,556 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-08 05:26:11,557 INFO L290 TraceCheckUtils]: 2: Hoare triple {294#(<= ~counter~0 0)} assume true; {294#(<= ~counter~0 0)} is VALID [2022-04-08 05:26:11,557 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {294#(<= ~counter~0 0)} {286#true} #89#return; {294#(<= ~counter~0 0)} is VALID [2022-04-08 05:26:11,557 INFO L272 TraceCheckUtils]: 4: Hoare triple {294#(<= ~counter~0 0)} call #t~ret5 := main(); {294#(<= ~counter~0 0)} is VALID [2022-04-08 05:26:11,558 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-08 05:26:11,558 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-08 05:26:11,558 INFO L290 TraceCheckUtils]: 7: Hoare triple {294#(<= ~counter~0 0)} ~cond := #in~cond; {294#(<= ~counter~0 0)} is VALID [2022-04-08 05:26:11,559 INFO L290 TraceCheckUtils]: 8: Hoare triple {294#(<= ~counter~0 0)} assume !(0 == ~cond); {294#(<= ~counter~0 0)} is VALID [2022-04-08 05:26:11,559 INFO L290 TraceCheckUtils]: 9: Hoare triple {294#(<= ~counter~0 0)} assume true; {294#(<= ~counter~0 0)} is VALID [2022-04-08 05:26:11,560 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {294#(<= ~counter~0 0)} {294#(<= ~counter~0 0)} #81#return; {294#(<= ~counter~0 0)} is VALID [2022-04-08 05:26:11,561 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-08 05:26:11,561 INFO L290 TraceCheckUtils]: 12: Hoare triple {294#(<= ~counter~0 0)} ~cond := #in~cond; {294#(<= ~counter~0 0)} is VALID [2022-04-08 05:26:11,561 INFO L290 TraceCheckUtils]: 13: Hoare triple {294#(<= ~counter~0 0)} assume !(0 == ~cond); {294#(<= ~counter~0 0)} is VALID [2022-04-08 05:26:11,562 INFO L290 TraceCheckUtils]: 14: Hoare triple {294#(<= ~counter~0 0)} assume true; {294#(<= ~counter~0 0)} is VALID [2022-04-08 05:26:11,564 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {294#(<= ~counter~0 0)} {294#(<= ~counter~0 0)} #83#return; {294#(<= ~counter~0 0)} is VALID [2022-04-08 05:26:11,565 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-08 05:26:11,565 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-08 05:26:11,566 INFO L290 TraceCheckUtils]: 18: Hoare triple {343#(<= |main_#t~post3| 0)} assume !(#t~post3 < 50);havoc #t~post3; {287#false} is VALID [2022-04-08 05:26:11,566 INFO L290 TraceCheckUtils]: 19: Hoare triple {287#false} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {287#false} is VALID [2022-04-08 05:26:11,566 INFO L290 TraceCheckUtils]: 20: Hoare triple {287#false} assume !(#t~post4 < 50);havoc #t~post4; {287#false} is VALID [2022-04-08 05:26:11,566 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-08 05:26:11,566 INFO L290 TraceCheckUtils]: 22: Hoare triple {287#false} ~cond := #in~cond; {287#false} is VALID [2022-04-08 05:26:11,567 INFO L290 TraceCheckUtils]: 23: Hoare triple {287#false} assume 0 == ~cond; {287#false} is VALID [2022-04-08 05:26:11,568 INFO L290 TraceCheckUtils]: 24: Hoare triple {287#false} assume !false; {287#false} is VALID [2022-04-08 05:26:11,568 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-08 05:26:11,568 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 05:26:11,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 05:26:11,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277557819] [2022-04-08 05:26:11,568 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 05:26:11,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1337883817] [2022-04-08 05:26:11,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1337883817] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 05:26:11,569 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 05:26:11,570 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 05:26:11,570 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 05:26:11,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [539018661] [2022-04-08 05:26:11,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [539018661] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 05:26:11,571 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 05:26:11,571 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 05:26:11,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712831953] [2022-04-08 05:26:11,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 05:26:11,572 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-08 05:26:11,573 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 05:26:11,573 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-08 05:26:11,590 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-08 05:26:11,590 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 05:26:11,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 05:26:11,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 05:26:11,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 05:26:11,591 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-08 05:26:11,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:26:11,650 INFO L93 Difference]: Finished difference Result 42 states and 52 transitions. [2022-04-08 05:26:11,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 05:26:11,651 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-08 05:26:11,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 05:26:11,651 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-08 05:26:11,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 52 transitions. [2022-04-08 05:26:11,654 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-08 05:26:11,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 52 transitions. [2022-04-08 05:26:11,661 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 52 transitions. [2022-04-08 05:26:11,694 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-08 05:26:11,695 INFO L225 Difference]: With dead ends: 42 [2022-04-08 05:26:11,696 INFO L226 Difference]: Without dead ends: 30 [2022-04-08 05:26:11,696 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-08 05:26:11,697 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-08 05:26:11,697 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-08 05:26:11,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-08 05:26:11,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-04-08 05:26:11,711 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 05:26:11,712 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-08 05:26:11,712 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-08 05:26:11,712 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-08 05:26:11,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:26:11,714 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2022-04-08 05:26:11,714 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2022-04-08 05:26:11,714 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:26:11,714 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:26:11,714 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-08 05:26:11,715 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-08 05:26:11,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:26:11,716 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2022-04-08 05:26:11,716 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2022-04-08 05:26:11,716 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:26:11,716 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:26:11,716 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 05:26:11,716 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 05:26:11,717 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-08 05:26:11,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2022-04-08 05:26:11,718 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 25 [2022-04-08 05:26:11,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 05:26:11,718 INFO L478 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2022-04-08 05:26:11,718 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-08 05:26:11,718 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 36 transitions. [2022-04-08 05:26:11,756 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-08 05:26:11,756 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2022-04-08 05:26:11,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-08 05:26:11,757 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 05:26:11,757 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 05:26:11,776 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-08 05:26:11,973 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-08 05:26:11,974 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 05:26:11,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 05:26:11,974 INFO L85 PathProgramCache]: Analyzing trace with hash 422434646, now seen corresponding path program 1 times [2022-04-08 05:26:11,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 05:26:11,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1178130597] [2022-04-08 05:26:11,975 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 05:26:11,975 INFO L85 PathProgramCache]: Analyzing trace with hash 422434646, now seen corresponding path program 2 times [2022-04-08 05:26:11,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 05:26:11,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008893273] [2022-04-08 05:26:11,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 05:26:11,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 05:26:11,991 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 05:26:11,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1426597885] [2022-04-08 05:26:11,992 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 05:26:11,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 05:26:11,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 05:26:11,993 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 05:26:11,994 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-08 05:26:12,025 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-08 05:26:12,026 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 05:26:12,026 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 05:26:12,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 05:26:12,050 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 05:26:12,244 INFO L272 TraceCheckUtils]: 0: Hoare triple {568#true} call ULTIMATE.init(); {568#true} is VALID [2022-04-08 05:26:12,244 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-08 05:26:12,245 INFO L290 TraceCheckUtils]: 2: Hoare triple {576#(<= ~counter~0 0)} assume true; {576#(<= ~counter~0 0)} is VALID [2022-04-08 05:26:12,245 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {576#(<= ~counter~0 0)} {568#true} #89#return; {576#(<= ~counter~0 0)} is VALID [2022-04-08 05:26:12,246 INFO L272 TraceCheckUtils]: 4: Hoare triple {576#(<= ~counter~0 0)} call #t~ret5 := main(); {576#(<= ~counter~0 0)} is VALID [2022-04-08 05:26:12,246 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-08 05:26:12,246 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-08 05:26:12,247 INFO L290 TraceCheckUtils]: 7: Hoare triple {576#(<= ~counter~0 0)} ~cond := #in~cond; {576#(<= ~counter~0 0)} is VALID [2022-04-08 05:26:12,247 INFO L290 TraceCheckUtils]: 8: Hoare triple {576#(<= ~counter~0 0)} assume !(0 == ~cond); {576#(<= ~counter~0 0)} is VALID [2022-04-08 05:26:12,247 INFO L290 TraceCheckUtils]: 9: Hoare triple {576#(<= ~counter~0 0)} assume true; {576#(<= ~counter~0 0)} is VALID [2022-04-08 05:26:12,248 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {576#(<= ~counter~0 0)} {576#(<= ~counter~0 0)} #81#return; {576#(<= ~counter~0 0)} is VALID [2022-04-08 05:26:12,248 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-08 05:26:12,248 INFO L290 TraceCheckUtils]: 12: Hoare triple {576#(<= ~counter~0 0)} ~cond := #in~cond; {576#(<= ~counter~0 0)} is VALID [2022-04-08 05:26:12,249 INFO L290 TraceCheckUtils]: 13: Hoare triple {576#(<= ~counter~0 0)} assume !(0 == ~cond); {576#(<= ~counter~0 0)} is VALID [2022-04-08 05:26:12,249 INFO L290 TraceCheckUtils]: 14: Hoare triple {576#(<= ~counter~0 0)} assume true; {576#(<= ~counter~0 0)} is VALID [2022-04-08 05:26:12,250 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {576#(<= ~counter~0 0)} {576#(<= ~counter~0 0)} #83#return; {576#(<= ~counter~0 0)} is VALID [2022-04-08 05:26:12,250 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-08 05:26:12,250 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-08 05:26:12,251 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-08 05:26:12,251 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-08 05:26:12,251 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-08 05:26:12,252 INFO L290 TraceCheckUtils]: 21: Hoare triple {635#(<= |main_#t~post4| 1)} assume !(#t~post4 < 50);havoc #t~post4; {569#false} is VALID [2022-04-08 05:26:12,252 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-08 05:26:12,252 INFO L290 TraceCheckUtils]: 23: Hoare triple {569#false} ~cond := #in~cond; {569#false} is VALID [2022-04-08 05:26:12,252 INFO L290 TraceCheckUtils]: 24: Hoare triple {569#false} assume 0 == ~cond; {569#false} is VALID [2022-04-08 05:26:12,252 INFO L290 TraceCheckUtils]: 25: Hoare triple {569#false} assume !false; {569#false} is VALID [2022-04-08 05:26:12,253 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-08 05:26:12,253 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 05:26:12,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 05:26:12,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008893273] [2022-04-08 05:26:12,253 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 05:26:12,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1426597885] [2022-04-08 05:26:12,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1426597885] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 05:26:12,253 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 05:26:12,253 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 05:26:12,254 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 05:26:12,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1178130597] [2022-04-08 05:26:12,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1178130597] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 05:26:12,254 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 05:26:12,254 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 05:26:12,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091696561] [2022-04-08 05:26:12,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 05:26:12,254 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-08 05:26:12,255 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 05:26:12,255 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-08 05:26:12,268 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-08 05:26:12,268 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 05:26:12,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 05:26:12,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 05:26:12,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-08 05:26:12,269 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-08 05:26:12,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:26:12,370 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2022-04-08 05:26:12,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 05:26:12,370 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-08 05:26:12,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 05:26:12,370 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-08 05:26:12,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 48 transitions. [2022-04-08 05:26:12,372 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-08 05:26:12,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 48 transitions. [2022-04-08 05:26:12,373 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 48 transitions. [2022-04-08 05:26:12,407 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-08 05:26:12,408 INFO L225 Difference]: With dead ends: 41 [2022-04-08 05:26:12,408 INFO L226 Difference]: Without dead ends: 34 [2022-04-08 05:26:12,409 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-08 05:26:12,409 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-08 05:26:12,410 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-08 05:26:12,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-08 05:26:12,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2022-04-08 05:26:12,420 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 05:26:12,420 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-08 05:26:12,420 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-08 05:26:12,421 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-08 05:26:12,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:26:12,422 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2022-04-08 05:26:12,422 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2022-04-08 05:26:12,423 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:26:12,423 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:26:12,423 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-08 05:26:12,423 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-08 05:26:12,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:26:12,425 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2022-04-08 05:26:12,425 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2022-04-08 05:26:12,425 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:26:12,425 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:26:12,425 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 05:26:12,425 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 05:26:12,425 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-08 05:26:12,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2022-04-08 05:26:12,427 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 40 transitions. Word has length 26 [2022-04-08 05:26:12,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 05:26:12,427 INFO L478 AbstractCegarLoop]: Abstraction has 33 states and 40 transitions. [2022-04-08 05:26:12,427 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-08 05:26:12,427 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 40 transitions. [2022-04-08 05:26:12,454 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:26:12,455 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2022-04-08 05:26:12,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-08 05:26:12,455 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 05:26:12,455 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 05:26:12,474 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-08 05:26:12,672 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-08 05:26:12,672 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 05:26:12,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 05:26:12,673 INFO L85 PathProgramCache]: Analyzing trace with hash 424222106, now seen corresponding path program 1 times [2022-04-08 05:26:12,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 05:26:12,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [764391939] [2022-04-08 05:26:12,673 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 05:26:12,673 INFO L85 PathProgramCache]: Analyzing trace with hash 424222106, now seen corresponding path program 2 times [2022-04-08 05:26:12,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 05:26:12,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760979380] [2022-04-08 05:26:12,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 05:26:12,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 05:26:12,687 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 05:26:12,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1346945399] [2022-04-08 05:26:12,688 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 05:26:12,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 05:26:12,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 05:26:12,689 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 05:26:12,697 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-08 05:26:12,740 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-08 05:26:12,740 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 05:26:12,741 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-08 05:26:12,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 05:26:12,749 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 05:26:13,242 INFO L272 TraceCheckUtils]: 0: Hoare triple {866#true} call ULTIMATE.init(); {866#true} is VALID [2022-04-08 05:26:13,242 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-08 05:26:13,243 INFO L290 TraceCheckUtils]: 2: Hoare triple {866#true} assume true; {866#true} is VALID [2022-04-08 05:26:13,243 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {866#true} {866#true} #89#return; {866#true} is VALID [2022-04-08 05:26:13,243 INFO L272 TraceCheckUtils]: 4: Hoare triple {866#true} call #t~ret5 := main(); {866#true} is VALID [2022-04-08 05:26:13,243 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-08 05:26:13,244 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-08 05:26:13,244 INFO L290 TraceCheckUtils]: 7: Hoare triple {866#true} ~cond := #in~cond; {866#true} is VALID [2022-04-08 05:26:13,244 INFO L290 TraceCheckUtils]: 8: Hoare triple {866#true} assume !(0 == ~cond); {866#true} is VALID [2022-04-08 05:26:13,244 INFO L290 TraceCheckUtils]: 9: Hoare triple {866#true} assume true; {866#true} is VALID [2022-04-08 05:26:13,244 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {866#true} {866#true} #81#return; {866#true} is VALID [2022-04-08 05:26:13,244 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-08 05:26:13,244 INFO L290 TraceCheckUtils]: 12: Hoare triple {866#true} ~cond := #in~cond; {866#true} is VALID [2022-04-08 05:26:13,245 INFO L290 TraceCheckUtils]: 13: Hoare triple {866#true} assume !(0 == ~cond); {866#true} is VALID [2022-04-08 05:26:13,245 INFO L290 TraceCheckUtils]: 14: Hoare triple {866#true} assume true; {866#true} is VALID [2022-04-08 05:26:13,245 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {866#true} {866#true} #83#return; {866#true} is VALID [2022-04-08 05:26:13,246 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-08 05:26:13,248 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-08 05:26:13,249 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-08 05:26:13,249 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-08 05:26:13,250 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-08 05:26:13,250 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-08 05:26:13,251 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-08 05:26:13,251 INFO L290 TraceCheckUtils]: 23: Hoare triple {939#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {943#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 05:26:13,252 INFO L290 TraceCheckUtils]: 24: Hoare triple {943#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {867#false} is VALID [2022-04-08 05:26:13,252 INFO L290 TraceCheckUtils]: 25: Hoare triple {867#false} assume !false; {867#false} is VALID [2022-04-08 05:26:13,252 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-08 05:26:13,252 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 05:26:13,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 05:26:13,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760979380] [2022-04-08 05:26:13,253 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 05:26:13,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1346945399] [2022-04-08 05:26:13,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1346945399] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 05:26:13,253 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 05:26:13,253 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 05:26:13,253 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 05:26:13,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [764391939] [2022-04-08 05:26:13,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [764391939] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 05:26:13,253 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 05:26:13,254 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 05:26:13,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299016715] [2022-04-08 05:26:13,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 05:26:13,254 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-08 05:26:13,254 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 05:26:13,255 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-08 05:26:13,271 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-08 05:26:13,271 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 05:26:13,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 05:26:13,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 05:26:13,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-04-08 05:26:13,272 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-08 05:26:13,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:26:13,467 INFO L93 Difference]: Finished difference Result 50 states and 63 transitions. [2022-04-08 05:26:13,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 05:26:13,467 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-08 05:26:13,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 05:26:13,468 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-08 05:26:13,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 57 transitions. [2022-04-08 05:26:13,469 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-08 05:26:13,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 57 transitions. [2022-04-08 05:26:13,470 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 57 transitions. [2022-04-08 05:26:13,522 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-08 05:26:13,524 INFO L225 Difference]: With dead ends: 50 [2022-04-08 05:26:13,524 INFO L226 Difference]: Without dead ends: 46 [2022-04-08 05:26:13,524 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-08 05:26:13,525 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-08 05:26:13,525 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-08 05:26:13,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-04-08 05:26:13,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 39. [2022-04-08 05:26:13,544 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 05:26:13,544 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-08 05:26:13,544 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-08 05:26:13,545 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-08 05:26:13,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:26:13,548 INFO L93 Difference]: Finished difference Result 46 states and 55 transitions. [2022-04-08 05:26:13,548 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 55 transitions. [2022-04-08 05:26:13,548 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:26:13,548 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:26:13,548 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-08 05:26:13,549 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-08 05:26:13,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:26:13,550 INFO L93 Difference]: Finished difference Result 46 states and 55 transitions. [2022-04-08 05:26:13,551 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 55 transitions. [2022-04-08 05:26:13,551 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:26:13,551 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:26:13,551 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 05:26:13,551 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 05:26:13,551 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-08 05:26:13,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 46 transitions. [2022-04-08 05:26:13,553 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 46 transitions. Word has length 26 [2022-04-08 05:26:13,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 05:26:13,553 INFO L478 AbstractCegarLoop]: Abstraction has 39 states and 46 transitions. [2022-04-08 05:26:13,553 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-08 05:26:13,553 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 46 transitions. [2022-04-08 05:26:13,589 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-08 05:26:13,589 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2022-04-08 05:26:13,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-08 05:26:13,590 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 05:26:13,590 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-08 05:26:13,607 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-08 05:26:13,795 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-08 05:26:13,796 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 05:26:13,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 05:26:13,797 INFO L85 PathProgramCache]: Analyzing trace with hash -1733722638, now seen corresponding path program 1 times [2022-04-08 05:26:13,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 05:26:13,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1514150537] [2022-04-08 05:26:13,797 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 05:26:13,797 INFO L85 PathProgramCache]: Analyzing trace with hash -1733722638, now seen corresponding path program 2 times [2022-04-08 05:26:13,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 05:26:13,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791138518] [2022-04-08 05:26:13,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 05:26:13,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 05:26:13,824 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 05:26:13,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [399557512] [2022-04-08 05:26:13,824 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 05:26:13,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 05:26:13,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 05:26:13,825 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 05:26:13,826 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-08 05:26:13,872 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 05:26:13,873 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 05:26:13,873 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-08 05:26:13,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 05:26:13,884 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 05:26:14,041 INFO L272 TraceCheckUtils]: 0: Hoare triple {1221#true} call ULTIMATE.init(); {1221#true} is VALID [2022-04-08 05:26:14,042 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-08 05:26:14,042 INFO L290 TraceCheckUtils]: 2: Hoare triple {1229#(<= ~counter~0 0)} assume true; {1229#(<= ~counter~0 0)} is VALID [2022-04-08 05:26:14,043 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1229#(<= ~counter~0 0)} {1221#true} #89#return; {1229#(<= ~counter~0 0)} is VALID [2022-04-08 05:26:14,043 INFO L272 TraceCheckUtils]: 4: Hoare triple {1229#(<= ~counter~0 0)} call #t~ret5 := main(); {1229#(<= ~counter~0 0)} is VALID [2022-04-08 05:26:14,043 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-08 05:26:14,044 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-08 05:26:14,044 INFO L290 TraceCheckUtils]: 7: Hoare triple {1229#(<= ~counter~0 0)} ~cond := #in~cond; {1229#(<= ~counter~0 0)} is VALID [2022-04-08 05:26:14,045 INFO L290 TraceCheckUtils]: 8: Hoare triple {1229#(<= ~counter~0 0)} assume !(0 == ~cond); {1229#(<= ~counter~0 0)} is VALID [2022-04-08 05:26:14,045 INFO L290 TraceCheckUtils]: 9: Hoare triple {1229#(<= ~counter~0 0)} assume true; {1229#(<= ~counter~0 0)} is VALID [2022-04-08 05:26:14,047 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1229#(<= ~counter~0 0)} {1229#(<= ~counter~0 0)} #81#return; {1229#(<= ~counter~0 0)} is VALID [2022-04-08 05:26:14,047 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-08 05:26:14,055 INFO L290 TraceCheckUtils]: 12: Hoare triple {1229#(<= ~counter~0 0)} ~cond := #in~cond; {1229#(<= ~counter~0 0)} is VALID [2022-04-08 05:26:14,055 INFO L290 TraceCheckUtils]: 13: Hoare triple {1229#(<= ~counter~0 0)} assume !(0 == ~cond); {1229#(<= ~counter~0 0)} is VALID [2022-04-08 05:26:14,056 INFO L290 TraceCheckUtils]: 14: Hoare triple {1229#(<= ~counter~0 0)} assume true; {1229#(<= ~counter~0 0)} is VALID [2022-04-08 05:26:14,056 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1229#(<= ~counter~0 0)} {1229#(<= ~counter~0 0)} #83#return; {1229#(<= ~counter~0 0)} is VALID [2022-04-08 05:26:14,057 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-08 05:26:14,057 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-08 05:26:14,058 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-08 05:26:14,058 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-08 05:26:14,058 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-08 05:26:14,059 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-08 05:26:14,059 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-08 05:26:14,060 INFO L290 TraceCheckUtils]: 23: Hoare triple {1288#(<= ~counter~0 2)} ~cond := #in~cond; {1288#(<= ~counter~0 2)} is VALID [2022-04-08 05:26:14,060 INFO L290 TraceCheckUtils]: 24: Hoare triple {1288#(<= ~counter~0 2)} assume !(0 == ~cond); {1288#(<= ~counter~0 2)} is VALID [2022-04-08 05:26:14,060 INFO L290 TraceCheckUtils]: 25: Hoare triple {1288#(<= ~counter~0 2)} assume true; {1288#(<= ~counter~0 2)} is VALID [2022-04-08 05:26:14,061 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1288#(<= ~counter~0 2)} {1288#(<= ~counter~0 2)} #85#return; {1288#(<= ~counter~0 2)} is VALID [2022-04-08 05:26:14,061 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-08 05:26:14,062 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-08 05:26:14,062 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-08 05:26:14,062 INFO L290 TraceCheckUtils]: 30: Hoare triple {1316#(<= |main_#t~post4| 2)} assume !(#t~post4 < 50);havoc #t~post4; {1222#false} is VALID [2022-04-08 05:26:14,063 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-08 05:26:14,063 INFO L290 TraceCheckUtils]: 32: Hoare triple {1222#false} ~cond := #in~cond; {1222#false} is VALID [2022-04-08 05:26:14,063 INFO L290 TraceCheckUtils]: 33: Hoare triple {1222#false} assume 0 == ~cond; {1222#false} is VALID [2022-04-08 05:26:14,063 INFO L290 TraceCheckUtils]: 34: Hoare triple {1222#false} assume !false; {1222#false} is VALID [2022-04-08 05:26:14,063 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-08 05:26:14,063 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 05:26:14,245 INFO L290 TraceCheckUtils]: 34: Hoare triple {1222#false} assume !false; {1222#false} is VALID [2022-04-08 05:26:14,245 INFO L290 TraceCheckUtils]: 33: Hoare triple {1222#false} assume 0 == ~cond; {1222#false} is VALID [2022-04-08 05:26:14,245 INFO L290 TraceCheckUtils]: 32: Hoare triple {1222#false} ~cond := #in~cond; {1222#false} is VALID [2022-04-08 05:26:14,245 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-08 05:26:14,245 INFO L290 TraceCheckUtils]: 30: Hoare triple {1344#(< |main_#t~post4| 50)} assume !(#t~post4 < 50);havoc #t~post4; {1222#false} is VALID [2022-04-08 05:26:14,247 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-08 05:26:14,247 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-08 05:26:14,247 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-08 05:26:14,248 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1221#true} {1348#(< ~counter~0 50)} #85#return; {1348#(< ~counter~0 50)} is VALID [2022-04-08 05:26:14,248 INFO L290 TraceCheckUtils]: 25: Hoare triple {1221#true} assume true; {1221#true} is VALID [2022-04-08 05:26:14,248 INFO L290 TraceCheckUtils]: 24: Hoare triple {1221#true} assume !(0 == ~cond); {1221#true} is VALID [2022-04-08 05:26:14,248 INFO L290 TraceCheckUtils]: 23: Hoare triple {1221#true} ~cond := #in~cond; {1221#true} is VALID [2022-04-08 05:26:14,248 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-08 05:26:14,249 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-08 05:26:14,249 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-08 05:26:14,249 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-08 05:26:14,250 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-08 05:26:14,250 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-08 05:26:14,251 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-08 05:26:14,251 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1221#true} {1386#(< ~counter~0 48)} #83#return; {1386#(< ~counter~0 48)} is VALID [2022-04-08 05:26:14,251 INFO L290 TraceCheckUtils]: 14: Hoare triple {1221#true} assume true; {1221#true} is VALID [2022-04-08 05:26:14,251 INFO L290 TraceCheckUtils]: 13: Hoare triple {1221#true} assume !(0 == ~cond); {1221#true} is VALID [2022-04-08 05:26:14,251 INFO L290 TraceCheckUtils]: 12: Hoare triple {1221#true} ~cond := #in~cond; {1221#true} is VALID [2022-04-08 05:26:14,251 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-08 05:26:14,252 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1221#true} {1386#(< ~counter~0 48)} #81#return; {1386#(< ~counter~0 48)} is VALID [2022-04-08 05:26:14,252 INFO L290 TraceCheckUtils]: 9: Hoare triple {1221#true} assume true; {1221#true} is VALID [2022-04-08 05:26:14,252 INFO L290 TraceCheckUtils]: 8: Hoare triple {1221#true} assume !(0 == ~cond); {1221#true} is VALID [2022-04-08 05:26:14,252 INFO L290 TraceCheckUtils]: 7: Hoare triple {1221#true} ~cond := #in~cond; {1221#true} is VALID [2022-04-08 05:26:14,252 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-08 05:26:14,253 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-08 05:26:14,253 INFO L272 TraceCheckUtils]: 4: Hoare triple {1386#(< ~counter~0 48)} call #t~ret5 := main(); {1386#(< ~counter~0 48)} is VALID [2022-04-08 05:26:14,254 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1386#(< ~counter~0 48)} {1221#true} #89#return; {1386#(< ~counter~0 48)} is VALID [2022-04-08 05:26:14,254 INFO L290 TraceCheckUtils]: 2: Hoare triple {1386#(< ~counter~0 48)} assume true; {1386#(< ~counter~0 48)} is VALID [2022-04-08 05:26:14,255 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-08 05:26:14,255 INFO L272 TraceCheckUtils]: 0: Hoare triple {1221#true} call ULTIMATE.init(); {1221#true} is VALID [2022-04-08 05:26:14,255 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-08 05:26:14,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 05:26:14,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791138518] [2022-04-08 05:26:14,255 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 05:26:14,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [399557512] [2022-04-08 05:26:14,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [399557512] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 05:26:14,256 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 05:26:14,256 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-04-08 05:26:14,256 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 05:26:14,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1514150537] [2022-04-08 05:26:14,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1514150537] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 05:26:14,256 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 05:26:14,256 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 05:26:14,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067405507] [2022-04-08 05:26:14,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 05:26:14,257 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-08 05:26:14,257 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 05:26:14,257 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-08 05:26:14,279 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:26:14,279 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 05:26:14,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 05:26:14,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 05:26:14,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-08 05:26:14,280 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-08 05:26:14,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:26:14,422 INFO L93 Difference]: Finished difference Result 64 states and 75 transitions. [2022-04-08 05:26:14,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 05:26:14,422 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-08 05:26:14,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 05:26:14,422 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-08 05:26:14,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 63 transitions. [2022-04-08 05:26:14,425 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-08 05:26:14,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 63 transitions. [2022-04-08 05:26:14,429 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 63 transitions. [2022-04-08 05:26:14,470 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-08 05:26:14,471 INFO L225 Difference]: With dead ends: 64 [2022-04-08 05:26:14,471 INFO L226 Difference]: Without dead ends: 57 [2022-04-08 05:26:14,472 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-08 05:26:14,476 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-08 05:26:14,476 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-08 05:26:14,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-04-08 05:26:14,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 51. [2022-04-08 05:26:14,514 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 05:26:14,514 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-08 05:26:14,515 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-08 05:26:14,515 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-08 05:26:14,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:26:14,516 INFO L93 Difference]: Finished difference Result 57 states and 68 transitions. [2022-04-08 05:26:14,516 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 68 transitions. [2022-04-08 05:26:14,517 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:26:14,517 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:26:14,517 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-08 05:26:14,517 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-08 05:26:14,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:26:14,519 INFO L93 Difference]: Finished difference Result 57 states and 68 transitions. [2022-04-08 05:26:14,519 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 68 transitions. [2022-04-08 05:26:14,519 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:26:14,519 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:26:14,519 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 05:26:14,519 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 05:26:14,520 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-08 05:26:14,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 60 transitions. [2022-04-08 05:26:14,521 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 60 transitions. Word has length 35 [2022-04-08 05:26:14,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 05:26:14,521 INFO L478 AbstractCegarLoop]: Abstraction has 51 states and 60 transitions. [2022-04-08 05:26:14,521 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-08 05:26:14,521 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 51 states and 60 transitions. [2022-04-08 05:26:14,573 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:26:14,573 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 60 transitions. [2022-04-08 05:26:14,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-08 05:26:14,573 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 05:26:14,574 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-08 05:26:14,590 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-08 05:26:14,779 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-08 05:26:14,780 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 05:26:14,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 05:26:14,781 INFO L85 PathProgramCache]: Analyzing trace with hash -1731935178, now seen corresponding path program 1 times [2022-04-08 05:26:14,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 05:26:14,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1329298060] [2022-04-08 05:26:14,782 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 05:26:14,782 INFO L85 PathProgramCache]: Analyzing trace with hash -1731935178, now seen corresponding path program 2 times [2022-04-08 05:26:14,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 05:26:14,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251795654] [2022-04-08 05:26:14,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 05:26:14,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 05:26:14,808 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 05:26:14,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [676280803] [2022-04-08 05:26:14,808 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 05:26:14,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 05:26:14,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 05:26:14,813 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 05:26:14,814 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-08 05:26:14,851 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 05:26:14,851 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 05:26:14,851 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-08 05:26:14,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 05:26:14,858 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 05:26:14,933 INFO L272 TraceCheckUtils]: 0: Hoare triple {1786#true} call ULTIMATE.init(); {1786#true} is VALID [2022-04-08 05:26:14,933 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-08 05:26:14,933 INFO L290 TraceCheckUtils]: 2: Hoare triple {1786#true} assume true; {1786#true} is VALID [2022-04-08 05:26:14,934 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1786#true} {1786#true} #89#return; {1786#true} is VALID [2022-04-08 05:26:14,934 INFO L272 TraceCheckUtils]: 4: Hoare triple {1786#true} call #t~ret5 := main(); {1786#true} is VALID [2022-04-08 05:26:14,934 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-08 05:26:14,934 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-08 05:26:14,934 INFO L290 TraceCheckUtils]: 7: Hoare triple {1786#true} ~cond := #in~cond; {1786#true} is VALID [2022-04-08 05:26:14,934 INFO L290 TraceCheckUtils]: 8: Hoare triple {1786#true} assume !(0 == ~cond); {1786#true} is VALID [2022-04-08 05:26:14,934 INFO L290 TraceCheckUtils]: 9: Hoare triple {1786#true} assume true; {1786#true} is VALID [2022-04-08 05:26:14,934 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1786#true} {1786#true} #81#return; {1786#true} is VALID [2022-04-08 05:26:14,934 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-08 05:26:14,934 INFO L290 TraceCheckUtils]: 12: Hoare triple {1786#true} ~cond := #in~cond; {1786#true} is VALID [2022-04-08 05:26:14,935 INFO L290 TraceCheckUtils]: 13: Hoare triple {1786#true} assume !(0 == ~cond); {1786#true} is VALID [2022-04-08 05:26:14,935 INFO L290 TraceCheckUtils]: 14: Hoare triple {1786#true} assume true; {1786#true} is VALID [2022-04-08 05:26:14,935 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1786#true} {1786#true} #83#return; {1786#true} is VALID [2022-04-08 05:26:14,937 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-08 05:26:14,937 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-08 05:26:14,940 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-08 05:26:14,941 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-08 05:26:14,941 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-08 05:26:14,941 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-08 05:26:14,941 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-08 05:26:14,941 INFO L290 TraceCheckUtils]: 23: Hoare triple {1786#true} ~cond := #in~cond; {1786#true} is VALID [2022-04-08 05:26:14,942 INFO L290 TraceCheckUtils]: 24: Hoare triple {1786#true} assume !(0 == ~cond); {1786#true} is VALID [2022-04-08 05:26:14,942 INFO L290 TraceCheckUtils]: 25: Hoare triple {1786#true} assume true; {1786#true} is VALID [2022-04-08 05:26:14,942 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-08 05:26:14,943 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-08 05:26:14,943 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-08 05:26:14,943 INFO L290 TraceCheckUtils]: 29: Hoare triple {1787#false} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {1787#false} is VALID [2022-04-08 05:26:14,943 INFO L290 TraceCheckUtils]: 30: Hoare triple {1787#false} assume !!(#t~post4 < 50);havoc #t~post4; {1787#false} is VALID [2022-04-08 05:26:14,943 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-08 05:26:14,943 INFO L290 TraceCheckUtils]: 32: Hoare triple {1787#false} ~cond := #in~cond; {1787#false} is VALID [2022-04-08 05:26:14,943 INFO L290 TraceCheckUtils]: 33: Hoare triple {1787#false} assume 0 == ~cond; {1787#false} is VALID [2022-04-08 05:26:14,943 INFO L290 TraceCheckUtils]: 34: Hoare triple {1787#false} assume !false; {1787#false} is VALID [2022-04-08 05:26:14,943 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-08 05:26:14,943 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 05:26:14,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 05:26:14,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251795654] [2022-04-08 05:26:14,944 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 05:26:14,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [676280803] [2022-04-08 05:26:14,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [676280803] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 05:26:14,944 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 05:26:14,944 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 05:26:14,944 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 05:26:14,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1329298060] [2022-04-08 05:26:14,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1329298060] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 05:26:14,944 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 05:26:14,945 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 05:26:14,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098027793] [2022-04-08 05:26:14,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 05:26:14,945 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-08 05:26:14,945 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 05:26:14,945 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-08 05:26:14,965 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:26:14,965 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-08 05:26:14,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 05:26:14,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-08 05:26:14,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 05:26:14,966 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-08 05:26:15,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:26:15,039 INFO L93 Difference]: Finished difference Result 72 states and 85 transitions. [2022-04-08 05:26:15,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-08 05:26:15,039 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-08 05:26:15,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 05:26:15,040 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-08 05:26:15,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 58 transitions. [2022-04-08 05:26:15,041 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-08 05:26:15,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 58 transitions. [2022-04-08 05:26:15,042 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 58 transitions. [2022-04-08 05:26:15,083 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-08 05:26:15,084 INFO L225 Difference]: With dead ends: 72 [2022-04-08 05:26:15,084 INFO L226 Difference]: Without dead ends: 40 [2022-04-08 05:26:15,084 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-08 05:26:15,085 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-08 05:26:15,085 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-08 05:26:15,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-04-08 05:26:15,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2022-04-08 05:26:15,105 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 05:26:15,105 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-08 05:26:15,106 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-08 05:26:15,106 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-08 05:26:15,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:26:15,108 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2022-04-08 05:26:15,108 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 47 transitions. [2022-04-08 05:26:15,108 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:26:15,108 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:26:15,108 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-08 05:26:15,108 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-08 05:26:15,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:26:15,110 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2022-04-08 05:26:15,110 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 47 transitions. [2022-04-08 05:26:15,110 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:26:15,110 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:26:15,110 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 05:26:15,110 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 05:26:15,110 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-08 05:26:15,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 47 transitions. [2022-04-08 05:26:15,111 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 47 transitions. Word has length 35 [2022-04-08 05:26:15,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 05:26:15,112 INFO L478 AbstractCegarLoop]: Abstraction has 40 states and 47 transitions. [2022-04-08 05:26:15,112 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-08 05:26:15,112 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 47 transitions. [2022-04-08 05:26:15,147 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:26:15,147 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 47 transitions. [2022-04-08 05:26:15,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-08 05:26:15,147 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 05:26:15,148 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-08 05:26:15,164 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-08 05:26:15,355 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-08 05:26:15,357 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 05:26:15,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 05:26:15,358 INFO L85 PathProgramCache]: Analyzing trace with hash -1874551443, now seen corresponding path program 1 times [2022-04-08 05:26:15,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 05:26:15,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [306837321] [2022-04-08 05:26:15,358 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 05:26:15,358 INFO L85 PathProgramCache]: Analyzing trace with hash -1874551443, now seen corresponding path program 2 times [2022-04-08 05:26:15,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 05:26:15,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262867819] [2022-04-08 05:26:15,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 05:26:15,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 05:26:15,376 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 05:26:15,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [974132590] [2022-04-08 05:26:15,376 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 05:26:15,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 05:26:15,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 05:26:15,377 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 05:26:15,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-08 05:26:15,422 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 05:26:15,422 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 05:26:15,422 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 05:26:15,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 05:26:15,430 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 05:26:15,552 INFO L272 TraceCheckUtils]: 0: Hoare triple {2197#true} call ULTIMATE.init(); {2197#true} is VALID [2022-04-08 05:26:15,553 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-08 05:26:15,553 INFO L290 TraceCheckUtils]: 2: Hoare triple {2205#(<= ~counter~0 0)} assume true; {2205#(<= ~counter~0 0)} is VALID [2022-04-08 05:26:15,553 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2205#(<= ~counter~0 0)} {2197#true} #89#return; {2205#(<= ~counter~0 0)} is VALID [2022-04-08 05:26:15,554 INFO L272 TraceCheckUtils]: 4: Hoare triple {2205#(<= ~counter~0 0)} call #t~ret5 := main(); {2205#(<= ~counter~0 0)} is VALID [2022-04-08 05:26:15,554 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-08 05:26:15,554 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-08 05:26:15,555 INFO L290 TraceCheckUtils]: 7: Hoare triple {2205#(<= ~counter~0 0)} ~cond := #in~cond; {2205#(<= ~counter~0 0)} is VALID [2022-04-08 05:26:15,555 INFO L290 TraceCheckUtils]: 8: Hoare triple {2205#(<= ~counter~0 0)} assume !(0 == ~cond); {2205#(<= ~counter~0 0)} is VALID [2022-04-08 05:26:15,555 INFO L290 TraceCheckUtils]: 9: Hoare triple {2205#(<= ~counter~0 0)} assume true; {2205#(<= ~counter~0 0)} is VALID [2022-04-08 05:26:15,556 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2205#(<= ~counter~0 0)} {2205#(<= ~counter~0 0)} #81#return; {2205#(<= ~counter~0 0)} is VALID [2022-04-08 05:26:15,556 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-08 05:26:15,556 INFO L290 TraceCheckUtils]: 12: Hoare triple {2205#(<= ~counter~0 0)} ~cond := #in~cond; {2205#(<= ~counter~0 0)} is VALID [2022-04-08 05:26:15,557 INFO L290 TraceCheckUtils]: 13: Hoare triple {2205#(<= ~counter~0 0)} assume !(0 == ~cond); {2205#(<= ~counter~0 0)} is VALID [2022-04-08 05:26:15,557 INFO L290 TraceCheckUtils]: 14: Hoare triple {2205#(<= ~counter~0 0)} assume true; {2205#(<= ~counter~0 0)} is VALID [2022-04-08 05:26:15,557 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2205#(<= ~counter~0 0)} {2205#(<= ~counter~0 0)} #83#return; {2205#(<= ~counter~0 0)} is VALID [2022-04-08 05:26:15,557 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-08 05:26:15,558 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-08 05:26:15,558 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-08 05:26:15,558 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-08 05:26:15,559 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-08 05:26:15,559 INFO L290 TraceCheckUtils]: 21: Hoare triple {2264#(<= |main_#t~post3| 1)} assume !(#t~post3 < 50);havoc #t~post3; {2198#false} is VALID [2022-04-08 05:26:15,559 INFO L290 TraceCheckUtils]: 22: Hoare triple {2198#false} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {2198#false} is VALID [2022-04-08 05:26:15,559 INFO L290 TraceCheckUtils]: 23: Hoare triple {2198#false} assume !!(#t~post4 < 50);havoc #t~post4; {2198#false} is VALID [2022-04-08 05:26:15,560 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-08 05:26:15,560 INFO L290 TraceCheckUtils]: 25: Hoare triple {2198#false} ~cond := #in~cond; {2198#false} is VALID [2022-04-08 05:26:15,560 INFO L290 TraceCheckUtils]: 26: Hoare triple {2198#false} assume !(0 == ~cond); {2198#false} is VALID [2022-04-08 05:26:15,560 INFO L290 TraceCheckUtils]: 27: Hoare triple {2198#false} assume true; {2198#false} is VALID [2022-04-08 05:26:15,560 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2198#false} {2198#false} #85#return; {2198#false} is VALID [2022-04-08 05:26:15,560 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-08 05:26:15,560 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-08 05:26:15,560 INFO L290 TraceCheckUtils]: 31: Hoare triple {2198#false} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {2198#false} is VALID [2022-04-08 05:26:15,560 INFO L290 TraceCheckUtils]: 32: Hoare triple {2198#false} assume !(#t~post4 < 50);havoc #t~post4; {2198#false} is VALID [2022-04-08 05:26:15,560 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-08 05:26:15,560 INFO L290 TraceCheckUtils]: 34: Hoare triple {2198#false} ~cond := #in~cond; {2198#false} is VALID [2022-04-08 05:26:15,561 INFO L290 TraceCheckUtils]: 35: Hoare triple {2198#false} assume 0 == ~cond; {2198#false} is VALID [2022-04-08 05:26:15,561 INFO L290 TraceCheckUtils]: 36: Hoare triple {2198#false} assume !false; {2198#false} is VALID [2022-04-08 05:26:15,561 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-08 05:26:15,561 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 05:26:15,732 INFO L290 TraceCheckUtils]: 36: Hoare triple {2198#false} assume !false; {2198#false} is VALID [2022-04-08 05:26:15,733 INFO L290 TraceCheckUtils]: 35: Hoare triple {2198#false} assume 0 == ~cond; {2198#false} is VALID [2022-04-08 05:26:15,733 INFO L290 TraceCheckUtils]: 34: Hoare triple {2198#false} ~cond := #in~cond; {2198#false} is VALID [2022-04-08 05:26:15,733 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-08 05:26:15,733 INFO L290 TraceCheckUtils]: 32: Hoare triple {2198#false} assume !(#t~post4 < 50);havoc #t~post4; {2198#false} is VALID [2022-04-08 05:26:15,733 INFO L290 TraceCheckUtils]: 31: Hoare triple {2198#false} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {2198#false} is VALID [2022-04-08 05:26:15,733 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-08 05:26:15,733 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-08 05:26:15,733 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2197#true} {2198#false} #85#return; {2198#false} is VALID [2022-04-08 05:26:15,733 INFO L290 TraceCheckUtils]: 27: Hoare triple {2197#true} assume true; {2197#true} is VALID [2022-04-08 05:26:15,733 INFO L290 TraceCheckUtils]: 26: Hoare triple {2197#true} assume !(0 == ~cond); {2197#true} is VALID [2022-04-08 05:26:15,734 INFO L290 TraceCheckUtils]: 25: Hoare triple {2197#true} ~cond := #in~cond; {2197#true} is VALID [2022-04-08 05:26:15,734 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-08 05:26:15,734 INFO L290 TraceCheckUtils]: 23: Hoare triple {2198#false} assume !!(#t~post4 < 50);havoc #t~post4; {2198#false} is VALID [2022-04-08 05:26:15,734 INFO L290 TraceCheckUtils]: 22: Hoare triple {2198#false} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {2198#false} is VALID [2022-04-08 05:26:15,737 INFO L290 TraceCheckUtils]: 21: Hoare triple {2358#(< |main_#t~post3| 50)} assume !(#t~post3 < 50);havoc #t~post3; {2198#false} is VALID [2022-04-08 05:26:15,737 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-08 05:26:15,738 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-08 05:26:15,738 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-08 05:26:15,738 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-08 05:26:15,739 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-08 05:26:15,739 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2197#true} {2372#(< ~counter~0 49)} #83#return; {2372#(< ~counter~0 49)} is VALID [2022-04-08 05:26:15,739 INFO L290 TraceCheckUtils]: 14: Hoare triple {2197#true} assume true; {2197#true} is VALID [2022-04-08 05:26:15,739 INFO L290 TraceCheckUtils]: 13: Hoare triple {2197#true} assume !(0 == ~cond); {2197#true} is VALID [2022-04-08 05:26:15,739 INFO L290 TraceCheckUtils]: 12: Hoare triple {2197#true} ~cond := #in~cond; {2197#true} is VALID [2022-04-08 05:26:15,740 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-08 05:26:15,740 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2197#true} {2372#(< ~counter~0 49)} #81#return; {2372#(< ~counter~0 49)} is VALID [2022-04-08 05:26:15,740 INFO L290 TraceCheckUtils]: 9: Hoare triple {2197#true} assume true; {2197#true} is VALID [2022-04-08 05:26:15,740 INFO L290 TraceCheckUtils]: 8: Hoare triple {2197#true} assume !(0 == ~cond); {2197#true} is VALID [2022-04-08 05:26:15,740 INFO L290 TraceCheckUtils]: 7: Hoare triple {2197#true} ~cond := #in~cond; {2197#true} is VALID [2022-04-08 05:26:15,740 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-08 05:26:15,741 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-08 05:26:15,741 INFO L272 TraceCheckUtils]: 4: Hoare triple {2372#(< ~counter~0 49)} call #t~ret5 := main(); {2372#(< ~counter~0 49)} is VALID [2022-04-08 05:26:15,741 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2372#(< ~counter~0 49)} {2197#true} #89#return; {2372#(< ~counter~0 49)} is VALID [2022-04-08 05:26:15,741 INFO L290 TraceCheckUtils]: 2: Hoare triple {2372#(< ~counter~0 49)} assume true; {2372#(< ~counter~0 49)} is VALID [2022-04-08 05:26:15,742 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-08 05:26:15,742 INFO L272 TraceCheckUtils]: 0: Hoare triple {2197#true} call ULTIMATE.init(); {2197#true} is VALID [2022-04-08 05:26:15,742 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-08 05:26:15,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 05:26:15,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262867819] [2022-04-08 05:26:15,743 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 05:26:15,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [974132590] [2022-04-08 05:26:15,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [974132590] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 05:26:15,743 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 05:26:15,743 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-08 05:26:15,743 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 05:26:15,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [306837321] [2022-04-08 05:26:15,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [306837321] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 05:26:15,743 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 05:26:15,743 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 05:26:15,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985942530] [2022-04-08 05:26:15,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 05:26:15,744 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-08 05:26:15,744 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 05:26:15,744 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-08 05:26:15,764 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:26:15,764 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 05:26:15,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 05:26:15,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 05:26:15,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-08 05:26:15,765 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-08 05:26:15,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:26:15,851 INFO L93 Difference]: Finished difference Result 63 states and 75 transitions. [2022-04-08 05:26:15,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 05:26:15,851 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-08 05:26:15,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 05:26:15,851 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-08 05:26:15,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 55 transitions. [2022-04-08 05:26:15,852 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-08 05:26:15,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 55 transitions. [2022-04-08 05:26:15,853 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 55 transitions. [2022-04-08 05:26:15,904 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-08 05:26:15,906 INFO L225 Difference]: With dead ends: 63 [2022-04-08 05:26:15,906 INFO L226 Difference]: Without dead ends: 42 [2022-04-08 05:26:15,906 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-08 05:26:15,907 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-08 05:26:15,907 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-08 05:26:15,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-04-08 05:26:15,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2022-04-08 05:26:15,928 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 05:26:15,928 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-08 05:26:15,929 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-08 05:26:15,929 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-08 05:26:15,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:26:15,930 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2022-04-08 05:26:15,930 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2022-04-08 05:26:15,930 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:26:15,930 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:26:15,930 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-08 05:26:15,931 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-08 05:26:15,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:26:15,932 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2022-04-08 05:26:15,932 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2022-04-08 05:26:15,932 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:26:15,932 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:26:15,932 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 05:26:15,932 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 05:26:15,932 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-08 05:26:15,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 49 transitions. [2022-04-08 05:26:15,933 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 49 transitions. Word has length 37 [2022-04-08 05:26:15,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 05:26:15,933 INFO L478 AbstractCegarLoop]: Abstraction has 42 states and 49 transitions. [2022-04-08 05:26:15,933 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-08 05:26:15,933 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 49 transitions. [2022-04-08 05:26:15,968 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-08 05:26:15,969 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2022-04-08 05:26:15,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-08 05:26:15,969 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 05:26:15,969 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-08 05:26:15,986 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-08 05:26:16,183 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-08 05:26:16,184 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 05:26:16,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 05:26:16,184 INFO L85 PathProgramCache]: Analyzing trace with hash 815990494, now seen corresponding path program 1 times [2022-04-08 05:26:16,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 05:26:16,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1761704181] [2022-04-08 05:26:16,184 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 05:26:16,184 INFO L85 PathProgramCache]: Analyzing trace with hash 815990494, now seen corresponding path program 2 times [2022-04-08 05:26:16,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 05:26:16,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360292440] [2022-04-08 05:26:16,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 05:26:16,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 05:26:16,203 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 05:26:16,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1734420282] [2022-04-08 05:26:16,203 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 05:26:16,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 05:26:16,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 05:26:16,205 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-08 05:26:16,206 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-08 05:26:16,240 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 05:26:16,240 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 05:26:16,240 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-08 05:26:16,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 05:26:16,255 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 05:26:16,430 INFO L272 TraceCheckUtils]: 0: Hoare triple {2722#true} call ULTIMATE.init(); {2722#true} is VALID [2022-04-08 05:26:16,431 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-08 05:26:16,431 INFO L290 TraceCheckUtils]: 2: Hoare triple {2730#(<= ~counter~0 0)} assume true; {2730#(<= ~counter~0 0)} is VALID [2022-04-08 05:26:16,432 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2730#(<= ~counter~0 0)} {2722#true} #89#return; {2730#(<= ~counter~0 0)} is VALID [2022-04-08 05:26:16,432 INFO L272 TraceCheckUtils]: 4: Hoare triple {2730#(<= ~counter~0 0)} call #t~ret5 := main(); {2730#(<= ~counter~0 0)} is VALID [2022-04-08 05:26:16,432 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-08 05:26:16,433 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-08 05:26:16,433 INFO L290 TraceCheckUtils]: 7: Hoare triple {2730#(<= ~counter~0 0)} ~cond := #in~cond; {2730#(<= ~counter~0 0)} is VALID [2022-04-08 05:26:16,433 INFO L290 TraceCheckUtils]: 8: Hoare triple {2730#(<= ~counter~0 0)} assume !(0 == ~cond); {2730#(<= ~counter~0 0)} is VALID [2022-04-08 05:26:16,434 INFO L290 TraceCheckUtils]: 9: Hoare triple {2730#(<= ~counter~0 0)} assume true; {2730#(<= ~counter~0 0)} is VALID [2022-04-08 05:26:16,434 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2730#(<= ~counter~0 0)} {2730#(<= ~counter~0 0)} #81#return; {2730#(<= ~counter~0 0)} is VALID [2022-04-08 05:26:16,434 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-08 05:26:16,435 INFO L290 TraceCheckUtils]: 12: Hoare triple {2730#(<= ~counter~0 0)} ~cond := #in~cond; {2730#(<= ~counter~0 0)} is VALID [2022-04-08 05:26:16,435 INFO L290 TraceCheckUtils]: 13: Hoare triple {2730#(<= ~counter~0 0)} assume !(0 == ~cond); {2730#(<= ~counter~0 0)} is VALID [2022-04-08 05:26:16,435 INFO L290 TraceCheckUtils]: 14: Hoare triple {2730#(<= ~counter~0 0)} assume true; {2730#(<= ~counter~0 0)} is VALID [2022-04-08 05:26:16,436 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2730#(<= ~counter~0 0)} {2730#(<= ~counter~0 0)} #83#return; {2730#(<= ~counter~0 0)} is VALID [2022-04-08 05:26:16,437 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-08 05:26:16,437 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-08 05:26:16,437 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-08 05:26:16,438 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-08 05:26:16,438 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-08 05:26:16,438 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-08 05:26:16,439 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-08 05:26:16,439 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-08 05:26:16,439 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-08 05:26:16,440 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-08 05:26:16,440 INFO L290 TraceCheckUtils]: 26: Hoare triple {2799#(<= ~counter~0 3)} ~cond := #in~cond; {2799#(<= ~counter~0 3)} is VALID [2022-04-08 05:26:16,440 INFO L290 TraceCheckUtils]: 27: Hoare triple {2799#(<= ~counter~0 3)} assume !(0 == ~cond); {2799#(<= ~counter~0 3)} is VALID [2022-04-08 05:26:16,441 INFO L290 TraceCheckUtils]: 28: Hoare triple {2799#(<= ~counter~0 3)} assume true; {2799#(<= ~counter~0 3)} is VALID [2022-04-08 05:26:16,441 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {2799#(<= ~counter~0 3)} {2799#(<= ~counter~0 3)} #85#return; {2799#(<= ~counter~0 3)} is VALID [2022-04-08 05:26:16,468 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-08 05:26:16,469 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-08 05:26:16,469 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-08 05:26:16,469 INFO L290 TraceCheckUtils]: 33: Hoare triple {2827#(<= |main_#t~post4| 3)} assume !(#t~post4 < 50);havoc #t~post4; {2723#false} is VALID [2022-04-08 05:26:16,469 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-08 05:26:16,470 INFO L290 TraceCheckUtils]: 35: Hoare triple {2723#false} ~cond := #in~cond; {2723#false} is VALID [2022-04-08 05:26:16,470 INFO L290 TraceCheckUtils]: 36: Hoare triple {2723#false} assume 0 == ~cond; {2723#false} is VALID [2022-04-08 05:26:16,470 INFO L290 TraceCheckUtils]: 37: Hoare triple {2723#false} assume !false; {2723#false} is VALID [2022-04-08 05:26:16,470 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-08 05:26:16,470 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 05:26:16,676 INFO L290 TraceCheckUtils]: 37: Hoare triple {2723#false} assume !false; {2723#false} is VALID [2022-04-08 05:26:16,676 INFO L290 TraceCheckUtils]: 36: Hoare triple {2723#false} assume 0 == ~cond; {2723#false} is VALID [2022-04-08 05:26:16,677 INFO L290 TraceCheckUtils]: 35: Hoare triple {2723#false} ~cond := #in~cond; {2723#false} is VALID [2022-04-08 05:26:16,677 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-08 05:26:16,677 INFO L290 TraceCheckUtils]: 33: Hoare triple {2855#(< |main_#t~post4| 50)} assume !(#t~post4 < 50);havoc #t~post4; {2723#false} is VALID [2022-04-08 05:26:16,678 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-08 05:26:16,678 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-08 05:26:16,678 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-08 05:26:16,679 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {2722#true} {2859#(< ~counter~0 50)} #85#return; {2859#(< ~counter~0 50)} is VALID [2022-04-08 05:26:16,679 INFO L290 TraceCheckUtils]: 28: Hoare triple {2722#true} assume true; {2722#true} is VALID [2022-04-08 05:26:16,679 INFO L290 TraceCheckUtils]: 27: Hoare triple {2722#true} assume !(0 == ~cond); {2722#true} is VALID [2022-04-08 05:26:16,679 INFO L290 TraceCheckUtils]: 26: Hoare triple {2722#true} ~cond := #in~cond; {2722#true} is VALID [2022-04-08 05:26:16,679 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-08 05:26:16,679 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-08 05:26:16,680 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-08 05:26:16,680 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-08 05:26:16,681 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-08 05:26:16,681 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-08 05:26:16,681 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-08 05:26:16,682 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-08 05:26:16,682 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-08 05:26:16,682 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-08 05:26:16,683 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2722#true} {2907#(< ~counter~0 47)} #83#return; {2907#(< ~counter~0 47)} is VALID [2022-04-08 05:26:16,683 INFO L290 TraceCheckUtils]: 14: Hoare triple {2722#true} assume true; {2722#true} is VALID [2022-04-08 05:26:16,683 INFO L290 TraceCheckUtils]: 13: Hoare triple {2722#true} assume !(0 == ~cond); {2722#true} is VALID [2022-04-08 05:26:16,683 INFO L290 TraceCheckUtils]: 12: Hoare triple {2722#true} ~cond := #in~cond; {2722#true} is VALID [2022-04-08 05:26:16,683 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-08 05:26:16,684 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2722#true} {2907#(< ~counter~0 47)} #81#return; {2907#(< ~counter~0 47)} is VALID [2022-04-08 05:26:16,684 INFO L290 TraceCheckUtils]: 9: Hoare triple {2722#true} assume true; {2722#true} is VALID [2022-04-08 05:26:16,684 INFO L290 TraceCheckUtils]: 8: Hoare triple {2722#true} assume !(0 == ~cond); {2722#true} is VALID [2022-04-08 05:26:16,684 INFO L290 TraceCheckUtils]: 7: Hoare triple {2722#true} ~cond := #in~cond; {2722#true} is VALID [2022-04-08 05:26:16,684 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-08 05:26:16,685 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-08 05:26:16,685 INFO L272 TraceCheckUtils]: 4: Hoare triple {2907#(< ~counter~0 47)} call #t~ret5 := main(); {2907#(< ~counter~0 47)} is VALID [2022-04-08 05:26:16,686 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2907#(< ~counter~0 47)} {2722#true} #89#return; {2907#(< ~counter~0 47)} is VALID [2022-04-08 05:26:16,686 INFO L290 TraceCheckUtils]: 2: Hoare triple {2907#(< ~counter~0 47)} assume true; {2907#(< ~counter~0 47)} is VALID [2022-04-08 05:26:16,686 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-08 05:26:16,686 INFO L272 TraceCheckUtils]: 0: Hoare triple {2722#true} call ULTIMATE.init(); {2722#true} is VALID [2022-04-08 05:26:16,687 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-08 05:26:16,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 05:26:16,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360292440] [2022-04-08 05:26:16,687 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 05:26:16,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1734420282] [2022-04-08 05:26:16,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1734420282] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 05:26:16,687 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 05:26:16,687 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-04-08 05:26:16,687 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 05:26:16,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1761704181] [2022-04-08 05:26:16,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1761704181] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 05:26:16,688 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 05:26:16,688 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 05:26:16,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924405528] [2022-04-08 05:26:16,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 05:26:16,688 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-08 05:26:16,688 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 05:26:16,689 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-08 05:26:16,714 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-08 05:26:16,714 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 05:26:16,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 05:26:16,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 05:26:16,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2022-04-08 05:26:16,715 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-08 05:26:16,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:26:16,861 INFO L93 Difference]: Finished difference Result 67 states and 78 transitions. [2022-04-08 05:26:16,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 05:26:16,861 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-08 05:26:16,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 05:26:16,862 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-08 05:26:16,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 66 transitions. [2022-04-08 05:26:16,863 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-08 05:26:16,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 66 transitions. [2022-04-08 05:26:16,864 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 66 transitions. [2022-04-08 05:26:16,905 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-08 05:26:16,906 INFO L225 Difference]: With dead ends: 67 [2022-04-08 05:26:16,906 INFO L226 Difference]: Without dead ends: 60 [2022-04-08 05:26:16,906 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-08 05:26:16,907 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-08 05:26:16,907 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-08 05:26:16,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-04-08 05:26:16,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 54. [2022-04-08 05:26:16,940 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 05:26:16,940 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-08 05:26:16,940 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-08 05:26:16,940 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-08 05:26:16,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:26:16,942 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions. [2022-04-08 05:26:16,942 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 71 transitions. [2022-04-08 05:26:16,942 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:26:16,942 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:26:16,942 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-08 05:26:16,942 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-08 05:26:16,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:26:16,944 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions. [2022-04-08 05:26:16,944 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 71 transitions. [2022-04-08 05:26:16,944 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:26:16,944 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:26:16,944 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 05:26:16,944 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 05:26:16,944 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-08 05:26:16,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 63 transitions. [2022-04-08 05:26:16,946 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 63 transitions. Word has length 38 [2022-04-08 05:26:16,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 05:26:16,946 INFO L478 AbstractCegarLoop]: Abstraction has 54 states and 63 transitions. [2022-04-08 05:26:16,947 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-08 05:26:16,947 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 54 states and 63 transitions. [2022-04-08 05:26:16,997 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-08 05:26:16,997 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2022-04-08 05:26:16,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-08 05:26:16,997 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 05:26:16,997 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-08 05:26:17,014 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-04-08 05:26:17,214 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-08 05:26:17,215 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 05:26:17,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 05:26:17,215 INFO L85 PathProgramCache]: Analyzing trace with hash 817777954, now seen corresponding path program 1 times [2022-04-08 05:26:17,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 05:26:17,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1993809034] [2022-04-08 05:26:17,216 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 05:26:17,216 INFO L85 PathProgramCache]: Analyzing trace with hash 817777954, now seen corresponding path program 2 times [2022-04-08 05:26:17,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 05:26:17,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326682343] [2022-04-08 05:26:17,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 05:26:17,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 05:26:17,227 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 05:26:17,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1065272740] [2022-04-08 05:26:17,227 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 05:26:17,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 05:26:17,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 05:26:17,228 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-08 05:26:17,229 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process