/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/nla-digbench/divbin2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 13:19:01,922 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 13:19:01,924 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 13:19:01,956 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 13:19:01,956 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 13:19:01,957 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 13:19:01,958 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 13:19:01,959 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 13:19:01,961 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 13:19:01,965 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 13:19:01,966 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 13:19:01,968 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 13:19:01,968 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 13:19:01,970 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 13:19:01,971 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 13:19:01,972 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 13:19:01,972 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 13:19:01,973 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 13:19:01,979 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 13:19:01,982 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 13:19:01,983 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 13:19:01,984 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 13:19:01,985 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 13:19:01,986 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 13:19:01,987 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 13:19:01,994 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 13:19:01,995 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 13:19:01,995 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 13:19:01,996 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 13:19:01,996 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 13:19:01,998 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 13:19:01,998 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 13:19:01,999 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 13:19:02,000 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 13:19:02,000 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 13:19:02,001 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 13:19:02,001 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 13:19:02,002 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 13:19:02,002 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 13:19:02,002 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 13:19:02,003 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 13:19:02,004 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 13:19:02,005 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-15 13:19:02,013 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 13:19:02,013 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 13:19:02,014 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 13:19:02,014 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 13:19:02,014 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 13:19:02,014 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 13:19:02,015 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 13:19:02,015 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 13:19:02,015 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 13:19:02,016 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 13:19:02,016 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 13:19:02,016 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 13:19:02,016 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 13:19:02,017 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 13:19:02,017 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 13:19:02,017 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 13:19:02,017 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 13:19:02,017 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 13:19:02,017 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 13:19:02,018 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 13:19:02,018 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 13:19:02,018 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-15 13:19:02,018 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-15 13:19:02,235 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 13:19:02,258 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 13:19:02,260 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 13:19:02,260 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 13:19:02,263 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 13:19:02,264 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench/divbin2.i [2022-04-15 13:19:02,317 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8609a95a3/ed8c914ebd8d4ce9afe37dfdfab6ff65/FLAG06ad5b8a6 [2022-04-15 13:19:02,696 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 13:19:02,696 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/divbin2.i [2022-04-15 13:19:02,701 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8609a95a3/ed8c914ebd8d4ce9afe37dfdfab6ff65/FLAG06ad5b8a6 [2022-04-15 13:19:02,711 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8609a95a3/ed8c914ebd8d4ce9afe37dfdfab6ff65 [2022-04-15 13:19:02,713 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 13:19:02,714 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 13:19:02,715 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 13:19:02,716 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 13:19:02,722 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 13:19:02,723 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 01:19:02" (1/1) ... [2022-04-15 13:19:02,724 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@584c2645 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:19:02, skipping insertion in model container [2022-04-15 13:19:02,724 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 01:19:02" (1/1) ... [2022-04-15 13:19:02,730 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 13:19:02,741 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 13:19:02,849 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/divbin2.i[951,964] [2022-04-15 13:19:02,875 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 13:19:02,882 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 13:19:02,892 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/divbin2.i[951,964] [2022-04-15 13:19:02,898 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 13:19:02,909 INFO L208 MainTranslator]: Completed translation [2022-04-15 13:19:02,909 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:19:02 WrapperNode [2022-04-15 13:19:02,909 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 13:19:02,910 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 13:19:02,910 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 13:19:02,910 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 13:19:02,919 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:19:02" (1/1) ... [2022-04-15 13:19:02,919 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:19:02" (1/1) ... [2022-04-15 13:19:02,924 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:19:02" (1/1) ... [2022-04-15 13:19:02,924 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:19:02" (1/1) ... [2022-04-15 13:19:02,929 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:19:02" (1/1) ... [2022-04-15 13:19:02,936 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:19:02" (1/1) ... [2022-04-15 13:19:02,937 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:19:02" (1/1) ... [2022-04-15 13:19:02,939 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 13:19:02,940 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 13:19:02,940 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 13:19:02,940 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 13:19:02,940 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:19:02" (1/1) ... [2022-04-15 13:19:02,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 13:19:02,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:19:02,964 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-15 13:19:02,971 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-15 13:19:02,991 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 13:19:02,992 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 13:19:02,992 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 13:19:02,992 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 13:19:02,992 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 13:19:02,992 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 13:19:02,992 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 13:19:02,992 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 13:19:02,992 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-15 13:19:02,993 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-15 13:19:02,993 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 13:19:02,993 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 13:19:02,993 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-15 13:19:02,993 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 13:19:02,993 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 13:19:02,993 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 13:19:02,993 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 13:19:02,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 13:19:02,994 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 13:19:02,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 13:19:02,994 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 13:19:02,994 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 13:19:03,050 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 13:19:03,051 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 13:19:03,178 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 13:19:03,184 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 13:19:03,184 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-15 13:19:03,185 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 01:19:03 BoogieIcfgContainer [2022-04-15 13:19:03,185 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 13:19:03,187 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 13:19:03,187 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 13:19:03,190 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 13:19:03,190 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 01:19:02" (1/3) ... [2022-04-15 13:19:03,190 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72ea7b85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 01:19:03, skipping insertion in model container [2022-04-15 13:19:03,190 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:19:02" (2/3) ... [2022-04-15 13:19:03,191 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72ea7b85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 01:19:03, skipping insertion in model container [2022-04-15 13:19:03,191 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 01:19:03" (3/3) ... [2022-04-15 13:19:03,192 INFO L111 eAbstractionObserver]: Analyzing ICFG divbin2.i [2022-04-15 13:19:03,196 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 13:19:03,196 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 13:19:03,229 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 13:19:03,234 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-15 13:19:03,235 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 13:19:03,249 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 15 states have (on average 1.6) internal successors, (24), 16 states have internal predecessors, (24), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 13:19:03,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-15 13:19:03,254 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:19:03,255 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:19:03,255 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:19:03,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:19:03,259 INFO L85 PathProgramCache]: Analyzing trace with hash 1443343444, now seen corresponding path program 1 times [2022-04-15 13:19:03,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:19:03,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1158145744] [2022-04-15 13:19:03,274 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 13:19:03,274 INFO L85 PathProgramCache]: Analyzing trace with hash 1443343444, now seen corresponding path program 2 times [2022-04-15 13:19:03,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:19:03,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416946158] [2022-04-15 13:19:03,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:19:03,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:19:03,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:19:03,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:19:03,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:19:03,401 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {27#true} is VALID [2022-04-15 13:19:03,401 INFO L290 TraceCheckUtils]: 1: Hoare triple {27#true} assume true; {27#true} is VALID [2022-04-15 13:19:03,402 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {27#true} {27#true} #80#return; {27#true} is VALID [2022-04-15 13:19:03,403 INFO L272 TraceCheckUtils]: 0: Hoare triple {27#true} call ULTIMATE.init(); {32#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:19:03,404 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {27#true} is VALID [2022-04-15 13:19:03,404 INFO L290 TraceCheckUtils]: 2: Hoare triple {27#true} assume true; {27#true} is VALID [2022-04-15 13:19:03,404 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27#true} {27#true} #80#return; {27#true} is VALID [2022-04-15 13:19:03,404 INFO L272 TraceCheckUtils]: 4: Hoare triple {27#true} call #t~ret2 := main(); {27#true} is VALID [2022-04-15 13:19:03,404 INFO L290 TraceCheckUtils]: 5: Hoare triple {27#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {27#true} is VALID [2022-04-15 13:19:03,405 INFO L290 TraceCheckUtils]: 6: Hoare triple {27#true} assume false; {28#false} is VALID [2022-04-15 13:19:03,405 INFO L290 TraceCheckUtils]: 7: Hoare triple {28#false} assume !true; {28#false} is VALID [2022-04-15 13:19:03,405 INFO L272 TraceCheckUtils]: 8: Hoare triple {28#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {28#false} is VALID [2022-04-15 13:19:03,406 INFO L290 TraceCheckUtils]: 9: Hoare triple {28#false} ~cond := #in~cond; {28#false} is VALID [2022-04-15 13:19:03,406 INFO L290 TraceCheckUtils]: 10: Hoare triple {28#false} assume 0 == ~cond; {28#false} is VALID [2022-04-15 13:19:03,406 INFO L290 TraceCheckUtils]: 11: Hoare triple {28#false} assume !false; {28#false} is VALID [2022-04-15 13:19:03,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:19:03,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:19:03,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416946158] [2022-04-15 13:19:03,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416946158] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:19:03,407 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:19:03,408 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 13:19:03,410 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:19:03,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1158145744] [2022-04-15 13:19:03,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1158145744] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:19:03,410 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:19:03,410 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 13:19:03,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740038955] [2022-04-15 13:19:03,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:19:03,415 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-15 13:19:03,416 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:19:03,419 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:19:03,462 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:19:03,462 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 13:19:03,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:19:03,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 13:19:03,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 13:19:03,492 INFO L87 Difference]: Start difference. First operand has 24 states, 15 states have (on average 1.6) internal successors, (24), 16 states have internal predecessors, (24), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:19:03,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:19:03,619 INFO L93 Difference]: Finished difference Result 40 states and 55 transitions. [2022-04-15 13:19:03,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 13:19:03,620 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-15 13:19:03,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:19:03,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:19:03,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2022-04-15 13:19:03,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:19:03,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2022-04-15 13:19:03,634 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 55 transitions. [2022-04-15 13:19:03,704 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:19:03,711 INFO L225 Difference]: With dead ends: 40 [2022-04-15 13:19:03,711 INFO L226 Difference]: Without dead ends: 19 [2022-04-15 13:19:03,714 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 13:19:03,716 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 16 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 13:19:03,717 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 28 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 13:19:03,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-04-15 13:19:03,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-04-15 13:19:03,745 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:19:03,746 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand has 19 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 13 states have internal predecessors, (16), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 13:19:03,746 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand has 19 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 13 states have internal predecessors, (16), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 13:19:03,746 INFO L87 Difference]: Start difference. First operand 19 states. Second operand has 19 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 13 states have internal predecessors, (16), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 13:19:03,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:19:03,750 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2022-04-15 13:19:03,750 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2022-04-15 13:19:03,750 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:19:03,750 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:19:03,751 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 13 states have internal predecessors, (16), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 19 states. [2022-04-15 13:19:03,751 INFO L87 Difference]: Start difference. First operand has 19 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 13 states have internal predecessors, (16), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 19 states. [2022-04-15 13:19:03,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:19:03,755 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2022-04-15 13:19:03,755 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2022-04-15 13:19:03,756 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:19:03,756 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:19:03,756 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:19:03,756 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:19:03,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 13 states have internal predecessors, (16), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 13:19:03,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2022-04-15 13:19:03,759 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 12 [2022-04-15 13:19:03,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:19:03,760 INFO L478 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2022-04-15 13:19:03,760 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:19:03,760 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 22 transitions. [2022-04-15 13:19:03,784 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:19:03,785 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2022-04-15 13:19:03,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-15 13:19:03,785 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:19:03,785 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:19:03,786 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 13:19:03,786 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:19:03,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:19:03,787 INFO L85 PathProgramCache]: Analyzing trace with hash -1532818659, now seen corresponding path program 1 times [2022-04-15 13:19:03,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:19:03,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [987688215] [2022-04-15 13:19:03,788 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 13:19:03,788 INFO L85 PathProgramCache]: Analyzing trace with hash -1532818659, now seen corresponding path program 2 times [2022-04-15 13:19:03,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:19:03,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112640221] [2022-04-15 13:19:03,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:19:03,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:19:03,804 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 13:19:03,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [127974083] [2022-04-15 13:19:03,805 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 13:19:03,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:19:03,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:19:03,815 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 13:19:03,822 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-15 13:19:03,893 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-15 13:19:03,893 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 13:19:03,896 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-15 13:19:03,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:19:03,913 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:19:04,329 INFO L272 TraceCheckUtils]: 0: Hoare triple {191#true} call ULTIMATE.init(); {191#true} is VALID [2022-04-15 13:19:04,330 INFO L290 TraceCheckUtils]: 1: Hoare triple {191#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {191#true} is VALID [2022-04-15 13:19:04,330 INFO L290 TraceCheckUtils]: 2: Hoare triple {191#true} assume true; {191#true} is VALID [2022-04-15 13:19:04,332 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {191#true} {191#true} #80#return; {191#true} is VALID [2022-04-15 13:19:04,332 INFO L272 TraceCheckUtils]: 4: Hoare triple {191#true} call #t~ret2 := main(); {191#true} is VALID [2022-04-15 13:19:04,333 INFO L290 TraceCheckUtils]: 5: Hoare triple {191#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {211#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 13:19:04,333 INFO L290 TraceCheckUtils]: 6: Hoare triple {211#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !false; {211#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 13:19:04,335 INFO L290 TraceCheckUtils]: 7: Hoare triple {211#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {218#(and (= main_~b~0 1) (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 13:19:04,336 INFO L290 TraceCheckUtils]: 8: Hoare triple {218#(and (= main_~b~0 1) (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !false; {218#(and (= main_~b~0 1) (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 13:19:04,337 INFO L272 TraceCheckUtils]: 9: Hoare triple {218#(and (= main_~b~0 1) (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {225#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 13:19:04,338 INFO L290 TraceCheckUtils]: 10: Hoare triple {225#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {229#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 13:19:04,338 INFO L290 TraceCheckUtils]: 11: Hoare triple {229#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {192#false} is VALID [2022-04-15 13:19:04,339 INFO L290 TraceCheckUtils]: 12: Hoare triple {192#false} assume !false; {192#false} is VALID [2022-04-15 13:19:04,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:19:04,339 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 13:19:04,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:19:04,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112640221] [2022-04-15 13:19:04,339 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 13:19:04,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [127974083] [2022-04-15 13:19:04,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [127974083] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:19:04,341 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:19:04,341 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 13:19:04,342 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:19:04,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [987688215] [2022-04-15 13:19:04,342 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [987688215] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:19:04,342 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:19:04,342 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 13:19:04,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47001946] [2022-04-15 13:19:04,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:19:04,343 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-15 13:19:04,344 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:19:04,344 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:19:04,358 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:19:04,359 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 13:19:04,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:19:04,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 13:19:04,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-04-15 13:19:04,361 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:19:04,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:19:04,514 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2022-04-15 13:19:04,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 13:19:04,514 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-15 13:19:04,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:19:04,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:19:04,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 36 transitions. [2022-04-15 13:19:04,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:19:04,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 36 transitions. [2022-04-15 13:19:04,519 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 36 transitions. [2022-04-15 13:19:04,557 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:19:04,558 INFO L225 Difference]: With dead ends: 31 [2022-04-15 13:19:04,558 INFO L226 Difference]: Without dead ends: 28 [2022-04-15 13:19:04,559 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-04-15 13:19:04,560 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 9 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 13:19:04,560 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 56 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 13:19:04,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-04-15 13:19:04,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-04-15 13:19:04,573 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:19:04,574 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 28 states, 19 states have (on average 1.263157894736842) internal successors, (24), 20 states have internal predecessors, (24), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:19:04,574 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 28 states, 19 states have (on average 1.263157894736842) internal successors, (24), 20 states have internal predecessors, (24), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:19:04,575 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 28 states, 19 states have (on average 1.263157894736842) internal successors, (24), 20 states have internal predecessors, (24), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:19:04,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:19:04,577 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2022-04-15 13:19:04,577 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2022-04-15 13:19:04,577 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:19:04,577 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:19:04,577 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 19 states have (on average 1.263157894736842) internal successors, (24), 20 states have internal predecessors, (24), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 28 states. [2022-04-15 13:19:04,578 INFO L87 Difference]: Start difference. First operand has 28 states, 19 states have (on average 1.263157894736842) internal successors, (24), 20 states have internal predecessors, (24), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 28 states. [2022-04-15 13:19:04,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:19:04,580 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2022-04-15 13:19:04,580 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2022-04-15 13:19:04,580 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:19:04,580 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:19:04,580 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:19:04,580 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:19:04,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 19 states have (on average 1.263157894736842) internal successors, (24), 20 states have internal predecessors, (24), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:19:04,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2022-04-15 13:19:04,582 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 13 [2022-04-15 13:19:04,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:19:04,583 INFO L478 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2022-04-15 13:19:04,583 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:19:04,583 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 32 transitions. [2022-04-15 13:19:04,618 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:19:04,618 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2022-04-15 13:19:04,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-15 13:19:04,619 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:19:04,619 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:19:04,636 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-15 13:19:04,823 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:19:04,823 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:19:04,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:19:04,824 INFO L85 PathProgramCache]: Analyzing trace with hash 909386808, now seen corresponding path program 1 times [2022-04-15 13:19:04,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:19:04,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [116600409] [2022-04-15 13:19:04,894 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:19:04,895 INFO L85 PathProgramCache]: Analyzing trace with hash -1026911966, now seen corresponding path program 1 times [2022-04-15 13:19:04,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:19:04,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642841050] [2022-04-15 13:19:04,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:19:04,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:19:04,922 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 13:19:04,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1158197255] [2022-04-15 13:19:04,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:19:04,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:19:04,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:19:04,928 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 13:19:04,929 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-15 13:19:04,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:19:04,966 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-15 13:19:04,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:19:04,974 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:19:05,487 INFO L272 TraceCheckUtils]: 0: Hoare triple {411#true} call ULTIMATE.init(); {411#true} is VALID [2022-04-15 13:19:05,488 INFO L290 TraceCheckUtils]: 1: Hoare triple {411#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {411#true} is VALID [2022-04-15 13:19:05,488 INFO L290 TraceCheckUtils]: 2: Hoare triple {411#true} assume true; {411#true} is VALID [2022-04-15 13:19:05,488 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {411#true} {411#true} #80#return; {411#true} is VALID [2022-04-15 13:19:05,488 INFO L272 TraceCheckUtils]: 4: Hoare triple {411#true} call #t~ret2 := main(); {411#true} is VALID [2022-04-15 13:19:05,489 INFO L290 TraceCheckUtils]: 5: Hoare triple {411#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {431#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 13:19:05,490 INFO L290 TraceCheckUtils]: 6: Hoare triple {431#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} [84] L33-2-->L34_primed: Formula: (or (and (= v_main_~r~0_In_1 0) (<= (mod (div v_main_~b~0_Out_2 2) 4294967296) (mod v_main_~r~0_In_1 4294967296)) (= (mod v_main_~b~0_Out_2 2) 0)) (= v_main_~r~0_In_1 v_main_~r~0_In_1)) InVars {main_~r~0=v_main_~r~0_In_1} OutVars{main_~b~0=v_main_~b~0_Out_2, main_~r~0=v_main_~r~0_In_1} AuxVars[] AssignedVars[main_~b~0] {431#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 13:19:05,490 INFO L290 TraceCheckUtils]: 7: Hoare triple {431#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} [83] L34_primed-->L34: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {431#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 13:19:05,491 INFO L290 TraceCheckUtils]: 8: Hoare triple {431#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {441#(and (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 13:19:05,492 INFO L290 TraceCheckUtils]: 9: Hoare triple {441#(and (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !false; {441#(and (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 13:19:05,493 INFO L272 TraceCheckUtils]: 10: Hoare triple {441#(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)); {448#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 13:19:05,493 INFO L290 TraceCheckUtils]: 11: Hoare triple {448#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {452#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 13:19:05,494 INFO L290 TraceCheckUtils]: 12: Hoare triple {452#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {412#false} is VALID [2022-04-15 13:19:05,494 INFO L290 TraceCheckUtils]: 13: Hoare triple {412#false} assume !false; {412#false} is VALID [2022-04-15 13:19:05,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:19:05,494 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 13:19:05,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:19:05,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642841050] [2022-04-15 13:19:05,495 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 13:19:05,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1158197255] [2022-04-15 13:19:05,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1158197255] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:19:05,495 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:19:05,495 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 13:19:05,538 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:19:05,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [116600409] [2022-04-15 13:19:05,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [116600409] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:19:05,538 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:19:05,538 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 13:19:05,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217105694] [2022-04-15 13:19:05,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:19:05,539 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-15 13:19:05,539 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:19:05,539 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:19:05,554 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:19:05,554 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 13:19:05,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:19:05,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 13:19:05,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-15 13:19:05,555 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:19:07,833 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-15 13:19:12,030 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-15 13:19:14,119 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 13:19:14,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:19:14,321 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2022-04-15 13:19:14,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 13:19:14,322 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-15 13:19:14,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:19:14,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:19:14,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 44 transitions. [2022-04-15 13:19:14,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:19:14,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 44 transitions. [2022-04-15 13:19:14,326 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 44 transitions. [2022-04-15 13:19:14,391 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:19:14,392 INFO L225 Difference]: With dead ends: 43 [2022-04-15 13:19:14,392 INFO L226 Difference]: Without dead ends: 39 [2022-04-15 13:19:14,393 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-04-15 13:19:14,394 INFO L913 BasicCegarLoop]: 17 mSDtfsCounter, 16 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 7 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2022-04-15 13:19:14,394 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 69 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 68 Invalid, 3 Unknown, 0 Unchecked, 6.5s Time] [2022-04-15 13:19:14,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-15 13:19:14,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 27. [2022-04-15 13:19:14,415 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:19:14,415 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 27 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 19 states have internal predecessors, (23), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:19:14,415 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 27 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 19 states have internal predecessors, (23), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:19:14,415 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 27 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 19 states have internal predecessors, (23), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:19:14,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:19:14,418 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2022-04-15 13:19:14,418 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2022-04-15 13:19:14,418 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:19:14,418 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:19:14,419 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 19 states have internal predecessors, (23), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 39 states. [2022-04-15 13:19:14,419 INFO L87 Difference]: Start difference. First operand has 27 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 19 states have internal predecessors, (23), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 39 states. [2022-04-15 13:19:14,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:19:14,422 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2022-04-15 13:19:14,422 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2022-04-15 13:19:14,422 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:19:14,422 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:19:14,422 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:19:14,422 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:19:14,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 19 states have internal predecessors, (23), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:19:14,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2022-04-15 13:19:14,424 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 15 [2022-04-15 13:19:14,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:19:14,424 INFO L478 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2022-04-15 13:19:14,424 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:19:14,424 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 31 transitions. [2022-04-15 13:19:14,488 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:19:14,489 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-15 13:19:14,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-15 13:19:14,489 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:19:14,489 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:19:14,507 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-15 13:19:14,690 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-15 13:19:14,690 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:19:14,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:19:14,691 INFO L85 PathProgramCache]: Analyzing trace with hash 1729767853, now seen corresponding path program 1 times [2022-04-15 13:19:14,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:19:14,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [610076572] [2022-04-15 13:19:14,691 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 13:19:14,691 INFO L85 PathProgramCache]: Analyzing trace with hash 1729767853, now seen corresponding path program 2 times [2022-04-15 13:19:14,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:19:14,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859903827] [2022-04-15 13:19:14,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:19:14,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:19:14,702 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 13:19:14,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1039258990] [2022-04-15 13:19:14,702 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 13:19:14,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:19:14,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:19:14,704 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 13:19:14,720 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-15 13:19:14,742 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 13:19:14,743 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 13:19:14,743 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-15 13:19:14,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:19:14,749 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:19:14,825 INFO L272 TraceCheckUtils]: 0: Hoare triple {681#true} call ULTIMATE.init(); {681#true} is VALID [2022-04-15 13:19:14,829 INFO L290 TraceCheckUtils]: 1: Hoare triple {681#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {681#true} is VALID [2022-04-15 13:19:14,829 INFO L290 TraceCheckUtils]: 2: Hoare triple {681#true} assume true; {681#true} is VALID [2022-04-15 13:19:14,830 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {681#true} {681#true} #80#return; {681#true} is VALID [2022-04-15 13:19:14,836 INFO L272 TraceCheckUtils]: 4: Hoare triple {681#true} call #t~ret2 := main(); {681#true} is VALID [2022-04-15 13:19:14,837 INFO L290 TraceCheckUtils]: 5: Hoare triple {681#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {701#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} is VALID [2022-04-15 13:19:14,837 INFO L290 TraceCheckUtils]: 6: Hoare triple {701#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} assume !false; {701#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} is VALID [2022-04-15 13:19:14,856 INFO L290 TraceCheckUtils]: 7: Hoare triple {701#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {701#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} is VALID [2022-04-15 13:19:14,856 INFO L290 TraceCheckUtils]: 8: Hoare triple {701#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} assume !false; {701#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} is VALID [2022-04-15 13:19:14,857 INFO L272 TraceCheckUtils]: 9: Hoare triple {701#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {681#true} is VALID [2022-04-15 13:19:14,857 INFO L290 TraceCheckUtils]: 10: Hoare triple {681#true} ~cond := #in~cond; {681#true} is VALID [2022-04-15 13:19:14,857 INFO L290 TraceCheckUtils]: 11: Hoare triple {681#true} assume !(0 == ~cond); {681#true} is VALID [2022-04-15 13:19:14,857 INFO L290 TraceCheckUtils]: 12: Hoare triple {681#true} assume true; {681#true} is VALID [2022-04-15 13:19:14,858 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {681#true} {701#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} #76#return; {701#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} is VALID [2022-04-15 13:19:14,859 INFO L290 TraceCheckUtils]: 14: Hoare triple {701#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} assume !!(~b~0 % 4294967296 != ~B~0 % 4294967296);~q~0 := 2 * ~q~0;~b~0 := (if ~b~0 % 4294967296 < 0 && 0 != ~b~0 % 4294967296 % 2 then 1 + ~b~0 % 4294967296 / 2 else ~b~0 % 4294967296 / 2); {682#false} is VALID [2022-04-15 13:19:14,860 INFO L290 TraceCheckUtils]: 15: Hoare triple {682#false} assume ~r~0 % 4294967296 >= ~b~0 % 4294967296;~q~0 := 1 + ~q~0;~r~0 := ~r~0 - ~b~0; {682#false} is VALID [2022-04-15 13:19:14,860 INFO L290 TraceCheckUtils]: 16: Hoare triple {682#false} assume !false; {682#false} is VALID [2022-04-15 13:19:14,860 INFO L272 TraceCheckUtils]: 17: Hoare triple {682#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {682#false} is VALID [2022-04-15 13:19:14,860 INFO L290 TraceCheckUtils]: 18: Hoare triple {682#false} ~cond := #in~cond; {682#false} is VALID [2022-04-15 13:19:14,860 INFO L290 TraceCheckUtils]: 19: Hoare triple {682#false} assume 0 == ~cond; {682#false} is VALID [2022-04-15 13:19:14,860 INFO L290 TraceCheckUtils]: 20: Hoare triple {682#false} assume !false; {682#false} is VALID [2022-04-15 13:19:14,861 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:19:14,861 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 13:19:14,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:19:14,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859903827] [2022-04-15 13:19:14,862 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 13:19:14,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1039258990] [2022-04-15 13:19:14,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1039258990] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:19:14,862 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:19:14,862 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 13:19:14,863 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:19:14,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [610076572] [2022-04-15 13:19:14,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [610076572] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:19:14,863 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:19:14,863 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 13:19:14,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133074718] [2022-04-15 13:19:14,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:19:14,864 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2022-04-15 13:19:14,864 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:19:14,864 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 13:19:14,883 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:19:14,883 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 13:19:14,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:19:14,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 13:19:14,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 13:19:14,884 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 13:19:14,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:19:14,989 INFO L93 Difference]: Finished difference Result 51 states and 60 transitions. [2022-04-15 13:19:14,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 13:19:14,989 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2022-04-15 13:19:14,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:19:14,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 13:19:14,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2022-04-15 13:19:14,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 13:19:14,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2022-04-15 13:19:14,999 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 42 transitions. [2022-04-15 13:19:15,041 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:19:15,042 INFO L225 Difference]: With dead ends: 51 [2022-04-15 13:19:15,042 INFO L226 Difference]: Without dead ends: 29 [2022-04-15 13:19:15,043 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 13:19:15,045 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 13:19:15,047 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 34 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 13:19:15,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-15 13:19:15,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-04-15 13:19:15,070 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:19:15,071 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 29 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:19:15,071 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 29 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:19:15,072 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 29 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:19:15,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:19:15,074 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2022-04-15 13:19:15,075 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2022-04-15 13:19:15,076 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:19:15,076 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:19:15,077 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 29 states. [2022-04-15 13:19:15,077 INFO L87 Difference]: Start difference. First operand has 29 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 29 states. [2022-04-15 13:19:15,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:19:15,081 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2022-04-15 13:19:15,081 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2022-04-15 13:19:15,082 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:19:15,082 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:19:15,082 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:19:15,082 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:19:15,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:19:15,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2022-04-15 13:19:15,087 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 21 [2022-04-15 13:19:15,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:19:15,088 INFO L478 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2022-04-15 13:19:15,088 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 13:19:15,088 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 33 transitions. [2022-04-15 13:19:15,151 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:19:15,151 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2022-04-15 13:19:15,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-15 13:19:15,152 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:19:15,152 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:19:15,179 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-15 13:19:15,353 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:19:15,353 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:19:15,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:19:15,354 INFO L85 PathProgramCache]: Analyzing trace with hash 700053448, now seen corresponding path program 1 times [2022-04-15 13:19:15,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:19:15,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1479919886] [2022-04-15 13:19:15,419 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:19:15,420 INFO L85 PathProgramCache]: Analyzing trace with hash -1668519182, now seen corresponding path program 1 times [2022-04-15 13:19:15,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:19:15,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212190355] [2022-04-15 13:19:15,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:19:15,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:19:15,432 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 13:19:15,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [652508749] [2022-04-15 13:19:15,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:19:15,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:19:15,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:19:15,434 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 13:19:15,450 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process