/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/hard-u_unwindbound2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 12:57:53,928 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 12:57:53,929 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 12:57:53,962 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 12:57:53,962 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 12:57:53,963 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 12:57:53,964 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 12:57:53,969 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 12:57:53,971 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 12:57:53,974 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 12:57:53,974 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 12:57:53,975 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 12:57:53,975 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 12:57:53,977 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 12:57:53,978 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 12:57:53,979 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 12:57:53,979 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 12:57:53,980 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 12:57:53,982 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 12:57:53,986 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 12:57:53,987 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 12:57:53,988 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 12:57:53,989 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 12:57:53,990 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 12:57:53,991 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 12:57:53,996 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 12:57:53,996 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 12:57:53,996 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 12:57:53,997 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 12:57:53,997 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 12:57:53,997 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 12:57:53,998 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 12:57:53,998 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 12:57:53,998 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 12:57:53,999 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 12:57:53,999 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 12:57:53,999 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 12:57:54,000 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 12:57:54,000 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 12:57:54,000 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 12:57:54,000 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 12:57:54,002 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 12:57:54,003 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-08 12:57:54,009 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 12:57:54,010 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 12:57:54,010 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 12:57:54,010 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 12:57:54,011 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 12:57:54,011 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 12:57:54,011 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 12:57:54,011 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 12:57:54,011 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 12:57:54,012 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 12:57:54,012 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 12:57:54,012 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 12:57:54,012 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 12:57:54,012 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 12:57:54,012 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 12:57:54,012 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 12:57:54,012 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 12:57:54,012 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 12:57:54,012 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 12:57:54,012 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 12:57:54,013 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 12:57:54,013 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-08 12:57:54,013 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 12:57:54,203 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 12:57:54,223 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 12:57:54,224 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 12:57:54,225 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 12:57:54,226 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 12:57:54,226 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/hard-u_unwindbound2.c [2022-04-08 12:57:54,269 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9c0b491a/48ad501d5c5b4db0a2d90fc68b242e5a/FLAG7a94d4a0d [2022-04-08 12:57:54,604 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 12:57:54,604 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/hard-u_unwindbound2.c [2022-04-08 12:57:54,610 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9c0b491a/48ad501d5c5b4db0a2d90fc68b242e5a/FLAG7a94d4a0d [2022-04-08 12:57:54,617 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9c0b491a/48ad501d5c5b4db0a2d90fc68b242e5a [2022-04-08 12:57:54,619 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 12:57:54,619 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 12:57:54,620 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 12:57:54,620 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 12:57:54,623 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 12:57:54,623 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 12:57:54" (1/1) ... [2022-04-08 12:57:54,624 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e4eec94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 12:57:54, skipping insertion in model container [2022-04-08 12:57:54,624 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 12:57:54" (1/1) ... [2022-04-08 12:57:54,628 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 12:57:54,643 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 12:57:54,759 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/hard-u_unwindbound2.c[537,550] [2022-04-08 12:57:54,786 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 12:57:54,799 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 12:57:54,809 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/hard-u_unwindbound2.c[537,550] [2022-04-08 12:57:54,821 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 12:57:54,831 INFO L208 MainTranslator]: Completed translation [2022-04-08 12:57:54,831 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 12:57:54 WrapperNode [2022-04-08 12:57:54,831 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 12:57:54,832 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 12:57:54,832 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 12:57:54,832 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 12:57:54,839 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 12:57:54" (1/1) ... [2022-04-08 12:57:54,839 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 12:57:54" (1/1) ... [2022-04-08 12:57:54,849 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 12:57:54" (1/1) ... [2022-04-08 12:57:54,849 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 12:57:54" (1/1) ... [2022-04-08 12:57:54,859 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 12:57:54" (1/1) ... [2022-04-08 12:57:54,864 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 12:57:54" (1/1) ... [2022-04-08 12:57:54,869 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 12:57:54" (1/1) ... [2022-04-08 12:57:54,870 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 12:57:54,871 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 12:57:54,871 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 12:57:54,871 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 12:57:54,872 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 12:57:54" (1/1) ... [2022-04-08 12:57:54,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 12:57:54,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:57:54,891 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 12:57:54,909 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 12:57:54,918 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 12:57:54,918 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 12:57:54,918 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 12:57:54,919 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-08 12:57:54,919 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 12:57:54,919 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 12:57:54,919 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 12:57:54,919 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 12:57:54,919 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 12:57:54,919 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 12:57:54,920 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-08 12:57:54,920 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-08 12:57:54,920 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 12:57:54,920 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 12:57:54,921 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 12:57:54,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 12:57:54,921 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 12:57:54,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 12:57:54,921 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 12:57:54,921 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 12:57:54,962 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 12:57:54,963 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 12:57:55,074 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 12:57:55,078 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 12:57:55,078 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-08 12:57:55,079 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 12:57:55 BoogieIcfgContainer [2022-04-08 12:57:55,079 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 12:57:55,080 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 12:57:55,080 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 12:57:55,082 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 12:57:55,083 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 12:57:54" (1/3) ... [2022-04-08 12:57:55,083 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@203c7ca1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 12:57:55, skipping insertion in model container [2022-04-08 12:57:55,083 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 12:57:54" (2/3) ... [2022-04-08 12:57:55,083 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@203c7ca1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 12:57:55, skipping insertion in model container [2022-04-08 12:57:55,083 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 12:57:55" (3/3) ... [2022-04-08 12:57:55,084 INFO L111 eAbstractionObserver]: Analyzing ICFG hard-u_unwindbound2.c [2022-04-08 12:57:55,087 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 12:57:55,087 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 12:57:55,111 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 12:57:55,115 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 12:57:55,115 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 12:57:55,136 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 22 states have internal predecessors, (31), 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 12:57:55,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-08 12:57:55,140 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:57:55,141 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 12:57:55,141 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:57:55,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:57:55,144 INFO L85 PathProgramCache]: Analyzing trace with hash 1191571617, now seen corresponding path program 1 times [2022-04-08 12:57:55,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:57:55,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1391933038] [2022-04-08 12:57:55,155 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:57:55,156 INFO L85 PathProgramCache]: Analyzing trace with hash 1191571617, now seen corresponding path program 2 times [2022-04-08 12:57:55,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:57:55,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248509804] [2022-04-08 12:57:55,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:57:55,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:57:55,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:57:55,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 12:57:55,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:57:55,292 INFO L290 TraceCheckUtils]: 0: Hoare triple {49#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {40#true} is VALID [2022-04-08 12:57:55,292 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#true} assume true; {40#true} is VALID [2022-04-08 12:57:55,293 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {40#true} {40#true} #96#return; {40#true} is VALID [2022-04-08 12:57:55,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-08 12:57:55,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:57:55,305 INFO L290 TraceCheckUtils]: 0: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2022-04-08 12:57:55,306 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#true} assume 0 == ~cond;assume false; {41#false} is VALID [2022-04-08 12:57:55,306 INFO L290 TraceCheckUtils]: 2: Hoare triple {41#false} assume true; {41#false} is VALID [2022-04-08 12:57:55,306 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41#false} {40#true} #80#return; {41#false} is VALID [2022-04-08 12:57:55,307 INFO L272 TraceCheckUtils]: 0: Hoare triple {40#true} call ULTIMATE.init(); {49#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 12:57:55,307 INFO L290 TraceCheckUtils]: 1: Hoare triple {49#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {40#true} is VALID [2022-04-08 12:57:55,307 INFO L290 TraceCheckUtils]: 2: Hoare triple {40#true} assume true; {40#true} is VALID [2022-04-08 12:57:55,307 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40#true} {40#true} #96#return; {40#true} is VALID [2022-04-08 12:57:55,308 INFO L272 TraceCheckUtils]: 4: Hoare triple {40#true} call #t~ret8 := main(); {40#true} is VALID [2022-04-08 12:57:55,308 INFO L290 TraceCheckUtils]: 5: Hoare triple {40#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; {40#true} is VALID [2022-04-08 12:57:55,308 INFO L272 TraceCheckUtils]: 6: Hoare triple {40#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {40#true} is VALID [2022-04-08 12:57:55,308 INFO L290 TraceCheckUtils]: 7: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2022-04-08 12:57:55,309 INFO L290 TraceCheckUtils]: 8: Hoare triple {40#true} assume 0 == ~cond;assume false; {41#false} is VALID [2022-04-08 12:57:55,309 INFO L290 TraceCheckUtils]: 9: Hoare triple {41#false} assume true; {41#false} is VALID [2022-04-08 12:57:55,309 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {41#false} {40#true} #80#return; {41#false} is VALID [2022-04-08 12:57:55,309 INFO L290 TraceCheckUtils]: 11: Hoare triple {41#false} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {41#false} is VALID [2022-04-08 12:57:55,309 INFO L290 TraceCheckUtils]: 12: Hoare triple {41#false} assume !true; {41#false} is VALID [2022-04-08 12:57:55,309 INFO L290 TraceCheckUtils]: 13: Hoare triple {41#false} assume !true; {41#false} is VALID [2022-04-08 12:57:55,310 INFO L272 TraceCheckUtils]: 14: Hoare triple {41#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~d~0 * ~q~0 + ~r~0) % 4294967296 then 1 else 0)); {41#false} is VALID [2022-04-08 12:57:55,310 INFO L290 TraceCheckUtils]: 15: Hoare triple {41#false} ~cond := #in~cond; {41#false} is VALID [2022-04-08 12:57:55,310 INFO L290 TraceCheckUtils]: 16: Hoare triple {41#false} assume 0 == ~cond; {41#false} is VALID [2022-04-08 12:57:55,310 INFO L290 TraceCheckUtils]: 17: Hoare triple {41#false} assume !false; {41#false} is VALID [2022-04-08 12:57:55,310 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 12:57:55,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:57:55,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248509804] [2022-04-08 12:57:55,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248509804] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:57:55,311 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:57:55,312 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 12:57:55,313 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:57:55,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1391933038] [2022-04-08 12:57:55,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1391933038] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:57:55,314 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:57:55,314 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 12:57:55,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548646550] [2022-04-08 12:57:55,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:57:55,317 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (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 18 [2022-04-08 12:57:55,318 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:57:55,320 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (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 12:57:55,335 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:57:55,335 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-08 12:57:55,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:57:55,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-08 12:57:55,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 12:57:55,360 INFO L87 Difference]: Start difference. First operand has 37 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 22 states have internal predecessors, (31), 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 4.0) internal successors, (12), 2 states have internal predecessors, (12), 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 12:57:55,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:57:55,492 INFO L93 Difference]: Finished difference Result 66 states and 101 transitions. [2022-04-08 12:57:55,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-08 12:57:55,492 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (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 18 [2022-04-08 12:57:55,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:57:55,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (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 12:57:55,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions. [2022-04-08 12:57:55,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (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 12:57:55,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions. [2022-04-08 12:57:55,504 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 101 transitions. [2022-04-08 12:57:55,627 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:57:55,637 INFO L225 Difference]: With dead ends: 66 [2022-04-08 12:57:55,637 INFO L226 Difference]: Without dead ends: 33 [2022-04-08 12:57:55,640 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 12:57:55,643 INFO L913 BasicCegarLoop]: 45 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 12:57:55,645 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 49 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 12:57:55,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-08 12:57:55,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2022-04-08 12:57:55,675 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:57:55,676 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 32 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 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 12:57:55,676 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 32 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 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 12:57:55,677 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 32 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 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 12:57:55,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:57:55,690 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2022-04-08 12:57:55,690 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2022-04-08 12:57:55,691 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:57:55,691 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:57:55,691 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 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 33 states. [2022-04-08 12:57:55,692 INFO L87 Difference]: Start difference. First operand has 32 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 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 33 states. [2022-04-08 12:57:55,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:57:55,694 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2022-04-08 12:57:55,695 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2022-04-08 12:57:55,695 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:57:55,695 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:57:55,695 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:57:55,695 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:57:55,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 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 12:57:55,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2022-04-08 12:57:55,698 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 18 [2022-04-08 12:57:55,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:57:55,699 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 42 transitions. [2022-04-08 12:57:55,699 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (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 12:57:55,699 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 42 transitions. [2022-04-08 12:57:55,737 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:57:55,737 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-08 12:57:55,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-08 12:57:55,738 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:57:55,738 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 12:57:55,738 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 12:57:55,738 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:57:55,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:57:55,739 INFO L85 PathProgramCache]: Analyzing trace with hash 336486197, now seen corresponding path program 1 times [2022-04-08 12:57:55,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:57:55,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [396543386] [2022-04-08 12:57:55,740 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:57:55,740 INFO L85 PathProgramCache]: Analyzing trace with hash 336486197, now seen corresponding path program 2 times [2022-04-08 12:57:55,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:57:55,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961053845] [2022-04-08 12:57:55,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:57:55,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:57:55,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:57:55,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 12:57:55,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:57:55,809 INFO L290 TraceCheckUtils]: 0: Hoare triple {326#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {314#true} is VALID [2022-04-08 12:57:55,809 INFO L290 TraceCheckUtils]: 1: Hoare triple {314#true} assume true; {314#true} is VALID [2022-04-08 12:57:55,810 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {314#true} {314#true} #96#return; {314#true} is VALID [2022-04-08 12:57:55,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-08 12:57:55,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:57:55,814 INFO L290 TraceCheckUtils]: 0: Hoare triple {314#true} ~cond := #in~cond; {314#true} is VALID [2022-04-08 12:57:55,815 INFO L290 TraceCheckUtils]: 1: Hoare triple {314#true} assume !(0 == ~cond); {314#true} is VALID [2022-04-08 12:57:55,815 INFO L290 TraceCheckUtils]: 2: Hoare triple {314#true} assume true; {314#true} is VALID [2022-04-08 12:57:55,815 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {314#true} {314#true} #80#return; {314#true} is VALID [2022-04-08 12:57:55,816 INFO L272 TraceCheckUtils]: 0: Hoare triple {314#true} call ULTIMATE.init(); {326#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 12:57:55,816 INFO L290 TraceCheckUtils]: 1: Hoare triple {326#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {314#true} is VALID [2022-04-08 12:57:55,816 INFO L290 TraceCheckUtils]: 2: Hoare triple {314#true} assume true; {314#true} is VALID [2022-04-08 12:57:55,816 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {314#true} {314#true} #96#return; {314#true} is VALID [2022-04-08 12:57:55,816 INFO L272 TraceCheckUtils]: 4: Hoare triple {314#true} call #t~ret8 := main(); {314#true} is VALID [2022-04-08 12:57:55,816 INFO L290 TraceCheckUtils]: 5: Hoare triple {314#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; {314#true} is VALID [2022-04-08 12:57:55,817 INFO L272 TraceCheckUtils]: 6: Hoare triple {314#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {314#true} is VALID [2022-04-08 12:57:55,817 INFO L290 TraceCheckUtils]: 7: Hoare triple {314#true} ~cond := #in~cond; {314#true} is VALID [2022-04-08 12:57:55,817 INFO L290 TraceCheckUtils]: 8: Hoare triple {314#true} assume !(0 == ~cond); {314#true} is VALID [2022-04-08 12:57:55,817 INFO L290 TraceCheckUtils]: 9: Hoare triple {314#true} assume true; {314#true} is VALID [2022-04-08 12:57:55,817 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {314#true} {314#true} #80#return; {314#true} is VALID [2022-04-08 12:57:55,818 INFO L290 TraceCheckUtils]: 11: Hoare triple {314#true} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {323#(= main_~q~0 0)} is VALID [2022-04-08 12:57:55,818 INFO L290 TraceCheckUtils]: 12: Hoare triple {323#(= main_~q~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {323#(= main_~q~0 0)} is VALID [2022-04-08 12:57:55,818 INFO L290 TraceCheckUtils]: 13: Hoare triple {323#(= main_~q~0 0)} assume !!(#t~post6 < 2);havoc #t~post6; {323#(= main_~q~0 0)} is VALID [2022-04-08 12:57:55,819 INFO L272 TraceCheckUtils]: 14: Hoare triple {323#(= main_~q~0 0)} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {324#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 12:57:55,819 INFO L290 TraceCheckUtils]: 15: Hoare triple {324#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {325#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 12:57:55,820 INFO L290 TraceCheckUtils]: 16: Hoare triple {325#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {315#false} is VALID [2022-04-08 12:57:55,820 INFO L290 TraceCheckUtils]: 17: Hoare triple {315#false} assume !false; {315#false} is VALID [2022-04-08 12:57:55,820 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 12:57:55,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:57:55,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961053845] [2022-04-08 12:57:55,821 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961053845] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:57:55,821 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:57:55,821 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 12:57:55,822 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:57:55,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [396543386] [2022-04-08 12:57:55,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [396543386] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:57:55,822 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:57:55,822 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 12:57:55,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455508691] [2022-04-08 12:57:55,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:57:55,823 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 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 18 [2022-04-08 12:57:55,823 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:57:55,823 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 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 12:57:55,835 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:57:55,835 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 12:57:55,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:57:55,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 12:57:55,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-08 12:57:55,836 INFO L87 Difference]: Start difference. First operand 32 states and 42 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 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 12:57:56,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:57:56,152 INFO L93 Difference]: Finished difference Result 47 states and 62 transitions. [2022-04-08 12:57:56,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 12:57:56,153 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 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 18 [2022-04-08 12:57:56,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:57:56,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 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 12:57:56,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 62 transitions. [2022-04-08 12:57:56,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 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 12:57:56,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 62 transitions. [2022-04-08 12:57:56,164 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 62 transitions. [2022-04-08 12:57:56,226 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 12:57:56,228 INFO L225 Difference]: With dead ends: 47 [2022-04-08 12:57:56,228 INFO L226 Difference]: Without dead ends: 45 [2022-04-08 12:57:56,228 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 12:57:56,229 INFO L913 BasicCegarLoop]: 39 mSDtfsCounter, 28 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 12:57:56,229 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 90 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 12:57:56,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-08 12:57:56,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 36. [2022-04-08 12:57:56,234 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:57:56,235 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 36 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 22 states have internal predecessors, (27), 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 12:57:56,235 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 36 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 22 states have internal predecessors, (27), 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 12:57:56,235 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 36 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 22 states have internal predecessors, (27), 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 12:57:56,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:57:56,238 INFO L93 Difference]: Finished difference Result 45 states and 60 transitions. [2022-04-08 12:57:56,238 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 60 transitions. [2022-04-08 12:57:56,238 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:57:56,238 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:57:56,239 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 22 states have internal predecessors, (27), 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 45 states. [2022-04-08 12:57:56,239 INFO L87 Difference]: Start difference. First operand has 36 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 22 states have internal predecessors, (27), 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 45 states. [2022-04-08 12:57:56,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:57:56,241 INFO L93 Difference]: Finished difference Result 45 states and 60 transitions. [2022-04-08 12:57:56,241 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 60 transitions. [2022-04-08 12:57:56,242 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:57:56,242 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:57:56,242 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:57:56,242 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:57:56,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 22 states have internal predecessors, (27), 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 12:57:56,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 45 transitions. [2022-04-08 12:57:56,260 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 45 transitions. Word has length 18 [2022-04-08 12:57:56,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:57:56,260 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 45 transitions. [2022-04-08 12:57:56,260 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 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 12:57:56,260 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 45 transitions. [2022-04-08 12:57:56,317 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:57:56,317 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 45 transitions. [2022-04-08 12:57:56,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-08 12:57:56,318 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:57:56,318 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 12:57:56,318 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-08 12:57:56,318 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:57:56,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:57:56,318 INFO L85 PathProgramCache]: Analyzing trace with hash -1819267188, now seen corresponding path program 1 times [2022-04-08 12:57:56,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:57:56,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1871925242] [2022-04-08 12:57:56,319 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:57:56,319 INFO L85 PathProgramCache]: Analyzing trace with hash -1819267188, now seen corresponding path program 2 times [2022-04-08 12:57:56,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:57:56,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926856957] [2022-04-08 12:57:56,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:57:56,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:57:56,331 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:57:56,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [642036807] [2022-04-08 12:57:56,331 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 12:57:56,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:57:56,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:57:56,344 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 12:57:56,344 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 12:57:56,381 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-08 12:57:56,381 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:57:56,382 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-08 12:57:56,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:57:56,390 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:57:56,529 INFO L272 TraceCheckUtils]: 0: Hoare triple {593#true} call ULTIMATE.init(); {593#true} is VALID [2022-04-08 12:57:56,530 INFO L290 TraceCheckUtils]: 1: Hoare triple {593#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);~counter~0 := 0; {601#(<= ~counter~0 0)} is VALID [2022-04-08 12:57:56,530 INFO L290 TraceCheckUtils]: 2: Hoare triple {601#(<= ~counter~0 0)} assume true; {601#(<= ~counter~0 0)} is VALID [2022-04-08 12:57:56,532 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {601#(<= ~counter~0 0)} {593#true} #96#return; {601#(<= ~counter~0 0)} is VALID [2022-04-08 12:57:56,532 INFO L272 TraceCheckUtils]: 4: Hoare triple {601#(<= ~counter~0 0)} call #t~ret8 := main(); {601#(<= ~counter~0 0)} is VALID [2022-04-08 12:57:56,533 INFO L290 TraceCheckUtils]: 5: Hoare triple {601#(<= ~counter~0 0)} 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; {601#(<= ~counter~0 0)} is VALID [2022-04-08 12:57:56,533 INFO L272 TraceCheckUtils]: 6: Hoare triple {601#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {601#(<= ~counter~0 0)} is VALID [2022-04-08 12:57:56,534 INFO L290 TraceCheckUtils]: 7: Hoare triple {601#(<= ~counter~0 0)} ~cond := #in~cond; {601#(<= ~counter~0 0)} is VALID [2022-04-08 12:57:56,534 INFO L290 TraceCheckUtils]: 8: Hoare triple {601#(<= ~counter~0 0)} assume !(0 == ~cond); {601#(<= ~counter~0 0)} is VALID [2022-04-08 12:57:56,535 INFO L290 TraceCheckUtils]: 9: Hoare triple {601#(<= ~counter~0 0)} assume true; {601#(<= ~counter~0 0)} is VALID [2022-04-08 12:57:56,535 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {601#(<= ~counter~0 0)} {601#(<= ~counter~0 0)} #80#return; {601#(<= ~counter~0 0)} is VALID [2022-04-08 12:57:56,536 INFO L290 TraceCheckUtils]: 11: Hoare triple {601#(<= ~counter~0 0)} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {601#(<= ~counter~0 0)} is VALID [2022-04-08 12:57:56,536 INFO L290 TraceCheckUtils]: 12: Hoare triple {601#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {635#(<= |main_#t~post6| 0)} is VALID [2022-04-08 12:57:56,537 INFO L290 TraceCheckUtils]: 13: Hoare triple {635#(<= |main_#t~post6| 0)} assume !(#t~post6 < 2);havoc #t~post6; {594#false} is VALID [2022-04-08 12:57:56,537 INFO L290 TraceCheckUtils]: 14: Hoare triple {594#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {594#false} is VALID [2022-04-08 12:57:56,537 INFO L290 TraceCheckUtils]: 15: Hoare triple {594#false} assume !(#t~post7 < 2);havoc #t~post7; {594#false} is VALID [2022-04-08 12:57:56,537 INFO L272 TraceCheckUtils]: 16: Hoare triple {594#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~d~0 * ~q~0 + ~r~0) % 4294967296 then 1 else 0)); {594#false} is VALID [2022-04-08 12:57:56,537 INFO L290 TraceCheckUtils]: 17: Hoare triple {594#false} ~cond := #in~cond; {594#false} is VALID [2022-04-08 12:57:56,537 INFO L290 TraceCheckUtils]: 18: Hoare triple {594#false} assume 0 == ~cond; {594#false} is VALID [2022-04-08 12:57:56,538 INFO L290 TraceCheckUtils]: 19: Hoare triple {594#false} assume !false; {594#false} is VALID [2022-04-08 12:57:56,538 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 12:57:56,538 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 12:57:56,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:57:56,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926856957] [2022-04-08 12:57:56,539 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:57:56,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [642036807] [2022-04-08 12:57:56,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [642036807] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:57:56,539 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:57:56,539 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 12:57:56,540 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:57:56,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1871925242] [2022-04-08 12:57:56,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1871925242] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:57:56,540 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:57:56,540 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 12:57:56,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510745650] [2022-04-08 12:57:56,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:57:56,541 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-04-08 12:57:56,541 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:57:56,541 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 12:57:56,555 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:57:56,555 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 12:57:56,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:57:56,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 12:57:56,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 12:57:56,555 INFO L87 Difference]: Start difference. First operand 36 states and 45 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 12:57:56,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:57:56,646 INFO L93 Difference]: Finished difference Result 52 states and 67 transitions. [2022-04-08 12:57:56,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 12:57:56,646 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-04-08 12:57:56,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:57:56,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 12:57:56,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 64 transitions. [2022-04-08 12:57:56,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 12:57:56,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 64 transitions. [2022-04-08 12:57:56,649 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 64 transitions. [2022-04-08 12:57:56,697 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 12:57:56,698 INFO L225 Difference]: With dead ends: 52 [2022-04-08 12:57:56,698 INFO L226 Difference]: Without dead ends: 38 [2022-04-08 12:57:56,698 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 12:57:56,699 INFO L913 BasicCegarLoop]: 40 mSDtfsCounter, 0 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 12:57:56,699 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 107 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 12:57:56,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-08 12:57:56,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-04-08 12:57:56,709 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:57:56,709 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 38 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 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 12:57:56,710 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 38 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 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 12:57:56,710 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 38 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 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 12:57:56,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:57:56,712 INFO L93 Difference]: Finished difference Result 38 states and 47 transitions. [2022-04-08 12:57:56,712 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 47 transitions. [2022-04-08 12:57:56,713 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:57:56,713 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:57:56,713 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 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 38 states. [2022-04-08 12:57:56,713 INFO L87 Difference]: Start difference. First operand has 38 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 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 38 states. [2022-04-08 12:57:56,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:57:56,715 INFO L93 Difference]: Finished difference Result 38 states and 47 transitions. [2022-04-08 12:57:56,715 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 47 transitions. [2022-04-08 12:57:56,715 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:57:56,715 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:57:56,715 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:57:56,715 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:57:56,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 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 12:57:56,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 47 transitions. [2022-04-08 12:57:56,717 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 47 transitions. Word has length 20 [2022-04-08 12:57:56,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:57:56,717 INFO L478 AbstractCegarLoop]: Abstraction has 38 states and 47 transitions. [2022-04-08 12:57:56,717 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 12:57:56,717 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 47 transitions. [2022-04-08 12:57:56,761 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:57:56,761 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 47 transitions. [2022-04-08 12:57:56,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-08 12:57:56,762 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:57:56,762 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, 1] [2022-04-08 12:57:56,791 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-08 12:57:56,975 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:57:56,975 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:57:56,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:57:56,976 INFO L85 PathProgramCache]: Analyzing trace with hash -784889968, now seen corresponding path program 1 times [2022-04-08 12:57:56,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:57:56,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [166144603] [2022-04-08 12:57:56,977 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:57:56,977 INFO L85 PathProgramCache]: Analyzing trace with hash -784889968, now seen corresponding path program 2 times [2022-04-08 12:57:56,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:57:56,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152676181] [2022-04-08 12:57:56,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:57:56,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:57:57,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:57:57,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 12:57:57,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:57:57,074 INFO L290 TraceCheckUtils]: 0: Hoare triple {928#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {912#true} is VALID [2022-04-08 12:57:57,074 INFO L290 TraceCheckUtils]: 1: Hoare triple {912#true} assume true; {912#true} is VALID [2022-04-08 12:57:57,074 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {912#true} {912#true} #96#return; {912#true} is VALID [2022-04-08 12:57:57,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-08 12:57:57,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:57:57,077 INFO L290 TraceCheckUtils]: 0: Hoare triple {912#true} ~cond := #in~cond; {912#true} is VALID [2022-04-08 12:57:57,077 INFO L290 TraceCheckUtils]: 1: Hoare triple {912#true} assume !(0 == ~cond); {912#true} is VALID [2022-04-08 12:57:57,078 INFO L290 TraceCheckUtils]: 2: Hoare triple {912#true} assume true; {912#true} is VALID [2022-04-08 12:57:57,078 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {912#true} {912#true} #80#return; {912#true} is VALID [2022-04-08 12:57:57,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-04-08 12:57:57,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:57:57,095 INFO L290 TraceCheckUtils]: 0: Hoare triple {912#true} ~cond := #in~cond; {912#true} is VALID [2022-04-08 12:57:57,095 INFO L290 TraceCheckUtils]: 1: Hoare triple {912#true} assume !(0 == ~cond); {912#true} is VALID [2022-04-08 12:57:57,095 INFO L290 TraceCheckUtils]: 2: Hoare triple {912#true} assume true; {912#true} is VALID [2022-04-08 12:57:57,096 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {912#true} {921#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} #82#return; {921#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} is VALID [2022-04-08 12:57:57,096 INFO L272 TraceCheckUtils]: 0: Hoare triple {912#true} call ULTIMATE.init(); {928#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 12:57:57,096 INFO L290 TraceCheckUtils]: 1: Hoare triple {928#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {912#true} is VALID [2022-04-08 12:57:57,097 INFO L290 TraceCheckUtils]: 2: Hoare triple {912#true} assume true; {912#true} is VALID [2022-04-08 12:57:57,097 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {912#true} {912#true} #96#return; {912#true} is VALID [2022-04-08 12:57:57,097 INFO L272 TraceCheckUtils]: 4: Hoare triple {912#true} call #t~ret8 := main(); {912#true} is VALID [2022-04-08 12:57:57,097 INFO L290 TraceCheckUtils]: 5: Hoare triple {912#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; {912#true} is VALID [2022-04-08 12:57:57,097 INFO L272 TraceCheckUtils]: 6: Hoare triple {912#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {912#true} is VALID [2022-04-08 12:57:57,097 INFO L290 TraceCheckUtils]: 7: Hoare triple {912#true} ~cond := #in~cond; {912#true} is VALID [2022-04-08 12:57:57,097 INFO L290 TraceCheckUtils]: 8: Hoare triple {912#true} assume !(0 == ~cond); {912#true} is VALID [2022-04-08 12:57:57,097 INFO L290 TraceCheckUtils]: 9: Hoare triple {912#true} assume true; {912#true} is VALID [2022-04-08 12:57:57,098 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {912#true} {912#true} #80#return; {912#true} is VALID [2022-04-08 12:57:57,098 INFO L290 TraceCheckUtils]: 11: Hoare triple {912#true} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {921#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} is VALID [2022-04-08 12:57:57,098 INFO L290 TraceCheckUtils]: 12: Hoare triple {921#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {921#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} is VALID [2022-04-08 12:57:57,099 INFO L290 TraceCheckUtils]: 13: Hoare triple {921#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} assume !!(#t~post6 < 2);havoc #t~post6; {921#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} is VALID [2022-04-08 12:57:57,099 INFO L272 TraceCheckUtils]: 14: Hoare triple {921#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {912#true} is VALID [2022-04-08 12:57:57,099 INFO L290 TraceCheckUtils]: 15: Hoare triple {912#true} ~cond := #in~cond; {912#true} is VALID [2022-04-08 12:57:57,099 INFO L290 TraceCheckUtils]: 16: Hoare triple {912#true} assume !(0 == ~cond); {912#true} is VALID [2022-04-08 12:57:57,099 INFO L290 TraceCheckUtils]: 17: Hoare triple {912#true} assume true; {912#true} is VALID [2022-04-08 12:57:57,102 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {912#true} {921#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} #82#return; {921#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} is VALID [2022-04-08 12:57:57,102 INFO L272 TraceCheckUtils]: 19: Hoare triple {921#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} call __VERIFIER_assert((if ~r~0 % 4294967296 == ~A~0 % 4294967296 then 1 else 0)); {926#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 12:57:57,103 INFO L290 TraceCheckUtils]: 20: Hoare triple {926#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {927#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 12:57:57,104 INFO L290 TraceCheckUtils]: 21: Hoare triple {927#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {913#false} is VALID [2022-04-08 12:57:57,104 INFO L290 TraceCheckUtils]: 22: Hoare triple {913#false} assume !false; {913#false} is VALID [2022-04-08 12:57:57,105 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 12:57:57,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:57:57,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152676181] [2022-04-08 12:57:57,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152676181] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:57:57,105 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:57:57,105 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 12:57:57,105 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:57:57,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [166144603] [2022-04-08 12:57:57,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [166144603] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:57:57,106 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:57:57,106 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 12:57:57,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142651147] [2022-04-08 12:57:57,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:57:57,106 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 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 23 [2022-04-08 12:57:57,107 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:57:57,107 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 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 12:57:57,121 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:57:57,122 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 12:57:57,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:57:57,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 12:57:57,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-08 12:57:57,122 INFO L87 Difference]: Start difference. First operand 38 states and 47 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 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 12:57:57,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:57:57,456 INFO L93 Difference]: Finished difference Result 52 states and 66 transitions. [2022-04-08 12:57:57,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 12:57:57,456 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 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 23 [2022-04-08 12:57:57,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:57:57,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 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 12:57:57,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 62 transitions. [2022-04-08 12:57:57,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 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 12:57:57,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 62 transitions. [2022-04-08 12:57:57,459 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 62 transitions. [2022-04-08 12:57:57,508 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 12:57:57,509 INFO L225 Difference]: With dead ends: 52 [2022-04-08 12:57:57,509 INFO L226 Difference]: Without dead ends: 50 [2022-04-08 12:57:57,510 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 12:57:57,511 INFO L913 BasicCegarLoop]: 39 mSDtfsCounter, 23 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 12:57:57,511 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 83 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 12:57:57,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-04-08 12:57:57,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 42. [2022-04-08 12:57:57,528 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:57:57,528 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand has 42 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 27 states have internal predecessors, (32), 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 12:57:57,528 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand has 42 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 27 states have internal predecessors, (32), 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 12:57:57,529 INFO L87 Difference]: Start difference. First operand 50 states. Second operand has 42 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 27 states have internal predecessors, (32), 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 12:57:57,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:57:57,530 INFO L93 Difference]: Finished difference Result 50 states and 64 transitions. [2022-04-08 12:57:57,530 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 64 transitions. [2022-04-08 12:57:57,531 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:57:57,531 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:57:57,531 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 27 states have internal predecessors, (32), 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 50 states. [2022-04-08 12:57:57,531 INFO L87 Difference]: Start difference. First operand has 42 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 27 states have internal predecessors, (32), 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 50 states. [2022-04-08 12:57:57,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:57:57,533 INFO L93 Difference]: Finished difference Result 50 states and 64 transitions. [2022-04-08 12:57:57,533 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 64 transitions. [2022-04-08 12:57:57,533 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:57:57,533 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:57:57,533 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:57:57,534 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:57:57,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 27 states have internal predecessors, (32), 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 12:57:57,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 50 transitions. [2022-04-08 12:57:57,535 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 50 transitions. Word has length 23 [2022-04-08 12:57:57,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:57:57,535 INFO L478 AbstractCegarLoop]: Abstraction has 42 states and 50 transitions. [2022-04-08 12:57:57,535 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 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 12:57:57,535 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 50 transitions. [2022-04-08 12:57:57,576 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:57:57,576 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 50 transitions. [2022-04-08 12:57:57,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-08 12:57:57,577 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:57:57,577 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, 1] [2022-04-08 12:57:57,577 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-08 12:57:57,577 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:57:57,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:57:57,577 INFO L85 PathProgramCache]: Analyzing trace with hash -1024624683, now seen corresponding path program 1 times [2022-04-08 12:57:57,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:57:57,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [726508695] [2022-04-08 12:57:57,578 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:57:57,578 INFO L85 PathProgramCache]: Analyzing trace with hash -1024624683, now seen corresponding path program 2 times [2022-04-08 12:57:57,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:57:57,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912435502] [2022-04-08 12:57:57,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:57:57,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:57:57,589 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:57:57,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [684554154] [2022-04-08 12:57:57,589 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 12:57:57,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:57:57,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:57:57,590 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 12:57:57,591 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 12:57:57,629 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 12:57:57,629 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:57:57,630 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 12:57:57,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:57:57,638 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:57:57,740 INFO L272 TraceCheckUtils]: 0: Hoare triple {1227#true} call ULTIMATE.init(); {1227#true} is VALID [2022-04-08 12:57:57,741 INFO L290 TraceCheckUtils]: 1: Hoare triple {1227#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);~counter~0 := 0; {1227#true} is VALID [2022-04-08 12:57:57,741 INFO L290 TraceCheckUtils]: 2: Hoare triple {1227#true} assume true; {1227#true} is VALID [2022-04-08 12:57:57,741 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1227#true} {1227#true} #96#return; {1227#true} is VALID [2022-04-08 12:57:57,741 INFO L272 TraceCheckUtils]: 4: Hoare triple {1227#true} call #t~ret8 := main(); {1227#true} is VALID [2022-04-08 12:57:57,741 INFO L290 TraceCheckUtils]: 5: Hoare triple {1227#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; {1227#true} is VALID [2022-04-08 12:57:57,741 INFO L272 TraceCheckUtils]: 6: Hoare triple {1227#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {1227#true} is VALID [2022-04-08 12:57:57,741 INFO L290 TraceCheckUtils]: 7: Hoare triple {1227#true} ~cond := #in~cond; {1227#true} is VALID [2022-04-08 12:57:57,741 INFO L290 TraceCheckUtils]: 8: Hoare triple {1227#true} assume !(0 == ~cond); {1227#true} is VALID [2022-04-08 12:57:57,742 INFO L290 TraceCheckUtils]: 9: Hoare triple {1227#true} assume true; {1227#true} is VALID [2022-04-08 12:57:57,742 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1227#true} {1227#true} #80#return; {1227#true} is VALID [2022-04-08 12:57:57,743 INFO L290 TraceCheckUtils]: 11: Hoare triple {1227#true} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {1265#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-08 12:57:57,743 INFO L290 TraceCheckUtils]: 12: Hoare triple {1265#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1265#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-08 12:57:57,751 INFO L290 TraceCheckUtils]: 13: Hoare triple {1265#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} assume !!(#t~post6 < 2);havoc #t~post6; {1265#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-08 12:57:57,751 INFO L272 TraceCheckUtils]: 14: Hoare triple {1265#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {1227#true} is VALID [2022-04-08 12:57:57,751 INFO L290 TraceCheckUtils]: 15: Hoare triple {1227#true} ~cond := #in~cond; {1227#true} is VALID [2022-04-08 12:57:57,752 INFO L290 TraceCheckUtils]: 16: Hoare triple {1227#true} assume !(0 == ~cond); {1227#true} is VALID [2022-04-08 12:57:57,752 INFO L290 TraceCheckUtils]: 17: Hoare triple {1227#true} assume true; {1227#true} is VALID [2022-04-08 12:57:57,752 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1227#true} {1265#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} #82#return; {1265#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-08 12:57:57,753 INFO L272 TraceCheckUtils]: 19: Hoare triple {1265#(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)); {1227#true} is VALID [2022-04-08 12:57:57,753 INFO L290 TraceCheckUtils]: 20: Hoare triple {1227#true} ~cond := #in~cond; {1227#true} is VALID [2022-04-08 12:57:57,753 INFO L290 TraceCheckUtils]: 21: Hoare triple {1227#true} assume !(0 == ~cond); {1227#true} is VALID [2022-04-08 12:57:57,753 INFO L290 TraceCheckUtils]: 22: Hoare triple {1227#true} assume true; {1227#true} is VALID [2022-04-08 12:57:57,754 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1227#true} {1265#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} #84#return; {1265#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-08 12:57:57,754 INFO L272 TraceCheckUtils]: 24: Hoare triple {1265#(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)); {1305#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 12:57:57,755 INFO L290 TraceCheckUtils]: 25: Hoare triple {1305#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1309#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 12:57:57,755 INFO L290 TraceCheckUtils]: 26: Hoare triple {1309#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1228#false} is VALID [2022-04-08 12:57:57,755 INFO L290 TraceCheckUtils]: 27: Hoare triple {1228#false} assume !false; {1228#false} is VALID [2022-04-08 12:57:57,755 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 12:57:57,755 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 12:57:57,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:57:57,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912435502] [2022-04-08 12:57:57,756 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:57:57,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [684554154] [2022-04-08 12:57:57,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [684554154] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:57:57,756 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:57:57,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 12:57:57,756 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:57:57,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [726508695] [2022-04-08 12:57:57,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [726508695] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:57:57,757 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:57:57,757 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 12:57:57,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286254117] [2022-04-08 12:57:57,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:57:57,757 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 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 28 [2022-04-08 12:57:57,757 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:57:57,757 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 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 12:57:57,776 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:57:57,776 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 12:57:57,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:57:57,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 12:57:57,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 12:57:57,777 INFO L87 Difference]: Start difference. First operand 42 states and 50 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 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 12:57:59,932 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 12:58:00,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:58:00,130 INFO L93 Difference]: Finished difference Result 59 states and 75 transitions. [2022-04-08 12:58:00,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 12:58:00,130 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 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 28 [2022-04-08 12:58:00,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:58:00,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 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 12:58:00,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 69 transitions. [2022-04-08 12:58:00,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 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 12:58:00,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 69 transitions. [2022-04-08 12:58:00,132 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 69 transitions. [2022-04-08 12:58:00,189 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:58:00,190 INFO L225 Difference]: With dead ends: 59 [2022-04-08 12:58:00,190 INFO L226 Difference]: Without dead ends: 56 [2022-04-08 12:58:00,191 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 24 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 12:58:00,191 INFO L913 BasicCegarLoop]: 43 mSDtfsCounter, 10 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 140 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.2s IncrementalHoareTripleChecker+Time [2022-04-08 12:58:00,191 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 140 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-04-08 12:58:00,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-04-08 12:58:00,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2022-04-08 12:58:00,205 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:58:00,205 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand has 56 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 35 states have internal predecessors, (42), 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 12:58:00,206 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand has 56 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 35 states have internal predecessors, (42), 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 12:58:00,206 INFO L87 Difference]: Start difference. First operand 56 states. Second operand has 56 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 35 states have internal predecessors, (42), 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 12:58:00,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:58:00,208 INFO L93 Difference]: Finished difference Result 56 states and 71 transitions. [2022-04-08 12:58:00,208 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 71 transitions. [2022-04-08 12:58:00,208 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:58:00,208 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:58:00,208 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 35 states have internal predecessors, (42), 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 56 states. [2022-04-08 12:58:00,209 INFO L87 Difference]: Start difference. First operand has 56 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 35 states have internal predecessors, (42), 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 56 states. [2022-04-08 12:58:00,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:58:00,210 INFO L93 Difference]: Finished difference Result 56 states and 71 transitions. [2022-04-08 12:58:00,210 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 71 transitions. [2022-04-08 12:58:00,210 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:58:00,211 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:58:00,211 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:58:00,211 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:58:00,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 35 states have internal predecessors, (42), 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 12:58:00,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 71 transitions. [2022-04-08 12:58:00,213 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 71 transitions. Word has length 28 [2022-04-08 12:58:00,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:58:00,213 INFO L478 AbstractCegarLoop]: Abstraction has 56 states and 71 transitions. [2022-04-08 12:58:00,213 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 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 12:58:00,213 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 56 states and 71 transitions. [2022-04-08 12:58:00,280 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:58:00,280 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 71 transitions. [2022-04-08 12:58:00,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-08 12:58:00,281 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:58:00,281 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, 1, 1] [2022-04-08 12:58:00,299 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 12:58:00,481 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 12:58:00,482 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:58:00,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:58:00,482 INFO L85 PathProgramCache]: Analyzing trace with hash 1301357193, now seen corresponding path program 1 times [2022-04-08 12:58:00,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:58:00,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1777549943] [2022-04-08 12:58:00,483 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:58:00,483 INFO L85 PathProgramCache]: Analyzing trace with hash 1301357193, now seen corresponding path program 2 times [2022-04-08 12:58:00,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:58:00,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507016604] [2022-04-08 12:58:00,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:58:00,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:58:00,494 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:58:00,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [843728756] [2022-04-08 12:58:00,494 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 12:58:00,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:58:00,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:58:00,495 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 12:58:00,526 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 12:58:00,534 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 12:58:00,534 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:58:00,535 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 12:58:00,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:58:00,544 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:58:00,723 INFO L272 TraceCheckUtils]: 0: Hoare triple {1659#true} call ULTIMATE.init(); {1659#true} is VALID [2022-04-08 12:58:00,724 INFO L290 TraceCheckUtils]: 1: Hoare triple {1659#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);~counter~0 := 0; {1667#(<= ~counter~0 0)} is VALID [2022-04-08 12:58:00,724 INFO L290 TraceCheckUtils]: 2: Hoare triple {1667#(<= ~counter~0 0)} assume true; {1667#(<= ~counter~0 0)} is VALID [2022-04-08 12:58:00,724 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1667#(<= ~counter~0 0)} {1659#true} #96#return; {1667#(<= ~counter~0 0)} is VALID [2022-04-08 12:58:00,725 INFO L272 TraceCheckUtils]: 4: Hoare triple {1667#(<= ~counter~0 0)} call #t~ret8 := main(); {1667#(<= ~counter~0 0)} is VALID [2022-04-08 12:58:00,725 INFO L290 TraceCheckUtils]: 5: Hoare triple {1667#(<= ~counter~0 0)} 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; {1667#(<= ~counter~0 0)} is VALID [2022-04-08 12:58:00,726 INFO L272 TraceCheckUtils]: 6: Hoare triple {1667#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {1667#(<= ~counter~0 0)} is VALID [2022-04-08 12:58:00,726 INFO L290 TraceCheckUtils]: 7: Hoare triple {1667#(<= ~counter~0 0)} ~cond := #in~cond; {1667#(<= ~counter~0 0)} is VALID [2022-04-08 12:58:00,726 INFO L290 TraceCheckUtils]: 8: Hoare triple {1667#(<= ~counter~0 0)} assume !(0 == ~cond); {1667#(<= ~counter~0 0)} is VALID [2022-04-08 12:58:00,726 INFO L290 TraceCheckUtils]: 9: Hoare triple {1667#(<= ~counter~0 0)} assume true; {1667#(<= ~counter~0 0)} is VALID [2022-04-08 12:58:00,727 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1667#(<= ~counter~0 0)} {1667#(<= ~counter~0 0)} #80#return; {1667#(<= ~counter~0 0)} is VALID [2022-04-08 12:58:00,727 INFO L290 TraceCheckUtils]: 11: Hoare triple {1667#(<= ~counter~0 0)} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {1667#(<= ~counter~0 0)} is VALID [2022-04-08 12:58:00,728 INFO L290 TraceCheckUtils]: 12: Hoare triple {1667#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1701#(<= ~counter~0 1)} is VALID [2022-04-08 12:58:00,728 INFO L290 TraceCheckUtils]: 13: Hoare triple {1701#(<= ~counter~0 1)} assume !!(#t~post6 < 2);havoc #t~post6; {1701#(<= ~counter~0 1)} is VALID [2022-04-08 12:58:00,729 INFO L272 TraceCheckUtils]: 14: Hoare triple {1701#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {1701#(<= ~counter~0 1)} is VALID [2022-04-08 12:58:00,729 INFO L290 TraceCheckUtils]: 15: Hoare triple {1701#(<= ~counter~0 1)} ~cond := #in~cond; {1701#(<= ~counter~0 1)} is VALID [2022-04-08 12:58:00,729 INFO L290 TraceCheckUtils]: 16: Hoare triple {1701#(<= ~counter~0 1)} assume !(0 == ~cond); {1701#(<= ~counter~0 1)} is VALID [2022-04-08 12:58:00,729 INFO L290 TraceCheckUtils]: 17: Hoare triple {1701#(<= ~counter~0 1)} assume true; {1701#(<= ~counter~0 1)} is VALID [2022-04-08 12:58:00,730 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1701#(<= ~counter~0 1)} {1701#(<= ~counter~0 1)} #82#return; {1701#(<= ~counter~0 1)} is VALID [2022-04-08 12:58:00,730 INFO L272 TraceCheckUtils]: 19: Hoare triple {1701#(<= ~counter~0 1)} call __VERIFIER_assert((if ~r~0 % 4294967296 == ~A~0 % 4294967296 then 1 else 0)); {1701#(<= ~counter~0 1)} is VALID [2022-04-08 12:58:00,731 INFO L290 TraceCheckUtils]: 20: Hoare triple {1701#(<= ~counter~0 1)} ~cond := #in~cond; {1701#(<= ~counter~0 1)} is VALID [2022-04-08 12:58:00,731 INFO L290 TraceCheckUtils]: 21: Hoare triple {1701#(<= ~counter~0 1)} assume !(0 == ~cond); {1701#(<= ~counter~0 1)} is VALID [2022-04-08 12:58:00,731 INFO L290 TraceCheckUtils]: 22: Hoare triple {1701#(<= ~counter~0 1)} assume true; {1701#(<= ~counter~0 1)} is VALID [2022-04-08 12:58:00,732 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1701#(<= ~counter~0 1)} {1701#(<= ~counter~0 1)} #84#return; {1701#(<= ~counter~0 1)} is VALID [2022-04-08 12:58:00,732 INFO L272 TraceCheckUtils]: 24: Hoare triple {1701#(<= ~counter~0 1)} call __VERIFIER_assert((if ~d~0 % 4294967296 == ~B~0 * ~p~0 % 4294967296 then 1 else 0)); {1701#(<= ~counter~0 1)} is VALID [2022-04-08 12:58:00,733 INFO L290 TraceCheckUtils]: 25: Hoare triple {1701#(<= ~counter~0 1)} ~cond := #in~cond; {1701#(<= ~counter~0 1)} is VALID [2022-04-08 12:58:00,733 INFO L290 TraceCheckUtils]: 26: Hoare triple {1701#(<= ~counter~0 1)} assume !(0 == ~cond); {1701#(<= ~counter~0 1)} is VALID [2022-04-08 12:58:00,733 INFO L290 TraceCheckUtils]: 27: Hoare triple {1701#(<= ~counter~0 1)} assume true; {1701#(<= ~counter~0 1)} is VALID [2022-04-08 12:58:00,734 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1701#(<= ~counter~0 1)} {1701#(<= ~counter~0 1)} #86#return; {1701#(<= ~counter~0 1)} is VALID [2022-04-08 12:58:00,734 INFO L290 TraceCheckUtils]: 29: Hoare triple {1701#(<= ~counter~0 1)} assume !(~r~0 % 4294967296 >= ~d~0 % 4294967296); {1701#(<= ~counter~0 1)} is VALID [2022-04-08 12:58:00,735 INFO L290 TraceCheckUtils]: 30: Hoare triple {1701#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {1756#(<= |main_#t~post7| 1)} is VALID [2022-04-08 12:58:00,735 INFO L290 TraceCheckUtils]: 31: Hoare triple {1756#(<= |main_#t~post7| 1)} assume !(#t~post7 < 2);havoc #t~post7; {1660#false} is VALID [2022-04-08 12:58:00,735 INFO L272 TraceCheckUtils]: 32: Hoare triple {1660#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~d~0 * ~q~0 + ~r~0) % 4294967296 then 1 else 0)); {1660#false} is VALID [2022-04-08 12:58:00,735 INFO L290 TraceCheckUtils]: 33: Hoare triple {1660#false} ~cond := #in~cond; {1660#false} is VALID [2022-04-08 12:58:00,735 INFO L290 TraceCheckUtils]: 34: Hoare triple {1660#false} assume 0 == ~cond; {1660#false} is VALID [2022-04-08 12:58:00,735 INFO L290 TraceCheckUtils]: 35: Hoare triple {1660#false} assume !false; {1660#false} is VALID [2022-04-08 12:58:00,736 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 12:58:00,736 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 12:58:00,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:58:00,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507016604] [2022-04-08 12:58:00,736 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:58:00,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [843728756] [2022-04-08 12:58:00,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [843728756] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:58:00,736 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:58:00,736 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 12:58:00,736 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:58:00,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1777549943] [2022-04-08 12:58:00,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1777549943] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:58:00,737 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:58:00,737 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 12:58:00,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519888874] [2022-04-08 12:58:00,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:58:00,737 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 36 [2022-04-08 12:58:00,737 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:58:00,738 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-08 12:58:00,761 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:58:00,762 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 12:58:00,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:58:00,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 12:58:00,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-08 12:58:00,762 INFO L87 Difference]: Start difference. First operand 56 states and 71 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-08 12:58:00,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:58:00,909 INFO L93 Difference]: Finished difference Result 76 states and 87 transitions. [2022-04-08 12:58:00,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 12:58:00,910 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 36 [2022-04-08 12:58:00,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:58:00,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-08 12:58:00,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-04-08 12:58:00,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-08 12:58:00,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-04-08 12:58:00,912 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 65 transitions. [2022-04-08 12:58:00,959 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:58:00,960 INFO L225 Difference]: With dead ends: 76 [2022-04-08 12:58:00,960 INFO L226 Difference]: Without dead ends: 69 [2022-04-08 12:58:00,960 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-08 12:58:00,961 INFO L913 BasicCegarLoop]: 42 mSDtfsCounter, 7 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 12:58:00,961 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 117 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 12:58:00,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-04-08 12:58:01,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2022-04-08 12:58:01,000 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:58:01,000 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand has 68 states, 42 states have (on average 1.1904761904761905) internal successors, (50), 44 states have internal predecessors, (50), 16 states have call successors, (16), 10 states have call predecessors, (16), 9 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 12:58:01,001 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand has 68 states, 42 states have (on average 1.1904761904761905) internal successors, (50), 44 states have internal predecessors, (50), 16 states have call successors, (16), 10 states have call predecessors, (16), 9 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 12:58:01,001 INFO L87 Difference]: Start difference. First operand 69 states. Second operand has 68 states, 42 states have (on average 1.1904761904761905) internal successors, (50), 44 states have internal predecessors, (50), 16 states have call successors, (16), 10 states have call predecessors, (16), 9 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 12:58:01,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:58:01,003 INFO L93 Difference]: Finished difference Result 69 states and 80 transitions. [2022-04-08 12:58:01,003 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 80 transitions. [2022-04-08 12:58:01,003 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:58:01,003 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:58:01,003 INFO L74 IsIncluded]: Start isIncluded. First operand has 68 states, 42 states have (on average 1.1904761904761905) internal successors, (50), 44 states have internal predecessors, (50), 16 states have call successors, (16), 10 states have call predecessors, (16), 9 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 69 states. [2022-04-08 12:58:01,003 INFO L87 Difference]: Start difference. First operand has 68 states, 42 states have (on average 1.1904761904761905) internal successors, (50), 44 states have internal predecessors, (50), 16 states have call successors, (16), 10 states have call predecessors, (16), 9 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 69 states. [2022-04-08 12:58:01,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:58:01,005 INFO L93 Difference]: Finished difference Result 69 states and 80 transitions. [2022-04-08 12:58:01,005 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 80 transitions. [2022-04-08 12:58:01,005 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:58:01,005 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:58:01,005 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:58:01,005 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:58:01,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 42 states have (on average 1.1904761904761905) internal successors, (50), 44 states have internal predecessors, (50), 16 states have call successors, (16), 10 states have call predecessors, (16), 9 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 12:58:01,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 79 transitions. [2022-04-08 12:58:01,025 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 79 transitions. Word has length 36 [2022-04-08 12:58:01,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:58:01,025 INFO L478 AbstractCegarLoop]: Abstraction has 68 states and 79 transitions. [2022-04-08 12:58:01,025 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-08 12:58:01,025 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 68 states and 79 transitions. [2022-04-08 12:58:01,128 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:58:01,129 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 79 transitions. [2022-04-08 12:58:01,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-08 12:58:01,130 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:58:01,130 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, 1, 1] [2022-04-08 12:58:01,158 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 12:58:01,346 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 12:58:01,346 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:58:01,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:58:01,347 INFO L85 PathProgramCache]: Analyzing trace with hash 1303085071, now seen corresponding path program 1 times [2022-04-08 12:58:01,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:58:01,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1342389205] [2022-04-08 12:58:01,347 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:58:01,347 INFO L85 PathProgramCache]: Analyzing trace with hash 1303085071, now seen corresponding path program 2 times [2022-04-08 12:58:01,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:58:01,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856086651] [2022-04-08 12:58:01,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:58:01,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:58:01,365 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:58:01,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1130843874] [2022-04-08 12:58:01,365 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 12:58:01,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:58:01,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:58:01,367 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 12:58:01,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-08 12:58:01,410 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 12:58:01,411 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:58:01,411 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-08 12:58:01,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:58:01,421 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:58:01,935 INFO L272 TraceCheckUtils]: 0: Hoare triple {2197#true} call ULTIMATE.init(); {2197#true} is VALID [2022-04-08 12:58:01,935 INFO L290 TraceCheckUtils]: 1: Hoare triple {2197#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2197#true} is VALID [2022-04-08 12:58:01,936 INFO L290 TraceCheckUtils]: 2: Hoare triple {2197#true} assume true; {2197#true} is VALID [2022-04-08 12:58:01,936 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2197#true} {2197#true} #96#return; {2197#true} is VALID [2022-04-08 12:58:01,936 INFO L272 TraceCheckUtils]: 4: Hoare triple {2197#true} call #t~ret8 := main(); {2197#true} is VALID [2022-04-08 12:58:01,936 INFO L290 TraceCheckUtils]: 5: Hoare triple {2197#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; {2197#true} is VALID [2022-04-08 12:58:01,936 INFO L272 TraceCheckUtils]: 6: Hoare triple {2197#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {2197#true} is VALID [2022-04-08 12:58:01,936 INFO L290 TraceCheckUtils]: 7: Hoare triple {2197#true} ~cond := #in~cond; {2197#true} is VALID [2022-04-08 12:58:01,936 INFO L290 TraceCheckUtils]: 8: Hoare triple {2197#true} assume !(0 == ~cond); {2197#true} is VALID [2022-04-08 12:58:01,936 INFO L290 TraceCheckUtils]: 9: Hoare triple {2197#true} assume true; {2197#true} is VALID [2022-04-08 12:58:01,936 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2197#true} {2197#true} #80#return; {2197#true} is VALID [2022-04-08 12:58:01,938 INFO L290 TraceCheckUtils]: 11: Hoare triple {2197#true} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {2235#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} is VALID [2022-04-08 12:58:01,938 INFO L290 TraceCheckUtils]: 12: Hoare triple {2235#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2235#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} is VALID [2022-04-08 12:58:01,939 INFO L290 TraceCheckUtils]: 13: Hoare triple {2235#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} assume !!(#t~post6 < 2);havoc #t~post6; {2235#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} is VALID [2022-04-08 12:58:01,939 INFO L272 TraceCheckUtils]: 14: Hoare triple {2235#(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)); {2197#true} is VALID [2022-04-08 12:58:01,939 INFO L290 TraceCheckUtils]: 15: Hoare triple {2197#true} ~cond := #in~cond; {2197#true} is VALID [2022-04-08 12:58:01,939 INFO L290 TraceCheckUtils]: 16: Hoare triple {2197#true} assume !(0 == ~cond); {2197#true} is VALID [2022-04-08 12:58:01,939 INFO L290 TraceCheckUtils]: 17: Hoare triple {2197#true} assume true; {2197#true} is VALID [2022-04-08 12:58:01,940 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2197#true} {2235#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} #82#return; {2235#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} is VALID [2022-04-08 12:58:01,940 INFO L272 TraceCheckUtils]: 19: Hoare triple {2235#(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)); {2197#true} is VALID [2022-04-08 12:58:01,940 INFO L290 TraceCheckUtils]: 20: Hoare triple {2197#true} ~cond := #in~cond; {2197#true} is VALID [2022-04-08 12:58:01,940 INFO L290 TraceCheckUtils]: 21: Hoare triple {2197#true} assume !(0 == ~cond); {2197#true} is VALID [2022-04-08 12:58:01,940 INFO L290 TraceCheckUtils]: 22: Hoare triple {2197#true} assume true; {2197#true} is VALID [2022-04-08 12:58:01,941 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2197#true} {2235#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} #84#return; {2235#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} is VALID [2022-04-08 12:58:01,941 INFO L272 TraceCheckUtils]: 24: Hoare triple {2235#(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)); {2197#true} is VALID [2022-04-08 12:58:01,941 INFO L290 TraceCheckUtils]: 25: Hoare triple {2197#true} ~cond := #in~cond; {2197#true} is VALID [2022-04-08 12:58:01,941 INFO L290 TraceCheckUtils]: 26: Hoare triple {2197#true} assume !(0 == ~cond); {2197#true} is VALID [2022-04-08 12:58:01,941 INFO L290 TraceCheckUtils]: 27: Hoare triple {2197#true} assume true; {2197#true} is VALID [2022-04-08 12:58:01,942 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2197#true} {2235#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} #86#return; {2235#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} is VALID [2022-04-08 12:58:01,942 INFO L290 TraceCheckUtils]: 29: Hoare triple {2235#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} assume !(~r~0 % 4294967296 >= ~d~0 % 4294967296); {2290#(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 12:58:01,946 INFO L290 TraceCheckUtils]: 30: Hoare triple {2290#(and (= main_~A~0 main_~r~0) (not (<= (mod main_~B~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2290#(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 12:58:01,946 INFO L290 TraceCheckUtils]: 31: Hoare triple {2290#(and (= main_~A~0 main_~r~0) (not (<= (mod main_~B~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0))} assume !!(#t~post7 < 2);havoc #t~post7; {2290#(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 12:58:01,947 INFO L272 TraceCheckUtils]: 32: Hoare triple {2290#(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)); {2300#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 12:58:01,947 INFO L290 TraceCheckUtils]: 33: Hoare triple {2300#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2304#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 12:58:01,948 INFO L290 TraceCheckUtils]: 34: Hoare triple {2304#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2198#false} is VALID [2022-04-08 12:58:01,948 INFO L290 TraceCheckUtils]: 35: Hoare triple {2198#false} assume !false; {2198#false} is VALID [2022-04-08 12:58:01,948 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 12:58:01,948 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 12:58:01,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:58:01,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856086651] [2022-04-08 12:58:01,948 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:58:01,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1130843874] [2022-04-08 12:58:01,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1130843874] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:58:01,949 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:58:01,949 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 12:58:01,949 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:58:01,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1342389205] [2022-04-08 12:58:01,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1342389205] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:58:01,949 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:58:01,949 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 12:58:01,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231466952] [2022-04-08 12:58:01,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:58:01,950 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 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 36 [2022-04-08 12:58:01,950 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:58:01,950 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 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 12:58:01,975 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:58:01,975 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 12:58:01,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:58:01,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 12:58:01,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-08 12:58:01,976 INFO L87 Difference]: Start difference. First operand 68 states and 79 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 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 12:58:04,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:58:04,693 INFO L93 Difference]: Finished difference Result 82 states and 98 transitions. [2022-04-08 12:58:04,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 12:58:04,694 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 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 36 [2022-04-08 12:58:04,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:58:04,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 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 12:58:04,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 80 transitions. [2022-04-08 12:58:04,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 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 12:58:04,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 80 transitions. [2022-04-08 12:58:04,696 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 80 transitions. [2022-04-08 12:58:04,774 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:58:04,776 INFO L225 Difference]: With dead ends: 82 [2022-04-08 12:58:04,776 INFO L226 Difference]: Without dead ends: 79 [2022-04-08 12:58:04,776 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-08 12:58:04,777 INFO L913 BasicCegarLoop]: 41 mSDtfsCounter, 14 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 12:58:04,777 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 162 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 12:58:04,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-04-08 12:58:04,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 78. [2022-04-08 12:58:04,822 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:58:04,823 INFO L82 GeneralOperation]: Start isEquivalent. First operand 79 states. Second operand has 78 states, 49 states have (on average 1.2040816326530612) internal successors, (59), 51 states have internal predecessors, (59), 18 states have call successors, (18), 11 states have call predecessors, (18), 10 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-08 12:58:04,824 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand has 78 states, 49 states have (on average 1.2040816326530612) internal successors, (59), 51 states have internal predecessors, (59), 18 states have call successors, (18), 11 states have call predecessors, (18), 10 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-08 12:58:04,825 INFO L87 Difference]: Start difference. First operand 79 states. Second operand has 78 states, 49 states have (on average 1.2040816326530612) internal successors, (59), 51 states have internal predecessors, (59), 18 states have call successors, (18), 11 states have call predecessors, (18), 10 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-08 12:58:04,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:58:04,827 INFO L93 Difference]: Finished difference Result 79 states and 94 transitions. [2022-04-08 12:58:04,827 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 94 transitions. [2022-04-08 12:58:04,827 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:58:04,827 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:58:04,828 INFO L74 IsIncluded]: Start isIncluded. First operand has 78 states, 49 states have (on average 1.2040816326530612) internal successors, (59), 51 states have internal predecessors, (59), 18 states have call successors, (18), 11 states have call predecessors, (18), 10 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) Second operand 79 states. [2022-04-08 12:58:04,828 INFO L87 Difference]: Start difference. First operand has 78 states, 49 states have (on average 1.2040816326530612) internal successors, (59), 51 states have internal predecessors, (59), 18 states have call successors, (18), 11 states have call predecessors, (18), 10 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) Second operand 79 states. [2022-04-08 12:58:04,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:58:04,831 INFO L93 Difference]: Finished difference Result 79 states and 94 transitions. [2022-04-08 12:58:04,831 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 94 transitions. [2022-04-08 12:58:04,832 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:58:04,832 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:58:04,832 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:58:04,832 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:58:04,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 49 states have (on average 1.2040816326530612) internal successors, (59), 51 states have internal predecessors, (59), 18 states have call successors, (18), 11 states have call predecessors, (18), 10 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-08 12:58:04,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 93 transitions. [2022-04-08 12:58:04,834 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 93 transitions. Word has length 36 [2022-04-08 12:58:04,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:58:04,835 INFO L478 AbstractCegarLoop]: Abstraction has 78 states and 93 transitions. [2022-04-08 12:58:04,835 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 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 12:58:04,835 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 78 states and 93 transitions. [2022-04-08 12:58:04,941 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:58:04,941 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 93 transitions. [2022-04-08 12:58:04,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-08 12:58:04,942 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:58:04,942 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 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] [2022-04-08 12:58:04,960 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-08 12:58:05,142 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:58:05,143 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:58:05,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:58:05,143 INFO L85 PathProgramCache]: Analyzing trace with hash -1189074514, now seen corresponding path program 1 times [2022-04-08 12:58:05,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:58:05,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [328388930] [2022-04-08 12:58:06,022 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 12:58:06,022 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 12:58:06,022 INFO L85 PathProgramCache]: Analyzing trace with hash -1189074514, now seen corresponding path program 2 times [2022-04-08 12:58:06,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:58:06,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350184613] [2022-04-08 12:58:06,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:58:06,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:58:06,033 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:58:06,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1406240997] [2022-04-08 12:58:06,034 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 12:58:06,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:58:06,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:58:06,034 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 12:58:06,035 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-08 12:58:06,070 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-08 12:58:06,071 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:58:06,071 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 12:58:06,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:58:06,080 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:58:06,215 INFO L272 TraceCheckUtils]: 0: Hoare triple {2792#true} call ULTIMATE.init(); {2792#true} is VALID [2022-04-08 12:58:06,215 INFO L290 TraceCheckUtils]: 1: Hoare triple {2792#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);~counter~0 := 0; {2792#true} is VALID [2022-04-08 12:58:06,215 INFO L290 TraceCheckUtils]: 2: Hoare triple {2792#true} assume true; {2792#true} is VALID [2022-04-08 12:58:06,215 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2792#true} {2792#true} #96#return; {2792#true} is VALID [2022-04-08 12:58:06,216 INFO L272 TraceCheckUtils]: 4: Hoare triple {2792#true} call #t~ret8 := main(); {2792#true} is VALID [2022-04-08 12:58:06,216 INFO L290 TraceCheckUtils]: 5: Hoare triple {2792#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; {2792#true} is VALID [2022-04-08 12:58:06,216 INFO L272 TraceCheckUtils]: 6: Hoare triple {2792#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {2792#true} is VALID [2022-04-08 12:58:06,216 INFO L290 TraceCheckUtils]: 7: Hoare triple {2792#true} ~cond := #in~cond; {2792#true} is VALID [2022-04-08 12:58:06,216 INFO L290 TraceCheckUtils]: 8: Hoare triple {2792#true} assume !(0 == ~cond); {2792#true} is VALID [2022-04-08 12:58:06,216 INFO L290 TraceCheckUtils]: 9: Hoare triple {2792#true} assume true; {2792#true} is VALID [2022-04-08 12:58:06,216 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2792#true} {2792#true} #80#return; {2792#true} is VALID [2022-04-08 12:58:06,216 INFO L290 TraceCheckUtils]: 11: Hoare triple {2792#true} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {2830#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 12:58:06,217 INFO L290 TraceCheckUtils]: 12: Hoare triple {2830#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2830#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 12:58:06,217 INFO L290 TraceCheckUtils]: 13: Hoare triple {2830#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post6 < 2);havoc #t~post6; {2830#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 12:58:06,217 INFO L272 TraceCheckUtils]: 14: Hoare triple {2830#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {2792#true} is VALID [2022-04-08 12:58:06,217 INFO L290 TraceCheckUtils]: 15: Hoare triple {2792#true} ~cond := #in~cond; {2792#true} is VALID [2022-04-08 12:58:06,217 INFO L290 TraceCheckUtils]: 16: Hoare triple {2792#true} assume !(0 == ~cond); {2792#true} is VALID [2022-04-08 12:58:06,218 INFO L290 TraceCheckUtils]: 17: Hoare triple {2792#true} assume true; {2792#true} is VALID [2022-04-08 12:58:06,218 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2792#true} {2830#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} #82#return; {2830#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 12:58:06,218 INFO L272 TraceCheckUtils]: 19: Hoare triple {2830#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~r~0 % 4294967296 == ~A~0 % 4294967296 then 1 else 0)); {2792#true} is VALID [2022-04-08 12:58:06,218 INFO L290 TraceCheckUtils]: 20: Hoare triple {2792#true} ~cond := #in~cond; {2792#true} is VALID [2022-04-08 12:58:06,218 INFO L290 TraceCheckUtils]: 21: Hoare triple {2792#true} assume !(0 == ~cond); {2792#true} is VALID [2022-04-08 12:58:06,218 INFO L290 TraceCheckUtils]: 22: Hoare triple {2792#true} assume true; {2792#true} is VALID [2022-04-08 12:58:06,219 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2792#true} {2830#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} #84#return; {2830#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 12:58:06,219 INFO L272 TraceCheckUtils]: 24: Hoare triple {2830#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~d~0 % 4294967296 == ~B~0 * ~p~0 % 4294967296 then 1 else 0)); {2792#true} is VALID [2022-04-08 12:58:06,219 INFO L290 TraceCheckUtils]: 25: Hoare triple {2792#true} ~cond := #in~cond; {2792#true} is VALID [2022-04-08 12:58:06,219 INFO L290 TraceCheckUtils]: 26: Hoare triple {2792#true} assume !(0 == ~cond); {2792#true} is VALID [2022-04-08 12:58:06,219 INFO L290 TraceCheckUtils]: 27: Hoare triple {2792#true} assume true; {2792#true} is VALID [2022-04-08 12:58:06,220 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2792#true} {2830#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} #86#return; {2830#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 12:58:06,220 INFO L290 TraceCheckUtils]: 29: Hoare triple {2830#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !!(~r~0 % 4294967296 >= ~d~0 % 4294967296);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {2830#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 12:58:06,221 INFO L290 TraceCheckUtils]: 30: Hoare triple {2830#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2830#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 12:58:06,221 INFO L290 TraceCheckUtils]: 31: Hoare triple {2830#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !(#t~post6 < 2);havoc #t~post6; {2830#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 12:58:06,221 INFO L290 TraceCheckUtils]: 32: Hoare triple {2830#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2830#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 12:58:06,222 INFO L290 TraceCheckUtils]: 33: Hoare triple {2830#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !(#t~post7 < 2);havoc #t~post7; {2830#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 12:58:06,222 INFO L272 TraceCheckUtils]: 34: Hoare triple {2830#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~d~0 * ~q~0 + ~r~0) % 4294967296 then 1 else 0)); {2900#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 12:58:06,223 INFO L290 TraceCheckUtils]: 35: Hoare triple {2900#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2904#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 12:58:06,227 INFO L290 TraceCheckUtils]: 36: Hoare triple {2904#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2793#false} is VALID [2022-04-08 12:58:06,227 INFO L290 TraceCheckUtils]: 37: Hoare triple {2793#false} assume !false; {2793#false} is VALID [2022-04-08 12:58:06,228 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-04-08 12:58:06,228 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 12:58:06,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:58:06,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350184613] [2022-04-08 12:58:06,228 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:58:06,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1406240997] [2022-04-08 12:58:06,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1406240997] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:58:06,228 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:58:06,228 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 12:58:06,228 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:58:06,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [328388930] [2022-04-08 12:58:06,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [328388930] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:58:06,228 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:58:06,229 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 12:58:06,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256144244] [2022-04-08 12:58:06,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:58:06,229 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 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 38 [2022-04-08 12:58:06,229 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:58:06,229 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 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 12:58:06,252 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:58:06,253 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 12:58:06,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:58:06,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 12:58:06,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 12:58:06,253 INFO L87 Difference]: Start difference. First operand 78 states and 93 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 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 12:58:06,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:58:06,498 INFO L93 Difference]: Finished difference Result 92 states and 112 transitions. [2022-04-08 12:58:06,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 12:58:06,498 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 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 38 [2022-04-08 12:58:06,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:58:06,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 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 12:58:06,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 61 transitions. [2022-04-08 12:58:06,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 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 12:58:06,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 61 transitions. [2022-04-08 12:58:06,500 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 61 transitions. [2022-04-08 12:58:06,549 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:58:06,550 INFO L225 Difference]: With dead ends: 92 [2022-04-08 12:58:06,550 INFO L226 Difference]: Without dead ends: 90 [2022-04-08 12:58:06,551 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 34 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 12:58:06,551 INFO L913 BasicCegarLoop]: 35 mSDtfsCounter, 10 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 12:58:06,551 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 118 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 12:58:06,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-04-08 12:58:06,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2022-04-08 12:58:06,603 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:58:06,603 INFO L82 GeneralOperation]: Start isEquivalent. First operand 90 states. Second operand has 89 states, 56 states have (on average 1.2321428571428572) internal successors, (69), 59 states have internal predecessors, (69), 21 states have call successors, (21), 12 states have call predecessors, (21), 11 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-08 12:58:06,603 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand has 89 states, 56 states have (on average 1.2321428571428572) internal successors, (69), 59 states have internal predecessors, (69), 21 states have call successors, (21), 12 states have call predecessors, (21), 11 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-08 12:58:06,603 INFO L87 Difference]: Start difference. First operand 90 states. Second operand has 89 states, 56 states have (on average 1.2321428571428572) internal successors, (69), 59 states have internal predecessors, (69), 21 states have call successors, (21), 12 states have call predecessors, (21), 11 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-08 12:58:06,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:58:06,605 INFO L93 Difference]: Finished difference Result 90 states and 110 transitions. [2022-04-08 12:58:06,606 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 110 transitions. [2022-04-08 12:58:06,606 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:58:06,606 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:58:06,606 INFO L74 IsIncluded]: Start isIncluded. First operand has 89 states, 56 states have (on average 1.2321428571428572) internal successors, (69), 59 states have internal predecessors, (69), 21 states have call successors, (21), 12 states have call predecessors, (21), 11 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) Second operand 90 states. [2022-04-08 12:58:06,606 INFO L87 Difference]: Start difference. First operand has 89 states, 56 states have (on average 1.2321428571428572) internal successors, (69), 59 states have internal predecessors, (69), 21 states have call successors, (21), 12 states have call predecessors, (21), 11 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) Second operand 90 states. [2022-04-08 12:58:06,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:58:06,608 INFO L93 Difference]: Finished difference Result 90 states and 110 transitions. [2022-04-08 12:58:06,608 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 110 transitions. [2022-04-08 12:58:06,609 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:58:06,609 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:58:06,609 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:58:06,609 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:58:06,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 56 states have (on average 1.2321428571428572) internal successors, (69), 59 states have internal predecessors, (69), 21 states have call successors, (21), 12 states have call predecessors, (21), 11 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-08 12:58:06,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 109 transitions. [2022-04-08 12:58:06,612 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 109 transitions. Word has length 38 [2022-04-08 12:58:06,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:58:06,612 INFO L478 AbstractCegarLoop]: Abstraction has 89 states and 109 transitions. [2022-04-08 12:58:06,612 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 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 12:58:06,612 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 89 states and 109 transitions. [2022-04-08 12:58:06,724 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:58:06,724 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 109 transitions. [2022-04-08 12:58:06,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-08 12:58:06,724 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:58:06,725 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 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, 1] [2022-04-08 12:58:06,742 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-08 12:58:06,925 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:58:06,925 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:58:06,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:58:06,926 INFO L85 PathProgramCache]: Analyzing trace with hash 817878903, now seen corresponding path program 1 times [2022-04-08 12:58:06,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:58:06,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [888493745] [2022-04-08 12:58:07,753 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 12:58:07,753 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 12:58:07,753 INFO L85 PathProgramCache]: Analyzing trace with hash 817878903, now seen corresponding path program 2 times [2022-04-08 12:58:07,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:58:07,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191005958] [2022-04-08 12:58:07,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:58:07,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:58:07,761 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:58:07,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1634579209] [2022-04-08 12:58:07,762 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 12:58:07,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:58:07,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:58:07,762 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 12:58:07,763 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-08 12:58:07,795 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 12:58:07,795 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:58:07,796 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 12:58:07,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:58:07,811 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:58:07,981 INFO L272 TraceCheckUtils]: 0: Hoare triple {3454#true} call ULTIMATE.init(); {3454#true} is VALID [2022-04-08 12:58:07,982 INFO L290 TraceCheckUtils]: 1: Hoare triple {3454#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);~counter~0 := 0; {3462#(<= ~counter~0 0)} is VALID [2022-04-08 12:58:07,983 INFO L290 TraceCheckUtils]: 2: Hoare triple {3462#(<= ~counter~0 0)} assume true; {3462#(<= ~counter~0 0)} is VALID [2022-04-08 12:58:07,985 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3462#(<= ~counter~0 0)} {3454#true} #96#return; {3462#(<= ~counter~0 0)} is VALID [2022-04-08 12:58:07,985 INFO L272 TraceCheckUtils]: 4: Hoare triple {3462#(<= ~counter~0 0)} call #t~ret8 := main(); {3462#(<= ~counter~0 0)} is VALID [2022-04-08 12:58:07,985 INFO L290 TraceCheckUtils]: 5: Hoare triple {3462#(<= ~counter~0 0)} 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; {3462#(<= ~counter~0 0)} is VALID [2022-04-08 12:58:07,986 INFO L272 TraceCheckUtils]: 6: Hoare triple {3462#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {3462#(<= ~counter~0 0)} is VALID [2022-04-08 12:58:07,986 INFO L290 TraceCheckUtils]: 7: Hoare triple {3462#(<= ~counter~0 0)} ~cond := #in~cond; {3462#(<= ~counter~0 0)} is VALID [2022-04-08 12:58:07,987 INFO L290 TraceCheckUtils]: 8: Hoare triple {3462#(<= ~counter~0 0)} assume !(0 == ~cond); {3462#(<= ~counter~0 0)} is VALID [2022-04-08 12:58:07,987 INFO L290 TraceCheckUtils]: 9: Hoare triple {3462#(<= ~counter~0 0)} assume true; {3462#(<= ~counter~0 0)} is VALID [2022-04-08 12:58:07,988 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3462#(<= ~counter~0 0)} {3462#(<= ~counter~0 0)} #80#return; {3462#(<= ~counter~0 0)} is VALID [2022-04-08 12:58:07,988 INFO L290 TraceCheckUtils]: 11: Hoare triple {3462#(<= ~counter~0 0)} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {3462#(<= ~counter~0 0)} is VALID [2022-04-08 12:58:07,989 INFO L290 TraceCheckUtils]: 12: Hoare triple {3462#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3496#(<= ~counter~0 1)} is VALID [2022-04-08 12:58:07,991 INFO L290 TraceCheckUtils]: 13: Hoare triple {3496#(<= ~counter~0 1)} assume !!(#t~post6 < 2);havoc #t~post6; {3496#(<= ~counter~0 1)} is VALID [2022-04-08 12:58:07,991 INFO L272 TraceCheckUtils]: 14: Hoare triple {3496#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {3496#(<= ~counter~0 1)} is VALID [2022-04-08 12:58:07,992 INFO L290 TraceCheckUtils]: 15: Hoare triple {3496#(<= ~counter~0 1)} ~cond := #in~cond; {3496#(<= ~counter~0 1)} is VALID [2022-04-08 12:58:07,992 INFO L290 TraceCheckUtils]: 16: Hoare triple {3496#(<= ~counter~0 1)} assume !(0 == ~cond); {3496#(<= ~counter~0 1)} is VALID [2022-04-08 12:58:07,993 INFO L290 TraceCheckUtils]: 17: Hoare triple {3496#(<= ~counter~0 1)} assume true; {3496#(<= ~counter~0 1)} is VALID [2022-04-08 12:58:07,993 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {3496#(<= ~counter~0 1)} {3496#(<= ~counter~0 1)} #82#return; {3496#(<= ~counter~0 1)} is VALID [2022-04-08 12:58:07,994 INFO L272 TraceCheckUtils]: 19: Hoare triple {3496#(<= ~counter~0 1)} call __VERIFIER_assert((if ~r~0 % 4294967296 == ~A~0 % 4294967296 then 1 else 0)); {3496#(<= ~counter~0 1)} is VALID [2022-04-08 12:58:07,994 INFO L290 TraceCheckUtils]: 20: Hoare triple {3496#(<= ~counter~0 1)} ~cond := #in~cond; {3496#(<= ~counter~0 1)} is VALID [2022-04-08 12:58:07,994 INFO L290 TraceCheckUtils]: 21: Hoare triple {3496#(<= ~counter~0 1)} assume !(0 == ~cond); {3496#(<= ~counter~0 1)} is VALID [2022-04-08 12:58:07,994 INFO L290 TraceCheckUtils]: 22: Hoare triple {3496#(<= ~counter~0 1)} assume true; {3496#(<= ~counter~0 1)} is VALID [2022-04-08 12:58:07,995 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3496#(<= ~counter~0 1)} {3496#(<= ~counter~0 1)} #84#return; {3496#(<= ~counter~0 1)} is VALID [2022-04-08 12:58:07,995 INFO L272 TraceCheckUtils]: 24: Hoare triple {3496#(<= ~counter~0 1)} call __VERIFIER_assert((if ~d~0 % 4294967296 == ~B~0 * ~p~0 % 4294967296 then 1 else 0)); {3496#(<= ~counter~0 1)} is VALID [2022-04-08 12:58:07,996 INFO L290 TraceCheckUtils]: 25: Hoare triple {3496#(<= ~counter~0 1)} ~cond := #in~cond; {3496#(<= ~counter~0 1)} is VALID [2022-04-08 12:58:07,996 INFO L290 TraceCheckUtils]: 26: Hoare triple {3496#(<= ~counter~0 1)} assume !(0 == ~cond); {3496#(<= ~counter~0 1)} is VALID [2022-04-08 12:58:07,996 INFO L290 TraceCheckUtils]: 27: Hoare triple {3496#(<= ~counter~0 1)} assume true; {3496#(<= ~counter~0 1)} is VALID [2022-04-08 12:58:07,997 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {3496#(<= ~counter~0 1)} {3496#(<= ~counter~0 1)} #86#return; {3496#(<= ~counter~0 1)} is VALID [2022-04-08 12:58:07,997 INFO L290 TraceCheckUtils]: 29: Hoare triple {3496#(<= ~counter~0 1)} assume !!(~r~0 % 4294967296 >= ~d~0 % 4294967296);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {3496#(<= ~counter~0 1)} is VALID [2022-04-08 12:58:07,997 INFO L290 TraceCheckUtils]: 30: Hoare triple {3496#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3551#(<= |main_#t~post6| 1)} is VALID [2022-04-08 12:58:07,998 INFO L290 TraceCheckUtils]: 31: Hoare triple {3551#(<= |main_#t~post6| 1)} assume !(#t~post6 < 2);havoc #t~post6; {3455#false} is VALID [2022-04-08 12:58:07,998 INFO L290 TraceCheckUtils]: 32: Hoare triple {3455#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {3455#false} is VALID [2022-04-08 12:58:07,998 INFO L290 TraceCheckUtils]: 33: Hoare triple {3455#false} assume !(#t~post7 < 2);havoc #t~post7; {3455#false} is VALID [2022-04-08 12:58:07,998 INFO L272 TraceCheckUtils]: 34: Hoare triple {3455#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~d~0 * ~q~0 + ~r~0) % 4294967296 then 1 else 0)); {3455#false} is VALID [2022-04-08 12:58:07,998 INFO L290 TraceCheckUtils]: 35: Hoare triple {3455#false} ~cond := #in~cond; {3455#false} is VALID [2022-04-08 12:58:07,998 INFO L290 TraceCheckUtils]: 36: Hoare triple {3455#false} assume !(0 == ~cond); {3455#false} is VALID [2022-04-08 12:58:07,998 INFO L290 TraceCheckUtils]: 37: Hoare triple {3455#false} assume true; {3455#false} is VALID [2022-04-08 12:58:07,998 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {3455#false} {3455#false} #92#return; {3455#false} is VALID [2022-04-08 12:58:07,998 INFO L272 TraceCheckUtils]: 39: Hoare triple {3455#false} call __VERIFIER_assert((if ~B~0 % 4294967296 == ~d~0 % 4294967296 then 1 else 0)); {3455#false} is VALID [2022-04-08 12:58:07,998 INFO L290 TraceCheckUtils]: 40: Hoare triple {3455#false} ~cond := #in~cond; {3455#false} is VALID [2022-04-08 12:58:07,999 INFO L290 TraceCheckUtils]: 41: Hoare triple {3455#false} assume 0 == ~cond; {3455#false} is VALID [2022-04-08 12:58:07,999 INFO L290 TraceCheckUtils]: 42: Hoare triple {3455#false} assume !false; {3455#false} is VALID [2022-04-08 12:58:07,999 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-04-08 12:58:07,999 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 12:58:08,168 INFO L290 TraceCheckUtils]: 42: Hoare triple {3455#false} assume !false; {3455#false} is VALID [2022-04-08 12:58:08,168 INFO L290 TraceCheckUtils]: 41: Hoare triple {3455#false} assume 0 == ~cond; {3455#false} is VALID [2022-04-08 12:58:08,168 INFO L290 TraceCheckUtils]: 40: Hoare triple {3455#false} ~cond := #in~cond; {3455#false} is VALID [2022-04-08 12:58:08,168 INFO L272 TraceCheckUtils]: 39: Hoare triple {3455#false} call __VERIFIER_assert((if ~B~0 % 4294967296 == ~d~0 % 4294967296 then 1 else 0)); {3455#false} is VALID [2022-04-08 12:58:08,168 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {3454#true} {3455#false} #92#return; {3455#false} is VALID [2022-04-08 12:58:08,168 INFO L290 TraceCheckUtils]: 37: Hoare triple {3454#true} assume true; {3454#true} is VALID [2022-04-08 12:58:08,168 INFO L290 TraceCheckUtils]: 36: Hoare triple {3454#true} assume !(0 == ~cond); {3454#true} is VALID [2022-04-08 12:58:08,168 INFO L290 TraceCheckUtils]: 35: Hoare triple {3454#true} ~cond := #in~cond; {3454#true} is VALID [2022-04-08 12:58:08,168 INFO L272 TraceCheckUtils]: 34: Hoare triple {3455#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~d~0 * ~q~0 + ~r~0) % 4294967296 then 1 else 0)); {3454#true} is VALID [2022-04-08 12:58:08,169 INFO L290 TraceCheckUtils]: 33: Hoare triple {3455#false} assume !(#t~post7 < 2);havoc #t~post7; {3455#false} is VALID [2022-04-08 12:58:08,169 INFO L290 TraceCheckUtils]: 32: Hoare triple {3455#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {3455#false} is VALID [2022-04-08 12:58:08,170 INFO L290 TraceCheckUtils]: 31: Hoare triple {3551#(<= |main_#t~post6| 1)} assume !(#t~post6 < 2);havoc #t~post6; {3455#false} is VALID [2022-04-08 12:58:08,171 INFO L290 TraceCheckUtils]: 30: Hoare triple {3496#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3551#(<= |main_#t~post6| 1)} is VALID [2022-04-08 12:58:08,171 INFO L290 TraceCheckUtils]: 29: Hoare triple {3496#(<= ~counter~0 1)} assume !!(~r~0 % 4294967296 >= ~d~0 % 4294967296);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {3496#(<= ~counter~0 1)} is VALID [2022-04-08 12:58:08,172 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {3454#true} {3496#(<= ~counter~0 1)} #86#return; {3496#(<= ~counter~0 1)} is VALID [2022-04-08 12:58:08,172 INFO L290 TraceCheckUtils]: 27: Hoare triple {3454#true} assume true; {3454#true} is VALID [2022-04-08 12:58:08,172 INFO L290 TraceCheckUtils]: 26: Hoare triple {3454#true} assume !(0 == ~cond); {3454#true} is VALID [2022-04-08 12:58:08,172 INFO L290 TraceCheckUtils]: 25: Hoare triple {3454#true} ~cond := #in~cond; {3454#true} is VALID [2022-04-08 12:58:08,172 INFO L272 TraceCheckUtils]: 24: Hoare triple {3496#(<= ~counter~0 1)} call __VERIFIER_assert((if ~d~0 % 4294967296 == ~B~0 * ~p~0 % 4294967296 then 1 else 0)); {3454#true} is VALID [2022-04-08 12:58:08,172 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3454#true} {3496#(<= ~counter~0 1)} #84#return; {3496#(<= ~counter~0 1)} is VALID [2022-04-08 12:58:08,172 INFO L290 TraceCheckUtils]: 22: Hoare triple {3454#true} assume true; {3454#true} is VALID [2022-04-08 12:58:08,173 INFO L290 TraceCheckUtils]: 21: Hoare triple {3454#true} assume !(0 == ~cond); {3454#true} is VALID [2022-04-08 12:58:08,173 INFO L290 TraceCheckUtils]: 20: Hoare triple {3454#true} ~cond := #in~cond; {3454#true} is VALID [2022-04-08 12:58:08,173 INFO L272 TraceCheckUtils]: 19: Hoare triple {3496#(<= ~counter~0 1)} call __VERIFIER_assert((if ~r~0 % 4294967296 == ~A~0 % 4294967296 then 1 else 0)); {3454#true} is VALID [2022-04-08 12:58:08,173 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {3454#true} {3496#(<= ~counter~0 1)} #82#return; {3496#(<= ~counter~0 1)} is VALID [2022-04-08 12:58:08,173 INFO L290 TraceCheckUtils]: 17: Hoare triple {3454#true} assume true; {3454#true} is VALID [2022-04-08 12:58:08,173 INFO L290 TraceCheckUtils]: 16: Hoare triple {3454#true} assume !(0 == ~cond); {3454#true} is VALID [2022-04-08 12:58:08,173 INFO L290 TraceCheckUtils]: 15: Hoare triple {3454#true} ~cond := #in~cond; {3454#true} is VALID [2022-04-08 12:58:08,174 INFO L272 TraceCheckUtils]: 14: Hoare triple {3496#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {3454#true} is VALID [2022-04-08 12:58:08,174 INFO L290 TraceCheckUtils]: 13: Hoare triple {3496#(<= ~counter~0 1)} assume !!(#t~post6 < 2);havoc #t~post6; {3496#(<= ~counter~0 1)} is VALID [2022-04-08 12:58:08,174 INFO L290 TraceCheckUtils]: 12: Hoare triple {3462#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3496#(<= ~counter~0 1)} is VALID [2022-04-08 12:58:08,175 INFO L290 TraceCheckUtils]: 11: Hoare triple {3462#(<= ~counter~0 0)} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {3462#(<= ~counter~0 0)} is VALID [2022-04-08 12:58:08,175 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3454#true} {3462#(<= ~counter~0 0)} #80#return; {3462#(<= ~counter~0 0)} is VALID [2022-04-08 12:58:08,175 INFO L290 TraceCheckUtils]: 9: Hoare triple {3454#true} assume true; {3454#true} is VALID [2022-04-08 12:58:08,175 INFO L290 TraceCheckUtils]: 8: Hoare triple {3454#true} assume !(0 == ~cond); {3454#true} is VALID [2022-04-08 12:58:08,175 INFO L290 TraceCheckUtils]: 7: Hoare triple {3454#true} ~cond := #in~cond; {3454#true} is VALID [2022-04-08 12:58:08,175 INFO L272 TraceCheckUtils]: 6: Hoare triple {3462#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {3454#true} is VALID [2022-04-08 12:58:08,176 INFO L290 TraceCheckUtils]: 5: Hoare triple {3462#(<= ~counter~0 0)} 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; {3462#(<= ~counter~0 0)} is VALID [2022-04-08 12:58:08,176 INFO L272 TraceCheckUtils]: 4: Hoare triple {3462#(<= ~counter~0 0)} call #t~ret8 := main(); {3462#(<= ~counter~0 0)} is VALID [2022-04-08 12:58:08,177 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3462#(<= ~counter~0 0)} {3454#true} #96#return; {3462#(<= ~counter~0 0)} is VALID [2022-04-08 12:58:08,177 INFO L290 TraceCheckUtils]: 2: Hoare triple {3462#(<= ~counter~0 0)} assume true; {3462#(<= ~counter~0 0)} is VALID [2022-04-08 12:58:08,177 INFO L290 TraceCheckUtils]: 1: Hoare triple {3454#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);~counter~0 := 0; {3462#(<= ~counter~0 0)} is VALID [2022-04-08 12:58:08,177 INFO L272 TraceCheckUtils]: 0: Hoare triple {3454#true} call ULTIMATE.init(); {3454#true} is VALID [2022-04-08 12:58:08,178 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-08 12:58:08,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:58:08,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191005958] [2022-04-08 12:58:08,178 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:58:08,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1634579209] [2022-04-08 12:58:08,178 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1634579209] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 12:58:08,178 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 12:58:08,178 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2022-04-08 12:58:08,178 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:58:08,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [888493745] [2022-04-08 12:58:08,178 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [888493745] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:58:08,178 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:58:08,179 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 12:58:08,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796588116] [2022-04-08 12:58:08,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:58:08,179 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) Word has length 43 [2022-04-08 12:58:08,179 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:58:08,180 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-08 12:58:08,203 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:58:08,204 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 12:58:08,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:58:08,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 12:58:08,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-08 12:58:08,204 INFO L87 Difference]: Start difference. First operand 89 states and 109 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-08 12:58:08,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:58:08,374 INFO L93 Difference]: Finished difference Result 116 states and 147 transitions. [2022-04-08 12:58:08,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 12:58:08,374 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) Word has length 43 [2022-04-08 12:58:08,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:58:08,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-08 12:58:08,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 78 transitions. [2022-04-08 12:58:08,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-08 12:58:08,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 78 transitions. [2022-04-08 12:58:08,376 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 78 transitions. [2022-04-08 12:58:08,433 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:58:08,435 INFO L225 Difference]: With dead ends: 116 [2022-04-08 12:58:08,435 INFO L226 Difference]: Without dead ends: 91 [2022-04-08 12:58:08,436 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 81 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-08 12:58:08,436 INFO L913 BasicCegarLoop]: 42 mSDtfsCounter, 7 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 12:58:08,436 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 136 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 12:58:08,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-04-08 12:58:08,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2022-04-08 12:58:08,484 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:58:08,485 INFO L82 GeneralOperation]: Start isEquivalent. First operand 91 states. Second operand has 91 states, 58 states have (on average 1.2241379310344827) internal successors, (71), 61 states have internal predecessors, (71), 21 states have call successors, (21), 12 states have call predecessors, (21), 11 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-08 12:58:08,485 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand has 91 states, 58 states have (on average 1.2241379310344827) internal successors, (71), 61 states have internal predecessors, (71), 21 states have call successors, (21), 12 states have call predecessors, (21), 11 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-08 12:58:08,485 INFO L87 Difference]: Start difference. First operand 91 states. Second operand has 91 states, 58 states have (on average 1.2241379310344827) internal successors, (71), 61 states have internal predecessors, (71), 21 states have call successors, (21), 12 states have call predecessors, (21), 11 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-08 12:58:08,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:58:08,487 INFO L93 Difference]: Finished difference Result 91 states and 111 transitions. [2022-04-08 12:58:08,487 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 111 transitions. [2022-04-08 12:58:08,487 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:58:08,487 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:58:08,488 INFO L74 IsIncluded]: Start isIncluded. First operand has 91 states, 58 states have (on average 1.2241379310344827) internal successors, (71), 61 states have internal predecessors, (71), 21 states have call successors, (21), 12 states have call predecessors, (21), 11 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) Second operand 91 states. [2022-04-08 12:58:08,488 INFO L87 Difference]: Start difference. First operand has 91 states, 58 states have (on average 1.2241379310344827) internal successors, (71), 61 states have internal predecessors, (71), 21 states have call successors, (21), 12 states have call predecessors, (21), 11 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) Second operand 91 states. [2022-04-08 12:58:08,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:58:08,490 INFO L93 Difference]: Finished difference Result 91 states and 111 transitions. [2022-04-08 12:58:08,490 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 111 transitions. [2022-04-08 12:58:08,490 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:58:08,490 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:58:08,490 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:58:08,490 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:58:08,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 58 states have (on average 1.2241379310344827) internal successors, (71), 61 states have internal predecessors, (71), 21 states have call successors, (21), 12 states have call predecessors, (21), 11 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-08 12:58:08,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 111 transitions. [2022-04-08 12:58:08,492 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 111 transitions. Word has length 43 [2022-04-08 12:58:08,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:58:08,492 INFO L478 AbstractCegarLoop]: Abstraction has 91 states and 111 transitions. [2022-04-08 12:58:08,492 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-08 12:58:08,492 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 91 states and 111 transitions. [2022-04-08 12:58:08,604 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:58:08,604 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 111 transitions. [2022-04-08 12:58:08,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-04-08 12:58:08,605 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:58:08,605 INFO L499 BasicCegarLoop]: trace histogram [6, 5, 5, 2, 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 12:58:08,623 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-08 12:58:08,805 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:58:08,805 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:58:08,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:58:08,806 INFO L85 PathProgramCache]: Analyzing trace with hash 1861890039, now seen corresponding path program 1 times [2022-04-08 12:58:08,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:58:08,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1117555736] [2022-04-08 12:58:09,536 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 12:58:09,536 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 12:58:09,536 INFO L85 PathProgramCache]: Analyzing trace with hash 1861890039, now seen corresponding path program 2 times [2022-04-08 12:58:09,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:58:09,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71821670] [2022-04-08 12:58:09,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:58:09,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:58:09,573 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:58:09,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1561291355] [2022-04-08 12:58:09,573 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 12:58:09,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:58:09,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:58:09,583 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 12:58:09,584 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-08 12:58:09,737 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 12:58:09,738 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:58:09,739 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-08 12:58:09,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:58:09,749 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:58:09,941 INFO L272 TraceCheckUtils]: 0: Hoare triple {4314#true} call ULTIMATE.init(); {4314#true} is VALID [2022-04-08 12:58:09,941 INFO L290 TraceCheckUtils]: 1: Hoare triple {4314#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);~counter~0 := 0; {4314#true} is VALID [2022-04-08 12:58:09,941 INFO L290 TraceCheckUtils]: 2: Hoare triple {4314#true} assume true; {4314#true} is VALID [2022-04-08 12:58:09,941 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4314#true} {4314#true} #96#return; {4314#true} is VALID [2022-04-08 12:58:09,942 INFO L272 TraceCheckUtils]: 4: Hoare triple {4314#true} call #t~ret8 := main(); {4314#true} is VALID [2022-04-08 12:58:09,942 INFO L290 TraceCheckUtils]: 5: Hoare triple {4314#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; {4314#true} is VALID [2022-04-08 12:58:09,942 INFO L272 TraceCheckUtils]: 6: Hoare triple {4314#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {4314#true} is VALID [2022-04-08 12:58:09,942 INFO L290 TraceCheckUtils]: 7: Hoare triple {4314#true} ~cond := #in~cond; {4314#true} is VALID [2022-04-08 12:58:09,942 INFO L290 TraceCheckUtils]: 8: Hoare triple {4314#true} assume !(0 == ~cond); {4314#true} is VALID [2022-04-08 12:58:09,942 INFO L290 TraceCheckUtils]: 9: Hoare triple {4314#true} assume true; {4314#true} is VALID [2022-04-08 12:58:09,942 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4314#true} {4314#true} #80#return; {4314#true} is VALID [2022-04-08 12:58:09,942 INFO L290 TraceCheckUtils]: 11: Hoare triple {4314#true} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {4352#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-08 12:58:09,943 INFO L290 TraceCheckUtils]: 12: Hoare triple {4352#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4352#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-08 12:58:09,943 INFO L290 TraceCheckUtils]: 13: Hoare triple {4352#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} assume !!(#t~post6 < 2);havoc #t~post6; {4352#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-08 12:58:09,944 INFO L272 TraceCheckUtils]: 14: Hoare triple {4352#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {4314#true} is VALID [2022-04-08 12:58:09,944 INFO L290 TraceCheckUtils]: 15: Hoare triple {4314#true} ~cond := #in~cond; {4314#true} is VALID [2022-04-08 12:58:09,944 INFO L290 TraceCheckUtils]: 16: Hoare triple {4314#true} assume !(0 == ~cond); {4314#true} is VALID [2022-04-08 12:58:09,944 INFO L290 TraceCheckUtils]: 17: Hoare triple {4314#true} assume true; {4314#true} is VALID [2022-04-08 12:58:09,944 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {4314#true} {4352#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} #82#return; {4352#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-08 12:58:09,944 INFO L272 TraceCheckUtils]: 19: Hoare triple {4352#(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)); {4314#true} is VALID [2022-04-08 12:58:09,945 INFO L290 TraceCheckUtils]: 20: Hoare triple {4314#true} ~cond := #in~cond; {4314#true} is VALID [2022-04-08 12:58:09,945 INFO L290 TraceCheckUtils]: 21: Hoare triple {4314#true} assume !(0 == ~cond); {4314#true} is VALID [2022-04-08 12:58:09,945 INFO L290 TraceCheckUtils]: 22: Hoare triple {4314#true} assume true; {4314#true} is VALID [2022-04-08 12:58:09,945 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {4314#true} {4352#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} #84#return; {4352#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-08 12:58:09,945 INFO L272 TraceCheckUtils]: 24: Hoare triple {4352#(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)); {4314#true} is VALID [2022-04-08 12:58:09,945 INFO L290 TraceCheckUtils]: 25: Hoare triple {4314#true} ~cond := #in~cond; {4314#true} is VALID [2022-04-08 12:58:09,946 INFO L290 TraceCheckUtils]: 26: Hoare triple {4314#true} assume !(0 == ~cond); {4314#true} is VALID [2022-04-08 12:58:09,946 INFO L290 TraceCheckUtils]: 27: Hoare triple {4314#true} assume true; {4314#true} is VALID [2022-04-08 12:58:09,947 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {4314#true} {4352#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} #86#return; {4352#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-08 12:58:09,947 INFO L290 TraceCheckUtils]: 29: Hoare triple {4352#(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; {4407#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2))} is VALID [2022-04-08 12:58:09,947 INFO L290 TraceCheckUtils]: 30: Hoare triple {4407#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4407#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2))} is VALID [2022-04-08 12:58:09,948 INFO L290 TraceCheckUtils]: 31: Hoare triple {4407#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2))} assume !!(#t~post6 < 2);havoc #t~post6; {4407#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2))} is VALID [2022-04-08 12:58:09,948 INFO L272 TraceCheckUtils]: 32: Hoare triple {4407#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2))} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {4314#true} is VALID [2022-04-08 12:58:09,948 INFO L290 TraceCheckUtils]: 33: Hoare triple {4314#true} ~cond := #in~cond; {4314#true} is VALID [2022-04-08 12:58:09,948 INFO L290 TraceCheckUtils]: 34: Hoare triple {4314#true} assume !(0 == ~cond); {4314#true} is VALID [2022-04-08 12:58:09,948 INFO L290 TraceCheckUtils]: 35: Hoare triple {4314#true} assume true; {4314#true} is VALID [2022-04-08 12:58:09,948 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {4314#true} {4407#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2))} #82#return; {4407#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2))} is VALID [2022-04-08 12:58:09,949 INFO L272 TraceCheckUtils]: 37: Hoare triple {4407#(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)); {4314#true} is VALID [2022-04-08 12:58:09,949 INFO L290 TraceCheckUtils]: 38: Hoare triple {4314#true} ~cond := #in~cond; {4314#true} is VALID [2022-04-08 12:58:09,949 INFO L290 TraceCheckUtils]: 39: Hoare triple {4314#true} assume !(0 == ~cond); {4314#true} is VALID [2022-04-08 12:58:09,950 INFO L290 TraceCheckUtils]: 40: Hoare triple {4314#true} assume true; {4314#true} is VALID [2022-04-08 12:58:09,951 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {4314#true} {4407#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2))} #84#return; {4407#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2))} is VALID [2022-04-08 12:58:09,953 INFO L272 TraceCheckUtils]: 42: Hoare triple {4407#(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)); {4447#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 12:58:09,955 INFO L290 TraceCheckUtils]: 43: Hoare triple {4447#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4451#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 12:58:09,957 INFO L290 TraceCheckUtils]: 44: Hoare triple {4451#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4315#false} is VALID [2022-04-08 12:58:09,957 INFO L290 TraceCheckUtils]: 45: Hoare triple {4315#false} assume !false; {4315#false} is VALID [2022-04-08 12:58:09,958 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-08 12:58:09,958 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 12:58:10,152 INFO L290 TraceCheckUtils]: 45: Hoare triple {4315#false} assume !false; {4315#false} is VALID [2022-04-08 12:58:10,153 INFO L290 TraceCheckUtils]: 44: Hoare triple {4451#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4315#false} is VALID [2022-04-08 12:58:10,153 INFO L290 TraceCheckUtils]: 43: Hoare triple {4447#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4451#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 12:58:10,154 INFO L272 TraceCheckUtils]: 42: Hoare triple {4467#(= (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)); {4447#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 12:58:10,154 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {4314#true} {4467#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} #84#return; {4467#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} is VALID [2022-04-08 12:58:10,154 INFO L290 TraceCheckUtils]: 40: Hoare triple {4314#true} assume true; {4314#true} is VALID [2022-04-08 12:58:10,155 INFO L290 TraceCheckUtils]: 39: Hoare triple {4314#true} assume !(0 == ~cond); {4314#true} is VALID [2022-04-08 12:58:10,155 INFO L290 TraceCheckUtils]: 38: Hoare triple {4314#true} ~cond := #in~cond; {4314#true} is VALID [2022-04-08 12:58:10,155 INFO L272 TraceCheckUtils]: 37: Hoare triple {4467#(= (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)); {4314#true} is VALID [2022-04-08 12:58:10,155 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {4314#true} {4467#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} #82#return; {4467#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} is VALID [2022-04-08 12:58:10,155 INFO L290 TraceCheckUtils]: 35: Hoare triple {4314#true} assume true; {4314#true} is VALID [2022-04-08 12:58:10,155 INFO L290 TraceCheckUtils]: 34: Hoare triple {4314#true} assume !(0 == ~cond); {4314#true} is VALID [2022-04-08 12:58:10,155 INFO L290 TraceCheckUtils]: 33: Hoare triple {4314#true} ~cond := #in~cond; {4314#true} is VALID [2022-04-08 12:58:10,156 INFO L272 TraceCheckUtils]: 32: Hoare triple {4467#(= (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)); {4314#true} is VALID [2022-04-08 12:58:10,156 INFO L290 TraceCheckUtils]: 31: Hoare triple {4467#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} assume !!(#t~post6 < 2);havoc #t~post6; {4467#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} is VALID [2022-04-08 12:58:10,156 INFO L290 TraceCheckUtils]: 30: Hoare triple {4467#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4467#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} is VALID [2022-04-08 12:58:11,458 INFO L290 TraceCheckUtils]: 29: Hoare triple {4507#(= (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; {4467#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} is VALID [2022-04-08 12:58:11,458 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {4314#true} {4507#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} #86#return; {4507#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} is VALID [2022-04-08 12:58:11,458 INFO L290 TraceCheckUtils]: 27: Hoare triple {4314#true} assume true; {4314#true} is VALID [2022-04-08 12:58:11,458 INFO L290 TraceCheckUtils]: 26: Hoare triple {4314#true} assume !(0 == ~cond); {4314#true} is VALID [2022-04-08 12:58:11,459 INFO L290 TraceCheckUtils]: 25: Hoare triple {4314#true} ~cond := #in~cond; {4314#true} is VALID [2022-04-08 12:58:11,459 INFO L272 TraceCheckUtils]: 24: Hoare triple {4507#(= (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)); {4314#true} is VALID [2022-04-08 12:58:11,459 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {4314#true} {4507#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} #84#return; {4507#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} is VALID [2022-04-08 12:58:11,459 INFO L290 TraceCheckUtils]: 22: Hoare triple {4314#true} assume true; {4314#true} is VALID [2022-04-08 12:58:11,459 INFO L290 TraceCheckUtils]: 21: Hoare triple {4314#true} assume !(0 == ~cond); {4314#true} is VALID [2022-04-08 12:58:11,459 INFO L290 TraceCheckUtils]: 20: Hoare triple {4314#true} ~cond := #in~cond; {4314#true} is VALID [2022-04-08 12:58:11,460 INFO L272 TraceCheckUtils]: 19: Hoare triple {4507#(= (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)); {4314#true} is VALID [2022-04-08 12:58:11,460 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {4314#true} {4507#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} #82#return; {4507#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} is VALID [2022-04-08 12:58:11,460 INFO L290 TraceCheckUtils]: 17: Hoare triple {4314#true} assume true; {4314#true} is VALID [2022-04-08 12:58:11,460 INFO L290 TraceCheckUtils]: 16: Hoare triple {4314#true} assume !(0 == ~cond); {4314#true} is VALID [2022-04-08 12:58:11,460 INFO L290 TraceCheckUtils]: 15: Hoare triple {4314#true} ~cond := #in~cond; {4314#true} is VALID [2022-04-08 12:58:11,460 INFO L272 TraceCheckUtils]: 14: Hoare triple {4507#(= (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)); {4314#true} is VALID [2022-04-08 12:58:11,461 INFO L290 TraceCheckUtils]: 13: Hoare triple {4507#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} assume !!(#t~post6 < 2);havoc #t~post6; {4507#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} is VALID [2022-04-08 12:58:11,461 INFO L290 TraceCheckUtils]: 12: Hoare triple {4507#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4507#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} is VALID [2022-04-08 12:58:11,461 INFO L290 TraceCheckUtils]: 11: Hoare triple {4314#true} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {4507#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} is VALID [2022-04-08 12:58:11,462 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4314#true} {4314#true} #80#return; {4314#true} is VALID [2022-04-08 12:58:11,462 INFO L290 TraceCheckUtils]: 9: Hoare triple {4314#true} assume true; {4314#true} is VALID [2022-04-08 12:58:11,462 INFO L290 TraceCheckUtils]: 8: Hoare triple {4314#true} assume !(0 == ~cond); {4314#true} is VALID [2022-04-08 12:58:11,462 INFO L290 TraceCheckUtils]: 7: Hoare triple {4314#true} ~cond := #in~cond; {4314#true} is VALID [2022-04-08 12:58:11,462 INFO L272 TraceCheckUtils]: 6: Hoare triple {4314#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {4314#true} is VALID [2022-04-08 12:58:11,462 INFO L290 TraceCheckUtils]: 5: Hoare triple {4314#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; {4314#true} is VALID [2022-04-08 12:58:11,462 INFO L272 TraceCheckUtils]: 4: Hoare triple {4314#true} call #t~ret8 := main(); {4314#true} is VALID [2022-04-08 12:58:11,462 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4314#true} {4314#true} #96#return; {4314#true} is VALID [2022-04-08 12:58:11,462 INFO L290 TraceCheckUtils]: 2: Hoare triple {4314#true} assume true; {4314#true} is VALID [2022-04-08 12:58:11,462 INFO L290 TraceCheckUtils]: 1: Hoare triple {4314#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);~counter~0 := 0; {4314#true} is VALID [2022-04-08 12:58:11,462 INFO L272 TraceCheckUtils]: 0: Hoare triple {4314#true} call ULTIMATE.init(); {4314#true} is VALID [2022-04-08 12:58:11,462 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-08 12:58:11,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:58:11,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71821670] [2022-04-08 12:58:11,463 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:58:11,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1561291355] [2022-04-08 12:58:11,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1561291355] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-08 12:58:11,463 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-08 12:58:11,463 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 8 [2022-04-08 12:58:11,463 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:58:11,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1117555736] [2022-04-08 12:58:11,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1117555736] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:58:11,463 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:58:11,464 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 12:58:11,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992843875] [2022-04-08 12:58:11,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:58:11,464 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 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 46 [2022-04-08 12:58:11,464 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:58:11,464 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 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 12:58:13,503 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 33 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 12:58:13,503 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 12:58:13,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:58:13,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 12:58:13,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-04-08 12:58:13,504 INFO L87 Difference]: Start difference. First operand 91 states and 111 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 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 12:58:16,302 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 12:58:19,895 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 12:58:22,148 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 12:58:24,565 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 12:58:25,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:58:25,106 INFO L93 Difference]: Finished difference Result 102 states and 124 transitions. [2022-04-08 12:58:25,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 12:58:25,106 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 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 46 [2022-04-08 12:58:25,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:58:25,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 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 12:58:25,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 55 transitions. [2022-04-08 12:58:25,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 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 12:58:25,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 55 transitions. [2022-04-08 12:58:25,108 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 55 transitions. [2022-04-08 12:58:27,164 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 54 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 12:58:27,166 INFO L225 Difference]: With dead ends: 102 [2022-04-08 12:58:27,166 INFO L226 Difference]: Without dead ends: 100 [2022-04-08 12:58:27,166 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 84 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-04-08 12:58:27,166 INFO L913 BasicCegarLoop]: 45 mSDtfsCounter, 15 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.3s IncrementalHoareTripleChecker+Time [2022-04-08 12:58:27,167 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 139 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 3 Unknown, 0 Unchecked, 8.3s Time] [2022-04-08 12:58:27,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-04-08 12:58:27,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 95. [2022-04-08 12:58:27,223 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:58:27,223 INFO L82 GeneralOperation]: Start isEquivalent. First operand 100 states. Second operand has 95 states, 61 states have (on average 1.2131147540983607) internal successors, (74), 64 states have internal predecessors, (74), 21 states have call successors, (21), 13 states have call predecessors, (21), 12 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-08 12:58:27,223 INFO L74 IsIncluded]: Start isIncluded. First operand 100 states. Second operand has 95 states, 61 states have (on average 1.2131147540983607) internal successors, (74), 64 states have internal predecessors, (74), 21 states have call successors, (21), 13 states have call predecessors, (21), 12 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-08 12:58:27,223 INFO L87 Difference]: Start difference. First operand 100 states. Second operand has 95 states, 61 states have (on average 1.2131147540983607) internal successors, (74), 64 states have internal predecessors, (74), 21 states have call successors, (21), 13 states have call predecessors, (21), 12 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-08 12:58:27,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:58:27,225 INFO L93 Difference]: Finished difference Result 100 states and 122 transitions. [2022-04-08 12:58:27,225 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 122 transitions. [2022-04-08 12:58:27,225 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:58:27,225 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:58:27,226 INFO L74 IsIncluded]: Start isIncluded. First operand has 95 states, 61 states have (on average 1.2131147540983607) internal successors, (74), 64 states have internal predecessors, (74), 21 states have call successors, (21), 13 states have call predecessors, (21), 12 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) Second operand 100 states. [2022-04-08 12:58:27,226 INFO L87 Difference]: Start difference. First operand has 95 states, 61 states have (on average 1.2131147540983607) internal successors, (74), 64 states have internal predecessors, (74), 21 states have call successors, (21), 13 states have call predecessors, (21), 12 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) Second operand 100 states. [2022-04-08 12:58:27,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:58:27,227 INFO L93 Difference]: Finished difference Result 100 states and 122 transitions. [2022-04-08 12:58:27,227 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 122 transitions. [2022-04-08 12:58:27,228 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:58:27,228 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:58:27,228 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:58:27,228 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:58:27,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 61 states have (on average 1.2131147540983607) internal successors, (74), 64 states have internal predecessors, (74), 21 states have call successors, (21), 13 states have call predecessors, (21), 12 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-08 12:58:27,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 114 transitions. [2022-04-08 12:58:27,229 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 114 transitions. Word has length 46 [2022-04-08 12:58:27,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:58:27,230 INFO L478 AbstractCegarLoop]: Abstraction has 95 states and 114 transitions. [2022-04-08 12:58:27,230 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 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 12:58:27,230 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 95 states and 114 transitions. [2022-04-08 12:58:30,310 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 113 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 12:58:30,310 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 114 transitions. [2022-04-08 12:58:30,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-08 12:58:30,310 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:58:30,311 INFO L499 BasicCegarLoop]: trace histogram [6, 5, 5, 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, 1, 1, 1, 1, 1] [2022-04-08 12:58:30,314 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-04-08 12:58:30,511 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:58:30,511 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:58:30,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:58:30,512 INFO L85 PathProgramCache]: Analyzing trace with hash -399036107, now seen corresponding path program 1 times [2022-04-08 12:58:30,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:58:30,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1209807242] [2022-04-08 12:58:30,512 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:58:30,512 INFO L85 PathProgramCache]: Analyzing trace with hash -399036107, now seen corresponding path program 2 times [2022-04-08 12:58:30,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:58:30,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985266764] [2022-04-08 12:58:30,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:58:30,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:58:30,523 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:58:30,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1814058592] [2022-04-08 12:58:30,523 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 12:58:30,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:58:30,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:58:30,532 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 12:58:30,533 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process