/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/divbin_unwindbound5.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 11:51:24,892 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 11:51:24,894 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 11:51:24,931 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 11:51:24,931 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 11:51:24,932 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 11:51:24,933 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 11:51:24,934 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 11:51:24,935 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 11:51:24,936 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 11:51:24,936 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 11:51:24,937 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 11:51:24,937 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 11:51:24,938 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 11:51:24,939 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 11:51:24,943 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 11:51:24,944 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 11:51:24,946 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 11:51:24,952 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 11:51:24,956 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 11:51:24,957 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 11:51:24,958 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 11:51:24,959 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 11:51:24,961 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 11:51:24,962 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 11:51:24,965 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 11:51:24,965 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 11:51:24,965 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 11:51:24,966 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 11:51:24,966 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 11:51:24,966 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 11:51:24,966 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 11:51:24,967 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 11:51:24,967 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 11:51:24,968 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 11:51:24,968 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 11:51:24,968 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 11:51:24,969 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 11:51:24,969 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 11:51:24,969 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 11:51:24,969 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 11:51:24,973 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 11:51:24,973 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-08 11:51:24,979 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 11:51:24,980 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 11:51:24,981 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 11:51:24,981 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 11:51:24,981 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 11:51:24,981 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 11:51:24,981 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 11:51:24,982 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 11:51:24,982 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 11:51:24,982 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 11:51:24,982 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 11:51:24,982 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 11:51:24,982 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 11:51:24,982 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 11:51:24,983 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 11:51:24,983 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 11:51:24,983 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 11:51:24,983 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 11:51:24,983 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 11:51:24,983 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 11:51:24,983 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 11:51:24,983 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-08 11:51:24,983 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-08 11:51:25,163 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 11:51:25,177 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 11:51:25,178 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 11:51:25,179 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 11:51:25,180 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 11:51:25,180 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/divbin_unwindbound5.i [2022-04-08 11:51:25,226 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f716dfe0/230b73717a4a4959b0511ed7b6075c76/FLAGa32078882 [2022-04-08 11:51:25,551 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 11:51:25,551 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/divbin_unwindbound5.i [2022-04-08 11:51:25,561 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f716dfe0/230b73717a4a4959b0511ed7b6075c76/FLAGa32078882 [2022-04-08 11:51:25,968 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f716dfe0/230b73717a4a4959b0511ed7b6075c76 [2022-04-08 11:51:25,970 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 11:51:25,972 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 11:51:25,974 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 11:51:25,974 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 11:51:25,976 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 11:51:25,977 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 11:51:25" (1/1) ... [2022-04-08 11:51:25,978 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6cdb715c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 11:51:25, skipping insertion in model container [2022-04-08 11:51:25,978 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 11:51:25" (1/1) ... [2022-04-08 11:51:25,982 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 11:51:25,991 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 11:51:26,107 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_unwindbound5.i[950,963] [2022-04-08 11:51:26,118 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 11:51:26,123 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 11:51:26,131 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_unwindbound5.i[950,963] [2022-04-08 11:51:26,136 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 11:51:26,145 INFO L208 MainTranslator]: Completed translation [2022-04-08 11:51:26,145 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 11:51:26 WrapperNode [2022-04-08 11:51:26,146 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 11:51:26,146 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 11:51:26,146 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 11:51:26,146 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 11:51:26,153 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 11:51:26" (1/1) ... [2022-04-08 11:51:26,153 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 11:51:26" (1/1) ... [2022-04-08 11:51:26,157 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 11:51:26" (1/1) ... [2022-04-08 11:51:26,157 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 11:51:26" (1/1) ... [2022-04-08 11:51:26,166 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 11:51:26" (1/1) ... [2022-04-08 11:51:26,169 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 11:51:26" (1/1) ... [2022-04-08 11:51:26,169 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 11:51:26" (1/1) ... [2022-04-08 11:51:26,170 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 11:51:26,171 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 11:51:26,171 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 11:51:26,171 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 11:51:26,181 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 11:51:26" (1/1) ... [2022-04-08 11:51:26,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 11:51:26,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:51:26,205 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-08 11:51:26,207 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-08 11:51:26,239 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 11:51:26,239 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 11:51:26,239 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 11:51:26,240 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-08 11:51:26,240 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 11:51:26,240 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 11:51:26,240 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 11:51:26,240 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 11:51:26,240 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-08 11:51:26,240 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-08 11:51:26,240 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 11:51:26,241 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 11:51:26,241 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-08 11:51:26,241 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-08 11:51:26,241 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 11:51:26,241 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 11:51:26,241 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 11:51:26,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 11:51:26,241 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 11:51:26,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 11:51:26,242 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 11:51:26,242 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 11:51:26,294 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 11:51:26,295 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 11:51:26,483 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 11:51:26,503 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 11:51:26,503 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-08 11:51:26,505 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 11:51:26 BoogieIcfgContainer [2022-04-08 11:51:26,505 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 11:51:26,507 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 11:51:26,507 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 11:51:26,538 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 11:51:26,538 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 11:51:25" (1/3) ... [2022-04-08 11:51:26,539 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a835523 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 11:51:26, skipping insertion in model container [2022-04-08 11:51:26,539 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 11:51:26" (2/3) ... [2022-04-08 11:51:26,539 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a835523 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 11:51:26, skipping insertion in model container [2022-04-08 11:51:26,540 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 11:51:26" (3/3) ... [2022-04-08 11:51:26,541 INFO L111 eAbstractionObserver]: Analyzing ICFG divbin_unwindbound5.i [2022-04-08 11:51:26,545 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 11:51:26,545 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 11:51:26,591 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 11:51:26,599 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-08 11:51:26,600 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 11:51:26,636 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 11:51:26,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-08 11:51:26,641 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:51:26,641 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 11:51:26,642 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:51:26,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:51:26,645 INFO L85 PathProgramCache]: Analyzing trace with hash 878397729, now seen corresponding path program 1 times [2022-04-08 11:51:26,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:51:26,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [824969540] [2022-04-08 11:51:26,681 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 11:51:26,681 INFO L85 PathProgramCache]: Analyzing trace with hash 878397729, now seen corresponding path program 2 times [2022-04-08 11:51:26,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:51:26,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618282749] [2022-04-08 11:51:26,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:51:26,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:51:26,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:51:26,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 11:51:26,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:51:26,905 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 11:51:26,906 INFO L290 TraceCheckUtils]: 1: Hoare triple {36#true} assume true; {36#true} is VALID [2022-04-08 11:51:26,906 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {36#true} {36#true} #89#return; {36#true} is VALID [2022-04-08 11:51:26,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-08 11:51:26,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:51:26,914 INFO L290 TraceCheckUtils]: 0: Hoare triple {36#true} ~cond := #in~cond; {36#true} is VALID [2022-04-08 11:51:26,914 INFO L290 TraceCheckUtils]: 1: Hoare triple {36#true} assume 0 == ~cond;assume false; {37#false} is VALID [2022-04-08 11:51:26,915 INFO L290 TraceCheckUtils]: 2: Hoare triple {37#false} assume true; {37#false} is VALID [2022-04-08 11:51:26,915 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37#false} {36#true} #81#return; {37#false} is VALID [2022-04-08 11:51:26,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-08 11:51:26,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:51:26,927 INFO L290 TraceCheckUtils]: 0: Hoare triple {36#true} ~cond := #in~cond; {36#true} is VALID [2022-04-08 11:51:26,928 INFO L290 TraceCheckUtils]: 1: Hoare triple {36#true} assume 0 == ~cond;assume false; {37#false} is VALID [2022-04-08 11:51:26,928 INFO L290 TraceCheckUtils]: 2: Hoare triple {37#false} assume true; {37#false} is VALID [2022-04-08 11:51:26,929 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37#false} {37#false} #83#return; {37#false} is VALID [2022-04-08 11:51:26,930 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 11:51:26,930 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 11:51:26,930 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#true} assume true; {36#true} is VALID [2022-04-08 11:51:26,930 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#true} {36#true} #89#return; {36#true} is VALID [2022-04-08 11:51:26,931 INFO L272 TraceCheckUtils]: 4: Hoare triple {36#true} call #t~ret5 := main(); {36#true} is VALID [2022-04-08 11:51:26,931 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 11:51:26,931 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 11:51:26,932 INFO L290 TraceCheckUtils]: 7: Hoare triple {36#true} ~cond := #in~cond; {36#true} is VALID [2022-04-08 11:51:26,932 INFO L290 TraceCheckUtils]: 8: Hoare triple {36#true} assume 0 == ~cond;assume false; {37#false} is VALID [2022-04-08 11:51:26,932 INFO L290 TraceCheckUtils]: 9: Hoare triple {37#false} assume true; {37#false} is VALID [2022-04-08 11:51:26,933 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {37#false} {36#true} #81#return; {37#false} is VALID [2022-04-08 11:51:26,933 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 11:51:26,933 INFO L290 TraceCheckUtils]: 12: Hoare triple {36#true} ~cond := #in~cond; {36#true} is VALID [2022-04-08 11:51:26,933 INFO L290 TraceCheckUtils]: 13: Hoare triple {36#true} assume 0 == ~cond;assume false; {37#false} is VALID [2022-04-08 11:51:26,934 INFO L290 TraceCheckUtils]: 14: Hoare triple {37#false} assume true; {37#false} is VALID [2022-04-08 11:51:26,934 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {37#false} {37#false} #83#return; {37#false} is VALID [2022-04-08 11:51:26,934 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 11:51:26,934 INFO L290 TraceCheckUtils]: 17: Hoare triple {37#false} assume !true; {37#false} is VALID [2022-04-08 11:51:26,935 INFO L290 TraceCheckUtils]: 18: Hoare triple {37#false} assume !true; {37#false} is VALID [2022-04-08 11:51:26,935 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 11:51:26,935 INFO L290 TraceCheckUtils]: 20: Hoare triple {37#false} ~cond := #in~cond; {37#false} is VALID [2022-04-08 11:51:26,936 INFO L290 TraceCheckUtils]: 21: Hoare triple {37#false} assume 0 == ~cond; {37#false} is VALID [2022-04-08 11:51:26,936 INFO L290 TraceCheckUtils]: 22: Hoare triple {37#false} assume !false; {37#false} is VALID [2022-04-08 11:51:26,936 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 11:51:26,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:51:26,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618282749] [2022-04-08 11:51:26,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618282749] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:51:26,938 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:51:26,938 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 11:51:26,940 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:51:26,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [824969540] [2022-04-08 11:51:26,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [824969540] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:51:26,941 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:51:26,941 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 11:51:26,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536427490] [2022-04-08 11:51:26,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:51:26,946 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 11:51:26,948 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:51:26,950 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 11:51:26,987 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 11:51:26,988 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-08 11:51:26,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:51:27,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-08 11:51:27,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 11:51:27,016 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 11:51:27,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:51:27,169 INFO L93 Difference]: Finished difference Result 60 states and 84 transitions. [2022-04-08 11:51:27,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-08 11:51:27,169 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 11:51:27,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:51:27,171 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 11:51:27,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 84 transitions. [2022-04-08 11:51:27,179 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 11:51:27,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 84 transitions. [2022-04-08 11:51:27,189 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 84 transitions. [2022-04-08 11:51:27,280 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 11:51:27,286 INFO L225 Difference]: With dead ends: 60 [2022-04-08 11:51:27,287 INFO L226 Difference]: Without dead ends: 29 [2022-04-08 11:51:27,288 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 11:51:27,309 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 11:51:27,310 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 11:51:27,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-08 11:51:27,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2022-04-08 11:51:27,329 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:51:27,330 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 11:51:27,330 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 11:51:27,330 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 11:51:27,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:51:27,333 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2022-04-08 11:51:27,333 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-04-08 11:51:27,333 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:51:27,333 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:51:27,334 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 11:51:27,334 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 11:51:27,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:51:27,336 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2022-04-08 11:51:27,336 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-04-08 11:51:27,336 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:51:27,336 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:51:27,336 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:51:27,337 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:51:27,337 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 11:51:27,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2022-04-08 11:51:27,339 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 23 [2022-04-08 11:51:27,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:51:27,339 INFO L478 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2022-04-08 11:51:27,339 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 11:51:27,340 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 34 transitions. [2022-04-08 11:51:27,366 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 11:51:27,367 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2022-04-08 11:51:27,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-08 11:51:27,367 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:51:27,368 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 11:51:27,368 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 11:51:27,368 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:51:27,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:51:27,369 INFO L85 PathProgramCache]: Analyzing trace with hash 994169231, now seen corresponding path program 1 times [2022-04-08 11:51:27,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:51:27,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [384556654] [2022-04-08 11:51:27,369 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 11:51:27,369 INFO L85 PathProgramCache]: Analyzing trace with hash 994169231, now seen corresponding path program 2 times [2022-04-08 11:51:27,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:51:27,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529231699] [2022-04-08 11:51:27,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:51:27,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:51:27,383 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:51:27,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1305091991] [2022-04-08 11:51:27,384 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 11:51:27,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:51:27,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:51:27,388 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 11:51:27,413 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-08 11:51:27,444 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-08 11:51:27,444 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:51:27,445 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-08 11:51:27,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:51:27,457 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:51:27,603 INFO L272 TraceCheckUtils]: 0: Hoare triple {286#true} call ULTIMATE.init(); {286#true} is VALID [2022-04-08 11:51:27,604 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 11:51:27,604 INFO L290 TraceCheckUtils]: 2: Hoare triple {294#(<= ~counter~0 0)} assume true; {294#(<= ~counter~0 0)} is VALID [2022-04-08 11:51:27,604 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {294#(<= ~counter~0 0)} {286#true} #89#return; {294#(<= ~counter~0 0)} is VALID [2022-04-08 11:51:27,605 INFO L272 TraceCheckUtils]: 4: Hoare triple {294#(<= ~counter~0 0)} call #t~ret5 := main(); {294#(<= ~counter~0 0)} is VALID [2022-04-08 11:51:27,605 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 11:51:27,606 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 11:51:27,606 INFO L290 TraceCheckUtils]: 7: Hoare triple {294#(<= ~counter~0 0)} ~cond := #in~cond; {294#(<= ~counter~0 0)} is VALID [2022-04-08 11:51:27,607 INFO L290 TraceCheckUtils]: 8: Hoare triple {294#(<= ~counter~0 0)} assume !(0 == ~cond); {294#(<= ~counter~0 0)} is VALID [2022-04-08 11:51:27,607 INFO L290 TraceCheckUtils]: 9: Hoare triple {294#(<= ~counter~0 0)} assume true; {294#(<= ~counter~0 0)} is VALID [2022-04-08 11:51:27,608 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 11:51:27,610 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 11:51:27,610 INFO L290 TraceCheckUtils]: 12: Hoare triple {294#(<= ~counter~0 0)} ~cond := #in~cond; {294#(<= ~counter~0 0)} is VALID [2022-04-08 11:51:27,610 INFO L290 TraceCheckUtils]: 13: Hoare triple {294#(<= ~counter~0 0)} assume !(0 == ~cond); {294#(<= ~counter~0 0)} is VALID [2022-04-08 11:51:27,611 INFO L290 TraceCheckUtils]: 14: Hoare triple {294#(<= ~counter~0 0)} assume true; {294#(<= ~counter~0 0)} is VALID [2022-04-08 11:51:27,614 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 11:51:27,614 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 11:51:27,615 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 11:51:27,616 INFO L290 TraceCheckUtils]: 18: Hoare triple {343#(<= |main_#t~post3| 0)} assume !(#t~post3 < 5);havoc #t~post3; {287#false} is VALID [2022-04-08 11:51:27,617 INFO L290 TraceCheckUtils]: 19: Hoare triple {287#false} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {287#false} is VALID [2022-04-08 11:51:27,617 INFO L290 TraceCheckUtils]: 20: Hoare triple {287#false} assume !(#t~post4 < 5);havoc #t~post4; {287#false} is VALID [2022-04-08 11:51:27,617 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 11:51:27,617 INFO L290 TraceCheckUtils]: 22: Hoare triple {287#false} ~cond := #in~cond; {287#false} is VALID [2022-04-08 11:51:27,617 INFO L290 TraceCheckUtils]: 23: Hoare triple {287#false} assume 0 == ~cond; {287#false} is VALID [2022-04-08 11:51:27,617 INFO L290 TraceCheckUtils]: 24: Hoare triple {287#false} assume !false; {287#false} is VALID [2022-04-08 11:51:27,618 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 11:51:27,618 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 11:51:27,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:51:27,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529231699] [2022-04-08 11:51:27,618 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:51:27,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1305091991] [2022-04-08 11:51:27,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1305091991] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:51:27,619 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:51:27,619 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 11:51:27,620 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:51:27,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [384556654] [2022-04-08 11:51:27,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [384556654] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:51:27,620 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:51:27,620 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 11:51:27,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128873422] [2022-04-08 11:51:27,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:51:27,621 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 11:51:27,621 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:51:27,621 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 11:51:27,636 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 11:51:27,636 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 11:51:27,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:51:27,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 11:51:27,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 11:51:27,637 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 11:51:27,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:51:27,692 INFO L93 Difference]: Finished difference Result 42 states and 52 transitions. [2022-04-08 11:51:27,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 11:51:27,692 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 11:51:27,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:51:27,692 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 11:51:27,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 52 transitions. [2022-04-08 11:51:27,694 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 11:51:27,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 52 transitions. [2022-04-08 11:51:27,695 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 52 transitions. [2022-04-08 11:51:27,728 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 11:51:27,729 INFO L225 Difference]: With dead ends: 42 [2022-04-08 11:51:27,729 INFO L226 Difference]: Without dead ends: 30 [2022-04-08 11:51:27,730 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 11:51:27,732 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 11:51:27,735 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 11:51:27,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-08 11:51:27,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-04-08 11:51:27,750 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:51:27,751 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 11:51:27,751 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 11:51:27,752 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 11:51:27,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:51:27,753 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2022-04-08 11:51:27,754 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2022-04-08 11:51:27,754 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:51:27,754 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:51:27,754 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 11:51:27,755 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 11:51:27,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:51:27,756 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2022-04-08 11:51:27,756 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2022-04-08 11:51:27,756 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:51:27,756 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:51:27,757 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:51:27,757 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:51:27,757 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 11:51:27,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2022-04-08 11:51:27,758 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 25 [2022-04-08 11:51:27,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:51:27,758 INFO L478 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2022-04-08 11:51:27,758 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 11:51:27,759 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 36 transitions. [2022-04-08 11:51:27,795 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 11:51:27,795 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2022-04-08 11:51:27,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-08 11:51:27,796 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:51:27,796 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 11:51:27,815 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 11:51:28,011 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 11:51:28,012 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:51:28,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:51:28,012 INFO L85 PathProgramCache]: Analyzing trace with hash 422434646, now seen corresponding path program 1 times [2022-04-08 11:51:28,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:51:28,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [849759778] [2022-04-08 11:51:28,013 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 11:51:28,013 INFO L85 PathProgramCache]: Analyzing trace with hash 422434646, now seen corresponding path program 2 times [2022-04-08 11:51:28,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:51:28,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912984582] [2022-04-08 11:51:28,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:51:28,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:51:28,034 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:51:28,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2009697471] [2022-04-08 11:51:28,034 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 11:51:28,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:51:28,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:51:28,036 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 11:51:28,037 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-08 11:51:28,069 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-08 11:51:28,069 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:51:28,070 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 11:51:28,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:51:28,079 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:51:28,232 INFO L272 TraceCheckUtils]: 0: Hoare triple {568#true} call ULTIMATE.init(); {568#true} is VALID [2022-04-08 11:51:28,233 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 11:51:28,233 INFO L290 TraceCheckUtils]: 2: Hoare triple {576#(<= ~counter~0 0)} assume true; {576#(<= ~counter~0 0)} is VALID [2022-04-08 11:51:28,234 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {576#(<= ~counter~0 0)} {568#true} #89#return; {576#(<= ~counter~0 0)} is VALID [2022-04-08 11:51:28,234 INFO L272 TraceCheckUtils]: 4: Hoare triple {576#(<= ~counter~0 0)} call #t~ret5 := main(); {576#(<= ~counter~0 0)} is VALID [2022-04-08 11:51:28,235 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 11:51:28,235 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 11:51:28,236 INFO L290 TraceCheckUtils]: 7: Hoare triple {576#(<= ~counter~0 0)} ~cond := #in~cond; {576#(<= ~counter~0 0)} is VALID [2022-04-08 11:51:28,236 INFO L290 TraceCheckUtils]: 8: Hoare triple {576#(<= ~counter~0 0)} assume !(0 == ~cond); {576#(<= ~counter~0 0)} is VALID [2022-04-08 11:51:28,236 INFO L290 TraceCheckUtils]: 9: Hoare triple {576#(<= ~counter~0 0)} assume true; {576#(<= ~counter~0 0)} is VALID [2022-04-08 11:51:28,237 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 11:51:28,237 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 11:51:28,238 INFO L290 TraceCheckUtils]: 12: Hoare triple {576#(<= ~counter~0 0)} ~cond := #in~cond; {576#(<= ~counter~0 0)} is VALID [2022-04-08 11:51:28,238 INFO L290 TraceCheckUtils]: 13: Hoare triple {576#(<= ~counter~0 0)} assume !(0 == ~cond); {576#(<= ~counter~0 0)} is VALID [2022-04-08 11:51:28,239 INFO L290 TraceCheckUtils]: 14: Hoare triple {576#(<= ~counter~0 0)} assume true; {576#(<= ~counter~0 0)} is VALID [2022-04-08 11:51:28,239 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 11:51:28,239 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 11:51:28,240 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 11:51:28,240 INFO L290 TraceCheckUtils]: 18: Hoare triple {625#(<= ~counter~0 1)} assume !!(#t~post3 < 5);havoc #t~post3; {625#(<= ~counter~0 1)} is VALID [2022-04-08 11:51:28,241 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 11:51:28,241 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 11:51:28,241 INFO L290 TraceCheckUtils]: 21: Hoare triple {635#(<= |main_#t~post4| 1)} assume !(#t~post4 < 5);havoc #t~post4; {569#false} is VALID [2022-04-08 11:51:28,242 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 11:51:28,242 INFO L290 TraceCheckUtils]: 23: Hoare triple {569#false} ~cond := #in~cond; {569#false} is VALID [2022-04-08 11:51:28,242 INFO L290 TraceCheckUtils]: 24: Hoare triple {569#false} assume 0 == ~cond; {569#false} is VALID [2022-04-08 11:51:28,242 INFO L290 TraceCheckUtils]: 25: Hoare triple {569#false} assume !false; {569#false} is VALID [2022-04-08 11:51:28,242 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 11:51:28,242 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 11:51:28,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:51:28,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912984582] [2022-04-08 11:51:28,243 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:51:28,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2009697471] [2022-04-08 11:51:28,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2009697471] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:51:28,243 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:51:28,243 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 11:51:28,243 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:51:28,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [849759778] [2022-04-08 11:51:28,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [849759778] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:51:28,244 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:51:28,244 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 11:51:28,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092679960] [2022-04-08 11:51:28,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:51:28,244 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 11:51:28,245 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:51:28,245 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 11:51:28,269 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 11:51:28,269 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 11:51:28,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:51:28,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 11:51:28,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-08 11:51:28,270 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 11:51:30,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:51:30,441 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2022-04-08 11:51:30,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 11:51:30,441 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 11:51:30,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:51:30,441 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 11:51:30,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 48 transitions. [2022-04-08 11:51:30,442 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 11:51:30,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 48 transitions. [2022-04-08 11:51:30,444 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 48 transitions. [2022-04-08 11:51:30,479 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 11:51:30,480 INFO L225 Difference]: With dead ends: 41 [2022-04-08 11:51:30,480 INFO L226 Difference]: Without dead ends: 34 [2022-04-08 11:51:30,481 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 11:51:30,481 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 11:51:30,482 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 11:51:30,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-08 11:51:30,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2022-04-08 11:51:30,495 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:51:30,495 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 11:51:30,496 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 11:51:30,496 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 11:51:30,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:51:30,497 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2022-04-08 11:51:30,497 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2022-04-08 11:51:30,498 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:51:30,498 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:51:30,498 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 11:51:30,498 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 11:51:30,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:51:30,499 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2022-04-08 11:51:30,499 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2022-04-08 11:51:30,500 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:51:30,500 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:51:30,500 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:51:30,500 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:51:30,500 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 11:51:30,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2022-04-08 11:51:30,501 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 40 transitions. Word has length 26 [2022-04-08 11:51:30,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:51:30,501 INFO L478 AbstractCegarLoop]: Abstraction has 33 states and 40 transitions. [2022-04-08 11:51:30,502 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 11:51:30,502 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 40 transitions. [2022-04-08 11:51:30,540 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:51:30,540 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2022-04-08 11:51:30,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-08 11:51:30,542 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:51:30,542 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 11:51:30,560 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 11:51:30,758 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 11:51:30,758 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:51:30,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:51:30,758 INFO L85 PathProgramCache]: Analyzing trace with hash 424222106, now seen corresponding path program 1 times [2022-04-08 11:51:30,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:51:30,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [377641157] [2022-04-08 11:51:30,759 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 11:51:30,759 INFO L85 PathProgramCache]: Analyzing trace with hash 424222106, now seen corresponding path program 2 times [2022-04-08 11:51:30,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:51:30,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357852837] [2022-04-08 11:51:30,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:51:30,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:51:30,775 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:51:30,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1209437967] [2022-04-08 11:51:30,775 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 11:51:30,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:51:30,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:51:30,777 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 11:51:30,778 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-08 11:51:30,817 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-08 11:51:30,817 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:51:30,818 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-08 11:51:30,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:51:30,826 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:51:31,329 INFO L272 TraceCheckUtils]: 0: Hoare triple {866#true} call ULTIMATE.init(); {866#true} is VALID [2022-04-08 11:51:31,329 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 11:51:31,330 INFO L290 TraceCheckUtils]: 2: Hoare triple {866#true} assume true; {866#true} is VALID [2022-04-08 11:51:31,330 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {866#true} {866#true} #89#return; {866#true} is VALID [2022-04-08 11:51:31,330 INFO L272 TraceCheckUtils]: 4: Hoare triple {866#true} call #t~ret5 := main(); {866#true} is VALID [2022-04-08 11:51:31,330 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 11:51:31,330 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 11:51:31,330 INFO L290 TraceCheckUtils]: 7: Hoare triple {866#true} ~cond := #in~cond; {866#true} is VALID [2022-04-08 11:51:31,330 INFO L290 TraceCheckUtils]: 8: Hoare triple {866#true} assume !(0 == ~cond); {866#true} is VALID [2022-04-08 11:51:31,331 INFO L290 TraceCheckUtils]: 9: Hoare triple {866#true} assume true; {866#true} is VALID [2022-04-08 11:51:31,331 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {866#true} {866#true} #81#return; {866#true} is VALID [2022-04-08 11:51:31,331 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 11:51:31,331 INFO L290 TraceCheckUtils]: 12: Hoare triple {866#true} ~cond := #in~cond; {866#true} is VALID [2022-04-08 11:51:31,331 INFO L290 TraceCheckUtils]: 13: Hoare triple {866#true} assume !(0 == ~cond); {866#true} is VALID [2022-04-08 11:51:31,331 INFO L290 TraceCheckUtils]: 14: Hoare triple {866#true} assume true; {866#true} is VALID [2022-04-08 11:51:31,331 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {866#true} {866#true} #83#return; {866#true} is VALID [2022-04-08 11:51:31,333 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 11:51:31,334 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 11:51:31,334 INFO L290 TraceCheckUtils]: 18: Hoare triple {919#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post3 < 5);havoc #t~post3; {919#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:51:31,335 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 11:51:31,336 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 11:51:31,336 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 < 5);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 11:51:31,337 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 11:51:31,337 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 11:51:31,338 INFO L290 TraceCheckUtils]: 24: Hoare triple {943#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {867#false} is VALID [2022-04-08 11:51:31,338 INFO L290 TraceCheckUtils]: 25: Hoare triple {867#false} assume !false; {867#false} is VALID [2022-04-08 11:51:31,338 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 11:51:31,338 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 11:51:31,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:51:31,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357852837] [2022-04-08 11:51:31,339 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:51:31,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1209437967] [2022-04-08 11:51:31,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1209437967] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:51:31,339 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:51:31,339 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 11:51:31,339 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:51:31,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [377641157] [2022-04-08 11:51:31,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [377641157] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:51:31,339 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:51:31,339 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 11:51:31,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679543313] [2022-04-08 11:51:31,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:51:31,340 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 11:51:31,340 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:51:31,340 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 11:51:31,359 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 11:51:31,359 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 11:51:31,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:51:31,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 11:51:31,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-04-08 11:51:31,360 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 11:51:33,519 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-08 11:51:35,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:51:35,725 INFO L93 Difference]: Finished difference Result 50 states and 63 transitions. [2022-04-08 11:51:35,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 11:51:35,726 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 11:51:35,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:51:35,726 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 11:51:35,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 57 transitions. [2022-04-08 11:51:35,727 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 11:51:35,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 57 transitions. [2022-04-08 11:51:35,728 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 57 transitions. [2022-04-08 11:51:35,770 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 11:51:35,771 INFO L225 Difference]: With dead ends: 50 [2022-04-08 11:51:35,771 INFO L226 Difference]: Without dead ends: 46 [2022-04-08 11:51:35,771 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 11:51:35,772 INFO L913 BasicCegarLoop]: 28 mSDtfsCounter, 18 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.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, 48 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-04-08 11:51:35,772 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 104 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 48 Invalid, 1 Unknown, 0 Unchecked, 2.1s Time] [2022-04-08 11:51:35,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-04-08 11:51:35,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 39. [2022-04-08 11:51:35,787 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:51:35,787 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 11:51:35,787 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 11:51:35,788 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 11:51:35,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:51:35,789 INFO L93 Difference]: Finished difference Result 46 states and 55 transitions. [2022-04-08 11:51:35,789 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 55 transitions. [2022-04-08 11:51:35,790 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:51:35,790 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:51:35,790 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 11:51:35,790 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 11:51:35,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:51:35,792 INFO L93 Difference]: Finished difference Result 46 states and 55 transitions. [2022-04-08 11:51:35,792 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 55 transitions. [2022-04-08 11:51:35,792 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:51:35,792 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:51:35,792 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:51:35,792 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:51:35,792 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 11:51:35,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 46 transitions. [2022-04-08 11:51:35,793 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 46 transitions. Word has length 26 [2022-04-08 11:51:35,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:51:35,794 INFO L478 AbstractCegarLoop]: Abstraction has 39 states and 46 transitions. [2022-04-08 11:51:35,794 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 11:51:35,794 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 46 transitions. [2022-04-08 11:51:35,841 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 11:51:35,842 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2022-04-08 11:51:35,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-08 11:51:35,842 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:51:35,842 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 11:51:35,877 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-08 11:51:36,043 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 11:51:36,043 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:51:36,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:51:36,044 INFO L85 PathProgramCache]: Analyzing trace with hash -1733722638, now seen corresponding path program 1 times [2022-04-08 11:51:36,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:51:36,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1103985660] [2022-04-08 11:51:36,044 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 11:51:36,044 INFO L85 PathProgramCache]: Analyzing trace with hash -1733722638, now seen corresponding path program 2 times [2022-04-08 11:51:36,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:51:36,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645462105] [2022-04-08 11:51:36,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:51:36,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:51:36,061 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:51:36,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [629089243] [2022-04-08 11:51:36,062 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 11:51:36,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:51:36,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:51:36,063 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 11:51:36,079 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-08 11:51:36,144 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 11:51:36,144 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:51:36,145 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-08 11:51:36,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:51:36,156 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:51:36,358 INFO L272 TraceCheckUtils]: 0: Hoare triple {1221#true} call ULTIMATE.init(); {1221#true} is VALID [2022-04-08 11:51:36,358 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 11:51:36,359 INFO L290 TraceCheckUtils]: 2: Hoare triple {1229#(<= ~counter~0 0)} assume true; {1229#(<= ~counter~0 0)} is VALID [2022-04-08 11:51:36,359 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1229#(<= ~counter~0 0)} {1221#true} #89#return; {1229#(<= ~counter~0 0)} is VALID [2022-04-08 11:51:36,360 INFO L272 TraceCheckUtils]: 4: Hoare triple {1229#(<= ~counter~0 0)} call #t~ret5 := main(); {1229#(<= ~counter~0 0)} is VALID [2022-04-08 11:51:36,360 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 11:51:36,360 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 11:51:36,362 INFO L290 TraceCheckUtils]: 7: Hoare triple {1229#(<= ~counter~0 0)} ~cond := #in~cond; {1229#(<= ~counter~0 0)} is VALID [2022-04-08 11:51:36,362 INFO L290 TraceCheckUtils]: 8: Hoare triple {1229#(<= ~counter~0 0)} assume !(0 == ~cond); {1229#(<= ~counter~0 0)} is VALID [2022-04-08 11:51:36,367 INFO L290 TraceCheckUtils]: 9: Hoare triple {1229#(<= ~counter~0 0)} assume true; {1229#(<= ~counter~0 0)} is VALID [2022-04-08 11:51:36,375 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 11:51:36,376 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 11:51:36,376 INFO L290 TraceCheckUtils]: 12: Hoare triple {1229#(<= ~counter~0 0)} ~cond := #in~cond; {1229#(<= ~counter~0 0)} is VALID [2022-04-08 11:51:36,377 INFO L290 TraceCheckUtils]: 13: Hoare triple {1229#(<= ~counter~0 0)} assume !(0 == ~cond); {1229#(<= ~counter~0 0)} is VALID [2022-04-08 11:51:36,377 INFO L290 TraceCheckUtils]: 14: Hoare triple {1229#(<= ~counter~0 0)} assume true; {1229#(<= ~counter~0 0)} is VALID [2022-04-08 11:51:36,377 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 11:51:36,378 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 11:51:36,378 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 11:51:36,379 INFO L290 TraceCheckUtils]: 18: Hoare triple {1278#(<= ~counter~0 1)} assume !!(#t~post3 < 5);havoc #t~post3; {1278#(<= ~counter~0 1)} is VALID [2022-04-08 11:51:36,379 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 11:51:36,380 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 11:51:36,380 INFO L290 TraceCheckUtils]: 21: Hoare triple {1288#(<= ~counter~0 2)} assume !!(#t~post4 < 5);havoc #t~post4; {1288#(<= ~counter~0 2)} is VALID [2022-04-08 11:51:36,380 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 11:51:36,381 INFO L290 TraceCheckUtils]: 23: Hoare triple {1288#(<= ~counter~0 2)} ~cond := #in~cond; {1288#(<= ~counter~0 2)} is VALID [2022-04-08 11:51:36,381 INFO L290 TraceCheckUtils]: 24: Hoare triple {1288#(<= ~counter~0 2)} assume !(0 == ~cond); {1288#(<= ~counter~0 2)} is VALID [2022-04-08 11:51:36,381 INFO L290 TraceCheckUtils]: 25: Hoare triple {1288#(<= ~counter~0 2)} assume true; {1288#(<= ~counter~0 2)} is VALID [2022-04-08 11:51:36,382 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 11:51:36,382 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 11:51:36,382 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 11:51:36,383 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 11:51:36,383 INFO L290 TraceCheckUtils]: 30: Hoare triple {1316#(<= |main_#t~post4| 2)} assume !(#t~post4 < 5);havoc #t~post4; {1222#false} is VALID [2022-04-08 11:51:36,383 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 11:51:36,384 INFO L290 TraceCheckUtils]: 32: Hoare triple {1222#false} ~cond := #in~cond; {1222#false} is VALID [2022-04-08 11:51:36,384 INFO L290 TraceCheckUtils]: 33: Hoare triple {1222#false} assume 0 == ~cond; {1222#false} is VALID [2022-04-08 11:51:36,384 INFO L290 TraceCheckUtils]: 34: Hoare triple {1222#false} assume !false; {1222#false} is VALID [2022-04-08 11:51:36,384 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 11:51:36,384 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 11:51:36,552 INFO L290 TraceCheckUtils]: 34: Hoare triple {1222#false} assume !false; {1222#false} is VALID [2022-04-08 11:51:36,553 INFO L290 TraceCheckUtils]: 33: Hoare triple {1222#false} assume 0 == ~cond; {1222#false} is VALID [2022-04-08 11:51:36,553 INFO L290 TraceCheckUtils]: 32: Hoare triple {1222#false} ~cond := #in~cond; {1222#false} is VALID [2022-04-08 11:51:36,553 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 11:51:36,553 INFO L290 TraceCheckUtils]: 30: Hoare triple {1344#(< |main_#t~post4| 5)} assume !(#t~post4 < 5);havoc #t~post4; {1222#false} is VALID [2022-04-08 11:51:36,554 INFO L290 TraceCheckUtils]: 29: Hoare triple {1348#(< ~counter~0 5)} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {1344#(< |main_#t~post4| 5)} is VALID [2022-04-08 11:51:36,555 INFO L290 TraceCheckUtils]: 28: Hoare triple {1348#(< ~counter~0 5)} assume ~r~0 % 4294967296 >= ~b~0 % 4294967296;~q~0 := 1 + ~q~0;~r~0 := ~r~0 - ~b~0; {1348#(< ~counter~0 5)} is VALID [2022-04-08 11:51:36,555 INFO L290 TraceCheckUtils]: 27: Hoare triple {1348#(< ~counter~0 5)} 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 5)} is VALID [2022-04-08 11:51:36,556 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1221#true} {1348#(< ~counter~0 5)} #85#return; {1348#(< ~counter~0 5)} is VALID [2022-04-08 11:51:36,556 INFO L290 TraceCheckUtils]: 25: Hoare triple {1221#true} assume true; {1221#true} is VALID [2022-04-08 11:51:36,556 INFO L290 TraceCheckUtils]: 24: Hoare triple {1221#true} assume !(0 == ~cond); {1221#true} is VALID [2022-04-08 11:51:36,556 INFO L290 TraceCheckUtils]: 23: Hoare triple {1221#true} ~cond := #in~cond; {1221#true} is VALID [2022-04-08 11:51:36,556 INFO L272 TraceCheckUtils]: 22: Hoare triple {1348#(< ~counter~0 5)} 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 11:51:36,557 INFO L290 TraceCheckUtils]: 21: Hoare triple {1348#(< ~counter~0 5)} assume !!(#t~post4 < 5);havoc #t~post4; {1348#(< ~counter~0 5)} is VALID [2022-04-08 11:51:36,557 INFO L290 TraceCheckUtils]: 20: Hoare triple {1376#(< ~counter~0 4)} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {1348#(< ~counter~0 5)} is VALID [2022-04-08 11:51:36,557 INFO L290 TraceCheckUtils]: 19: Hoare triple {1376#(< ~counter~0 4)} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {1376#(< ~counter~0 4)} is VALID [2022-04-08 11:51:36,558 INFO L290 TraceCheckUtils]: 18: Hoare triple {1376#(< ~counter~0 4)} assume !!(#t~post3 < 5);havoc #t~post3; {1376#(< ~counter~0 4)} is VALID [2022-04-08 11:51:36,558 INFO L290 TraceCheckUtils]: 17: Hoare triple {1288#(<= ~counter~0 2)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {1376#(< ~counter~0 4)} is VALID [2022-04-08 11:51:36,558 INFO L290 TraceCheckUtils]: 16: Hoare triple {1288#(<= ~counter~0 2)} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {1288#(<= ~counter~0 2)} is VALID [2022-04-08 11:51:36,559 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1221#true} {1288#(<= ~counter~0 2)} #83#return; {1288#(<= ~counter~0 2)} is VALID [2022-04-08 11:51:36,559 INFO L290 TraceCheckUtils]: 14: Hoare triple {1221#true} assume true; {1221#true} is VALID [2022-04-08 11:51:36,559 INFO L290 TraceCheckUtils]: 13: Hoare triple {1221#true} assume !(0 == ~cond); {1221#true} is VALID [2022-04-08 11:51:36,559 INFO L290 TraceCheckUtils]: 12: Hoare triple {1221#true} ~cond := #in~cond; {1221#true} is VALID [2022-04-08 11:51:36,559 INFO L272 TraceCheckUtils]: 11: Hoare triple {1288#(<= ~counter~0 2)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {1221#true} is VALID [2022-04-08 11:51:36,560 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1221#true} {1288#(<= ~counter~0 2)} #81#return; {1288#(<= ~counter~0 2)} is VALID [2022-04-08 11:51:36,560 INFO L290 TraceCheckUtils]: 9: Hoare triple {1221#true} assume true; {1221#true} is VALID [2022-04-08 11:51:36,561 INFO L290 TraceCheckUtils]: 8: Hoare triple {1221#true} assume !(0 == ~cond); {1221#true} is VALID [2022-04-08 11:51:36,561 INFO L290 TraceCheckUtils]: 7: Hoare triple {1221#true} ~cond := #in~cond; {1221#true} is VALID [2022-04-08 11:51:36,561 INFO L272 TraceCheckUtils]: 6: Hoare triple {1288#(<= ~counter~0 2)} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {1221#true} is VALID [2022-04-08 11:51:36,561 INFO L290 TraceCheckUtils]: 5: Hoare triple {1288#(<= ~counter~0 2)} 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; {1288#(<= ~counter~0 2)} is VALID [2022-04-08 11:51:36,562 INFO L272 TraceCheckUtils]: 4: Hoare triple {1288#(<= ~counter~0 2)} call #t~ret5 := main(); {1288#(<= ~counter~0 2)} is VALID [2022-04-08 11:51:36,562 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1288#(<= ~counter~0 2)} {1221#true} #89#return; {1288#(<= ~counter~0 2)} is VALID [2022-04-08 11:51:36,562 INFO L290 TraceCheckUtils]: 2: Hoare triple {1288#(<= ~counter~0 2)} assume true; {1288#(<= ~counter~0 2)} is VALID [2022-04-08 11:51:36,563 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; {1288#(<= ~counter~0 2)} is VALID [2022-04-08 11:51:36,563 INFO L272 TraceCheckUtils]: 0: Hoare triple {1221#true} call ULTIMATE.init(); {1221#true} is VALID [2022-04-08 11:51:36,564 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 11:51:36,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:51:36,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645462105] [2022-04-08 11:51:36,565 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:51:36,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [629089243] [2022-04-08 11:51:36,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [629089243] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 11:51:36,566 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 11:51:36,566 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2022-04-08 11:51:36,566 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:51:36,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1103985660] [2022-04-08 11:51:36,566 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1103985660] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:51:36,566 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:51:36,566 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 11:51:36,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657933635] [2022-04-08 11:51:36,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:51:36,567 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 11:51:36,567 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:51:36,567 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 11:51:36,586 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:51:36,586 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 11:51:36,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:51:36,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 11:51:36,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-04-08 11:51:36,586 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 11:51:36,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:51:36,744 INFO L93 Difference]: Finished difference Result 64 states and 75 transitions. [2022-04-08 11:51:36,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 11:51:36,744 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 11:51:36,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:51:36,744 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 11:51:36,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 63 transitions. [2022-04-08 11:51:36,746 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 11:51:36,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 63 transitions. [2022-04-08 11:51:36,747 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 63 transitions. [2022-04-08 11:51:36,788 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 11:51:36,789 INFO L225 Difference]: With dead ends: 64 [2022-04-08 11:51:36,789 INFO L226 Difference]: Without dead ends: 57 [2022-04-08 11:51:36,789 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-08 11:51:36,790 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 11:51:36,790 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 11:51:36,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-04-08 11:51:36,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 51. [2022-04-08 11:51:36,825 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:51:36,826 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 11:51:36,826 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 11:51:36,826 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 11:51:36,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:51:36,828 INFO L93 Difference]: Finished difference Result 57 states and 68 transitions. [2022-04-08 11:51:36,828 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 68 transitions. [2022-04-08 11:51:36,828 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:51:36,828 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:51:36,828 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 11:51:36,829 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 11:51:36,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:51:36,830 INFO L93 Difference]: Finished difference Result 57 states and 68 transitions. [2022-04-08 11:51:36,830 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 68 transitions. [2022-04-08 11:51:36,830 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:51:36,830 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:51:36,830 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:51:36,831 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:51:36,831 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 11:51:36,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 60 transitions. [2022-04-08 11:51:36,832 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 60 transitions. Word has length 35 [2022-04-08 11:51:36,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:51:36,832 INFO L478 AbstractCegarLoop]: Abstraction has 51 states and 60 transitions. [2022-04-08 11:51:36,832 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 11:51:36,833 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 51 states and 60 transitions. [2022-04-08 11:51:36,893 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:51:36,893 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 60 transitions. [2022-04-08 11:51:36,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-08 11:51:36,894 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:51:36,894 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 11:51:36,912 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-08 11:51:37,103 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 11:51:37,103 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:51:37,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:51:37,104 INFO L85 PathProgramCache]: Analyzing trace with hash -1731935178, now seen corresponding path program 1 times [2022-04-08 11:51:37,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:51:37,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [716806891] [2022-04-08 11:51:37,104 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 11:51:37,104 INFO L85 PathProgramCache]: Analyzing trace with hash -1731935178, now seen corresponding path program 2 times [2022-04-08 11:51:37,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:51:37,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940154399] [2022-04-08 11:51:37,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:51:37,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:51:37,126 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:51:37,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [926830467] [2022-04-08 11:51:37,126 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 11:51:37,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:51:37,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:51:37,130 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 11:51:37,131 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-08 11:51:37,167 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 11:51:37,168 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:51:37,168 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-08 11:51:37,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:51:37,175 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:51:37,246 INFO L272 TraceCheckUtils]: 0: Hoare triple {1785#true} call ULTIMATE.init(); {1785#true} is VALID [2022-04-08 11:51:37,247 INFO L290 TraceCheckUtils]: 1: Hoare triple {1785#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; {1785#true} is VALID [2022-04-08 11:51:37,247 INFO L290 TraceCheckUtils]: 2: Hoare triple {1785#true} assume true; {1785#true} is VALID [2022-04-08 11:51:37,247 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1785#true} {1785#true} #89#return; {1785#true} is VALID [2022-04-08 11:51:37,247 INFO L272 TraceCheckUtils]: 4: Hoare triple {1785#true} call #t~ret5 := main(); {1785#true} is VALID [2022-04-08 11:51:37,247 INFO L290 TraceCheckUtils]: 5: Hoare triple {1785#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; {1785#true} is VALID [2022-04-08 11:51:37,247 INFO L272 TraceCheckUtils]: 6: Hoare triple {1785#true} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {1785#true} is VALID [2022-04-08 11:51:37,247 INFO L290 TraceCheckUtils]: 7: Hoare triple {1785#true} ~cond := #in~cond; {1785#true} is VALID [2022-04-08 11:51:37,247 INFO L290 TraceCheckUtils]: 8: Hoare triple {1785#true} assume !(0 == ~cond); {1785#true} is VALID [2022-04-08 11:51:37,247 INFO L290 TraceCheckUtils]: 9: Hoare triple {1785#true} assume true; {1785#true} is VALID [2022-04-08 11:51:37,248 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1785#true} {1785#true} #81#return; {1785#true} is VALID [2022-04-08 11:51:37,248 INFO L272 TraceCheckUtils]: 11: Hoare triple {1785#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {1785#true} is VALID [2022-04-08 11:51:37,248 INFO L290 TraceCheckUtils]: 12: Hoare triple {1785#true} ~cond := #in~cond; {1785#true} is VALID [2022-04-08 11:51:37,248 INFO L290 TraceCheckUtils]: 13: Hoare triple {1785#true} assume !(0 == ~cond); {1785#true} is VALID [2022-04-08 11:51:37,248 INFO L290 TraceCheckUtils]: 14: Hoare triple {1785#true} assume true; {1785#true} is VALID [2022-04-08 11:51:37,248 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1785#true} {1785#true} #83#return; {1785#true} is VALID [2022-04-08 11:51:37,250 INFO L290 TraceCheckUtils]: 16: Hoare triple {1785#true} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {1838#(= main_~B~0 main_~b~0)} is VALID [2022-04-08 11:51:37,250 INFO L290 TraceCheckUtils]: 17: Hoare triple {1838#(= main_~B~0 main_~b~0)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {1838#(= main_~B~0 main_~b~0)} is VALID [2022-04-08 11:51:37,253 INFO L290 TraceCheckUtils]: 18: Hoare triple {1838#(= main_~B~0 main_~b~0)} assume !!(#t~post3 < 5);havoc #t~post3; {1838#(= main_~B~0 main_~b~0)} is VALID [2022-04-08 11:51:37,253 INFO L290 TraceCheckUtils]: 19: Hoare triple {1838#(= main_~B~0 main_~b~0)} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {1838#(= main_~B~0 main_~b~0)} is VALID [2022-04-08 11:51:37,254 INFO L290 TraceCheckUtils]: 20: Hoare triple {1838#(= main_~B~0 main_~b~0)} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {1838#(= main_~B~0 main_~b~0)} is VALID [2022-04-08 11:51:37,254 INFO L290 TraceCheckUtils]: 21: Hoare triple {1838#(= main_~B~0 main_~b~0)} assume !!(#t~post4 < 5);havoc #t~post4; {1838#(= main_~B~0 main_~b~0)} is VALID [2022-04-08 11:51:37,254 INFO L272 TraceCheckUtils]: 22: Hoare triple {1838#(= main_~B~0 main_~b~0)} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1785#true} is VALID [2022-04-08 11:51:37,254 INFO L290 TraceCheckUtils]: 23: Hoare triple {1785#true} ~cond := #in~cond; {1785#true} is VALID [2022-04-08 11:51:37,254 INFO L290 TraceCheckUtils]: 24: Hoare triple {1785#true} assume !(0 == ~cond); {1785#true} is VALID [2022-04-08 11:51:37,254 INFO L290 TraceCheckUtils]: 25: Hoare triple {1785#true} assume true; {1785#true} is VALID [2022-04-08 11:51:37,255 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1785#true} {1838#(= main_~B~0 main_~b~0)} #85#return; {1838#(= main_~B~0 main_~b~0)} is VALID [2022-04-08 11:51:37,255 INFO L290 TraceCheckUtils]: 27: Hoare triple {1838#(= 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); {1786#false} is VALID [2022-04-08 11:51:37,256 INFO L290 TraceCheckUtils]: 28: Hoare triple {1786#false} assume ~r~0 % 4294967296 >= ~b~0 % 4294967296;~q~0 := 1 + ~q~0;~r~0 := ~r~0 - ~b~0; {1786#false} is VALID [2022-04-08 11:51:37,256 INFO L290 TraceCheckUtils]: 29: Hoare triple {1786#false} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {1786#false} is VALID [2022-04-08 11:51:37,256 INFO L290 TraceCheckUtils]: 30: Hoare triple {1786#false} assume !!(#t~post4 < 5);havoc #t~post4; {1786#false} is VALID [2022-04-08 11:51:37,256 INFO L272 TraceCheckUtils]: 31: Hoare triple {1786#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1786#false} is VALID [2022-04-08 11:51:37,256 INFO L290 TraceCheckUtils]: 32: Hoare triple {1786#false} ~cond := #in~cond; {1786#false} is VALID [2022-04-08 11:51:37,256 INFO L290 TraceCheckUtils]: 33: Hoare triple {1786#false} assume 0 == ~cond; {1786#false} is VALID [2022-04-08 11:51:37,256 INFO L290 TraceCheckUtils]: 34: Hoare triple {1786#false} assume !false; {1786#false} is VALID [2022-04-08 11:51:37,256 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 11:51:37,256 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 11:51:37,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:51:37,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940154399] [2022-04-08 11:51:37,257 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:51:37,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [926830467] [2022-04-08 11:51:37,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [926830467] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:51:37,257 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:51:37,257 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 11:51:37,257 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:51:37,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [716806891] [2022-04-08 11:51:37,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [716806891] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:51:37,257 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:51:37,257 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 11:51:37,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946624789] [2022-04-08 11:51:37,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:51:37,258 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 11:51:37,258 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:51:37,258 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 11:51:37,283 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:51:37,283 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-08 11:51:37,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:51:37,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-08 11:51:37,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 11:51:37,284 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 11:51:37,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:51:37,371 INFO L93 Difference]: Finished difference Result 72 states and 85 transitions. [2022-04-08 11:51:37,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-08 11:51:37,372 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 11:51:37,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:51:37,372 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 11:51:37,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 58 transitions. [2022-04-08 11:51:37,373 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 11:51:37,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 58 transitions. [2022-04-08 11:51:37,374 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 58 transitions. [2022-04-08 11:51:37,412 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 11:51:37,413 INFO L225 Difference]: With dead ends: 72 [2022-04-08 11:51:37,413 INFO L226 Difference]: Without dead ends: 40 [2022-04-08 11:51:37,414 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 11:51:37,414 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 11:51:37,414 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 11:51:37,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-04-08 11:51:37,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2022-04-08 11:51:37,433 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:51:37,433 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 11:51:37,433 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 11:51:37,433 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 11:51:37,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:51:37,434 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2022-04-08 11:51:37,434 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 47 transitions. [2022-04-08 11:51:37,434 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:51:37,434 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:51:37,435 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 11:51:37,435 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 11:51:37,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:51:37,436 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2022-04-08 11:51:37,436 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 47 transitions. [2022-04-08 11:51:37,436 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:51:37,436 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:51:37,436 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:51:37,436 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:51:37,436 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 11:51:37,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 47 transitions. [2022-04-08 11:51:37,437 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 47 transitions. Word has length 35 [2022-04-08 11:51:37,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:51:37,437 INFO L478 AbstractCegarLoop]: Abstraction has 40 states and 47 transitions. [2022-04-08 11:51:37,438 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 11:51:37,438 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 47 transitions. [2022-04-08 11:51:37,480 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:51:37,481 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 47 transitions. [2022-04-08 11:51:37,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-08 11:51:37,481 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:51:37,481 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 11:51:37,500 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-08 11:51:37,697 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 11:51:37,697 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:51:37,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:51:37,698 INFO L85 PathProgramCache]: Analyzing trace with hash -1874551443, now seen corresponding path program 1 times [2022-04-08 11:51:37,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:51:37,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1021739249] [2022-04-08 11:51:37,698 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 11:51:37,698 INFO L85 PathProgramCache]: Analyzing trace with hash -1874551443, now seen corresponding path program 2 times [2022-04-08 11:51:37,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:51:37,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154044242] [2022-04-08 11:51:37,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:51:37,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:51:37,710 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:51:37,711 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1507547583] [2022-04-08 11:51:37,711 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 11:51:37,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:51:37,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:51:37,715 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 11:51:37,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-08 11:51:37,752 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 11:51:37,752 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:51:37,753 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 11:51:37,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:51:37,761 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:51:37,893 INFO L272 TraceCheckUtils]: 0: Hoare triple {2196#true} call ULTIMATE.init(); {2196#true} is VALID [2022-04-08 11:51:37,894 INFO L290 TraceCheckUtils]: 1: Hoare triple {2196#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; {2204#(<= ~counter~0 0)} is VALID [2022-04-08 11:51:37,894 INFO L290 TraceCheckUtils]: 2: Hoare triple {2204#(<= ~counter~0 0)} assume true; {2204#(<= ~counter~0 0)} is VALID [2022-04-08 11:51:37,894 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2204#(<= ~counter~0 0)} {2196#true} #89#return; {2204#(<= ~counter~0 0)} is VALID [2022-04-08 11:51:37,895 INFO L272 TraceCheckUtils]: 4: Hoare triple {2204#(<= ~counter~0 0)} call #t~ret5 := main(); {2204#(<= ~counter~0 0)} is VALID [2022-04-08 11:51:37,895 INFO L290 TraceCheckUtils]: 5: Hoare triple {2204#(<= ~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; {2204#(<= ~counter~0 0)} is VALID [2022-04-08 11:51:37,895 INFO L272 TraceCheckUtils]: 6: Hoare triple {2204#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {2204#(<= ~counter~0 0)} is VALID [2022-04-08 11:51:37,896 INFO L290 TraceCheckUtils]: 7: Hoare triple {2204#(<= ~counter~0 0)} ~cond := #in~cond; {2204#(<= ~counter~0 0)} is VALID [2022-04-08 11:51:37,896 INFO L290 TraceCheckUtils]: 8: Hoare triple {2204#(<= ~counter~0 0)} assume !(0 == ~cond); {2204#(<= ~counter~0 0)} is VALID [2022-04-08 11:51:37,896 INFO L290 TraceCheckUtils]: 9: Hoare triple {2204#(<= ~counter~0 0)} assume true; {2204#(<= ~counter~0 0)} is VALID [2022-04-08 11:51:37,897 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2204#(<= ~counter~0 0)} {2204#(<= ~counter~0 0)} #81#return; {2204#(<= ~counter~0 0)} is VALID [2022-04-08 11:51:37,897 INFO L272 TraceCheckUtils]: 11: Hoare triple {2204#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {2204#(<= ~counter~0 0)} is VALID [2022-04-08 11:51:37,897 INFO L290 TraceCheckUtils]: 12: Hoare triple {2204#(<= ~counter~0 0)} ~cond := #in~cond; {2204#(<= ~counter~0 0)} is VALID [2022-04-08 11:51:37,898 INFO L290 TraceCheckUtils]: 13: Hoare triple {2204#(<= ~counter~0 0)} assume !(0 == ~cond); {2204#(<= ~counter~0 0)} is VALID [2022-04-08 11:51:37,898 INFO L290 TraceCheckUtils]: 14: Hoare triple {2204#(<= ~counter~0 0)} assume true; {2204#(<= ~counter~0 0)} is VALID [2022-04-08 11:51:37,899 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2204#(<= ~counter~0 0)} {2204#(<= ~counter~0 0)} #83#return; {2204#(<= ~counter~0 0)} is VALID [2022-04-08 11:51:37,899 INFO L290 TraceCheckUtils]: 16: Hoare triple {2204#(<= ~counter~0 0)} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {2204#(<= ~counter~0 0)} is VALID [2022-04-08 11:51:37,899 INFO L290 TraceCheckUtils]: 17: Hoare triple {2204#(<= ~counter~0 0)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {2253#(<= ~counter~0 1)} is VALID [2022-04-08 11:51:37,900 INFO L290 TraceCheckUtils]: 18: Hoare triple {2253#(<= ~counter~0 1)} assume !!(#t~post3 < 5);havoc #t~post3; {2253#(<= ~counter~0 1)} is VALID [2022-04-08 11:51:37,900 INFO L290 TraceCheckUtils]: 19: Hoare triple {2253#(<= ~counter~0 1)} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {2253#(<= ~counter~0 1)} is VALID [2022-04-08 11:51:37,900 INFO L290 TraceCheckUtils]: 20: Hoare triple {2253#(<= ~counter~0 1)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {2263#(<= |main_#t~post3| 1)} is VALID [2022-04-08 11:51:37,901 INFO L290 TraceCheckUtils]: 21: Hoare triple {2263#(<= |main_#t~post3| 1)} assume !(#t~post3 < 5);havoc #t~post3; {2197#false} is VALID [2022-04-08 11:51:37,901 INFO L290 TraceCheckUtils]: 22: Hoare triple {2197#false} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {2197#false} is VALID [2022-04-08 11:51:37,901 INFO L290 TraceCheckUtils]: 23: Hoare triple {2197#false} assume !!(#t~post4 < 5);havoc #t~post4; {2197#false} is VALID [2022-04-08 11:51:37,901 INFO L272 TraceCheckUtils]: 24: Hoare triple {2197#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {2197#false} is VALID [2022-04-08 11:51:37,901 INFO L290 TraceCheckUtils]: 25: Hoare triple {2197#false} ~cond := #in~cond; {2197#false} is VALID [2022-04-08 11:51:37,901 INFO L290 TraceCheckUtils]: 26: Hoare triple {2197#false} assume !(0 == ~cond); {2197#false} is VALID [2022-04-08 11:51:37,901 INFO L290 TraceCheckUtils]: 27: Hoare triple {2197#false} assume true; {2197#false} is VALID [2022-04-08 11:51:37,901 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2197#false} {2197#false} #85#return; {2197#false} is VALID [2022-04-08 11:51:37,902 INFO L290 TraceCheckUtils]: 29: Hoare triple {2197#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); {2197#false} is VALID [2022-04-08 11:51:37,904 INFO L290 TraceCheckUtils]: 30: Hoare triple {2197#false} assume ~r~0 % 4294967296 >= ~b~0 % 4294967296;~q~0 := 1 + ~q~0;~r~0 := ~r~0 - ~b~0; {2197#false} is VALID [2022-04-08 11:51:37,907 INFO L290 TraceCheckUtils]: 31: Hoare triple {2197#false} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {2197#false} is VALID [2022-04-08 11:51:37,912 INFO L290 TraceCheckUtils]: 32: Hoare triple {2197#false} assume !(#t~post4 < 5);havoc #t~post4; {2197#false} is VALID [2022-04-08 11:51:37,912 INFO L272 TraceCheckUtils]: 33: Hoare triple {2197#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {2197#false} is VALID [2022-04-08 11:51:37,912 INFO L290 TraceCheckUtils]: 34: Hoare triple {2197#false} ~cond := #in~cond; {2197#false} is VALID [2022-04-08 11:51:37,912 INFO L290 TraceCheckUtils]: 35: Hoare triple {2197#false} assume 0 == ~cond; {2197#false} is VALID [2022-04-08 11:51:37,912 INFO L290 TraceCheckUtils]: 36: Hoare triple {2197#false} assume !false; {2197#false} is VALID [2022-04-08 11:51:37,912 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 11:51:37,912 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 11:51:38,075 INFO L290 TraceCheckUtils]: 36: Hoare triple {2197#false} assume !false; {2197#false} is VALID [2022-04-08 11:51:38,075 INFO L290 TraceCheckUtils]: 35: Hoare triple {2197#false} assume 0 == ~cond; {2197#false} is VALID [2022-04-08 11:51:38,077 INFO L290 TraceCheckUtils]: 34: Hoare triple {2197#false} ~cond := #in~cond; {2197#false} is VALID [2022-04-08 11:51:38,077 INFO L272 TraceCheckUtils]: 33: Hoare triple {2197#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {2197#false} is VALID [2022-04-08 11:51:38,077 INFO L290 TraceCheckUtils]: 32: Hoare triple {2197#false} assume !(#t~post4 < 5);havoc #t~post4; {2197#false} is VALID [2022-04-08 11:51:38,077 INFO L290 TraceCheckUtils]: 31: Hoare triple {2197#false} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {2197#false} is VALID [2022-04-08 11:51:38,078 INFO L290 TraceCheckUtils]: 30: Hoare triple {2197#false} assume ~r~0 % 4294967296 >= ~b~0 % 4294967296;~q~0 := 1 + ~q~0;~r~0 := ~r~0 - ~b~0; {2197#false} is VALID [2022-04-08 11:51:38,078 INFO L290 TraceCheckUtils]: 29: Hoare triple {2197#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); {2197#false} is VALID [2022-04-08 11:51:38,078 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2196#true} {2197#false} #85#return; {2197#false} is VALID [2022-04-08 11:51:38,078 INFO L290 TraceCheckUtils]: 27: Hoare triple {2196#true} assume true; {2196#true} is VALID [2022-04-08 11:51:38,078 INFO L290 TraceCheckUtils]: 26: Hoare triple {2196#true} assume !(0 == ~cond); {2196#true} is VALID [2022-04-08 11:51:38,078 INFO L290 TraceCheckUtils]: 25: Hoare triple {2196#true} ~cond := #in~cond; {2196#true} is VALID [2022-04-08 11:51:38,078 INFO L272 TraceCheckUtils]: 24: Hoare triple {2197#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {2196#true} is VALID [2022-04-08 11:51:38,078 INFO L290 TraceCheckUtils]: 23: Hoare triple {2197#false} assume !!(#t~post4 < 5);havoc #t~post4; {2197#false} is VALID [2022-04-08 11:51:38,078 INFO L290 TraceCheckUtils]: 22: Hoare triple {2197#false} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {2197#false} is VALID [2022-04-08 11:51:38,087 INFO L290 TraceCheckUtils]: 21: Hoare triple {2357#(< |main_#t~post3| 5)} assume !(#t~post3 < 5);havoc #t~post3; {2197#false} is VALID [2022-04-08 11:51:38,089 INFO L290 TraceCheckUtils]: 20: Hoare triple {2361#(< ~counter~0 5)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {2357#(< |main_#t~post3| 5)} is VALID [2022-04-08 11:51:38,089 INFO L290 TraceCheckUtils]: 19: Hoare triple {2361#(< ~counter~0 5)} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {2361#(< ~counter~0 5)} is VALID [2022-04-08 11:51:38,089 INFO L290 TraceCheckUtils]: 18: Hoare triple {2361#(< ~counter~0 5)} assume !!(#t~post3 < 5);havoc #t~post3; {2361#(< ~counter~0 5)} is VALID [2022-04-08 11:51:38,090 INFO L290 TraceCheckUtils]: 17: Hoare triple {2371#(< ~counter~0 4)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {2361#(< ~counter~0 5)} is VALID [2022-04-08 11:51:38,090 INFO L290 TraceCheckUtils]: 16: Hoare triple {2371#(< ~counter~0 4)} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {2371#(< ~counter~0 4)} is VALID [2022-04-08 11:51:38,091 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2196#true} {2371#(< ~counter~0 4)} #83#return; {2371#(< ~counter~0 4)} is VALID [2022-04-08 11:51:38,091 INFO L290 TraceCheckUtils]: 14: Hoare triple {2196#true} assume true; {2196#true} is VALID [2022-04-08 11:51:38,091 INFO L290 TraceCheckUtils]: 13: Hoare triple {2196#true} assume !(0 == ~cond); {2196#true} is VALID [2022-04-08 11:51:38,091 INFO L290 TraceCheckUtils]: 12: Hoare triple {2196#true} ~cond := #in~cond; {2196#true} is VALID [2022-04-08 11:51:38,091 INFO L272 TraceCheckUtils]: 11: Hoare triple {2371#(< ~counter~0 4)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {2196#true} is VALID [2022-04-08 11:51:38,092 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2196#true} {2371#(< ~counter~0 4)} #81#return; {2371#(< ~counter~0 4)} is VALID [2022-04-08 11:51:38,092 INFO L290 TraceCheckUtils]: 9: Hoare triple {2196#true} assume true; {2196#true} is VALID [2022-04-08 11:51:38,092 INFO L290 TraceCheckUtils]: 8: Hoare triple {2196#true} assume !(0 == ~cond); {2196#true} is VALID [2022-04-08 11:51:38,092 INFO L290 TraceCheckUtils]: 7: Hoare triple {2196#true} ~cond := #in~cond; {2196#true} is VALID [2022-04-08 11:51:38,092 INFO L272 TraceCheckUtils]: 6: Hoare triple {2371#(< ~counter~0 4)} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {2196#true} is VALID [2022-04-08 11:51:38,092 INFO L290 TraceCheckUtils]: 5: Hoare triple {2371#(< ~counter~0 4)} 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; {2371#(< ~counter~0 4)} is VALID [2022-04-08 11:51:38,093 INFO L272 TraceCheckUtils]: 4: Hoare triple {2371#(< ~counter~0 4)} call #t~ret5 := main(); {2371#(< ~counter~0 4)} is VALID [2022-04-08 11:51:38,093 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2371#(< ~counter~0 4)} {2196#true} #89#return; {2371#(< ~counter~0 4)} is VALID [2022-04-08 11:51:38,093 INFO L290 TraceCheckUtils]: 2: Hoare triple {2371#(< ~counter~0 4)} assume true; {2371#(< ~counter~0 4)} is VALID [2022-04-08 11:51:38,094 INFO L290 TraceCheckUtils]: 1: Hoare triple {2196#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; {2371#(< ~counter~0 4)} is VALID [2022-04-08 11:51:38,094 INFO L272 TraceCheckUtils]: 0: Hoare triple {2196#true} call ULTIMATE.init(); {2196#true} is VALID [2022-04-08 11:51:38,094 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 11:51:38,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:51:38,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154044242] [2022-04-08 11:51:38,095 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:51:38,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1507547583] [2022-04-08 11:51:38,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1507547583] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 11:51:38,095 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 11:51:38,095 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-08 11:51:38,095 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:51:38,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1021739249] [2022-04-08 11:51:38,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1021739249] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:51:38,095 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:51:38,095 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 11:51:38,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523948509] [2022-04-08 11:51:38,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:51:38,096 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 11:51:38,096 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:51:38,096 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 11:51:38,127 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:51:38,127 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 11:51:38,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:51:38,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 11:51:38,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-08 11:51:38,128 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 11:51:38,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:51:38,237 INFO L93 Difference]: Finished difference Result 63 states and 75 transitions. [2022-04-08 11:51:38,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 11:51:38,237 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 11:51:38,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:51:38,237 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 11:51:38,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 55 transitions. [2022-04-08 11:51:38,238 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 11:51:38,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 55 transitions. [2022-04-08 11:51:38,239 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 55 transitions. [2022-04-08 11:51:38,272 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 11:51:38,273 INFO L225 Difference]: With dead ends: 63 [2022-04-08 11:51:38,273 INFO L226 Difference]: Without dead ends: 42 [2022-04-08 11:51:38,273 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 11:51:38,274 INFO L913 BasicCegarLoop]: 32 mSDtfsCounter, 6 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 99 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 11:51:38,274 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 99 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 11:51:38,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-04-08 11:51:38,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2022-04-08 11:51:38,301 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:51:38,301 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 11:51:38,301 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 11:51:38,301 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 11:51:38,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:51:38,302 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2022-04-08 11:51:38,302 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2022-04-08 11:51:38,302 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:51:38,303 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:51:38,303 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 11:51:38,303 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 11:51:38,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:51:38,304 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2022-04-08 11:51:38,304 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2022-04-08 11:51:38,304 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:51:38,304 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:51:38,304 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:51:38,304 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:51:38,304 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 11:51:38,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 49 transitions. [2022-04-08 11:51:38,305 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 49 transitions. Word has length 37 [2022-04-08 11:51:38,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:51:38,305 INFO L478 AbstractCegarLoop]: Abstraction has 42 states and 49 transitions. [2022-04-08 11:51:38,306 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 11:51:38,306 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 49 transitions. [2022-04-08 11:51:38,348 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 11:51:38,348 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2022-04-08 11:51:38,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-08 11:51:38,349 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:51:38,349 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 11:51:38,367 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 11:51:38,559 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 11:51:38,559 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:51:38,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:51:38,560 INFO L85 PathProgramCache]: Analyzing trace with hash 815990494, now seen corresponding path program 1 times [2022-04-08 11:51:38,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:51:38,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [516155223] [2022-04-08 11:51:38,560 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 11:51:38,560 INFO L85 PathProgramCache]: Analyzing trace with hash 815990494, now seen corresponding path program 2 times [2022-04-08 11:51:38,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:51:38,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698707016] [2022-04-08 11:51:38,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:51:38,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:51:38,574 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:51:38,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [341436860] [2022-04-08 11:51:38,575 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 11:51:38,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:51:38,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:51:38,576 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 11:51:38,582 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 11:51:38,614 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 11:51:38,614 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:51:38,615 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-08 11:51:38,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:51:38,623 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:51:38,818 INFO L272 TraceCheckUtils]: 0: Hoare triple {2721#true} call ULTIMATE.init(); {2721#true} is VALID [2022-04-08 11:51:38,818 INFO L290 TraceCheckUtils]: 1: Hoare triple {2721#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; {2729#(<= ~counter~0 0)} is VALID [2022-04-08 11:51:38,819 INFO L290 TraceCheckUtils]: 2: Hoare triple {2729#(<= ~counter~0 0)} assume true; {2729#(<= ~counter~0 0)} is VALID [2022-04-08 11:51:38,819 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2729#(<= ~counter~0 0)} {2721#true} #89#return; {2729#(<= ~counter~0 0)} is VALID [2022-04-08 11:51:38,819 INFO L272 TraceCheckUtils]: 4: Hoare triple {2729#(<= ~counter~0 0)} call #t~ret5 := main(); {2729#(<= ~counter~0 0)} is VALID [2022-04-08 11:51:38,820 INFO L290 TraceCheckUtils]: 5: Hoare triple {2729#(<= ~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; {2729#(<= ~counter~0 0)} is VALID [2022-04-08 11:51:38,820 INFO L272 TraceCheckUtils]: 6: Hoare triple {2729#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {2729#(<= ~counter~0 0)} is VALID [2022-04-08 11:51:38,821 INFO L290 TraceCheckUtils]: 7: Hoare triple {2729#(<= ~counter~0 0)} ~cond := #in~cond; {2729#(<= ~counter~0 0)} is VALID [2022-04-08 11:51:38,821 INFO L290 TraceCheckUtils]: 8: Hoare triple {2729#(<= ~counter~0 0)} assume !(0 == ~cond); {2729#(<= ~counter~0 0)} is VALID [2022-04-08 11:51:38,821 INFO L290 TraceCheckUtils]: 9: Hoare triple {2729#(<= ~counter~0 0)} assume true; {2729#(<= ~counter~0 0)} is VALID [2022-04-08 11:51:38,822 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2729#(<= ~counter~0 0)} {2729#(<= ~counter~0 0)} #81#return; {2729#(<= ~counter~0 0)} is VALID [2022-04-08 11:51:38,822 INFO L272 TraceCheckUtils]: 11: Hoare triple {2729#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {2729#(<= ~counter~0 0)} is VALID [2022-04-08 11:51:38,822 INFO L290 TraceCheckUtils]: 12: Hoare triple {2729#(<= ~counter~0 0)} ~cond := #in~cond; {2729#(<= ~counter~0 0)} is VALID [2022-04-08 11:51:38,823 INFO L290 TraceCheckUtils]: 13: Hoare triple {2729#(<= ~counter~0 0)} assume !(0 == ~cond); {2729#(<= ~counter~0 0)} is VALID [2022-04-08 11:51:38,824 INFO L290 TraceCheckUtils]: 14: Hoare triple {2729#(<= ~counter~0 0)} assume true; {2729#(<= ~counter~0 0)} is VALID [2022-04-08 11:51:38,825 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2729#(<= ~counter~0 0)} {2729#(<= ~counter~0 0)} #83#return; {2729#(<= ~counter~0 0)} is VALID [2022-04-08 11:51:38,825 INFO L290 TraceCheckUtils]: 16: Hoare triple {2729#(<= ~counter~0 0)} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {2729#(<= ~counter~0 0)} is VALID [2022-04-08 11:51:38,826 INFO L290 TraceCheckUtils]: 17: Hoare triple {2729#(<= ~counter~0 0)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {2778#(<= ~counter~0 1)} is VALID [2022-04-08 11:51:38,826 INFO L290 TraceCheckUtils]: 18: Hoare triple {2778#(<= ~counter~0 1)} assume !!(#t~post3 < 5);havoc #t~post3; {2778#(<= ~counter~0 1)} is VALID [2022-04-08 11:51:38,826 INFO L290 TraceCheckUtils]: 19: Hoare triple {2778#(<= ~counter~0 1)} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {2778#(<= ~counter~0 1)} is VALID [2022-04-08 11:51:38,827 INFO L290 TraceCheckUtils]: 20: Hoare triple {2778#(<= ~counter~0 1)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {2788#(<= ~counter~0 2)} is VALID [2022-04-08 11:51:38,827 INFO L290 TraceCheckUtils]: 21: Hoare triple {2788#(<= ~counter~0 2)} assume !!(#t~post3 < 5);havoc #t~post3; {2788#(<= ~counter~0 2)} is VALID [2022-04-08 11:51:38,827 INFO L290 TraceCheckUtils]: 22: Hoare triple {2788#(<= ~counter~0 2)} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {2788#(<= ~counter~0 2)} is VALID [2022-04-08 11:51:38,828 INFO L290 TraceCheckUtils]: 23: Hoare triple {2788#(<= ~counter~0 2)} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {2798#(<= ~counter~0 3)} is VALID [2022-04-08 11:51:38,828 INFO L290 TraceCheckUtils]: 24: Hoare triple {2798#(<= ~counter~0 3)} assume !!(#t~post4 < 5);havoc #t~post4; {2798#(<= ~counter~0 3)} is VALID [2022-04-08 11:51:38,829 INFO L272 TraceCheckUtils]: 25: Hoare triple {2798#(<= ~counter~0 3)} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {2798#(<= ~counter~0 3)} is VALID [2022-04-08 11:51:38,829 INFO L290 TraceCheckUtils]: 26: Hoare triple {2798#(<= ~counter~0 3)} ~cond := #in~cond; {2798#(<= ~counter~0 3)} is VALID [2022-04-08 11:51:38,830 INFO L290 TraceCheckUtils]: 27: Hoare triple {2798#(<= ~counter~0 3)} assume !(0 == ~cond); {2798#(<= ~counter~0 3)} is VALID [2022-04-08 11:51:38,830 INFO L290 TraceCheckUtils]: 28: Hoare triple {2798#(<= ~counter~0 3)} assume true; {2798#(<= ~counter~0 3)} is VALID [2022-04-08 11:51:38,831 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {2798#(<= ~counter~0 3)} {2798#(<= ~counter~0 3)} #85#return; {2798#(<= ~counter~0 3)} is VALID [2022-04-08 11:51:38,831 INFO L290 TraceCheckUtils]: 30: Hoare triple {2798#(<= ~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); {2798#(<= ~counter~0 3)} is VALID [2022-04-08 11:51:38,831 INFO L290 TraceCheckUtils]: 31: Hoare triple {2798#(<= ~counter~0 3)} assume ~r~0 % 4294967296 >= ~b~0 % 4294967296;~q~0 := 1 + ~q~0;~r~0 := ~r~0 - ~b~0; {2798#(<= ~counter~0 3)} is VALID [2022-04-08 11:51:38,831 INFO L290 TraceCheckUtils]: 32: Hoare triple {2798#(<= ~counter~0 3)} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {2826#(<= |main_#t~post4| 3)} is VALID [2022-04-08 11:51:38,832 INFO L290 TraceCheckUtils]: 33: Hoare triple {2826#(<= |main_#t~post4| 3)} assume !(#t~post4 < 5);havoc #t~post4; {2722#false} is VALID [2022-04-08 11:51:38,832 INFO L272 TraceCheckUtils]: 34: Hoare triple {2722#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {2722#false} is VALID [2022-04-08 11:51:38,832 INFO L290 TraceCheckUtils]: 35: Hoare triple {2722#false} ~cond := #in~cond; {2722#false} is VALID [2022-04-08 11:51:38,832 INFO L290 TraceCheckUtils]: 36: Hoare triple {2722#false} assume 0 == ~cond; {2722#false} is VALID [2022-04-08 11:51:38,832 INFO L290 TraceCheckUtils]: 37: Hoare triple {2722#false} assume !false; {2722#false} is VALID [2022-04-08 11:51:38,832 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 11:51:38,833 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 11:51:39,045 INFO L290 TraceCheckUtils]: 37: Hoare triple {2722#false} assume !false; {2722#false} is VALID [2022-04-08 11:51:39,045 INFO L290 TraceCheckUtils]: 36: Hoare triple {2722#false} assume 0 == ~cond; {2722#false} is VALID [2022-04-08 11:51:39,045 INFO L290 TraceCheckUtils]: 35: Hoare triple {2722#false} ~cond := #in~cond; {2722#false} is VALID [2022-04-08 11:51:39,045 INFO L272 TraceCheckUtils]: 34: Hoare triple {2722#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {2722#false} is VALID [2022-04-08 11:51:39,047 INFO L290 TraceCheckUtils]: 33: Hoare triple {2854#(< |main_#t~post4| 5)} assume !(#t~post4 < 5);havoc #t~post4; {2722#false} is VALID [2022-04-08 11:51:39,048 INFO L290 TraceCheckUtils]: 32: Hoare triple {2858#(< ~counter~0 5)} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {2854#(< |main_#t~post4| 5)} is VALID [2022-04-08 11:51:39,048 INFO L290 TraceCheckUtils]: 31: Hoare triple {2858#(< ~counter~0 5)} assume ~r~0 % 4294967296 >= ~b~0 % 4294967296;~q~0 := 1 + ~q~0;~r~0 := ~r~0 - ~b~0; {2858#(< ~counter~0 5)} is VALID [2022-04-08 11:51:39,048 INFO L290 TraceCheckUtils]: 30: Hoare triple {2858#(< ~counter~0 5)} 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); {2858#(< ~counter~0 5)} is VALID [2022-04-08 11:51:39,049 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {2721#true} {2858#(< ~counter~0 5)} #85#return; {2858#(< ~counter~0 5)} is VALID [2022-04-08 11:51:39,049 INFO L290 TraceCheckUtils]: 28: Hoare triple {2721#true} assume true; {2721#true} is VALID [2022-04-08 11:51:39,049 INFO L290 TraceCheckUtils]: 27: Hoare triple {2721#true} assume !(0 == ~cond); {2721#true} is VALID [2022-04-08 11:51:39,049 INFO L290 TraceCheckUtils]: 26: Hoare triple {2721#true} ~cond := #in~cond; {2721#true} is VALID [2022-04-08 11:51:39,049 INFO L272 TraceCheckUtils]: 25: Hoare triple {2858#(< ~counter~0 5)} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {2721#true} is VALID [2022-04-08 11:51:39,049 INFO L290 TraceCheckUtils]: 24: Hoare triple {2858#(< ~counter~0 5)} assume !!(#t~post4 < 5);havoc #t~post4; {2858#(< ~counter~0 5)} is VALID [2022-04-08 11:51:39,050 INFO L290 TraceCheckUtils]: 23: Hoare triple {2798#(<= ~counter~0 3)} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {2858#(< ~counter~0 5)} is VALID [2022-04-08 11:51:39,050 INFO L290 TraceCheckUtils]: 22: Hoare triple {2798#(<= ~counter~0 3)} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {2798#(<= ~counter~0 3)} is VALID [2022-04-08 11:51:39,050 INFO L290 TraceCheckUtils]: 21: Hoare triple {2798#(<= ~counter~0 3)} assume !!(#t~post3 < 5);havoc #t~post3; {2798#(<= ~counter~0 3)} is VALID [2022-04-08 11:51:39,051 INFO L290 TraceCheckUtils]: 20: Hoare triple {2788#(<= ~counter~0 2)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {2798#(<= ~counter~0 3)} is VALID [2022-04-08 11:51:39,051 INFO L290 TraceCheckUtils]: 19: Hoare triple {2788#(<= ~counter~0 2)} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {2788#(<= ~counter~0 2)} is VALID [2022-04-08 11:51:39,051 INFO L290 TraceCheckUtils]: 18: Hoare triple {2788#(<= ~counter~0 2)} assume !!(#t~post3 < 5);havoc #t~post3; {2788#(<= ~counter~0 2)} is VALID [2022-04-08 11:51:39,051 INFO L290 TraceCheckUtils]: 17: Hoare triple {2778#(<= ~counter~0 1)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {2788#(<= ~counter~0 2)} is VALID [2022-04-08 11:51:39,052 INFO L290 TraceCheckUtils]: 16: Hoare triple {2778#(<= ~counter~0 1)} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {2778#(<= ~counter~0 1)} is VALID [2022-04-08 11:51:39,052 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2721#true} {2778#(<= ~counter~0 1)} #83#return; {2778#(<= ~counter~0 1)} is VALID [2022-04-08 11:51:39,052 INFO L290 TraceCheckUtils]: 14: Hoare triple {2721#true} assume true; {2721#true} is VALID [2022-04-08 11:51:39,052 INFO L290 TraceCheckUtils]: 13: Hoare triple {2721#true} assume !(0 == ~cond); {2721#true} is VALID [2022-04-08 11:51:39,052 INFO L290 TraceCheckUtils]: 12: Hoare triple {2721#true} ~cond := #in~cond; {2721#true} is VALID [2022-04-08 11:51:39,052 INFO L272 TraceCheckUtils]: 11: Hoare triple {2778#(<= ~counter~0 1)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {2721#true} is VALID [2022-04-08 11:51:39,053 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2721#true} {2778#(<= ~counter~0 1)} #81#return; {2778#(<= ~counter~0 1)} is VALID [2022-04-08 11:51:39,053 INFO L290 TraceCheckUtils]: 9: Hoare triple {2721#true} assume true; {2721#true} is VALID [2022-04-08 11:51:39,053 INFO L290 TraceCheckUtils]: 8: Hoare triple {2721#true} assume !(0 == ~cond); {2721#true} is VALID [2022-04-08 11:51:39,053 INFO L290 TraceCheckUtils]: 7: Hoare triple {2721#true} ~cond := #in~cond; {2721#true} is VALID [2022-04-08 11:51:39,053 INFO L272 TraceCheckUtils]: 6: Hoare triple {2778#(<= ~counter~0 1)} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {2721#true} is VALID [2022-04-08 11:51:39,054 INFO L290 TraceCheckUtils]: 5: Hoare triple {2778#(<= ~counter~0 1)} 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; {2778#(<= ~counter~0 1)} is VALID [2022-04-08 11:51:39,054 INFO L272 TraceCheckUtils]: 4: Hoare triple {2778#(<= ~counter~0 1)} call #t~ret5 := main(); {2778#(<= ~counter~0 1)} is VALID [2022-04-08 11:51:39,054 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2778#(<= ~counter~0 1)} {2721#true} #89#return; {2778#(<= ~counter~0 1)} is VALID [2022-04-08 11:51:39,055 INFO L290 TraceCheckUtils]: 2: Hoare triple {2778#(<= ~counter~0 1)} assume true; {2778#(<= ~counter~0 1)} is VALID [2022-04-08 11:51:39,055 INFO L290 TraceCheckUtils]: 1: Hoare triple {2721#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; {2778#(<= ~counter~0 1)} is VALID [2022-04-08 11:51:39,055 INFO L272 TraceCheckUtils]: 0: Hoare triple {2721#true} call ULTIMATE.init(); {2721#true} is VALID [2022-04-08 11:51:39,055 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 11:51:39,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:51:39,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698707016] [2022-04-08 11:51:39,056 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:51:39,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [341436860] [2022-04-08 11:51:39,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [341436860] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 11:51:39,056 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 11:51:39,056 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2022-04-08 11:51:39,056 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:51:39,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [516155223] [2022-04-08 11:51:39,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [516155223] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:51:39,056 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:51:39,056 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 11:51:39,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877191645] [2022-04-08 11:51:39,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:51:39,057 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 11:51:39,057 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:51:39,057 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 11:51:39,080 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 11:51:39,080 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 11:51:39,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:51:39,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 11:51:39,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-04-08 11:51:39,081 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 11:51:39,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:51:39,247 INFO L93 Difference]: Finished difference Result 67 states and 78 transitions. [2022-04-08 11:51:39,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 11:51:39,248 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 11:51:39,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:51:39,248 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 11:51:39,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 66 transitions. [2022-04-08 11:51:39,249 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 11:51:39,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 66 transitions. [2022-04-08 11:51:39,250 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 66 transitions. [2022-04-08 11:51:39,294 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 11:51:39,295 INFO L225 Difference]: With dead ends: 67 [2022-04-08 11:51:39,295 INFO L226 Difference]: Without dead ends: 60 [2022-04-08 11:51:39,295 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-04-08 11:51:39,295 INFO L913 BasicCegarLoop]: 32 mSDtfsCounter, 24 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 11:51:39,296 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 103 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 11:51:39,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-04-08 11:51:39,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 54. [2022-04-08 11:51:39,331 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:51:39,331 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 11:51:39,332 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 11:51:39,332 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 11:51:39,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:51:39,333 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions. [2022-04-08 11:51:39,333 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 71 transitions. [2022-04-08 11:51:39,333 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:51:39,334 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:51:39,334 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 11:51:39,334 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 11:51:39,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:51:39,335 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions. [2022-04-08 11:51:39,335 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 71 transitions. [2022-04-08 11:51:39,335 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:51:39,336 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:51:39,336 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:51:39,336 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:51:39,336 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 11:51:39,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 63 transitions. [2022-04-08 11:51:39,337 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 63 transitions. Word has length 38 [2022-04-08 11:51:39,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:51:39,337 INFO L478 AbstractCegarLoop]: Abstraction has 54 states and 63 transitions. [2022-04-08 11:51:39,338 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 11:51:39,338 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 54 states and 63 transitions. [2022-04-08 11:51:39,395 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 11:51:39,396 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2022-04-08 11:51:39,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-08 11:51:39,396 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:51:39,396 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 11:51:39,415 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 11:51:39,597 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 11:51:39,597 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:51:39,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:51:39,597 INFO L85 PathProgramCache]: Analyzing trace with hash 817777954, now seen corresponding path program 1 times [2022-04-08 11:51:39,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:51:39,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1236559453] [2022-04-08 11:51:39,598 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 11:51:39,598 INFO L85 PathProgramCache]: Analyzing trace with hash 817777954, now seen corresponding path program 2 times [2022-04-08 11:51:39,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:51:39,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007616535] [2022-04-08 11:51:39,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:51:39,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:51:39,611 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:51:39,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [533994437] [2022-04-08 11:51:39,611 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 11:51:39,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:51:39,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:51:39,612 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 11:51:39,613 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process