/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/nla-digbench/hard-u.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 04:20:09,005 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 04:20:09,007 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 04:20:09,066 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 04:20:09,067 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 04:20:09,068 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 04:20:09,070 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 04:20:09,071 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 04:20:09,072 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 04:20:09,075 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 04:20:09,076 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 04:20:09,076 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 04:20:09,076 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 04:20:09,077 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 04:20:09,077 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 04:20:09,078 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 04:20:09,078 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 04:20:09,079 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 04:20:09,080 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 04:20:09,080 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 04:20:09,081 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 04:20:09,083 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 04:20:09,084 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 04:20:09,084 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 04:20:09,087 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 04:20:09,095 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 04:20:09,095 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 04:20:09,095 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 04:20:09,096 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 04:20:09,096 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 04:20:09,096 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 04:20:09,096 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 04:20:09,097 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 04:20:09,097 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 04:20:09,098 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 04:20:09,098 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 04:20:09,098 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 04:20:09,099 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 04:20:09,099 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 04:20:09,099 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 04:20:09,099 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 04:20:09,102 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 04:20:09,103 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-28 04:20:09,112 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 04:20:09,113 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 04:20:09,113 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 04:20:09,113 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 04:20:09,114 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 04:20:09,114 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 04:20:09,114 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 04:20:09,114 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 04:20:09,114 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 04:20:09,114 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 04:20:09,115 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 04:20:09,115 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 04:20:09,115 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 04:20:09,115 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 04:20:09,115 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 04:20:09,115 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 04:20:09,115 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 04:20:09,115 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 04:20:09,115 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 04:20:09,115 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 04:20:09,115 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 04:20:09,116 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 04:20:09,116 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 04:20:09,116 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 04:20:09,116 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 04:20:09,116 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-28 04:20:09,289 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 04:20:09,302 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 04:20:09,303 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 04:20:09,304 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 04:20:09,310 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 04:20:09,310 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench/hard-u.c [2022-04-28 04:20:09,355 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64e3f54e6/4b07efe0f6cb4acb8799d4e7acc516eb/FLAGc0111eb62 [2022-04-28 04:20:09,726 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 04:20:09,727 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/hard-u.c [2022-04-28 04:20:09,731 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64e3f54e6/4b07efe0f6cb4acb8799d4e7acc516eb/FLAGc0111eb62 [2022-04-28 04:20:09,739 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64e3f54e6/4b07efe0f6cb4acb8799d4e7acc516eb [2022-04-28 04:20:09,741 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 04:20:09,742 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 04:20:09,743 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 04:20:09,743 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 04:20:09,745 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 04:20:09,745 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 04:20:09" (1/1) ... [2022-04-28 04:20:09,746 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69d6d4b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:20:09, skipping insertion in model container [2022-04-28 04:20:09,746 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 04:20:09" (1/1) ... [2022-04-28 04:20:09,750 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 04:20:09,757 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 04:20:09,869 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/hard-u.c[537,550] [2022-04-28 04:20:09,895 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 04:20:09,903 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 04:20:09,916 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/hard-u.c[537,550] [2022-04-28 04:20:09,928 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 04:20:09,937 INFO L208 MainTranslator]: Completed translation [2022-04-28 04:20:09,937 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:20:09 WrapperNode [2022-04-28 04:20:09,938 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 04:20:09,939 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 04:20:09,939 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 04:20:09,939 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 04:20:09,945 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:20:09" (1/1) ... [2022-04-28 04:20:09,945 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:20:09" (1/1) ... [2022-04-28 04:20:09,950 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:20:09" (1/1) ... [2022-04-28 04:20:09,950 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:20:09" (1/1) ... [2022-04-28 04:20:09,961 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:20:09" (1/1) ... [2022-04-28 04:20:09,965 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:20:09" (1/1) ... [2022-04-28 04:20:09,971 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:20:09" (1/1) ... [2022-04-28 04:20:09,972 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 04:20:09,973 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 04:20:09,973 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 04:20:09,973 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 04:20:09,973 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:20:09" (1/1) ... [2022-04-28 04:20:09,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 04:20:09,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:20:09,993 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-28 04:20:10,011 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-28 04:20:10,021 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 04:20:10,021 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 04:20:10,021 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 04:20:10,021 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 04:20:10,021 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 04:20:10,021 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 04:20:10,021 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 04:20:10,021 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 04:20:10,022 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 04:20:10,022 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 04:20:10,022 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-28 04:20:10,022 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 04:20:10,023 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 04:20:10,023 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 04:20:10,023 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 04:20:10,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 04:20:10,023 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 04:20:10,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 04:20:10,023 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 04:20:10,023 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 04:20:10,069 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 04:20:10,070 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 04:20:10,206 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 04:20:10,210 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 04:20:10,211 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-28 04:20:10,212 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 04:20:10 BoogieIcfgContainer [2022-04-28 04:20:10,212 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 04:20:10,213 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 04:20:10,213 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 04:20:10,234 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 04:20:10,234 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 04:20:09" (1/3) ... [2022-04-28 04:20:10,234 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ce77a98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 04:20:10, skipping insertion in model container [2022-04-28 04:20:10,235 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:20:09" (2/3) ... [2022-04-28 04:20:10,235 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ce77a98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 04:20:10, skipping insertion in model container [2022-04-28 04:20:10,235 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 04:20:10" (3/3) ... [2022-04-28 04:20:10,236 INFO L111 eAbstractionObserver]: Analyzing ICFG hard-u.c [2022-04-28 04:20:10,245 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 04:20:10,245 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 04:20:10,300 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 04:20:10,304 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@60deced2, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@12c9d905 [2022-04-28 04:20:10,304 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 04:20:10,317 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 20 states have internal predecessors, (29), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 04:20:10,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 04:20:10,322 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:20:10,322 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:20:10,323 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:20:10,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:20:10,329 INFO L85 PathProgramCache]: Analyzing trace with hash -977830905, now seen corresponding path program 1 times [2022-04-28 04:20:10,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:20:10,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [207415638] [2022-04-28 04:20:10,345 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 04:20:10,346 INFO L85 PathProgramCache]: Analyzing trace with hash -977830905, now seen corresponding path program 2 times [2022-04-28 04:20:10,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:20:10,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164819321] [2022-04-28 04:20:10,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:20:10,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:20:10,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:20:10,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:20:10,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:20:10,503 INFO L290 TraceCheckUtils]: 0: Hoare triple {47#(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(9, 2);call #Ultimate.allocInit(12, 3); {38#true} is VALID [2022-04-28 04:20:10,503 INFO L290 TraceCheckUtils]: 1: Hoare triple {38#true} assume true; {38#true} is VALID [2022-04-28 04:20:10,504 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {38#true} {38#true} #94#return; {38#true} is VALID [2022-04-28 04:20:10,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 04:20:10,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:20:10,520 INFO L290 TraceCheckUtils]: 0: Hoare triple {38#true} ~cond := #in~cond; {38#true} is VALID [2022-04-28 04:20:10,521 INFO L290 TraceCheckUtils]: 1: Hoare triple {38#true} assume 0 == ~cond;assume false; {39#false} is VALID [2022-04-28 04:20:10,521 INFO L290 TraceCheckUtils]: 2: Hoare triple {39#false} assume true; {39#false} is VALID [2022-04-28 04:20:10,522 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {39#false} {38#true} #78#return; {39#false} is VALID [2022-04-28 04:20:10,524 INFO L272 TraceCheckUtils]: 0: Hoare triple {38#true} call ULTIMATE.init(); {47#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:20:10,524 INFO L290 TraceCheckUtils]: 1: Hoare triple {47#(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(9, 2);call #Ultimate.allocInit(12, 3); {38#true} is VALID [2022-04-28 04:20:10,524 INFO L290 TraceCheckUtils]: 2: Hoare triple {38#true} assume true; {38#true} is VALID [2022-04-28 04:20:10,524 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38#true} {38#true} #94#return; {38#true} is VALID [2022-04-28 04:20:10,524 INFO L272 TraceCheckUtils]: 4: Hoare triple {38#true} call #t~ret6 := main(); {38#true} is VALID [2022-04-28 04:20:10,524 INFO L290 TraceCheckUtils]: 5: Hoare triple {38#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {38#true} is VALID [2022-04-28 04:20:10,525 INFO L272 TraceCheckUtils]: 6: Hoare triple {38#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {38#true} is VALID [2022-04-28 04:20:10,525 INFO L290 TraceCheckUtils]: 7: Hoare triple {38#true} ~cond := #in~cond; {38#true} is VALID [2022-04-28 04:20:10,531 INFO L290 TraceCheckUtils]: 8: Hoare triple {38#true} assume 0 == ~cond;assume false; {39#false} is VALID [2022-04-28 04:20:10,532 INFO L290 TraceCheckUtils]: 9: Hoare triple {39#false} assume true; {39#false} is VALID [2022-04-28 04:20:10,532 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {39#false} {38#true} #78#return; {39#false} is VALID [2022-04-28 04:20:10,532 INFO L290 TraceCheckUtils]: 11: Hoare triple {39#false} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {39#false} is VALID [2022-04-28 04:20:10,532 INFO L290 TraceCheckUtils]: 12: Hoare triple {39#false} assume !false; {39#false} is VALID [2022-04-28 04:20:10,532 INFO L272 TraceCheckUtils]: 13: Hoare triple {39#false} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {39#false} is VALID [2022-04-28 04:20:10,533 INFO L290 TraceCheckUtils]: 14: Hoare triple {39#false} ~cond := #in~cond; {39#false} is VALID [2022-04-28 04:20:10,533 INFO L290 TraceCheckUtils]: 15: Hoare triple {39#false} assume 0 == ~cond; {39#false} is VALID [2022-04-28 04:20:10,533 INFO L290 TraceCheckUtils]: 16: Hoare triple {39#false} assume !false; {39#false} is VALID [2022-04-28 04:20:10,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:20:10,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:20:10,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164819321] [2022-04-28 04:20:10,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164819321] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:20:10,534 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:20:10,535 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 04:20:10,536 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:20:10,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [207415638] [2022-04-28 04:20:10,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [207415638] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:20:10,537 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:20:10,537 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 04:20:10,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527627987] [2022-04-28 04:20:10,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:20:10,541 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-28 04:20:10,542 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:20:10,544 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 04:20:10,560 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:20:10,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 04:20:10,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:20:10,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 04:20:10,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 04:20:10,579 INFO L87 Difference]: Start difference. First operand has 35 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 20 states have internal predecessors, (29), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 04:20:10,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:20:10,696 INFO L93 Difference]: Finished difference Result 61 states and 95 transitions. [2022-04-28 04:20:10,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 04:20:10,697 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-28 04:20:10,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:20:10,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 04:20:10,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions. [2022-04-28 04:20:10,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 04:20:10,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions. [2022-04-28 04:20:10,726 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 95 transitions. [2022-04-28 04:20:10,850 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:20:10,860 INFO L225 Difference]: With dead ends: 61 [2022-04-28 04:20:10,860 INFO L226 Difference]: Without dead ends: 30 [2022-04-28 04:20:10,863 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 04:20:10,867 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 20 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 04:20:10,868 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 38 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 04:20:10,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-28 04:20:10,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-04-28 04:20:10,906 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:20:10,908 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 30 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 04:20:10,908 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 30 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 04:20:10,909 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 30 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 04:20:10,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:20:10,914 INFO L93 Difference]: Finished difference Result 30 states and 38 transitions. [2022-04-28 04:20:10,914 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2022-04-28 04:20:10,915 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:20:10,915 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:20:10,915 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 30 states. [2022-04-28 04:20:10,916 INFO L87 Difference]: Start difference. First operand has 30 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 30 states. [2022-04-28 04:20:10,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:20:10,922 INFO L93 Difference]: Finished difference Result 30 states and 38 transitions. [2022-04-28 04:20:10,924 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2022-04-28 04:20:10,924 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:20:10,928 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:20:10,928 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:20:10,929 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:20:10,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 04:20:10,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2022-04-28 04:20:10,932 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 17 [2022-04-28 04:20:10,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:20:10,932 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2022-04-28 04:20:10,932 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 04:20:10,932 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 38 transitions. [2022-04-28 04:20:10,975 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:20:10,976 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2022-04-28 04:20:10,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 04:20:10,976 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:20:10,976 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:20:10,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 04:20:10,977 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:20:10,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:20:10,977 INFO L85 PathProgramCache]: Analyzing trace with hash -297772535, now seen corresponding path program 1 times [2022-04-28 04:20:10,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:20:10,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [547034502] [2022-04-28 04:20:10,979 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 04:20:10,979 INFO L85 PathProgramCache]: Analyzing trace with hash -297772535, now seen corresponding path program 2 times [2022-04-28 04:20:10,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:20:10,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529159142] [2022-04-28 04:20:10,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:20:10,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:20:11,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:20:11,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:20:11,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:20:11,082 INFO L290 TraceCheckUtils]: 0: Hoare triple {304#(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(9, 2);call #Ultimate.allocInit(12, 3); {292#true} is VALID [2022-04-28 04:20:11,083 INFO L290 TraceCheckUtils]: 1: Hoare triple {292#true} assume true; {292#true} is VALID [2022-04-28 04:20:11,083 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {292#true} {292#true} #94#return; {292#true} is VALID [2022-04-28 04:20:11,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 04:20:11,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:20:11,093 INFO L290 TraceCheckUtils]: 0: Hoare triple {292#true} ~cond := #in~cond; {292#true} is VALID [2022-04-28 04:20:11,093 INFO L290 TraceCheckUtils]: 1: Hoare triple {292#true} assume !(0 == ~cond); {292#true} is VALID [2022-04-28 04:20:11,093 INFO L290 TraceCheckUtils]: 2: Hoare triple {292#true} assume true; {292#true} is VALID [2022-04-28 04:20:11,094 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {292#true} {292#true} #78#return; {292#true} is VALID [2022-04-28 04:20:11,094 INFO L272 TraceCheckUtils]: 0: Hoare triple {292#true} call ULTIMATE.init(); {304#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:20:11,094 INFO L290 TraceCheckUtils]: 1: Hoare triple {304#(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(9, 2);call #Ultimate.allocInit(12, 3); {292#true} is VALID [2022-04-28 04:20:11,095 INFO L290 TraceCheckUtils]: 2: Hoare triple {292#true} assume true; {292#true} is VALID [2022-04-28 04:20:11,095 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {292#true} {292#true} #94#return; {292#true} is VALID [2022-04-28 04:20:11,095 INFO L272 TraceCheckUtils]: 4: Hoare triple {292#true} call #t~ret6 := main(); {292#true} is VALID [2022-04-28 04:20:11,095 INFO L290 TraceCheckUtils]: 5: Hoare triple {292#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {292#true} is VALID [2022-04-28 04:20:11,095 INFO L272 TraceCheckUtils]: 6: Hoare triple {292#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {292#true} is VALID [2022-04-28 04:20:11,095 INFO L290 TraceCheckUtils]: 7: Hoare triple {292#true} ~cond := #in~cond; {292#true} is VALID [2022-04-28 04:20:11,095 INFO L290 TraceCheckUtils]: 8: Hoare triple {292#true} assume !(0 == ~cond); {292#true} is VALID [2022-04-28 04:20:11,096 INFO L290 TraceCheckUtils]: 9: Hoare triple {292#true} assume true; {292#true} is VALID [2022-04-28 04:20:11,096 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {292#true} {292#true} #78#return; {292#true} is VALID [2022-04-28 04:20:11,096 INFO L290 TraceCheckUtils]: 11: Hoare triple {292#true} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {301#(= main_~q~0 0)} is VALID [2022-04-28 04:20:11,097 INFO L290 TraceCheckUtils]: 12: Hoare triple {301#(= main_~q~0 0)} assume !false; {301#(= main_~q~0 0)} is VALID [2022-04-28 04:20:11,098 INFO L272 TraceCheckUtils]: 13: Hoare triple {301#(= main_~q~0 0)} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {302#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:20:11,098 INFO L290 TraceCheckUtils]: 14: Hoare triple {302#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {303#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 04:20:11,099 INFO L290 TraceCheckUtils]: 15: Hoare triple {303#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {293#false} is VALID [2022-04-28 04:20:11,099 INFO L290 TraceCheckUtils]: 16: Hoare triple {293#false} assume !false; {293#false} is VALID [2022-04-28 04:20:11,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:20:11,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:20:11,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529159142] [2022-04-28 04:20:11,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529159142] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:20:11,100 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:20:11,100 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 04:20:11,100 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:20:11,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [547034502] [2022-04-28 04:20:11,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [547034502] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:20:11,101 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:20:11,101 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 04:20:11,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479538710] [2022-04-28 04:20:11,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:20:11,103 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-28 04:20:11,103 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:20:11,104 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 04:20:11,116 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:20:11,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 04:20:11,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:20:11,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 04:20:11,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 04:20:11,117 INFO L87 Difference]: Start difference. First operand 30 states and 38 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 04:20:11,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:20:11,542 INFO L93 Difference]: Finished difference Result 43 states and 55 transitions. [2022-04-28 04:20:11,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 04:20:11,543 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-28 04:20:11,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:20:11,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 04:20:11,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 55 transitions. [2022-04-28 04:20:11,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 04:20:11,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 55 transitions. [2022-04-28 04:20:11,550 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 55 transitions. [2022-04-28 04:20:11,608 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:20:11,611 INFO L225 Difference]: With dead ends: 43 [2022-04-28 04:20:11,611 INFO L226 Difference]: Without dead ends: 41 [2022-04-28 04:20:11,611 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-28 04:20:11,613 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 37 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 04:20:11,616 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 45 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 04:20:11,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-04-28 04:20:11,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 34. [2022-04-28 04:20:11,629 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:20:11,629 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand has 34 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 04:20:11,629 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand has 34 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 04:20:11,630 INFO L87 Difference]: Start difference. First operand 41 states. Second operand has 34 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 04:20:11,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:20:11,636 INFO L93 Difference]: Finished difference Result 41 states and 53 transitions. [2022-04-28 04:20:11,636 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 53 transitions. [2022-04-28 04:20:11,641 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:20:11,641 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:20:11,642 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 41 states. [2022-04-28 04:20:11,643 INFO L87 Difference]: Start difference. First operand has 34 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 41 states. [2022-04-28 04:20:11,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:20:11,647 INFO L93 Difference]: Finished difference Result 41 states and 53 transitions. [2022-04-28 04:20:11,647 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 53 transitions. [2022-04-28 04:20:11,647 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:20:11,647 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:20:11,647 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:20:11,647 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:20:11,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 04:20:11,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2022-04-28 04:20:11,649 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 41 transitions. Word has length 17 [2022-04-28 04:20:11,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:20:11,649 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 41 transitions. [2022-04-28 04:20:11,649 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 04:20:11,649 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 41 transitions. [2022-04-28 04:20:11,692 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:20:11,693 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2022-04-28 04:20:11,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 04:20:11,694 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:20:11,697 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:20:11,697 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 04:20:11,699 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:20:11,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:20:11,700 INFO L85 PathProgramCache]: Analyzing trace with hash -1294462534, now seen corresponding path program 1 times [2022-04-28 04:20:11,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:20:11,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [630460779] [2022-04-28 04:20:11,702 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 04:20:11,702 INFO L85 PathProgramCache]: Analyzing trace with hash -1294462534, now seen corresponding path program 2 times [2022-04-28 04:20:11,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:20:11,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918368030] [2022-04-28 04:20:11,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:20:11,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:20:11,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:20:11,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:20:11,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:20:11,799 INFO L290 TraceCheckUtils]: 0: Hoare triple {567#(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(9, 2);call #Ultimate.allocInit(12, 3); {551#true} is VALID [2022-04-28 04:20:11,799 INFO L290 TraceCheckUtils]: 1: Hoare triple {551#true} assume true; {551#true} is VALID [2022-04-28 04:20:11,800 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {551#true} {551#true} #94#return; {551#true} is VALID [2022-04-28 04:20:11,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 04:20:11,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:20:11,807 INFO L290 TraceCheckUtils]: 0: Hoare triple {551#true} ~cond := #in~cond; {551#true} is VALID [2022-04-28 04:20:11,807 INFO L290 TraceCheckUtils]: 1: Hoare triple {551#true} assume !(0 == ~cond); {551#true} is VALID [2022-04-28 04:20:11,807 INFO L290 TraceCheckUtils]: 2: Hoare triple {551#true} assume true; {551#true} is VALID [2022-04-28 04:20:11,807 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {551#true} {551#true} #78#return; {551#true} is VALID [2022-04-28 04:20:11,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-04-28 04:20:11,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:20:11,812 INFO L290 TraceCheckUtils]: 0: Hoare triple {551#true} ~cond := #in~cond; {551#true} is VALID [2022-04-28 04:20:11,812 INFO L290 TraceCheckUtils]: 1: Hoare triple {551#true} assume !(0 == ~cond); {551#true} is VALID [2022-04-28 04:20:11,812 INFO L290 TraceCheckUtils]: 2: Hoare triple {551#true} assume true; {551#true} is VALID [2022-04-28 04:20:11,813 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {551#true} {560#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} #80#return; {560#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} is VALID [2022-04-28 04:20:11,813 INFO L272 TraceCheckUtils]: 0: Hoare triple {551#true} call ULTIMATE.init(); {567#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:20:11,814 INFO L290 TraceCheckUtils]: 1: Hoare triple {567#(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(9, 2);call #Ultimate.allocInit(12, 3); {551#true} is VALID [2022-04-28 04:20:11,814 INFO L290 TraceCheckUtils]: 2: Hoare triple {551#true} assume true; {551#true} is VALID [2022-04-28 04:20:11,814 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {551#true} {551#true} #94#return; {551#true} is VALID [2022-04-28 04:20:11,814 INFO L272 TraceCheckUtils]: 4: Hoare triple {551#true} call #t~ret6 := main(); {551#true} is VALID [2022-04-28 04:20:11,814 INFO L290 TraceCheckUtils]: 5: Hoare triple {551#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {551#true} is VALID [2022-04-28 04:20:11,814 INFO L272 TraceCheckUtils]: 6: Hoare triple {551#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {551#true} is VALID [2022-04-28 04:20:11,814 INFO L290 TraceCheckUtils]: 7: Hoare triple {551#true} ~cond := #in~cond; {551#true} is VALID [2022-04-28 04:20:11,815 INFO L290 TraceCheckUtils]: 8: Hoare triple {551#true} assume !(0 == ~cond); {551#true} is VALID [2022-04-28 04:20:11,815 INFO L290 TraceCheckUtils]: 9: Hoare triple {551#true} assume true; {551#true} is VALID [2022-04-28 04:20:11,815 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {551#true} {551#true} #78#return; {551#true} is VALID [2022-04-28 04:20:11,815 INFO L290 TraceCheckUtils]: 11: Hoare triple {551#true} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {560#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} is VALID [2022-04-28 04:20:11,816 INFO L290 TraceCheckUtils]: 12: Hoare triple {560#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} assume !false; {560#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} is VALID [2022-04-28 04:20:11,816 INFO L272 TraceCheckUtils]: 13: Hoare triple {560#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {551#true} is VALID [2022-04-28 04:20:11,816 INFO L290 TraceCheckUtils]: 14: Hoare triple {551#true} ~cond := #in~cond; {551#true} is VALID [2022-04-28 04:20:11,816 INFO L290 TraceCheckUtils]: 15: Hoare triple {551#true} assume !(0 == ~cond); {551#true} is VALID [2022-04-28 04:20:11,816 INFO L290 TraceCheckUtils]: 16: Hoare triple {551#true} assume true; {551#true} is VALID [2022-04-28 04:20:11,817 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {551#true} {560#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} #80#return; {560#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} is VALID [2022-04-28 04:20:11,817 INFO L272 TraceCheckUtils]: 18: Hoare triple {560#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} call __VERIFIER_assert((if ~r~0 % 4294967296 == ~A~0 % 4294967296 then 1 else 0)); {565#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:20:11,818 INFO L290 TraceCheckUtils]: 19: Hoare triple {565#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {566#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 04:20:11,818 INFO L290 TraceCheckUtils]: 20: Hoare triple {566#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {552#false} is VALID [2022-04-28 04:20:11,818 INFO L290 TraceCheckUtils]: 21: Hoare triple {552#false} assume !false; {552#false} is VALID [2022-04-28 04:20:11,819 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:20:11,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:20:11,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918368030] [2022-04-28 04:20:11,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918368030] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:20:11,819 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:20:11,819 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 04:20:11,819 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:20:11,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [630460779] [2022-04-28 04:20:11,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [630460779] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:20:11,820 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:20:11,820 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 04:20:11,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975022782] [2022-04-28 04:20:11,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:20:11,820 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-28 04:20:11,820 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:20:11,821 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 04:20:11,836 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:20:11,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 04:20:11,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:20:11,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 04:20:11,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 04:20:11,837 INFO L87 Difference]: Start difference. First operand 34 states and 41 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 04:20:12,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:20:12,207 INFO L93 Difference]: Finished difference Result 47 states and 58 transitions. [2022-04-28 04:20:12,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 04:20:12,207 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-28 04:20:12,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:20:12,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 04:20:12,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 55 transitions. [2022-04-28 04:20:12,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 04:20:12,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 55 transitions. [2022-04-28 04:20:12,211 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 55 transitions. [2022-04-28 04:20:12,267 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:20:12,268 INFO L225 Difference]: With dead ends: 47 [2022-04-28 04:20:12,268 INFO L226 Difference]: Without dead ends: 45 [2022-04-28 04:20:12,268 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-28 04:20:12,269 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 32 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 04:20:12,269 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 45 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 04:20:12,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-28 04:20:12,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 38. [2022-04-28 04:20:12,275 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:20:12,275 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 38 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 04:20:12,275 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 38 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 04:20:12,276 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 38 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 04:20:12,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:20:12,277 INFO L93 Difference]: Finished difference Result 45 states and 56 transitions. [2022-04-28 04:20:12,277 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 56 transitions. [2022-04-28 04:20:12,278 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:20:12,278 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:20:12,278 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 45 states. [2022-04-28 04:20:12,278 INFO L87 Difference]: Start difference. First operand has 38 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 45 states. [2022-04-28 04:20:12,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:20:12,280 INFO L93 Difference]: Finished difference Result 45 states and 56 transitions. [2022-04-28 04:20:12,280 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 56 transitions. [2022-04-28 04:20:12,280 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:20:12,280 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:20:12,280 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:20:12,280 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:20:12,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 04:20:12,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2022-04-28 04:20:12,282 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 22 [2022-04-28 04:20:12,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:20:12,282 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions. [2022-04-28 04:20:12,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 04:20:12,282 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 44 transitions. [2022-04-28 04:20:12,318 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-28 04:20:12,318 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2022-04-28 04:20:12,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-28 04:20:12,319 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:20:12,319 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:20:12,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-28 04:20:12,319 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:20:12,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:20:12,319 INFO L85 PathProgramCache]: Analyzing trace with hash -1449027479, now seen corresponding path program 1 times [2022-04-28 04:20:12,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:20:12,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [147250505] [2022-04-28 04:20:12,320 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 04:20:12,320 INFO L85 PathProgramCache]: Analyzing trace with hash -1449027479, now seen corresponding path program 2 times [2022-04-28 04:20:12,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:20:12,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901160048] [2022-04-28 04:20:12,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:20:12,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:20:12,329 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 04:20:12,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1988714184] [2022-04-28 04:20:12,329 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 04:20:12,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:20:12,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:20:12,340 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 04:20:12,341 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-28 04:20:12,373 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 04:20:12,373 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 04:20:12,375 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 04:20:12,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:20:12,400 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:20:12,556 INFO L272 TraceCheckUtils]: 0: Hoare triple {838#true} call ULTIMATE.init(); {838#true} is VALID [2022-04-28 04:20:12,557 INFO L290 TraceCheckUtils]: 1: Hoare triple {838#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {838#true} is VALID [2022-04-28 04:20:12,557 INFO L290 TraceCheckUtils]: 2: Hoare triple {838#true} assume true; {838#true} is VALID [2022-04-28 04:20:12,557 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {838#true} {838#true} #94#return; {838#true} is VALID [2022-04-28 04:20:12,557 INFO L272 TraceCheckUtils]: 4: Hoare triple {838#true} call #t~ret6 := main(); {838#true} is VALID [2022-04-28 04:20:12,557 INFO L290 TraceCheckUtils]: 5: Hoare triple {838#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {838#true} is VALID [2022-04-28 04:20:12,557 INFO L272 TraceCheckUtils]: 6: Hoare triple {838#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {838#true} is VALID [2022-04-28 04:20:12,557 INFO L290 TraceCheckUtils]: 7: Hoare triple {838#true} ~cond := #in~cond; {838#true} is VALID [2022-04-28 04:20:12,558 INFO L290 TraceCheckUtils]: 8: Hoare triple {838#true} assume !(0 == ~cond); {838#true} is VALID [2022-04-28 04:20:12,558 INFO L290 TraceCheckUtils]: 9: Hoare triple {838#true} assume true; {838#true} is VALID [2022-04-28 04:20:12,558 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {838#true} {838#true} #78#return; {838#true} is VALID [2022-04-28 04:20:12,558 INFO L290 TraceCheckUtils]: 11: Hoare triple {838#true} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {876#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 04:20:12,559 INFO L290 TraceCheckUtils]: 12: Hoare triple {876#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} assume !false; {876#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 04:20:12,559 INFO L272 TraceCheckUtils]: 13: Hoare triple {876#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {838#true} is VALID [2022-04-28 04:20:12,559 INFO L290 TraceCheckUtils]: 14: Hoare triple {838#true} ~cond := #in~cond; {838#true} is VALID [2022-04-28 04:20:12,559 INFO L290 TraceCheckUtils]: 15: Hoare triple {838#true} assume !(0 == ~cond); {838#true} is VALID [2022-04-28 04:20:12,559 INFO L290 TraceCheckUtils]: 16: Hoare triple {838#true} assume true; {838#true} is VALID [2022-04-28 04:20:12,560 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {838#true} {876#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} #80#return; {876#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 04:20:12,560 INFO L272 TraceCheckUtils]: 18: Hoare triple {876#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~r~0 % 4294967296 == ~A~0 % 4294967296 then 1 else 0)); {838#true} is VALID [2022-04-28 04:20:12,560 INFO L290 TraceCheckUtils]: 19: Hoare triple {838#true} ~cond := #in~cond; {838#true} is VALID [2022-04-28 04:20:12,560 INFO L290 TraceCheckUtils]: 20: Hoare triple {838#true} assume !(0 == ~cond); {838#true} is VALID [2022-04-28 04:20:12,560 INFO L290 TraceCheckUtils]: 21: Hoare triple {838#true} assume true; {838#true} is VALID [2022-04-28 04:20:12,561 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {838#true} {876#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} #82#return; {876#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 04:20:12,562 INFO L272 TraceCheckUtils]: 23: Hoare triple {876#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~d~0 % 4294967296 == ~B~0 * ~p~0 % 4294967296 then 1 else 0)); {913#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 04:20:12,562 INFO L290 TraceCheckUtils]: 24: Hoare triple {913#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {917#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:20:12,562 INFO L290 TraceCheckUtils]: 25: Hoare triple {917#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {839#false} is VALID [2022-04-28 04:20:12,562 INFO L290 TraceCheckUtils]: 26: Hoare triple {839#false} assume !false; {839#false} is VALID [2022-04-28 04:20:12,563 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 04:20:12,563 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 04:20:12,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:20:12,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901160048] [2022-04-28 04:20:12,563 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 04:20:12,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1988714184] [2022-04-28 04:20:12,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1988714184] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:20:12,563 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:20:12,563 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 04:20:12,564 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:20:12,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [147250505] [2022-04-28 04:20:12,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [147250505] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:20:12,564 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:20:12,564 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 04:20:12,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688054159] [2022-04-28 04:20:12,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:20:12,565 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 27 [2022-04-28 04:20:12,565 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:20:12,565 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 04:20:12,583 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:20:12,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 04:20:12,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:20:12,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 04:20:12,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 04:20:12,584 INFO L87 Difference]: Start difference. First operand 38 states and 44 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 04:20:14,704 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-28 04:20:14,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:20:14,939 INFO L93 Difference]: Finished difference Result 55 states and 68 transitions. [2022-04-28 04:20:14,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 04:20:14,940 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 27 [2022-04-28 04:20:14,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:20:14,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 04:20:14,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 62 transitions. [2022-04-28 04:20:14,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 04:20:14,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 62 transitions. [2022-04-28 04:20:14,942 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 62 transitions. [2022-04-28 04:20:14,997 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:20:14,999 INFO L225 Difference]: With dead ends: 55 [2022-04-28 04:20:14,999 INFO L226 Difference]: Without dead ends: 52 [2022-04-28 04:20:14,999 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 04:20:15,000 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 8 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-04-28 04:20:15,000 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 124 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 1 Unknown, 0 Unchecked, 2.1s Time] [2022-04-28 04:20:15,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-28 04:20:15,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2022-04-28 04:20:15,011 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:20:15,011 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 52 states, 29 states have (on average 1.206896551724138) internal successors, (35), 31 states have internal predecessors, (35), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 04:20:15,011 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 52 states, 29 states have (on average 1.206896551724138) internal successors, (35), 31 states have internal predecessors, (35), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 04:20:15,012 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 52 states, 29 states have (on average 1.206896551724138) internal successors, (35), 31 states have internal predecessors, (35), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 04:20:15,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:20:15,013 INFO L93 Difference]: Finished difference Result 52 states and 64 transitions. [2022-04-28 04:20:15,013 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 64 transitions. [2022-04-28 04:20:15,014 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:20:15,014 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:20:15,014 INFO L74 IsIncluded]: Start isIncluded. First operand has 52 states, 29 states have (on average 1.206896551724138) internal successors, (35), 31 states have internal predecessors, (35), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 52 states. [2022-04-28 04:20:15,014 INFO L87 Difference]: Start difference. First operand has 52 states, 29 states have (on average 1.206896551724138) internal successors, (35), 31 states have internal predecessors, (35), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 52 states. [2022-04-28 04:20:15,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:20:15,016 INFO L93 Difference]: Finished difference Result 52 states and 64 transitions. [2022-04-28 04:20:15,016 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 64 transitions. [2022-04-28 04:20:15,016 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:20:15,017 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:20:15,017 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:20:15,017 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:20:15,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 29 states have (on average 1.206896551724138) internal successors, (35), 31 states have internal predecessors, (35), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 04:20:15,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 64 transitions. [2022-04-28 04:20:15,019 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 64 transitions. Word has length 27 [2022-04-28 04:20:15,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:20:15,019 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 64 transitions. [2022-04-28 04:20:15,019 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 04:20:15,019 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 64 transitions. [2022-04-28 04:20:15,090 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:20:15,090 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 64 transitions. [2022-04-28 04:20:15,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-28 04:20:15,090 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:20:15,090 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:20:15,114 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-28 04:20:15,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:20:15,307 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:20:15,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:20:15,308 INFO L85 PathProgramCache]: Analyzing trace with hash 905213191, now seen corresponding path program 1 times [2022-04-28 04:20:15,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:20:15,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1663465358] [2022-04-28 04:20:15,308 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 04:20:15,308 INFO L85 PathProgramCache]: Analyzing trace with hash 905213191, now seen corresponding path program 2 times [2022-04-28 04:20:15,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:20:15,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112823742] [2022-04-28 04:20:15,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:20:15,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:20:15,318 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 04:20:15,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [432784262] [2022-04-28 04:20:15,318 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 04:20:15,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:20:15,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:20:15,325 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 04:20:15,335 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-28 04:20:15,371 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 04:20:15,371 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 04:20:15,372 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-28 04:20:15,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:20:15,381 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:20:15,910 INFO L272 TraceCheckUtils]: 0: Hoare triple {1243#true} call ULTIMATE.init(); {1243#true} is VALID [2022-04-28 04:20:15,910 INFO L290 TraceCheckUtils]: 1: Hoare triple {1243#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {1243#true} is VALID [2022-04-28 04:20:15,911 INFO L290 TraceCheckUtils]: 2: Hoare triple {1243#true} assume true; {1243#true} is VALID [2022-04-28 04:20:15,911 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1243#true} {1243#true} #94#return; {1243#true} is VALID [2022-04-28 04:20:15,911 INFO L272 TraceCheckUtils]: 4: Hoare triple {1243#true} call #t~ret6 := main(); {1243#true} is VALID [2022-04-28 04:20:15,911 INFO L290 TraceCheckUtils]: 5: Hoare triple {1243#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {1243#true} is VALID [2022-04-28 04:20:15,911 INFO L272 TraceCheckUtils]: 6: Hoare triple {1243#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {1243#true} is VALID [2022-04-28 04:20:15,911 INFO L290 TraceCheckUtils]: 7: Hoare triple {1243#true} ~cond := #in~cond; {1243#true} is VALID [2022-04-28 04:20:15,911 INFO L290 TraceCheckUtils]: 8: Hoare triple {1243#true} assume !(0 == ~cond); {1243#true} is VALID [2022-04-28 04:20:15,911 INFO L290 TraceCheckUtils]: 9: Hoare triple {1243#true} assume true; {1243#true} is VALID [2022-04-28 04:20:15,912 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1243#true} {1243#true} #78#return; {1243#true} is VALID [2022-04-28 04:20:15,912 INFO L290 TraceCheckUtils]: 11: Hoare triple {1243#true} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {1281#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} is VALID [2022-04-28 04:20:15,922 INFO L290 TraceCheckUtils]: 12: Hoare triple {1281#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} assume !false; {1281#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} is VALID [2022-04-28 04:20:15,922 INFO L272 TraceCheckUtils]: 13: Hoare triple {1281#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {1243#true} is VALID [2022-04-28 04:20:15,922 INFO L290 TraceCheckUtils]: 14: Hoare triple {1243#true} ~cond := #in~cond; {1243#true} is VALID [2022-04-28 04:20:15,923 INFO L290 TraceCheckUtils]: 15: Hoare triple {1243#true} assume !(0 == ~cond); {1243#true} is VALID [2022-04-28 04:20:15,923 INFO L290 TraceCheckUtils]: 16: Hoare triple {1243#true} assume true; {1243#true} is VALID [2022-04-28 04:20:15,923 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1243#true} {1281#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} #80#return; {1281#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} is VALID [2022-04-28 04:20:15,923 INFO L272 TraceCheckUtils]: 18: Hoare triple {1281#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} call __VERIFIER_assert((if ~r~0 % 4294967296 == ~A~0 % 4294967296 then 1 else 0)); {1243#true} is VALID [2022-04-28 04:20:15,923 INFO L290 TraceCheckUtils]: 19: Hoare triple {1243#true} ~cond := #in~cond; {1243#true} is VALID [2022-04-28 04:20:15,924 INFO L290 TraceCheckUtils]: 20: Hoare triple {1243#true} assume !(0 == ~cond); {1243#true} is VALID [2022-04-28 04:20:15,924 INFO L290 TraceCheckUtils]: 21: Hoare triple {1243#true} assume true; {1243#true} is VALID [2022-04-28 04:20:15,924 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1243#true} {1281#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} #82#return; {1281#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} is VALID [2022-04-28 04:20:15,924 INFO L272 TraceCheckUtils]: 23: Hoare triple {1281#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} call __VERIFIER_assert((if ~d~0 % 4294967296 == ~B~0 * ~p~0 % 4294967296 then 1 else 0)); {1243#true} is VALID [2022-04-28 04:20:15,924 INFO L290 TraceCheckUtils]: 24: Hoare triple {1243#true} ~cond := #in~cond; {1243#true} is VALID [2022-04-28 04:20:15,925 INFO L290 TraceCheckUtils]: 25: Hoare triple {1243#true} assume !(0 == ~cond); {1243#true} is VALID [2022-04-28 04:20:15,925 INFO L290 TraceCheckUtils]: 26: Hoare triple {1243#true} assume true; {1243#true} is VALID [2022-04-28 04:20:15,925 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1243#true} {1281#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} #84#return; {1281#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} is VALID [2022-04-28 04:20:15,926 INFO L290 TraceCheckUtils]: 28: Hoare triple {1281#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} assume !(~r~0 % 4294967296 >= ~d~0 % 4294967296); {1333#(and (= main_~A~0 main_~r~0) (not (<= (mod main_~B~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0))} is VALID [2022-04-28 04:20:15,926 INFO L290 TraceCheckUtils]: 29: Hoare triple {1333#(and (= main_~A~0 main_~r~0) (not (<= (mod main_~B~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0))} assume !false; {1333#(and (= main_~A~0 main_~r~0) (not (<= (mod main_~B~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0))} is VALID [2022-04-28 04:20:15,927 INFO L272 TraceCheckUtils]: 30: Hoare triple {1333#(and (= main_~A~0 main_~r~0) (not (<= (mod main_~B~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~B~0 + ~r~0) % 4294967296 then 1 else 0)); {1340#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 04:20:15,927 INFO L290 TraceCheckUtils]: 31: Hoare triple {1340#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1344#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:20:15,927 INFO L290 TraceCheckUtils]: 32: Hoare triple {1344#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1244#false} is VALID [2022-04-28 04:20:15,928 INFO L290 TraceCheckUtils]: 33: Hoare triple {1244#false} assume !false; {1244#false} is VALID [2022-04-28 04:20:15,928 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-28 04:20:15,928 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 04:20:15,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:20:15,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112823742] [2022-04-28 04:20:15,928 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 04:20:15,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [432784262] [2022-04-28 04:20:15,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [432784262] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:20:15,928 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:20:15,929 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 04:20:15,929 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:20:15,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1663465358] [2022-04-28 04:20:15,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1663465358] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:20:15,929 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:20:15,929 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 04:20:15,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044103993] [2022-04-28 04:20:15,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:20:15,930 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 34 [2022-04-28 04:20:15,930 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:20:15,930 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 04:20:15,954 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:20:15,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 04:20:15,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:20:15,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 04:20:15,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 04:20:15,955 INFO L87 Difference]: Start difference. First operand 52 states and 64 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 04:20:17,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:20:17,351 INFO L93 Difference]: Finished difference Result 73 states and 87 transitions. [2022-04-28 04:20:17,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 04:20:17,352 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 34 [2022-04-28 04:20:17,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:20:17,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 04:20:17,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 72 transitions. [2022-04-28 04:20:17,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 04:20:17,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 72 transitions. [2022-04-28 04:20:17,355 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 72 transitions. [2022-04-28 04:20:17,424 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:20:17,426 INFO L225 Difference]: With dead ends: 73 [2022-04-28 04:20:17,426 INFO L226 Difference]: Without dead ends: 70 [2022-04-28 04:20:17,426 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-28 04:20:17,427 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 12 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 04:20:17,427 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 135 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 04:20:17,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-04-28 04:20:17,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2022-04-28 04:20:17,462 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:20:17,462 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand has 69 states, 41 states have (on average 1.170731707317073) internal successors, (48), 43 states have internal predecessors, (48), 18 states have call successors, (18), 10 states have call predecessors, (18), 9 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 04:20:17,462 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand has 69 states, 41 states have (on average 1.170731707317073) internal successors, (48), 43 states have internal predecessors, (48), 18 states have call successors, (18), 10 states have call predecessors, (18), 9 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 04:20:17,463 INFO L87 Difference]: Start difference. First operand 70 states. Second operand has 69 states, 41 states have (on average 1.170731707317073) internal successors, (48), 43 states have internal predecessors, (48), 18 states have call successors, (18), 10 states have call predecessors, (18), 9 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 04:20:17,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:20:17,465 INFO L93 Difference]: Finished difference Result 70 states and 83 transitions. [2022-04-28 04:20:17,465 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 83 transitions. [2022-04-28 04:20:17,465 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:20:17,465 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:20:17,465 INFO L74 IsIncluded]: Start isIncluded. First operand has 69 states, 41 states have (on average 1.170731707317073) internal successors, (48), 43 states have internal predecessors, (48), 18 states have call successors, (18), 10 states have call predecessors, (18), 9 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) Second operand 70 states. [2022-04-28 04:20:17,466 INFO L87 Difference]: Start difference. First operand has 69 states, 41 states have (on average 1.170731707317073) internal successors, (48), 43 states have internal predecessors, (48), 18 states have call successors, (18), 10 states have call predecessors, (18), 9 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) Second operand 70 states. [2022-04-28 04:20:17,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:20:17,468 INFO L93 Difference]: Finished difference Result 70 states and 83 transitions. [2022-04-28 04:20:17,468 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 83 transitions. [2022-04-28 04:20:17,468 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:20:17,468 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:20:17,468 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:20:17,468 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:20:17,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 41 states have (on average 1.170731707317073) internal successors, (48), 43 states have internal predecessors, (48), 18 states have call successors, (18), 10 states have call predecessors, (18), 9 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 04:20:17,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 82 transitions. [2022-04-28 04:20:17,470 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 82 transitions. Word has length 34 [2022-04-28 04:20:17,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:20:17,470 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 82 transitions. [2022-04-28 04:20:17,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 04:20:17,471 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 69 states and 82 transitions. [2022-04-28 04:20:17,580 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:20:17,580 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 82 transitions. [2022-04-28 04:20:17,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-28 04:20:17,581 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:20:17,581 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:20:17,597 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-28 04:20:17,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:20:17,787 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:20:17,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:20:17,788 INFO L85 PathProgramCache]: Analyzing trace with hash -1576096488, now seen corresponding path program 1 times [2022-04-28 04:20:17,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:20:17,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [736501456] [2022-04-28 04:20:18,691 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:20:18,691 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-28 04:20:18,691 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 04:20:18,691 INFO L85 PathProgramCache]: Analyzing trace with hash -1576096488, now seen corresponding path program 2 times [2022-04-28 04:20:18,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:20:18,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160811669] [2022-04-28 04:20:18,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:20:18,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:20:18,702 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 04:20:18,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [112347904] [2022-04-28 04:20:18,702 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 04:20:18,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:20:18,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:20:18,703 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 04:20:18,704 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-28 04:20:18,803 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 04:20:18,804 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 04:20:18,804 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-28 04:20:18,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:20:18,815 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:20:18,966 INFO L272 TraceCheckUtils]: 0: Hoare triple {1778#true} call ULTIMATE.init(); {1778#true} is VALID [2022-04-28 04:20:18,966 INFO L290 TraceCheckUtils]: 1: Hoare triple {1778#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {1778#true} is VALID [2022-04-28 04:20:18,967 INFO L290 TraceCheckUtils]: 2: Hoare triple {1778#true} assume true; {1778#true} is VALID [2022-04-28 04:20:18,967 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1778#true} {1778#true} #94#return; {1778#true} is VALID [2022-04-28 04:20:18,967 INFO L272 TraceCheckUtils]: 4: Hoare triple {1778#true} call #t~ret6 := main(); {1778#true} is VALID [2022-04-28 04:20:18,967 INFO L290 TraceCheckUtils]: 5: Hoare triple {1778#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {1778#true} is VALID [2022-04-28 04:20:18,967 INFO L272 TraceCheckUtils]: 6: Hoare triple {1778#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {1778#true} is VALID [2022-04-28 04:20:18,967 INFO L290 TraceCheckUtils]: 7: Hoare triple {1778#true} ~cond := #in~cond; {1778#true} is VALID [2022-04-28 04:20:18,967 INFO L290 TraceCheckUtils]: 8: Hoare triple {1778#true} assume !(0 == ~cond); {1778#true} is VALID [2022-04-28 04:20:18,967 INFO L290 TraceCheckUtils]: 9: Hoare triple {1778#true} assume true; {1778#true} is VALID [2022-04-28 04:20:18,967 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1778#true} {1778#true} #78#return; {1778#true} is VALID [2022-04-28 04:20:18,968 INFO L290 TraceCheckUtils]: 11: Hoare triple {1778#true} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {1816#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 04:20:18,968 INFO L290 TraceCheckUtils]: 12: Hoare triple {1816#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} assume !false; {1816#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 04:20:18,968 INFO L272 TraceCheckUtils]: 13: Hoare triple {1816#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {1778#true} is VALID [2022-04-28 04:20:18,968 INFO L290 TraceCheckUtils]: 14: Hoare triple {1778#true} ~cond := #in~cond; {1778#true} is VALID [2022-04-28 04:20:18,968 INFO L290 TraceCheckUtils]: 15: Hoare triple {1778#true} assume !(0 == ~cond); {1778#true} is VALID [2022-04-28 04:20:18,969 INFO L290 TraceCheckUtils]: 16: Hoare triple {1778#true} assume true; {1778#true} is VALID [2022-04-28 04:20:18,969 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1778#true} {1816#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} #80#return; {1816#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 04:20:18,969 INFO L272 TraceCheckUtils]: 18: Hoare triple {1816#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~r~0 % 4294967296 == ~A~0 % 4294967296 then 1 else 0)); {1778#true} is VALID [2022-04-28 04:20:18,969 INFO L290 TraceCheckUtils]: 19: Hoare triple {1778#true} ~cond := #in~cond; {1778#true} is VALID [2022-04-28 04:20:18,969 INFO L290 TraceCheckUtils]: 20: Hoare triple {1778#true} assume !(0 == ~cond); {1778#true} is VALID [2022-04-28 04:20:18,970 INFO L290 TraceCheckUtils]: 21: Hoare triple {1778#true} assume true; {1778#true} is VALID [2022-04-28 04:20:18,970 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1778#true} {1816#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} #82#return; {1816#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 04:20:18,970 INFO L272 TraceCheckUtils]: 23: Hoare triple {1816#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~d~0 % 4294967296 == ~B~0 * ~p~0 % 4294967296 then 1 else 0)); {1778#true} is VALID [2022-04-28 04:20:18,970 INFO L290 TraceCheckUtils]: 24: Hoare triple {1778#true} ~cond := #in~cond; {1778#true} is VALID [2022-04-28 04:20:18,970 INFO L290 TraceCheckUtils]: 25: Hoare triple {1778#true} assume !(0 == ~cond); {1778#true} is VALID [2022-04-28 04:20:18,971 INFO L290 TraceCheckUtils]: 26: Hoare triple {1778#true} assume true; {1778#true} is VALID [2022-04-28 04:20:18,971 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1778#true} {1816#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} #84#return; {1816#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 04:20:18,972 INFO L290 TraceCheckUtils]: 28: Hoare triple {1816#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} assume !!(~r~0 % 4294967296 >= ~d~0 % 4294967296);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {1868#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2))} is VALID [2022-04-28 04:20:18,972 INFO L290 TraceCheckUtils]: 29: Hoare triple {1868#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2))} assume !false; {1868#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2))} is VALID [2022-04-28 04:20:18,972 INFO L272 TraceCheckUtils]: 30: Hoare triple {1868#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2))} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {1778#true} is VALID [2022-04-28 04:20:18,972 INFO L290 TraceCheckUtils]: 31: Hoare triple {1778#true} ~cond := #in~cond; {1778#true} is VALID [2022-04-28 04:20:18,972 INFO L290 TraceCheckUtils]: 32: Hoare triple {1778#true} assume !(0 == ~cond); {1778#true} is VALID [2022-04-28 04:20:18,972 INFO L290 TraceCheckUtils]: 33: Hoare triple {1778#true} assume true; {1778#true} is VALID [2022-04-28 04:20:18,973 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {1778#true} {1868#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2))} #80#return; {1868#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2))} is VALID [2022-04-28 04:20:18,973 INFO L272 TraceCheckUtils]: 35: Hoare triple {1868#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2))} call __VERIFIER_assert((if ~r~0 % 4294967296 == ~A~0 % 4294967296 then 1 else 0)); {1778#true} is VALID [2022-04-28 04:20:18,973 INFO L290 TraceCheckUtils]: 36: Hoare triple {1778#true} ~cond := #in~cond; {1778#true} is VALID [2022-04-28 04:20:18,973 INFO L290 TraceCheckUtils]: 37: Hoare triple {1778#true} assume !(0 == ~cond); {1778#true} is VALID [2022-04-28 04:20:18,973 INFO L290 TraceCheckUtils]: 38: Hoare triple {1778#true} assume true; {1778#true} is VALID [2022-04-28 04:20:18,974 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {1778#true} {1868#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2))} #82#return; {1868#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2))} is VALID [2022-04-28 04:20:18,977 INFO L272 TraceCheckUtils]: 40: Hoare triple {1868#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2))} call __VERIFIER_assert((if ~d~0 % 4294967296 == ~B~0 * ~p~0 % 4294967296 then 1 else 0)); {1905#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 04:20:18,977 INFO L290 TraceCheckUtils]: 41: Hoare triple {1905#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1909#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:20:18,977 INFO L290 TraceCheckUtils]: 42: Hoare triple {1909#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1779#false} is VALID [2022-04-28 04:20:18,978 INFO L290 TraceCheckUtils]: 43: Hoare triple {1779#false} assume !false; {1779#false} is VALID [2022-04-28 04:20:18,978 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-28 04:20:18,978 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 04:20:19,218 INFO L290 TraceCheckUtils]: 43: Hoare triple {1779#false} assume !false; {1779#false} is VALID [2022-04-28 04:20:19,219 INFO L290 TraceCheckUtils]: 42: Hoare triple {1909#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1779#false} is VALID [2022-04-28 04:20:19,219 INFO L290 TraceCheckUtils]: 41: Hoare triple {1905#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1909#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:20:19,220 INFO L272 TraceCheckUtils]: 40: Hoare triple {1925#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} call __VERIFIER_assert((if ~d~0 % 4294967296 == ~B~0 * ~p~0 % 4294967296 then 1 else 0)); {1905#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 04:20:19,221 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {1778#true} {1925#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} #82#return; {1925#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} is VALID [2022-04-28 04:20:19,221 INFO L290 TraceCheckUtils]: 38: Hoare triple {1778#true} assume true; {1778#true} is VALID [2022-04-28 04:20:19,221 INFO L290 TraceCheckUtils]: 37: Hoare triple {1778#true} assume !(0 == ~cond); {1778#true} is VALID [2022-04-28 04:20:19,221 INFO L290 TraceCheckUtils]: 36: Hoare triple {1778#true} ~cond := #in~cond; {1778#true} is VALID [2022-04-28 04:20:19,221 INFO L272 TraceCheckUtils]: 35: Hoare triple {1925#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} call __VERIFIER_assert((if ~r~0 % 4294967296 == ~A~0 % 4294967296 then 1 else 0)); {1778#true} is VALID [2022-04-28 04:20:19,221 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {1778#true} {1925#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} #80#return; {1925#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} is VALID [2022-04-28 04:20:19,222 INFO L290 TraceCheckUtils]: 33: Hoare triple {1778#true} assume true; {1778#true} is VALID [2022-04-28 04:20:19,222 INFO L290 TraceCheckUtils]: 32: Hoare triple {1778#true} assume !(0 == ~cond); {1778#true} is VALID [2022-04-28 04:20:19,222 INFO L290 TraceCheckUtils]: 31: Hoare triple {1778#true} ~cond := #in~cond; {1778#true} is VALID [2022-04-28 04:20:19,222 INFO L272 TraceCheckUtils]: 30: Hoare triple {1925#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {1778#true} is VALID [2022-04-28 04:20:19,222 INFO L290 TraceCheckUtils]: 29: Hoare triple {1925#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} assume !false; {1925#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} is VALID [2022-04-28 04:20:21,234 WARN L290 TraceCheckUtils]: 28: Hoare triple {1962#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} assume !!(~r~0 % 4294967296 >= ~d~0 % 4294967296);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {1925#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} is UNKNOWN [2022-04-28 04:20:21,235 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1778#true} {1962#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} #84#return; {1962#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} is VALID [2022-04-28 04:20:21,235 INFO L290 TraceCheckUtils]: 26: Hoare triple {1778#true} assume true; {1778#true} is VALID [2022-04-28 04:20:21,235 INFO L290 TraceCheckUtils]: 25: Hoare triple {1778#true} assume !(0 == ~cond); {1778#true} is VALID [2022-04-28 04:20:21,235 INFO L290 TraceCheckUtils]: 24: Hoare triple {1778#true} ~cond := #in~cond; {1778#true} is VALID [2022-04-28 04:20:21,235 INFO L272 TraceCheckUtils]: 23: Hoare triple {1962#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} call __VERIFIER_assert((if ~d~0 % 4294967296 == ~B~0 * ~p~0 % 4294967296 then 1 else 0)); {1778#true} is VALID [2022-04-28 04:20:21,236 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1778#true} {1962#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} #82#return; {1962#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} is VALID [2022-04-28 04:20:21,236 INFO L290 TraceCheckUtils]: 21: Hoare triple {1778#true} assume true; {1778#true} is VALID [2022-04-28 04:20:21,236 INFO L290 TraceCheckUtils]: 20: Hoare triple {1778#true} assume !(0 == ~cond); {1778#true} is VALID [2022-04-28 04:20:21,237 INFO L290 TraceCheckUtils]: 19: Hoare triple {1778#true} ~cond := #in~cond; {1778#true} is VALID [2022-04-28 04:20:21,237 INFO L272 TraceCheckUtils]: 18: Hoare triple {1962#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} call __VERIFIER_assert((if ~r~0 % 4294967296 == ~A~0 % 4294967296 then 1 else 0)); {1778#true} is VALID [2022-04-28 04:20:21,237 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1778#true} {1962#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} #80#return; {1962#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} is VALID [2022-04-28 04:20:21,237 INFO L290 TraceCheckUtils]: 16: Hoare triple {1778#true} assume true; {1778#true} is VALID [2022-04-28 04:20:21,237 INFO L290 TraceCheckUtils]: 15: Hoare triple {1778#true} assume !(0 == ~cond); {1778#true} is VALID [2022-04-28 04:20:21,237 INFO L290 TraceCheckUtils]: 14: Hoare triple {1778#true} ~cond := #in~cond; {1778#true} is VALID [2022-04-28 04:20:21,238 INFO L272 TraceCheckUtils]: 13: Hoare triple {1962#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {1778#true} is VALID [2022-04-28 04:20:21,238 INFO L290 TraceCheckUtils]: 12: Hoare triple {1962#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} assume !false; {1962#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} is VALID [2022-04-28 04:20:21,238 INFO L290 TraceCheckUtils]: 11: Hoare triple {1778#true} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {1962#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} is VALID [2022-04-28 04:20:21,238 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1778#true} {1778#true} #78#return; {1778#true} is VALID [2022-04-28 04:20:21,239 INFO L290 TraceCheckUtils]: 9: Hoare triple {1778#true} assume true; {1778#true} is VALID [2022-04-28 04:20:21,239 INFO L290 TraceCheckUtils]: 8: Hoare triple {1778#true} assume !(0 == ~cond); {1778#true} is VALID [2022-04-28 04:20:21,239 INFO L290 TraceCheckUtils]: 7: Hoare triple {1778#true} ~cond := #in~cond; {1778#true} is VALID [2022-04-28 04:20:21,239 INFO L272 TraceCheckUtils]: 6: Hoare triple {1778#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {1778#true} is VALID [2022-04-28 04:20:21,239 INFO L290 TraceCheckUtils]: 5: Hoare triple {1778#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {1778#true} is VALID [2022-04-28 04:20:21,239 INFO L272 TraceCheckUtils]: 4: Hoare triple {1778#true} call #t~ret6 := main(); {1778#true} is VALID [2022-04-28 04:20:21,239 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1778#true} {1778#true} #94#return; {1778#true} is VALID [2022-04-28 04:20:21,239 INFO L290 TraceCheckUtils]: 2: Hoare triple {1778#true} assume true; {1778#true} is VALID [2022-04-28 04:20:21,239 INFO L290 TraceCheckUtils]: 1: Hoare triple {1778#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {1778#true} is VALID [2022-04-28 04:20:21,239 INFO L272 TraceCheckUtils]: 0: Hoare triple {1778#true} call ULTIMATE.init(); {1778#true} is VALID [2022-04-28 04:20:21,240 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-28 04:20:21,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:20:21,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160811669] [2022-04-28 04:20:21,240 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 04:20:21,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [112347904] [2022-04-28 04:20:21,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [112347904] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-28 04:20:21,240 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-28 04:20:21,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 8 [2022-04-28 04:20:21,240 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:20:21,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [736501456] [2022-04-28 04:20:21,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [736501456] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:20:21,241 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:20:21,241 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 04:20:21,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003650673] [2022-04-28 04:20:21,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:20:21,241 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 44 [2022-04-28 04:20:21,241 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:20:21,241 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 04:20:22,726 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:20:22,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 04:20:22,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:20:22,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 04:20:22,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-04-28 04:20:22,727 INFO L87 Difference]: Start difference. First operand 69 states and 82 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 04:20:28,485 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 04:20:30,954 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 04:20:33,065 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 04:20:35,209 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 04:20:38,729 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 04:20:40,843 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 04:20:41,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:20:41,050 INFO L93 Difference]: Finished difference Result 81 states and 97 transitions. [2022-04-28 04:20:41,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 04:20:41,050 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 44 [2022-04-28 04:20:41,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:20:41,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 04:20:41,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2022-04-28 04:20:41,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 04:20:41,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2022-04-28 04:20:41,055 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 53 transitions. [2022-04-28 04:20:43,123 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 52 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 04:20:43,125 INFO L225 Difference]: With dead ends: 81 [2022-04-28 04:20:43,125 INFO L226 Difference]: Without dead ends: 79 [2022-04-28 04:20:43,125 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-04-28 04:20:43,126 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 8 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 2 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.4s IncrementalHoareTripleChecker+Time [2022-04-28 04:20:43,126 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 133 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 58 Invalid, 6 Unknown, 0 Unchecked, 13.4s Time] [2022-04-28 04:20:43,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-04-28 04:20:43,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 76. [2022-04-28 04:20:43,157 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:20:43,157 INFO L82 GeneralOperation]: Start isEquivalent. First operand 79 states. Second operand has 76 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 48 states have internal predecessors, (52), 20 states have call successors, (20), 11 states have call predecessors, (20), 10 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 04:20:43,157 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand has 76 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 48 states have internal predecessors, (52), 20 states have call successors, (20), 11 states have call predecessors, (20), 10 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 04:20:43,158 INFO L87 Difference]: Start difference. First operand 79 states. Second operand has 76 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 48 states have internal predecessors, (52), 20 states have call successors, (20), 11 states have call predecessors, (20), 10 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 04:20:43,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:20:43,160 INFO L93 Difference]: Finished difference Result 79 states and 95 transitions. [2022-04-28 04:20:43,160 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 95 transitions. [2022-04-28 04:20:43,160 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:20:43,160 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:20:43,161 INFO L74 IsIncluded]: Start isIncluded. First operand has 76 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 48 states have internal predecessors, (52), 20 states have call successors, (20), 11 states have call predecessors, (20), 10 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) Second operand 79 states. [2022-04-28 04:20:43,161 INFO L87 Difference]: Start difference. First operand has 76 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 48 states have internal predecessors, (52), 20 states have call successors, (20), 11 states have call predecessors, (20), 10 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) Second operand 79 states. [2022-04-28 04:20:43,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:20:43,163 INFO L93 Difference]: Finished difference Result 79 states and 95 transitions. [2022-04-28 04:20:43,163 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 95 transitions. [2022-04-28 04:20:43,163 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:20:43,163 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:20:43,163 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:20:43,163 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:20:43,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 48 states have internal predecessors, (52), 20 states have call successors, (20), 11 states have call predecessors, (20), 10 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 04:20:43,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 90 transitions. [2022-04-28 04:20:43,166 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 90 transitions. Word has length 44 [2022-04-28 04:20:43,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:20:43,166 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 90 transitions. [2022-04-28 04:20:43,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 04:20:43,166 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 76 states and 90 transitions. [2022-04-28 04:20:45,735 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 89 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 04:20:45,735 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 90 transitions. [2022-04-28 04:20:45,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-28 04:20:45,736 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:20:45,736 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:20:45,742 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-04-28 04:20:45,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:20:45,939 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:20:45,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:20:45,941 INFO L85 PathProgramCache]: Analyzing trace with hash 1352613400, now seen corresponding path program 1 times [2022-04-28 04:20:45,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:20:45,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [595161145] [2022-04-28 04:20:45,942 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 04:20:45,942 INFO L85 PathProgramCache]: Analyzing trace with hash 1352613400, now seen corresponding path program 2 times [2022-04-28 04:20:45,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:20:45,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831405416] [2022-04-28 04:20:45,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:20:45,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:20:45,954 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 04:20:45,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [500503517] [2022-04-28 04:20:45,954 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 04:20:45,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:20:45,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:20:45,955 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 04:20:45,956 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process