/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-34549b5 [2022-04-08 04:26:52,642 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 04:26:52,643 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 04:26:52,679 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 04:26:52,679 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 04:26:52,681 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 04:26:52,682 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 04:26:52,684 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 04:26:52,686 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 04:26:52,689 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 04:26:52,689 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 04:26:52,690 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 04:26:52,691 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 04:26:52,692 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 04:26:52,693 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 04:26:52,695 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 04:26:52,696 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 04:26:52,696 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 04:26:52,698 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 04:26:52,702 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 04:26:52,703 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 04:26:52,704 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 04:26:52,705 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 04:26:52,705 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 04:26:52,706 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 04:26:52,711 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 04:26:52,711 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 04:26:52,711 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 04:26:52,712 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 04:26:52,712 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 04:26:52,713 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 04:26:52,714 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 04:26:52,715 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 04:26:52,715 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 04:26:52,716 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 04:26:52,716 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 04:26:52,716 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 04:26:52,717 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 04:26:52,717 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 04:26:52,717 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 04:26:52,717 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 04:26:52,719 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 04:26:52,719 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-08 04:26:52,728 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 04:26:52,728 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 04:26:52,729 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 04:26:52,729 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-08 04:26:52,729 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 04:26:52,730 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-08 04:26:52,730 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 04:26:52,730 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 04:26:52,730 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 04:26:52,730 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 04:26:52,731 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-08 04:26:52,731 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 04:26:52,731 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 04:26:52,731 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 04:26:52,731 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 04:26:52,731 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 04:26:52,731 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 04:26:52,731 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 04:26:52,731 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 04:26:52,732 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 04:26:52,732 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 04:26:52,732 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 04:26:52,732 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 04:26:52,732 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 04:26:52,732 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-08 04:26:52,732 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-08 04:26:52,930 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 04:26:52,947 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 04:26:52,949 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 04:26:52,950 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 04:26:52,951 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 04:26:52,952 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-08 04:26:53,003 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d71955e46/1e5c3c83f5044ee6a229c803c52e9a16/FLAG3955a0a81 [2022-04-08 04:26:53,329 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 04:26:53,330 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/hard-u.c [2022-04-08 04:26:53,335 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d71955e46/1e5c3c83f5044ee6a229c803c52e9a16/FLAG3955a0a81 [2022-04-08 04:26:53,749 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d71955e46/1e5c3c83f5044ee6a229c803c52e9a16 [2022-04-08 04:26:53,751 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 04:26:53,752 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 04:26:53,755 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 04:26:53,755 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 04:26:53,758 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 04:26:53,759 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 04:26:53" (1/1) ... [2022-04-08 04:26:53,760 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e3bfd74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:26:53, skipping insertion in model container [2022-04-08 04:26:53,760 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 04:26:53" (1/1) ... [2022-04-08 04:26:53,764 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 04:26:53,774 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 04:26:53,876 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-08 04:26:53,889 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 04:26:53,894 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 04:26:53,902 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-08 04:26:53,907 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 04:26:53,924 INFO L208 MainTranslator]: Completed translation [2022-04-08 04:26:53,925 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:26:53 WrapperNode [2022-04-08 04:26:53,925 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 04:26:53,925 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 04:26:53,925 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 04:26:53,925 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 04:26:53,933 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:26:53" (1/1) ... [2022-04-08 04:26:53,933 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:26:53" (1/1) ... [2022-04-08 04:26:53,938 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:26:53" (1/1) ... [2022-04-08 04:26:53,938 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:26:53" (1/1) ... [2022-04-08 04:26:53,947 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:26:53" (1/1) ... [2022-04-08 04:26:53,951 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:26:53" (1/1) ... [2022-04-08 04:26:53,954 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:26:53" (1/1) ... [2022-04-08 04:26:53,958 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 04:26:53,959 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 04:26:53,959 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 04:26:53,959 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 04:26:53,961 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:26:53" (1/1) ... [2022-04-08 04:26:53,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 04:26:53,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:26:53,983 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-08 04:26:53,987 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-08 04:26:54,008 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 04:26:54,009 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 04:26:54,009 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 04:26:54,009 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-08 04:26:54,009 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 04:26:54,009 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 04:26:54,009 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 04:26:54,009 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 04:26:54,009 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 04:26:54,009 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 04:26:54,009 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-08 04:26:54,009 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-08 04:26:54,010 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 04:26:54,010 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 04:26:54,010 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 04:26:54,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 04:26:54,010 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 04:26:54,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 04:26:54,010 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 04:26:54,011 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 04:26:54,052 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 04:26:54,053 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 04:26:54,234 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 04:26:54,239 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 04:26:54,239 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-08 04:26:54,240 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 04:26:54 BoogieIcfgContainer [2022-04-08 04:26:54,240 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 04:26:54,241 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 04:26:54,241 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 04:26:54,257 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 04:26:54,257 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 04:26:53" (1/3) ... [2022-04-08 04:26:54,258 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7529af02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 04:26:54, skipping insertion in model container [2022-04-08 04:26:54,258 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:26:53" (2/3) ... [2022-04-08 04:26:54,258 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7529af02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 04:26:54, skipping insertion in model container [2022-04-08 04:26:54,258 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 04:26:54" (3/3) ... [2022-04-08 04:26:54,259 INFO L111 eAbstractionObserver]: Analyzing ICFG hard-u.c [2022-04-08 04:26:54,262 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 04:26:54,263 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 04:26:54,349 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 04:26:54,354 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-08 04:26:54,354 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 04:26:54,389 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-08 04:26:54,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-08 04:26:54,395 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:26:54,396 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:26:54,397 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:26:54,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:26:54,406 INFO L85 PathProgramCache]: Analyzing trace with hash -977830905, now seen corresponding path program 1 times [2022-04-08 04:26:54,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:26:54,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1475093144] [2022-04-08 04:26:54,420 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 04:26:54,420 INFO L85 PathProgramCache]: Analyzing trace with hash -977830905, now seen corresponding path program 2 times [2022-04-08 04:26:54,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:26:54,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094944889] [2022-04-08 04:26:54,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:26:54,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:26:54,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:26:54,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 04:26:54,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:26:54,617 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-08 04:26:54,617 INFO L290 TraceCheckUtils]: 1: Hoare triple {38#true} assume true; {38#true} is VALID [2022-04-08 04:26:54,617 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {38#true} {38#true} #94#return; {38#true} is VALID [2022-04-08 04:26:54,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-08 04:26:54,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:26:54,632 INFO L290 TraceCheckUtils]: 0: Hoare triple {38#true} ~cond := #in~cond; {38#true} is VALID [2022-04-08 04:26:54,633 INFO L290 TraceCheckUtils]: 1: Hoare triple {38#true} assume 0 == ~cond;assume false; {39#false} is VALID [2022-04-08 04:26:54,633 INFO L290 TraceCheckUtils]: 2: Hoare triple {39#false} assume true; {39#false} is VALID [2022-04-08 04:26:54,633 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {39#false} {38#true} #78#return; {39#false} is VALID [2022-04-08 04:26:54,635 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-08 04:26:54,635 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-08 04:26:54,635 INFO L290 TraceCheckUtils]: 2: Hoare triple {38#true} assume true; {38#true} is VALID [2022-04-08 04:26:54,636 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38#true} {38#true} #94#return; {38#true} is VALID [2022-04-08 04:26:54,636 INFO L272 TraceCheckUtils]: 4: Hoare triple {38#true} call #t~ret6 := main(); {38#true} is VALID [2022-04-08 04:26:54,636 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-08 04:26:54,636 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-08 04:26:54,637 INFO L290 TraceCheckUtils]: 7: Hoare triple {38#true} ~cond := #in~cond; {38#true} is VALID [2022-04-08 04:26:54,637 INFO L290 TraceCheckUtils]: 8: Hoare triple {38#true} assume 0 == ~cond;assume false; {39#false} is VALID [2022-04-08 04:26:54,638 INFO L290 TraceCheckUtils]: 9: Hoare triple {39#false} assume true; {39#false} is VALID [2022-04-08 04:26:54,638 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {39#false} {38#true} #78#return; {39#false} is VALID [2022-04-08 04:26:54,638 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-08 04:26:54,639 INFO L290 TraceCheckUtils]: 12: Hoare triple {39#false} assume !false; {39#false} is VALID [2022-04-08 04:26:54,639 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-08 04:26:54,639 INFO L290 TraceCheckUtils]: 14: Hoare triple {39#false} ~cond := #in~cond; {39#false} is VALID [2022-04-08 04:26:54,640 INFO L290 TraceCheckUtils]: 15: Hoare triple {39#false} assume 0 == ~cond; {39#false} is VALID [2022-04-08 04:26:54,640 INFO L290 TraceCheckUtils]: 16: Hoare triple {39#false} assume !false; {39#false} is VALID [2022-04-08 04:26:54,640 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-08 04:26:54,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:26:54,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094944889] [2022-04-08 04:26:54,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094944889] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:26:54,642 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:26:54,642 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 04:26:54,646 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:26:54,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1475093144] [2022-04-08 04:26:54,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1475093144] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:26:54,646 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:26:54,646 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 04:26:54,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417186235] [2022-04-08 04:26:54,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:26:54,651 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-08 04:26:54,652 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:26:54,654 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-08 04:26:54,705 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-08 04:26:54,706 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-08 04:26:54,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:26:54,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-08 04:26:54,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 04:26:54,730 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-08 04:26:54,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:26:54,893 INFO L93 Difference]: Finished difference Result 61 states and 95 transitions. [2022-04-08 04:26:54,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-08 04:26:54,893 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-08 04:26:54,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:26:54,894 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-08 04:26:54,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions. [2022-04-08 04:26:54,900 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-08 04:26:54,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions. [2022-04-08 04:26:54,906 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 95 transitions. [2022-04-08 04:26:55,012 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-08 04:26:55,017 INFO L225 Difference]: With dead ends: 61 [2022-04-08 04:26:55,018 INFO L226 Difference]: Without dead ends: 30 [2022-04-08 04:26:55,020 INFO L912 BasicCegarLoop]: 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-08 04:26:55,022 INFO L913 BasicCegarLoop]: 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-08 04:26:55,022 INFO L914 BasicCegarLoop]: 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-08 04:26:55,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-08 04:26:55,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-04-08 04:26:55,042 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:26:55,043 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-08 04:26:55,043 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-08 04:26:55,043 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-08 04:26:55,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:26:55,047 INFO L93 Difference]: Finished difference Result 30 states and 38 transitions. [2022-04-08 04:26:55,047 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2022-04-08 04:26:55,047 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:26:55,048 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:26:55,048 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-08 04:26:55,048 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-08 04:26:55,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:26:55,051 INFO L93 Difference]: Finished difference Result 30 states and 38 transitions. [2022-04-08 04:26:55,051 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2022-04-08 04:26:55,051 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:26:55,051 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:26:55,052 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:26:55,052 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:26:55,052 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-08 04:26:55,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2022-04-08 04:26:55,055 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 17 [2022-04-08 04:26:55,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:26:55,055 INFO L478 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2022-04-08 04:26:55,055 INFO L479 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-08 04:26:55,055 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 38 transitions. [2022-04-08 04:26:55,090 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-08 04:26:55,090 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2022-04-08 04:26:55,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-08 04:26:55,090 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:26:55,090 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:26:55,090 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 04:26:55,091 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:26:55,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:26:55,091 INFO L85 PathProgramCache]: Analyzing trace with hash -297772535, now seen corresponding path program 1 times [2022-04-08 04:26:55,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:26:55,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [174998525] [2022-04-08 04:26:55,092 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 04:26:55,092 INFO L85 PathProgramCache]: Analyzing trace with hash -297772535, now seen corresponding path program 2 times [2022-04-08 04:26:55,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:26:55,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073632721] [2022-04-08 04:26:55,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:26:55,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:26:55,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:26:55,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 04:26:55,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:26:55,160 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-08 04:26:55,161 INFO L290 TraceCheckUtils]: 1: Hoare triple {292#true} assume true; {292#true} is VALID [2022-04-08 04:26:55,161 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {292#true} {292#true} #94#return; {292#true} is VALID [2022-04-08 04:26:55,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-08 04:26:55,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:26:55,168 INFO L290 TraceCheckUtils]: 0: Hoare triple {292#true} ~cond := #in~cond; {292#true} is VALID [2022-04-08 04:26:55,168 INFO L290 TraceCheckUtils]: 1: Hoare triple {292#true} assume !(0 == ~cond); {292#true} is VALID [2022-04-08 04:26:55,168 INFO L290 TraceCheckUtils]: 2: Hoare triple {292#true} assume true; {292#true} is VALID [2022-04-08 04:26:55,168 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {292#true} {292#true} #78#return; {292#true} is VALID [2022-04-08 04:26:55,169 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-08 04:26:55,169 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-08 04:26:55,169 INFO L290 TraceCheckUtils]: 2: Hoare triple {292#true} assume true; {292#true} is VALID [2022-04-08 04:26:55,169 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {292#true} {292#true} #94#return; {292#true} is VALID [2022-04-08 04:26:55,169 INFO L272 TraceCheckUtils]: 4: Hoare triple {292#true} call #t~ret6 := main(); {292#true} is VALID [2022-04-08 04:26:55,170 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-08 04:26:55,170 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-08 04:26:55,170 INFO L290 TraceCheckUtils]: 7: Hoare triple {292#true} ~cond := #in~cond; {292#true} is VALID [2022-04-08 04:26:55,170 INFO L290 TraceCheckUtils]: 8: Hoare triple {292#true} assume !(0 == ~cond); {292#true} is VALID [2022-04-08 04:26:55,170 INFO L290 TraceCheckUtils]: 9: Hoare triple {292#true} assume true; {292#true} is VALID [2022-04-08 04:26:55,170 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {292#true} {292#true} #78#return; {292#true} is VALID [2022-04-08 04:26:55,171 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-08 04:26:55,171 INFO L290 TraceCheckUtils]: 12: Hoare triple {301#(= main_~q~0 0)} assume !false; {301#(= main_~q~0 0)} is VALID [2022-04-08 04:26:55,172 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-08 04:26:55,172 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-08 04:26:55,172 INFO L290 TraceCheckUtils]: 15: Hoare triple {303#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {293#false} is VALID [2022-04-08 04:26:55,173 INFO L290 TraceCheckUtils]: 16: Hoare triple {293#false} assume !false; {293#false} is VALID [2022-04-08 04:26:55,173 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-08 04:26:55,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:26:55,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073632721] [2022-04-08 04:26:55,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073632721] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:26:55,173 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:26:55,174 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 04:26:55,174 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:26:55,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [174998525] [2022-04-08 04:26:55,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [174998525] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:26:55,174 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:26:55,174 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 04:26:55,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525943537] [2022-04-08 04:26:55,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:26:55,175 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-08 04:26:55,175 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:26:55,175 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-08 04:26:55,187 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-08 04:26:55,187 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 04:26:55,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:26:55,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 04:26:55,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-08 04:26:55,188 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-08 04:26:55,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:26:55,565 INFO L93 Difference]: Finished difference Result 43 states and 55 transitions. [2022-04-08 04:26:55,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 04:26:55,565 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-08 04:26:55,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:26:55,566 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-08 04:26:55,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 55 transitions. [2022-04-08 04:26:55,568 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-08 04:26:55,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 55 transitions. [2022-04-08 04:26:55,570 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 55 transitions. [2022-04-08 04:26:55,620 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:26:55,621 INFO L225 Difference]: With dead ends: 43 [2022-04-08 04:26:55,622 INFO L226 Difference]: Without dead ends: 41 [2022-04-08 04:26:55,622 INFO L912 BasicCegarLoop]: 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-08 04:26:55,623 INFO L913 BasicCegarLoop]: 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.1s IncrementalHoareTripleChecker+Time [2022-04-08 04:26:55,623 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 45 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 04:26:55,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-04-08 04:26:55,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 34. [2022-04-08 04:26:55,629 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:26:55,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-08 04:26:55,630 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-08 04:26:55,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-08 04:26:55,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:26:55,633 INFO L93 Difference]: Finished difference Result 41 states and 53 transitions. [2022-04-08 04:26:55,633 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 53 transitions. [2022-04-08 04:26:55,633 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:26:55,633 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:26:55,634 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-08 04:26:55,634 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-08 04:26:55,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:26:55,636 INFO L93 Difference]: Finished difference Result 41 states and 53 transitions. [2022-04-08 04:26:55,636 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 53 transitions. [2022-04-08 04:26:55,637 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:26:55,637 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:26:55,637 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:26:55,637 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:26:55,637 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-08 04:26:55,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2022-04-08 04:26:55,639 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 41 transitions. Word has length 17 [2022-04-08 04:26:55,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:26:55,639 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 41 transitions. [2022-04-08 04:26:55,639 INFO L479 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-08 04:26:55,640 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 41 transitions. [2022-04-08 04:26:55,678 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-08 04:26:55,678 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2022-04-08 04:26:55,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-08 04:26:55,678 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:26:55,679 INFO L499 BasicCegarLoop]: 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-08 04:26:55,679 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-08 04:26:55,679 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:26:55,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:26:55,680 INFO L85 PathProgramCache]: Analyzing trace with hash -1294462534, now seen corresponding path program 1 times [2022-04-08 04:26:55,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:26:55,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1837966034] [2022-04-08 04:26:55,680 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 04:26:55,680 INFO L85 PathProgramCache]: Analyzing trace with hash -1294462534, now seen corresponding path program 2 times [2022-04-08 04:26:55,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:26:55,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243708095] [2022-04-08 04:26:55,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:26:55,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:26:55,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:26:55,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 04:26:55,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:26:55,739 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-08 04:26:55,739 INFO L290 TraceCheckUtils]: 1: Hoare triple {551#true} assume true; {551#true} is VALID [2022-04-08 04:26:55,739 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {551#true} {551#true} #94#return; {551#true} is VALID [2022-04-08 04:26:55,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-08 04:26:55,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:26:55,746 INFO L290 TraceCheckUtils]: 0: Hoare triple {551#true} ~cond := #in~cond; {551#true} is VALID [2022-04-08 04:26:55,746 INFO L290 TraceCheckUtils]: 1: Hoare triple {551#true} assume !(0 == ~cond); {551#true} is VALID [2022-04-08 04:26:55,746 INFO L290 TraceCheckUtils]: 2: Hoare triple {551#true} assume true; {551#true} is VALID [2022-04-08 04:26:55,746 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {551#true} {551#true} #78#return; {551#true} is VALID [2022-04-08 04:26:55,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-04-08 04:26:55,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:26:55,752 INFO L290 TraceCheckUtils]: 0: Hoare triple {551#true} ~cond := #in~cond; {551#true} is VALID [2022-04-08 04:26:55,752 INFO L290 TraceCheckUtils]: 1: Hoare triple {551#true} assume !(0 == ~cond); {551#true} is VALID [2022-04-08 04:26:55,752 INFO L290 TraceCheckUtils]: 2: Hoare triple {551#true} assume true; {551#true} is VALID [2022-04-08 04:26:55,753 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-08 04:26:55,753 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-08 04:26:55,753 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-08 04:26:55,754 INFO L290 TraceCheckUtils]: 2: Hoare triple {551#true} assume true; {551#true} is VALID [2022-04-08 04:26:55,754 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {551#true} {551#true} #94#return; {551#true} is VALID [2022-04-08 04:26:55,754 INFO L272 TraceCheckUtils]: 4: Hoare triple {551#true} call #t~ret6 := main(); {551#true} is VALID [2022-04-08 04:26:55,754 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-08 04:26:55,754 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-08 04:26:55,754 INFO L290 TraceCheckUtils]: 7: Hoare triple {551#true} ~cond := #in~cond; {551#true} is VALID [2022-04-08 04:26:55,754 INFO L290 TraceCheckUtils]: 8: Hoare triple {551#true} assume !(0 == ~cond); {551#true} is VALID [2022-04-08 04:26:55,754 INFO L290 TraceCheckUtils]: 9: Hoare triple {551#true} assume true; {551#true} is VALID [2022-04-08 04:26:55,755 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {551#true} {551#true} #78#return; {551#true} is VALID [2022-04-08 04:26:55,755 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-08 04:26:55,755 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-08 04:26:55,755 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-08 04:26:55,756 INFO L290 TraceCheckUtils]: 14: Hoare triple {551#true} ~cond := #in~cond; {551#true} is VALID [2022-04-08 04:26:55,756 INFO L290 TraceCheckUtils]: 15: Hoare triple {551#true} assume !(0 == ~cond); {551#true} is VALID [2022-04-08 04:26:55,756 INFO L290 TraceCheckUtils]: 16: Hoare triple {551#true} assume true; {551#true} is VALID [2022-04-08 04:26:55,756 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-08 04:26:55,757 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-08 04:26:55,757 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-08 04:26:55,758 INFO L290 TraceCheckUtils]: 20: Hoare triple {566#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {552#false} is VALID [2022-04-08 04:26:55,758 INFO L290 TraceCheckUtils]: 21: Hoare triple {552#false} assume !false; {552#false} is VALID [2022-04-08 04:26:55,758 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-08 04:26:55,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:26:55,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243708095] [2022-04-08 04:26:55,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243708095] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:26:55,759 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:26:55,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 04:26:55,759 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:26:55,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1837966034] [2022-04-08 04:26:55,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1837966034] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:26:55,759 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:26:55,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 04:26:55,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270556666] [2022-04-08 04:26:55,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:26:55,760 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-08 04:26:55,760 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:26:55,760 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-08 04:26:55,774 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:26:55,774 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 04:26:55,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:26:55,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 04:26:55,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-08 04:26:55,775 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-08 04:26:56,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:26:56,143 INFO L93 Difference]: Finished difference Result 47 states and 58 transitions. [2022-04-08 04:26:56,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 04:26:56,143 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-08 04:26:56,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:26:56,144 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-08 04:26:56,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 55 transitions. [2022-04-08 04:26:56,151 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-08 04:26:56,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 55 transitions. [2022-04-08 04:26:56,157 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 55 transitions. [2022-04-08 04:26:56,206 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:26:56,213 INFO L225 Difference]: With dead ends: 47 [2022-04-08 04:26:56,213 INFO L226 Difference]: Without dead ends: 45 [2022-04-08 04:26:56,214 INFO L912 BasicCegarLoop]: 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-08 04:26:56,217 INFO L913 BasicCegarLoop]: 28 mSDtfsCounter, 32 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-08 04:26:56,221 INFO L914 BasicCegarLoop]: 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-08 04:26:56,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-08 04:26:56,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 38. [2022-04-08 04:26:56,232 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:26:56,233 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-08 04:26:56,233 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-08 04:26:56,233 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-08 04:26:56,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:26:56,235 INFO L93 Difference]: Finished difference Result 45 states and 56 transitions. [2022-04-08 04:26:56,235 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 56 transitions. [2022-04-08 04:26:56,236 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:26:56,236 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:26:56,236 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-08 04:26:56,236 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-08 04:26:56,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:26:56,238 INFO L93 Difference]: Finished difference Result 45 states and 56 transitions. [2022-04-08 04:26:56,238 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 56 transitions. [2022-04-08 04:26:56,238 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:26:56,239 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:26:56,239 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:26:56,239 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:26:56,242 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-08 04:26:56,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2022-04-08 04:26:56,244 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 22 [2022-04-08 04:26:56,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:26:56,245 INFO L478 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions. [2022-04-08 04:26:56,245 INFO L479 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-08 04:26:56,245 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 44 transitions. [2022-04-08 04:26:56,277 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-08 04:26:56,278 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2022-04-08 04:26:56,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-08 04:26:56,279 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:26:56,279 INFO L499 BasicCegarLoop]: 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-08 04:26:56,279 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-08 04:26:56,281 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:26:56,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:26:56,281 INFO L85 PathProgramCache]: Analyzing trace with hash -1449027479, now seen corresponding path program 1 times [2022-04-08 04:26:56,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:26:56,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1410330968] [2022-04-08 04:26:56,292 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 04:26:56,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1449027479, now seen corresponding path program 2 times [2022-04-08 04:26:56,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:26:56,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742765673] [2022-04-08 04:26:56,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:26:56,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:26:56,306 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 04:26:56,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1737011487] [2022-04-08 04:26:56,306 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 04:26:56,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:26:56,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:26:56,323 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 04:26:56,346 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-08 04:26:56,364 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 04:26:56,364 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 04:26:56,365 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 04:26:56,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:26:56,383 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 04:26:56,511 INFO L272 TraceCheckUtils]: 0: Hoare triple {838#true} call ULTIMATE.init(); {838#true} is VALID [2022-04-08 04:26:56,511 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-08 04:26:56,511 INFO L290 TraceCheckUtils]: 2: Hoare triple {838#true} assume true; {838#true} is VALID [2022-04-08 04:26:56,511 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {838#true} {838#true} #94#return; {838#true} is VALID [2022-04-08 04:26:56,511 INFO L272 TraceCheckUtils]: 4: Hoare triple {838#true} call #t~ret6 := main(); {838#true} is VALID [2022-04-08 04:26:56,511 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-08 04:26:56,512 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-08 04:26:56,512 INFO L290 TraceCheckUtils]: 7: Hoare triple {838#true} ~cond := #in~cond; {838#true} is VALID [2022-04-08 04:26:56,512 INFO L290 TraceCheckUtils]: 8: Hoare triple {838#true} assume !(0 == ~cond); {838#true} is VALID [2022-04-08 04:26:56,512 INFO L290 TraceCheckUtils]: 9: Hoare triple {838#true} assume true; {838#true} is VALID [2022-04-08 04:26:56,512 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {838#true} {838#true} #78#return; {838#true} is VALID [2022-04-08 04:26:56,512 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-08 04:26:56,513 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-08 04:26:56,513 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-08 04:26:56,513 INFO L290 TraceCheckUtils]: 14: Hoare triple {838#true} ~cond := #in~cond; {838#true} is VALID [2022-04-08 04:26:56,513 INFO L290 TraceCheckUtils]: 15: Hoare triple {838#true} assume !(0 == ~cond); {838#true} is VALID [2022-04-08 04:26:56,513 INFO L290 TraceCheckUtils]: 16: Hoare triple {838#true} assume true; {838#true} is VALID [2022-04-08 04:26:56,514 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-08 04:26:56,514 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-08 04:26:56,514 INFO L290 TraceCheckUtils]: 19: Hoare triple {838#true} ~cond := #in~cond; {838#true} is VALID [2022-04-08 04:26:56,514 INFO L290 TraceCheckUtils]: 20: Hoare triple {838#true} assume !(0 == ~cond); {838#true} is VALID [2022-04-08 04:26:56,515 INFO L290 TraceCheckUtils]: 21: Hoare triple {838#true} assume true; {838#true} is VALID [2022-04-08 04:26:56,515 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-08 04:26:56,516 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-08 04:26:56,516 INFO L290 TraceCheckUtils]: 24: Hoare triple {913#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {917#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 04:26:56,516 INFO L290 TraceCheckUtils]: 25: Hoare triple {917#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {839#false} is VALID [2022-04-08 04:26:56,517 INFO L290 TraceCheckUtils]: 26: Hoare triple {839#false} assume !false; {839#false} is VALID [2022-04-08 04:26:56,517 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-08 04:26:56,517 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 04:26:56,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:26:56,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742765673] [2022-04-08 04:26:56,517 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 04:26:56,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1737011487] [2022-04-08 04:26:56,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1737011487] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:26:56,518 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:26:56,518 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 04:26:56,518 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:26:56,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1410330968] [2022-04-08 04:26:56,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1410330968] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:26:56,518 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:26:56,519 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 04:26:56,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246163722] [2022-04-08 04:26:56,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:26:56,519 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-08 04:26:56,519 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:26:56,519 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-08 04:26:56,534 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-08 04:26:56,534 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 04:26:56,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:26:56,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 04:26:56,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 04:26:56,535 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-08 04:26:58,684 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-08 04:26:58,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:26:58,941 INFO L93 Difference]: Finished difference Result 55 states and 68 transitions. [2022-04-08 04:26:58,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 04:26:58,941 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-08 04:26:58,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:26:58,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-08 04:26:58,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 62 transitions. [2022-04-08 04:26:58,943 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-08 04:26:58,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 62 transitions. [2022-04-08 04:26:58,944 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 62 transitions. [2022-04-08 04:26:59,004 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-08 04:26:59,005 INFO L225 Difference]: With dead ends: 55 [2022-04-08 04:26:59,005 INFO L226 Difference]: Without dead ends: 52 [2022-04-08 04:26:59,005 INFO L912 BasicCegarLoop]: 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-08 04:26:59,007 INFO L913 BasicCegarLoop]: 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-08 04:26:59,007 INFO L914 BasicCegarLoop]: 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-08 04:26:59,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-08 04:26:59,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2022-04-08 04:26:59,092 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:26:59,092 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-08 04:26:59,092 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-08 04:26:59,093 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-08 04:26:59,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:26:59,095 INFO L93 Difference]: Finished difference Result 52 states and 64 transitions. [2022-04-08 04:26:59,095 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 64 transitions. [2022-04-08 04:26:59,095 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:26:59,095 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:26:59,095 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-08 04:26:59,096 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-08 04:26:59,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:26:59,101 INFO L93 Difference]: Finished difference Result 52 states and 64 transitions. [2022-04-08 04:26:59,101 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 64 transitions. [2022-04-08 04:26:59,102 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:26:59,102 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:26:59,102 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:26:59,102 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:26:59,102 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-08 04:26:59,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 64 transitions. [2022-04-08 04:26:59,104 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 64 transitions. Word has length 27 [2022-04-08 04:26:59,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:26:59,104 INFO L478 AbstractCegarLoop]: Abstraction has 52 states and 64 transitions. [2022-04-08 04:26:59,104 INFO L479 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-08 04:26:59,104 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 64 transitions. [2022-04-08 04:26:59,288 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-08 04:26:59,289 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 64 transitions. [2022-04-08 04:26:59,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-08 04:26:59,289 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:26:59,289 INFO L499 BasicCegarLoop]: 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-08 04:26:59,325 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-08 04:26:59,490 WARN L460 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-08 04:26:59,490 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:26:59,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:26:59,491 INFO L85 PathProgramCache]: Analyzing trace with hash 905213191, now seen corresponding path program 1 times [2022-04-08 04:26:59,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:26:59,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [378698787] [2022-04-08 04:26:59,491 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 04:26:59,491 INFO L85 PathProgramCache]: Analyzing trace with hash 905213191, now seen corresponding path program 2 times [2022-04-08 04:26:59,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:26:59,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951875793] [2022-04-08 04:26:59,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:26:59,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:26:59,506 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 04:26:59,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1038687125] [2022-04-08 04:26:59,506 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 04:26:59,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:26:59,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:26:59,509 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 04:26:59,569 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-08 04:26:59,603 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 04:26:59,603 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 04:26:59,604 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-08 04:26:59,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:26:59,619 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 04:27:00,452 INFO L272 TraceCheckUtils]: 0: Hoare triple {1243#true} call ULTIMATE.init(); {1243#true} is VALID [2022-04-08 04:27:00,452 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-08 04:27:00,453 INFO L290 TraceCheckUtils]: 2: Hoare triple {1243#true} assume true; {1243#true} is VALID [2022-04-08 04:27:00,453 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1243#true} {1243#true} #94#return; {1243#true} is VALID [2022-04-08 04:27:00,453 INFO L272 TraceCheckUtils]: 4: Hoare triple {1243#true} call #t~ret6 := main(); {1243#true} is VALID [2022-04-08 04:27:00,453 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-08 04:27:00,454 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-08 04:27:00,454 INFO L290 TraceCheckUtils]: 7: Hoare triple {1243#true} ~cond := #in~cond; {1243#true} is VALID [2022-04-08 04:27:00,454 INFO L290 TraceCheckUtils]: 8: Hoare triple {1243#true} assume !(0 == ~cond); {1243#true} is VALID [2022-04-08 04:27:00,455 INFO L290 TraceCheckUtils]: 9: Hoare triple {1243#true} assume true; {1243#true} is VALID [2022-04-08 04:27:00,455 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1243#true} {1243#true} #78#return; {1243#true} is VALID [2022-04-08 04:27:00,462 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-08 04:27:00,464 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-08 04:27:00,464 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-08 04:27:00,464 INFO L290 TraceCheckUtils]: 14: Hoare triple {1243#true} ~cond := #in~cond; {1243#true} is VALID [2022-04-08 04:27:00,464 INFO L290 TraceCheckUtils]: 15: Hoare triple {1243#true} assume !(0 == ~cond); {1243#true} is VALID [2022-04-08 04:27:00,464 INFO L290 TraceCheckUtils]: 16: Hoare triple {1243#true} assume true; {1243#true} is VALID [2022-04-08 04:27:00,467 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-08 04:27:00,467 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-08 04:27:00,467 INFO L290 TraceCheckUtils]: 19: Hoare triple {1243#true} ~cond := #in~cond; {1243#true} is VALID [2022-04-08 04:27:00,467 INFO L290 TraceCheckUtils]: 20: Hoare triple {1243#true} assume !(0 == ~cond); {1243#true} is VALID [2022-04-08 04:27:00,467 INFO L290 TraceCheckUtils]: 21: Hoare triple {1243#true} assume true; {1243#true} is VALID [2022-04-08 04:27:00,469 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-08 04:27:00,469 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-08 04:27:00,469 INFO L290 TraceCheckUtils]: 24: Hoare triple {1243#true} ~cond := #in~cond; {1243#true} is VALID [2022-04-08 04:27:00,469 INFO L290 TraceCheckUtils]: 25: Hoare triple {1243#true} assume !(0 == ~cond); {1243#true} is VALID [2022-04-08 04:27:00,469 INFO L290 TraceCheckUtils]: 26: Hoare triple {1243#true} assume true; {1243#true} is VALID [2022-04-08 04:27:00,470 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-08 04:27:00,471 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-08 04:27:00,472 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-08 04:27:00,472 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-08 04:27:00,473 INFO L290 TraceCheckUtils]: 31: Hoare triple {1340#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1344#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 04:27:00,473 INFO L290 TraceCheckUtils]: 32: Hoare triple {1344#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1244#false} is VALID [2022-04-08 04:27:00,473 INFO L290 TraceCheckUtils]: 33: Hoare triple {1244#false} assume !false; {1244#false} is VALID [2022-04-08 04:27:00,473 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-08 04:27:00,474 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 04:27:00,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:27:00,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951875793] [2022-04-08 04:27:00,474 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 04:27:00,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1038687125] [2022-04-08 04:27:00,474 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1038687125] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:27:00,474 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:27:00,474 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 04:27:00,474 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:27:00,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [378698787] [2022-04-08 04:27:00,474 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [378698787] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:27:00,474 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:27:00,474 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 04:27:00,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091552530] [2022-04-08 04:27:00,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:27:00,475 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-08 04:27:00,475 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:27:00,475 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-08 04:27:00,513 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-08 04:27:00,513 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 04:27:00,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:27:00,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 04:27:00,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-08 04:27:00,514 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-08 04:27:05,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:27:05,535 INFO L93 Difference]: Finished difference Result 73 states and 87 transitions. [2022-04-08 04:27:05,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 04:27:05,535 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-08 04:27:05,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:27:05,536 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-08 04:27:05,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 72 transitions. [2022-04-08 04:27:05,537 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-08 04:27:05,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 72 transitions. [2022-04-08 04:27:05,539 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 72 transitions. [2022-04-08 04:27:05,729 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-08 04:27:05,731 INFO L225 Difference]: With dead ends: 73 [2022-04-08 04:27:05,731 INFO L226 Difference]: Without dead ends: 70 [2022-04-08 04:27:05,732 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-08 04:27:05,732 INFO L913 BasicCegarLoop]: 35 mSDtfsCounter, 12 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.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, 1.2s IncrementalHoareTripleChecker+Time [2022-04-08 04:27:05,732 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 135 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-04-08 04:27:05,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-04-08 04:27:05,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2022-04-08 04:27:05,758 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:27:05,759 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-08 04:27:05,759 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-08 04:27:05,759 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-08 04:27:05,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:27:05,761 INFO L93 Difference]: Finished difference Result 70 states and 83 transitions. [2022-04-08 04:27:05,761 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 83 transitions. [2022-04-08 04:27:05,762 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:27:05,762 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:27:05,762 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-08 04:27:05,762 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-08 04:27:05,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:27:05,764 INFO L93 Difference]: Finished difference Result 70 states and 83 transitions. [2022-04-08 04:27:05,764 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 83 transitions. [2022-04-08 04:27:05,765 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:27:05,765 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:27:05,765 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:27:05,765 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:27:05,765 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-08 04:27:05,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 82 transitions. [2022-04-08 04:27:05,768 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 82 transitions. Word has length 34 [2022-04-08 04:27:05,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:27:05,769 INFO L478 AbstractCegarLoop]: Abstraction has 69 states and 82 transitions. [2022-04-08 04:27:05,769 INFO L479 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-08 04:27:05,769 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 69 states and 82 transitions. [2022-04-08 04:27:06,216 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-08 04:27:06,216 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 82 transitions. [2022-04-08 04:27:06,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-08 04:27:06,217 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:27:06,217 INFO L499 BasicCegarLoop]: 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-08 04:27:06,235 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-08 04:27:06,417 WARN L460 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-08 04:27:06,418 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:27:06,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:27:06,418 INFO L85 PathProgramCache]: Analyzing trace with hash -1576096488, now seen corresponding path program 1 times [2022-04-08 04:27:06,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:27:06,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [598842289] [2022-04-08 04:27:07,971 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 04:27:07,971 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-08 04:27:07,971 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 04:27:07,972 INFO L85 PathProgramCache]: Analyzing trace with hash -1576096488, now seen corresponding path program 2 times [2022-04-08 04:27:07,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:27:07,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610660193] [2022-04-08 04:27:07,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:27:07,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:27:08,001 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 04:27:08,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [813059420] [2022-04-08 04:27:08,001 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 04:27:08,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:27:08,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:27:08,022 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 04:27:08,027 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-08 04:27:08,152 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 04:27:08,152 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 04:27:08,153 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-08 04:27:08,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:27:08,169 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 04:27:08,381 INFO L272 TraceCheckUtils]: 0: Hoare triple {1778#true} call ULTIMATE.init(); {1778#true} is VALID [2022-04-08 04:27:08,381 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-08 04:27:08,381 INFO L290 TraceCheckUtils]: 2: Hoare triple {1778#true} assume true; {1778#true} is VALID [2022-04-08 04:27:08,381 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1778#true} {1778#true} #94#return; {1778#true} is VALID [2022-04-08 04:27:08,381 INFO L272 TraceCheckUtils]: 4: Hoare triple {1778#true} call #t~ret6 := main(); {1778#true} is VALID [2022-04-08 04:27:08,381 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-08 04:27:08,382 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-08 04:27:08,382 INFO L290 TraceCheckUtils]: 7: Hoare triple {1778#true} ~cond := #in~cond; {1778#true} is VALID [2022-04-08 04:27:08,382 INFO L290 TraceCheckUtils]: 8: Hoare triple {1778#true} assume !(0 == ~cond); {1778#true} is VALID [2022-04-08 04:27:08,382 INFO L290 TraceCheckUtils]: 9: Hoare triple {1778#true} assume true; {1778#true} is VALID [2022-04-08 04:27:08,382 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1778#true} {1778#true} #78#return; {1778#true} is VALID [2022-04-08 04:27:08,382 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-08 04:27:08,383 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-08 04:27:08,383 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-08 04:27:08,383 INFO L290 TraceCheckUtils]: 14: Hoare triple {1778#true} ~cond := #in~cond; {1778#true} is VALID [2022-04-08 04:27:08,383 INFO L290 TraceCheckUtils]: 15: Hoare triple {1778#true} assume !(0 == ~cond); {1778#true} is VALID [2022-04-08 04:27:08,383 INFO L290 TraceCheckUtils]: 16: Hoare triple {1778#true} assume true; {1778#true} is VALID [2022-04-08 04:27:08,384 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-08 04:27:08,384 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-08 04:27:08,384 INFO L290 TraceCheckUtils]: 19: Hoare triple {1778#true} ~cond := #in~cond; {1778#true} is VALID [2022-04-08 04:27:08,384 INFO L290 TraceCheckUtils]: 20: Hoare triple {1778#true} assume !(0 == ~cond); {1778#true} is VALID [2022-04-08 04:27:08,384 INFO L290 TraceCheckUtils]: 21: Hoare triple {1778#true} assume true; {1778#true} is VALID [2022-04-08 04:27:08,385 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-08 04:27:08,385 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-08 04:27:08,385 INFO L290 TraceCheckUtils]: 24: Hoare triple {1778#true} ~cond := #in~cond; {1778#true} is VALID [2022-04-08 04:27:08,386 INFO L290 TraceCheckUtils]: 25: Hoare triple {1778#true} assume !(0 == ~cond); {1778#true} is VALID [2022-04-08 04:27:08,386 INFO L290 TraceCheckUtils]: 26: Hoare triple {1778#true} assume true; {1778#true} is VALID [2022-04-08 04:27:08,386 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-08 04:27:08,387 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-08 04:27:08,387 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-08 04:27:08,387 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-08 04:27:08,387 INFO L290 TraceCheckUtils]: 31: Hoare triple {1778#true} ~cond := #in~cond; {1778#true} is VALID [2022-04-08 04:27:08,387 INFO L290 TraceCheckUtils]: 32: Hoare triple {1778#true} assume !(0 == ~cond); {1778#true} is VALID [2022-04-08 04:27:08,387 INFO L290 TraceCheckUtils]: 33: Hoare triple {1778#true} assume true; {1778#true} is VALID [2022-04-08 04:27:08,388 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-08 04:27:08,388 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-08 04:27:08,388 INFO L290 TraceCheckUtils]: 36: Hoare triple {1778#true} ~cond := #in~cond; {1778#true} is VALID [2022-04-08 04:27:08,388 INFO L290 TraceCheckUtils]: 37: Hoare triple {1778#true} assume !(0 == ~cond); {1778#true} is VALID [2022-04-08 04:27:08,388 INFO L290 TraceCheckUtils]: 38: Hoare triple {1778#true} assume true; {1778#true} is VALID [2022-04-08 04:27:08,389 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-08 04:27:08,391 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-08 04:27:08,391 INFO L290 TraceCheckUtils]: 41: Hoare triple {1905#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1909#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 04:27:08,391 INFO L290 TraceCheckUtils]: 42: Hoare triple {1909#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1779#false} is VALID [2022-04-08 04:27:08,392 INFO L290 TraceCheckUtils]: 43: Hoare triple {1779#false} assume !false; {1779#false} is VALID [2022-04-08 04:27:08,392 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-08 04:27:08,392 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 04:27:09,443 INFO L290 TraceCheckUtils]: 43: Hoare triple {1779#false} assume !false; {1779#false} is VALID [2022-04-08 04:27:09,444 INFO L290 TraceCheckUtils]: 42: Hoare triple {1909#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1779#false} is VALID [2022-04-08 04:27:09,444 INFO L290 TraceCheckUtils]: 41: Hoare triple {1905#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1909#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 04:27:09,445 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-08 04:27:09,446 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-08 04:27:09,446 INFO L290 TraceCheckUtils]: 38: Hoare triple {1778#true} assume true; {1778#true} is VALID [2022-04-08 04:27:09,446 INFO L290 TraceCheckUtils]: 37: Hoare triple {1778#true} assume !(0 == ~cond); {1778#true} is VALID [2022-04-08 04:27:09,446 INFO L290 TraceCheckUtils]: 36: Hoare triple {1778#true} ~cond := #in~cond; {1778#true} is VALID [2022-04-08 04:27:09,446 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-08 04:27:09,447 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-08 04:27:09,447 INFO L290 TraceCheckUtils]: 33: Hoare triple {1778#true} assume true; {1778#true} is VALID [2022-04-08 04:27:09,447 INFO L290 TraceCheckUtils]: 32: Hoare triple {1778#true} assume !(0 == ~cond); {1778#true} is VALID [2022-04-08 04:27:09,447 INFO L290 TraceCheckUtils]: 31: Hoare triple {1778#true} ~cond := #in~cond; {1778#true} is VALID [2022-04-08 04:27:09,447 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-08 04:27:09,450 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-08 04:27:11,065 INFO 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 VALID [2022-04-08 04:27:11,066 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-08 04:27:11,066 INFO L290 TraceCheckUtils]: 26: Hoare triple {1778#true} assume true; {1778#true} is VALID [2022-04-08 04:27:11,066 INFO L290 TraceCheckUtils]: 25: Hoare triple {1778#true} assume !(0 == ~cond); {1778#true} is VALID [2022-04-08 04:27:11,066 INFO L290 TraceCheckUtils]: 24: Hoare triple {1778#true} ~cond := #in~cond; {1778#true} is VALID [2022-04-08 04:27:11,067 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-08 04:27:11,068 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-08 04:27:11,069 INFO L290 TraceCheckUtils]: 21: Hoare triple {1778#true} assume true; {1778#true} is VALID [2022-04-08 04:27:11,069 INFO L290 TraceCheckUtils]: 20: Hoare triple {1778#true} assume !(0 == ~cond); {1778#true} is VALID [2022-04-08 04:27:11,069 INFO L290 TraceCheckUtils]: 19: Hoare triple {1778#true} ~cond := #in~cond; {1778#true} is VALID [2022-04-08 04:27:11,069 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-08 04:27:11,069 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-08 04:27:11,069 INFO L290 TraceCheckUtils]: 16: Hoare triple {1778#true} assume true; {1778#true} is VALID [2022-04-08 04:27:11,070 INFO L290 TraceCheckUtils]: 15: Hoare triple {1778#true} assume !(0 == ~cond); {1778#true} is VALID [2022-04-08 04:27:11,070 INFO L290 TraceCheckUtils]: 14: Hoare triple {1778#true} ~cond := #in~cond; {1778#true} is VALID [2022-04-08 04:27:11,070 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-08 04:27:11,082 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-08 04:27:11,082 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-08 04:27:11,082 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1778#true} {1778#true} #78#return; {1778#true} is VALID [2022-04-08 04:27:11,083 INFO L290 TraceCheckUtils]: 9: Hoare triple {1778#true} assume true; {1778#true} is VALID [2022-04-08 04:27:11,083 INFO L290 TraceCheckUtils]: 8: Hoare triple {1778#true} assume !(0 == ~cond); {1778#true} is VALID [2022-04-08 04:27:11,083 INFO L290 TraceCheckUtils]: 7: Hoare triple {1778#true} ~cond := #in~cond; {1778#true} is VALID [2022-04-08 04:27:11,083 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-08 04:27:11,083 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-08 04:27:11,083 INFO L272 TraceCheckUtils]: 4: Hoare triple {1778#true} call #t~ret6 := main(); {1778#true} is VALID [2022-04-08 04:27:11,083 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1778#true} {1778#true} #94#return; {1778#true} is VALID [2022-04-08 04:27:11,083 INFO L290 TraceCheckUtils]: 2: Hoare triple {1778#true} assume true; {1778#true} is VALID [2022-04-08 04:27:11,083 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-08 04:27:11,083 INFO L272 TraceCheckUtils]: 0: Hoare triple {1778#true} call ULTIMATE.init(); {1778#true} is VALID [2022-04-08 04:27:11,084 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-08 04:27:11,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:27:11,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610660193] [2022-04-08 04:27:11,084 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 04:27:11,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [813059420] [2022-04-08 04:27:11,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [813059420] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-08 04:27:11,084 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-08 04:27:11,084 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 8 [2022-04-08 04:27:11,084 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:27:11,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [598842289] [2022-04-08 04:27:11,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [598842289] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:27:11,084 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:27:11,084 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 04:27:11,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239370975] [2022-04-08 04:27:11,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:27:11,085 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-08 04:27:11,085 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:27:11,085 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-08 04:27:12,476 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:27:12,476 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 04:27:12,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:27:12,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 04:27:12,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-04-08 04:27:12,477 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-08 04:27:18,517 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-08 04:27:21,152 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-08 04:27:23,290 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-08 04:27:26,708 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 04:27:28,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:27:28,999 INFO L93 Difference]: Finished difference Result 81 states and 97 transitions. [2022-04-08 04:27:28,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 04:27:29,000 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-08 04:27:29,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:27:29,000 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-08 04:27:29,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2022-04-08 04:27:29,001 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-08 04:27:29,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2022-04-08 04:27:29,002 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 53 transitions. [2022-04-08 04:27:31,055 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-08 04:27:31,057 INFO L225 Difference]: With dead ends: 81 [2022-04-08 04:27:31,057 INFO L226 Difference]: Without dead ends: 79 [2022-04-08 04:27:31,057 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-04-08 04:27:31,058 INFO L913 BasicCegarLoop]: 36 mSDtfsCounter, 8 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 2 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.8s IncrementalHoareTripleChecker+Time [2022-04-08 04:27:31,058 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 132 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 60 Invalid, 4 Unknown, 0 Unchecked, 9.8s Time] [2022-04-08 04:27:31,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-04-08 04:27:31,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 76. [2022-04-08 04:27:31,129 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:27:31,130 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-08 04:27:31,130 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-08 04:27:31,131 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-08 04:27:31,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:27:31,133 INFO L93 Difference]: Finished difference Result 79 states and 95 transitions. [2022-04-08 04:27:31,133 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 95 transitions. [2022-04-08 04:27:31,133 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:27:31,133 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:27:31,134 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-08 04:27:31,134 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-08 04:27:31,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:27:31,138 INFO L93 Difference]: Finished difference Result 79 states and 95 transitions. [2022-04-08 04:27:31,138 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 95 transitions. [2022-04-08 04:27:31,139 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:27:31,139 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:27:31,139 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:27:31,139 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:27:31,140 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-08 04:27:31,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 90 transitions. [2022-04-08 04:27:31,142 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 90 transitions. Word has length 44 [2022-04-08 04:27:31,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:27:31,142 INFO L478 AbstractCegarLoop]: Abstraction has 76 states and 90 transitions. [2022-04-08 04:27:31,142 INFO L479 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-08 04:27:31,142 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 76 states and 90 transitions. [2022-04-08 04:27:33,761 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-08 04:27:33,761 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 90 transitions. [2022-04-08 04:27:33,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-08 04:27:33,762 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:27:33,762 INFO L499 BasicCegarLoop]: 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-08 04:27:33,766 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-08 04:27:33,962 WARN L460 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-08 04:27:33,962 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:27:33,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:27:33,962 INFO L85 PathProgramCache]: Analyzing trace with hash 1352613400, now seen corresponding path program 1 times [2022-04-08 04:27:33,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:27:33,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1496320528] [2022-04-08 04:27:33,963 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 04:27:33,963 INFO L85 PathProgramCache]: Analyzing trace with hash 1352613400, now seen corresponding path program 2 times [2022-04-08 04:27:33,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:27:33,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820433689] [2022-04-08 04:27:33,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:27:33,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:27:33,986 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 04:27:33,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1079923962] [2022-04-08 04:27:33,986 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 04:27:33,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:27:33,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:27:33,995 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 04:27:34,042 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process