/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/loops/invert_string-3.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-d966a43 [2022-01-31 20:36:32,845 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-31 20:36:32,847 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-31 20:36:32,901 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-31 20:36:32,901 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-31 20:36:32,905 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-31 20:36:32,907 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-31 20:36:32,908 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-31 20:36:32,909 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-31 20:36:32,909 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-31 20:36:32,910 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-31 20:36:32,911 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-31 20:36:32,911 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-31 20:36:32,912 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-31 20:36:32,913 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-31 20:36:32,922 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-31 20:36:32,923 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-31 20:36:32,928 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-31 20:36:32,929 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-31 20:36:32,931 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-31 20:36:32,932 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-31 20:36:32,939 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-31 20:36:32,939 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-31 20:36:32,940 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-31 20:36:32,942 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-31 20:36:32,942 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-31 20:36:32,942 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-31 20:36:32,943 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-31 20:36:32,943 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-31 20:36:32,944 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-31 20:36:32,944 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-31 20:36:32,945 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-31 20:36:32,945 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-31 20:36:32,946 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-31 20:36:32,947 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-31 20:36:32,947 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-31 20:36:32,947 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-31 20:36:32,947 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-31 20:36:32,948 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-31 20:36:32,948 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-31 20:36:32,949 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-31 20:36:32,955 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-01-31 20:36:32,970 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-31 20:36:32,970 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-31 20:36:32,971 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-31 20:36:32,972 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-31 20:36:32,972 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-31 20:36:32,972 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-31 20:36:32,972 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-31 20:36:32,972 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-31 20:36:32,972 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-31 20:36:32,972 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-31 20:36:32,973 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-31 20:36:32,973 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-31 20:36:32,973 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-31 20:36:32,974 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-31 20:36:32,974 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-31 20:36:32,974 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-31 20:36:32,974 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-31 20:36:32,974 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-31 20:36:32,974 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 20:36:32,974 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-31 20:36:32,975 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2022-01-31 20:36:32,975 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-31 20:36:32,975 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-01-31 20:36:32,975 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-01-31 20:36:33,193 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-31 20:36:33,209 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-31 20:36:33,211 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-31 20:36:33,211 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-31 20:36:33,216 INFO L275 PluginConnector]: CDTParser initialized [2022-01-31 20:36:33,216 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/invert_string-3.c [2022-01-31 20:36:33,272 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe0a8c55c/0ceb45a11eea4e79a440dbde099c132e/FLAGb3fc3bcba [2022-01-31 20:36:33,608 INFO L306 CDTParser]: Found 1 translation units. [2022-01-31 20:36:33,608 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/invert_string-3.c [2022-01-31 20:36:33,612 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe0a8c55c/0ceb45a11eea4e79a440dbde099c132e/FLAGb3fc3bcba [2022-01-31 20:36:33,621 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe0a8c55c/0ceb45a11eea4e79a440dbde099c132e [2022-01-31 20:36:33,623 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-31 20:36:33,624 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-01-31 20:36:33,625 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-31 20:36:33,625 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-31 20:36:33,627 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-31 20:36:33,628 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 08:36:33" (1/1) ... [2022-01-31 20:36:33,629 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@280f709b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:36:33, skipping insertion in model container [2022-01-31 20:36:33,629 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 08:36:33" (1/1) ... [2022-01-31 20:36:33,634 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-31 20:36:33,643 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-31 20:36:33,764 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/invert_string-3.c[327,340] [2022-01-31 20:36:33,787 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 20:36:33,798 INFO L203 MainTranslator]: Completed pre-run [2022-01-31 20:36:33,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/loops/invert_string-3.c[327,340] [2022-01-31 20:36:33,829 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 20:36:33,839 INFO L208 MainTranslator]: Completed translation [2022-01-31 20:36:33,841 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:36:33 WrapperNode [2022-01-31 20:36:33,841 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-31 20:36:33,842 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-31 20:36:33,842 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-31 20:36:33,842 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-31 20:36:33,852 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:36:33" (1/1) ... [2022-01-31 20:36:33,852 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:36:33" (1/1) ... [2022-01-31 20:36:33,867 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:36:33" (1/1) ... [2022-01-31 20:36:33,867 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:36:33" (1/1) ... [2022-01-31 20:36:33,877 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:36:33" (1/1) ... [2022-01-31 20:36:33,881 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:36:33" (1/1) ... [2022-01-31 20:36:33,888 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:36:33" (1/1) ... [2022-01-31 20:36:33,890 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-31 20:36:33,891 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-31 20:36:33,891 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-31 20:36:33,891 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-31 20:36:33,893 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:36:33" (1/1) ... [2022-01-31 20:36:33,898 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 20:36:33,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 20:36:33,924 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-01-31 20:36:33,940 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-01-31 20:36:33,962 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-01-31 20:36:33,962 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-31 20:36:33,963 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-01-31 20:36:33,963 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-01-31 20:36:33,963 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-01-31 20:36:33,963 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-01-31 20:36:33,963 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-01-31 20:36:33,963 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-01-31 20:36:33,963 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-31 20:36:33,963 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-01-31 20:36:33,963 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-01-31 20:36:33,963 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-01-31 20:36:33,964 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-31 20:36:33,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-31 20:36:33,965 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-31 20:36:33,965 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-31 20:36:33,965 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-01-31 20:36:33,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-31 20:36:33,965 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-31 20:36:34,018 INFO L234 CfgBuilder]: Building ICFG [2022-01-31 20:36:34,018 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-31 20:36:34,108 INFO L275 CfgBuilder]: Performing block encoding [2022-01-31 20:36:34,112 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-31 20:36:34,113 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-01-31 20:36:34,114 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 08:36:34 BoogieIcfgContainer [2022-01-31 20:36:34,114 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-31 20:36:34,116 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-31 20:36:34,116 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-31 20:36:34,118 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-31 20:36:34,118 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 08:36:33" (1/3) ... [2022-01-31 20:36:34,119 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28f62f01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 08:36:34, skipping insertion in model container [2022-01-31 20:36:34,119 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:36:33" (2/3) ... [2022-01-31 20:36:34,119 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28f62f01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 08:36:34, skipping insertion in model container [2022-01-31 20:36:34,119 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 08:36:34" (3/3) ... [2022-01-31 20:36:34,120 INFO L111 eAbstractionObserver]: Analyzing ICFG invert_string-3.c [2022-01-31 20:36:34,124 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-01-31 20:36:34,124 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-31 20:36:34,155 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-31 20:36:34,160 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=AcceleratedInterpolation, 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, mLoopAccelerationTechnique=JORDAN [2022-01-31 20:36:34,160 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-31 20:36:34,170 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 20 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-31 20:36:34,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-01-31 20:36:34,176 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 20:36:34,177 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 20:36:34,177 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 20:36:34,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 20:36:34,181 INFO L85 PathProgramCache]: Analyzing trace with hash 1728321422, now seen corresponding path program 1 times [2022-01-31 20:36:34,186 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 20:36:34,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1035922240] [2022-01-31 20:36:34,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 20:36:34,196 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 20:36:34,224 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 20:36:34,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:36:34,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 20:36:34,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:36:34,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 20:36:34,478 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 20:36:34,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1035922240] [2022-01-31 20:36:34,480 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1035922240] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 20:36:34,480 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 20:36:34,480 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 20:36:34,481 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859967670] [2022-01-31 20:36:34,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 20:36:34,485 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 20:36:34,485 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 20:36:34,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 20:36:34,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-31 20:36:34,530 INFO L87 Difference]: Start difference. First operand has 27 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 20 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 20:36:34,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 20:36:34,707 INFO L93 Difference]: Finished difference Result 48 states and 61 transitions. [2022-01-31 20:36:34,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-31 20:36:34,709 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-01-31 20:36:34,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 20:36:34,714 INFO L225 Difference]: With dead ends: 48 [2022-01-31 20:36:34,714 INFO L226 Difference]: Without dead ends: 24 [2022-01-31 20:36:34,716 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-31 20:36:34,719 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 36 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 20:36:34,720 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 35 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 20:36:34,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-01-31 20:36:34,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2022-01-31 20:36:34,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 20:36:34,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2022-01-31 20:36:34,752 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 15 [2022-01-31 20:36:34,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 20:36:34,753 INFO L470 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2022-01-31 20:36:34,753 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 20:36:34,753 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-01-31 20:36:34,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-01-31 20:36:34,754 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 20:36:34,754 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 20:36:34,754 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-31 20:36:34,754 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 20:36:34,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 20:36:34,755 INFO L85 PathProgramCache]: Analyzing trace with hash -1238871028, now seen corresponding path program 1 times [2022-01-31 20:36:34,755 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 20:36:34,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2117572634] [2022-01-31 20:36:34,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 20:36:34,770 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 20:36:34,771 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 20:36:34,771 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 20:36:34,776 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 20:36:34,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:36:34,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 20:36:34,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:36:34,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 20:36:34,953 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 20:36:34,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2117572634] [2022-01-31 20:36:34,953 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [2117572634] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 20:36:34,953 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 20:36:34,953 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-31 20:36:34,954 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81087203] [2022-01-31 20:36:34,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 20:36:34,954 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-31 20:36:34,955 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 20:36:34,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-31 20:36:34,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-31 20:36:34,956 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 20:36:35,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 20:36:35,025 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2022-01-31 20:36:35,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-31 20:36:35,026 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-01-31 20:36:35,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 20:36:35,027 INFO L225 Difference]: With dead ends: 40 [2022-01-31 20:36:35,027 INFO L226 Difference]: Without dead ends: 25 [2022-01-31 20:36:35,028 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-31 20:36:35,029 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 19 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 20:36:35,029 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 28 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 20:36:35,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-01-31 20:36:35,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2022-01-31 20:36:35,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 20:36:35,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2022-01-31 20:36:35,043 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 17 [2022-01-31 20:36:35,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 20:36:35,044 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2022-01-31 20:36:35,044 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 20:36:35,045 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2022-01-31 20:36:35,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-01-31 20:36:35,046 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 20:36:35,047 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 20:36:35,047 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-31 20:36:35,048 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 20:36:35,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 20:36:35,052 INFO L85 PathProgramCache]: Analyzing trace with hash -1304082102, now seen corresponding path program 1 times [2022-01-31 20:36:35,056 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 20:36:35,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1779095522] [2022-01-31 20:36:35,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 20:36:35,058 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 20:36:35,058 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 20:36:35,059 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 20:36:35,060 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 20:36:35,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:36:35,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 20:36:35,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:36:35,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 20:36:35,215 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 20:36:35,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1779095522] [2022-01-31 20:36:35,216 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1779095522] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 20:36:35,216 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 20:36:35,216 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-31 20:36:35,216 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868498551] [2022-01-31 20:36:35,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 20:36:35,217 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-31 20:36:35,217 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 20:36:35,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-31 20:36:35,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-01-31 20:36:35,218 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 20:36:35,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 20:36:35,314 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2022-01-31 20:36:35,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-31 20:36:35,314 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-01-31 20:36:35,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 20:36:35,316 INFO L225 Difference]: With dead ends: 42 [2022-01-31 20:36:35,316 INFO L226 Difference]: Without dead ends: 27 [2022-01-31 20:36:35,317 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-01-31 20:36:35,324 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 21 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 20:36:35,325 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 33 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 20:36:35,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-01-31 20:36:35,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2022-01-31 20:36:35,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 20:36:35,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2022-01-31 20:36:35,339 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 19 [2022-01-31 20:36:35,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 20:36:35,339 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2022-01-31 20:36:35,339 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 20:36:35,339 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2022-01-31 20:36:35,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-01-31 20:36:35,340 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 20:36:35,340 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 20:36:35,340 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-31 20:36:35,340 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 20:36:35,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 20:36:35,341 INFO L85 PathProgramCache]: Analyzing trace with hash 452585224, now seen corresponding path program 2 times [2022-01-31 20:36:35,341 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 20:36:35,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1530110168] [2022-01-31 20:36:35,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 20:36:35,344 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 20:36:35,344 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 20:36:35,345 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 20:36:35,346 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 20:36:35,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:36:35,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 20:36:35,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:36:35,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 20:36:35,458 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 20:36:35,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1530110168] [2022-01-31 20:36:35,458 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1530110168] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 20:36:35,459 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 20:36:35,459 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-31 20:36:35,459 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021649641] [2022-01-31 20:36:35,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 20:36:35,459 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-31 20:36:35,459 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 20:36:35,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-31 20:36:35,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-01-31 20:36:35,460 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 20:36:35,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 20:36:35,579 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2022-01-31 20:36:35,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-31 20:36:35,579 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-01-31 20:36:35,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 20:36:35,580 INFO L225 Difference]: With dead ends: 44 [2022-01-31 20:36:35,580 INFO L226 Difference]: Without dead ends: 29 [2022-01-31 20:36:35,580 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-01-31 20:36:35,581 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 23 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 20:36:35,581 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 38 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 20:36:35,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-01-31 20:36:35,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2022-01-31 20:36:35,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 20:36:35,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2022-01-31 20:36:35,587 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 21 [2022-01-31 20:36:35,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 20:36:35,588 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2022-01-31 20:36:35,588 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 20:36:35,588 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2022-01-31 20:36:35,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-01-31 20:36:35,588 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 20:36:35,589 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 20:36:35,589 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-31 20:36:35,589 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 20:36:35,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 20:36:35,589 INFO L85 PathProgramCache]: Analyzing trace with hash 687738182, now seen corresponding path program 3 times [2022-01-31 20:36:35,589 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 20:36:35,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [204930232] [2022-01-31 20:36:35,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 20:36:35,612 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 20:36:35,612 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 20:36:35,612 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 20:36:35,614 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 20:36:35,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:36:35,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 20:36:35,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:36:35,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 20:36:35,799 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 20:36:35,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [204930232] [2022-01-31 20:36:35,799 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [204930232] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 20:36:35,800 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 20:36:35,800 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-31 20:36:35,800 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181861551] [2022-01-31 20:36:35,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 20:36:35,802 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-31 20:36:35,802 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 20:36:35,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-31 20:36:35,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-01-31 20:36:35,803 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 20:36:35,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 20:36:35,927 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2022-01-31 20:36:35,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-31 20:36:35,928 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-01-31 20:36:35,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 20:36:35,932 INFO L225 Difference]: With dead ends: 46 [2022-01-31 20:36:35,933 INFO L226 Difference]: Without dead ends: 31 [2022-01-31 20:36:35,937 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-01-31 20:36:35,941 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 26 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 20:36:35,941 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 38 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 20:36:35,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-01-31 20:36:35,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2022-01-31 20:36:35,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 24 states have (on average 1.125) internal successors, (27), 24 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 20:36:35,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2022-01-31 20:36:35,948 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 23 [2022-01-31 20:36:35,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 20:36:35,949 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2022-01-31 20:36:35,949 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 20:36:35,949 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2022-01-31 20:36:35,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-01-31 20:36:35,950 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 20:36:35,950 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 20:36:35,950 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-31 20:36:35,950 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 20:36:35,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 20:36:35,951 INFO L85 PathProgramCache]: Analyzing trace with hash -963535868, now seen corresponding path program 4 times [2022-01-31 20:36:35,951 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 20:36:35,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1899110056] [2022-01-31 20:36:35,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 20:36:35,962 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 20:36:35,962 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 20:36:35,962 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 20:36:35,965 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 20:36:36,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:36:36,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 20:36:36,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:36:36,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 20:36:36,182 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 20:36:36,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1899110056] [2022-01-31 20:36:36,182 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1899110056] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 20:36:36,182 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 20:36:36,183 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-31 20:36:36,183 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210208052] [2022-01-31 20:36:36,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 20:36:36,183 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-31 20:36:36,183 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 20:36:36,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-31 20:36:36,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-01-31 20:36:36,184 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 20:36:36,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 20:36:36,388 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2022-01-31 20:36:36,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-31 20:36:36,388 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-01-31 20:36:36,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 20:36:36,389 INFO L225 Difference]: With dead ends: 48 [2022-01-31 20:36:36,389 INFO L226 Difference]: Without dead ends: 33 [2022-01-31 20:36:36,390 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2022-01-31 20:36:36,390 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 28 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 20:36:36,391 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 43 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 20:36:36,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-01-31 20:36:36,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2022-01-31 20:36:36,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 20:36:36,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2022-01-31 20:36:36,407 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 25 [2022-01-31 20:36:36,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 20:36:36,408 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2022-01-31 20:36:36,408 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 20:36:36,408 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2022-01-31 20:36:36,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-01-31 20:36:36,409 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 20:36:36,409 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 20:36:36,409 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-31 20:36:36,410 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 20:36:36,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 20:36:36,410 INFO L85 PathProgramCache]: Analyzing trace with hash 1300001602, now seen corresponding path program 5 times [2022-01-31 20:36:36,410 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 20:36:36,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [12140686] [2022-01-31 20:36:36,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 20:36:36,414 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 20:36:36,414 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 20:36:36,414 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 20:36:36,415 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 20:36:36,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:36:36,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 20:36:36,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:36:36,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 20:36:36,598 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 20:36:36,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [12140686] [2022-01-31 20:36:36,599 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [12140686] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 20:36:36,599 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 20:36:36,599 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-31 20:36:36,599 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319338068] [2022-01-31 20:36:36,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 20:36:36,599 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-31 20:36:36,600 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 20:36:36,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-31 20:36:36,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-01-31 20:36:36,601 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 20:36:36,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 20:36:36,708 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2022-01-31 20:36:36,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-31 20:36:36,708 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-01-31 20:36:36,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 20:36:36,710 INFO L225 Difference]: With dead ends: 46 [2022-01-31 20:36:36,710 INFO L226 Difference]: Without dead ends: 35 [2022-01-31 20:36:36,711 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-01-31 20:36:36,713 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 31 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 20:36:36,714 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 33 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 20:36:36,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-01-31 20:36:36,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2022-01-31 20:36:36,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 28 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 20:36:36,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2022-01-31 20:36:36,729 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 27 [2022-01-31 20:36:36,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 20:36:36,730 INFO L470 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions. [2022-01-31 20:36:36,730 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 20:36:36,730 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2022-01-31 20:36:36,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-01-31 20:36:36,731 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 20:36:36,732 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 20:36:36,732 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-31 20:36:36,732 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 20:36:36,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 20:36:36,732 INFO L85 PathProgramCache]: Analyzing trace with hash -537357632, now seen corresponding path program 6 times [2022-01-31 20:36:36,732 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 20:36:36,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [132522152] [2022-01-31 20:36:36,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 20:36:36,736 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 20:36:36,736 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 20:36:36,736 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 20:36:36,738 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 20:36:36,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:36:36,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 20:36:36,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:36:36,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 20:36:36,929 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 20:36:36,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [132522152] [2022-01-31 20:36:36,929 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [132522152] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 20:36:36,929 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 20:36:36,929 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-31 20:36:36,929 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886175937] [2022-01-31 20:36:36,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 20:36:36,930 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-31 20:36:36,930 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 20:36:36,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-31 20:36:36,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-01-31 20:36:36,931 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 20:36:37,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 20:36:37,142 INFO L93 Difference]: Finished difference Result 48 states and 51 transitions. [2022-01-31 20:36:37,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-31 20:36:37,143 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-01-31 20:36:37,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 20:36:37,143 INFO L225 Difference]: With dead ends: 48 [2022-01-31 20:36:37,144 INFO L226 Difference]: Without dead ends: 37 [2022-01-31 20:36:37,144 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2022-01-31 20:36:37,144 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 34 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 20:36:37,145 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 43 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 20:36:37,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-01-31 20:36:37,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2022-01-31 20:36:37,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 30 states have (on average 1.1) internal successors, (33), 30 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 20:36:37,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2022-01-31 20:36:37,154 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 29 [2022-01-31 20:36:37,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 20:36:37,154 INFO L470 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2022-01-31 20:36:37,154 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 20:36:37,154 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2022-01-31 20:36:37,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-01-31 20:36:37,155 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 20:36:37,155 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 20:36:37,155 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-31 20:36:37,155 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 20:36:37,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 20:36:37,156 INFO L85 PathProgramCache]: Analyzing trace with hash -1008022850, now seen corresponding path program 7 times [2022-01-31 20:36:37,156 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 20:36:37,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [802632860] [2022-01-31 20:36:37,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 20:36:37,158 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 20:36:37,158 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 20:36:37,158 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 20:36:37,159 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 20:36:37,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:36:37,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 20:36:37,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:36:37,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 20:36:37,340 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 20:36:37,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [802632860] [2022-01-31 20:36:37,341 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [802632860] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 20:36:37,341 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 20:36:37,341 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-31 20:36:37,341 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697647375] [2022-01-31 20:36:37,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 20:36:37,341 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-31 20:36:37,341 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 20:36:37,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-31 20:36:37,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-01-31 20:36:37,343 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 20:36:37,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 20:36:37,610 INFO L93 Difference]: Finished difference Result 50 states and 53 transitions. [2022-01-31 20:36:37,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-31 20:36:37,610 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-01-31 20:36:37,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 20:36:37,611 INFO L225 Difference]: With dead ends: 50 [2022-01-31 20:36:37,611 INFO L226 Difference]: Without dead ends: 39 [2022-01-31 20:36:37,611 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2022-01-31 20:36:37,612 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 38 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 20:36:37,612 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 43 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 20:36:37,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-01-31 20:36:37,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2022-01-31 20:36:37,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 32 states have (on average 1.09375) internal successors, (35), 32 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 20:36:37,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2022-01-31 20:36:37,621 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 31 [2022-01-31 20:36:37,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 20:36:37,621 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2022-01-31 20:36:37,621 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 20:36:37,621 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2022-01-31 20:36:37,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-01-31 20:36:37,622 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 20:36:37,622 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 20:36:37,622 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-31 20:36:37,622 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 20:36:37,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 20:36:37,623 INFO L85 PathProgramCache]: Analyzing trace with hash 1949236028, now seen corresponding path program 8 times [2022-01-31 20:36:37,623 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 20:36:37,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [376767577] [2022-01-31 20:36:37,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 20:36:37,625 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 20:36:37,625 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 20:36:37,625 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 20:36:37,626 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 20:36:37,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:36:37,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 20:36:37,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:36:37,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 20:36:37,860 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 20:36:37,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [376767577] [2022-01-31 20:36:37,861 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [376767577] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 20:36:37,861 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 20:36:37,861 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-31 20:36:37,861 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024886664] [2022-01-31 20:36:37,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 20:36:37,861 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-31 20:36:37,861 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 20:36:37,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-31 20:36:37,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-01-31 20:36:37,862 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 20:36:38,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 20:36:38,215 INFO L93 Difference]: Finished difference Result 63 states and 69 transitions. [2022-01-31 20:36:38,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-31 20:36:38,216 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-01-31 20:36:38,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 20:36:38,218 INFO L225 Difference]: With dead ends: 63 [2022-01-31 20:36:38,218 INFO L226 Difference]: Without dead ends: 52 [2022-01-31 20:36:38,218 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=84, Invalid=188, Unknown=0, NotChecked=0, Total=272 [2022-01-31 20:36:38,219 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 55 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 20:36:38,219 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [55 Valid, 52 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-31 20:36:38,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-01-31 20:36:38,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 40. [2022-01-31 20:36:38,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 34 states have (on average 1.088235294117647) internal successors, (37), 34 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 20:36:38,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 42 transitions. [2022-01-31 20:36:38,231 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 42 transitions. Word has length 33 [2022-01-31 20:36:38,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 20:36:38,231 INFO L470 AbstractCegarLoop]: Abstraction has 40 states and 42 transitions. [2022-01-31 20:36:38,232 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 20:36:38,232 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2022-01-31 20:36:38,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-01-31 20:36:38,232 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 20:36:38,232 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 20:36:38,233 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-31 20:36:38,233 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 20:36:38,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 20:36:38,233 INFO L85 PathProgramCache]: Analyzing trace with hash 606667834, now seen corresponding path program 9 times [2022-01-31 20:36:38,233 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 20:36:38,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [131577999] [2022-01-31 20:36:38,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 20:36:38,235 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 20:36:38,235 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 20:36:38,235 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 20:36:38,236 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 20:36:38,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:36:39,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 20:36:39,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:36:39,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 20:36:39,172 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 20:36:39,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [131577999] [2022-01-31 20:36:39,172 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [131577999] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 20:36:39,173 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 20:36:39,173 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-01-31 20:36:39,173 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122412079] [2022-01-31 20:36:39,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 20:36:39,173 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-01-31 20:36:39,173 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 20:36:39,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-01-31 20:36:39,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2022-01-31 20:36:39,174 INFO L87 Difference]: Start difference. First operand 40 states and 42 transitions. Second operand has 21 states, 20 states have (on average 1.4) internal successors, (28), 19 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 20:36:40,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 20:36:40,723 INFO L93 Difference]: Finished difference Result 70 states and 77 transitions. [2022-01-31 20:36:40,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-01-31 20:36:40,724 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.4) internal successors, (28), 19 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2022-01-31 20:36:40,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 20:36:40,724 INFO L225 Difference]: With dead ends: 70 [2022-01-31 20:36:40,724 INFO L226 Difference]: Without dead ends: 68 [2022-01-31 20:36:40,725 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 448 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=361, Invalid=1801, Unknown=0, NotChecked=0, Total=2162 [2022-01-31 20:36:40,726 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 98 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 489 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-31 20:36:40,726 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [98 Valid, 60 Invalid, 629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 489 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-31 20:36:40,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-01-31 20:36:40,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 46. [2022-01-31 20:36:40,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 39 states have internal predecessors, (41), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-31 20:36:40,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 48 transitions. [2022-01-31 20:36:40,742 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 48 transitions. Word has length 35 [2022-01-31 20:36:40,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 20:36:40,742 INFO L470 AbstractCegarLoop]: Abstraction has 46 states and 48 transitions. [2022-01-31 20:36:40,742 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.4) internal successors, (28), 19 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 20:36:40,742 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 48 transitions. [2022-01-31 20:36:40,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-01-31 20:36:40,743 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 20:36:40,743 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 20:36:40,743 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-31 20:36:40,744 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 20:36:40,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 20:36:40,744 INFO L85 PathProgramCache]: Analyzing trace with hash 758259348, now seen corresponding path program 1 times [2022-01-31 20:36:40,744 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 20:36:40,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [626053137] [2022-01-31 20:36:40,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 20:36:40,746 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 20:36:40,746 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 20:36:40,746 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 20:36:40,748 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 20:36:40,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:36:41,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 20:36:41,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:36:41,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-01-31 20:36:41,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:36:41,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 20:36:41,857 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 20:36:41,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [626053137] [2022-01-31 20:36:41,857 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [626053137] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 20:36:41,857 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 20:36:41,857 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-01-31 20:36:41,858 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216363707] [2022-01-31 20:36:41,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 20:36:41,858 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-01-31 20:36:41,858 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 20:36:41,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-01-31 20:36:41,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2022-01-31 20:36:41,859 INFO L87 Difference]: Start difference. First operand 46 states and 48 transitions. Second operand has 22 states, 21 states have (on average 1.380952380952381) internal successors, (29), 20 states have internal predecessors, (29), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 20:36:43,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 20:36:43,140 INFO L93 Difference]: Finished difference Result 67 states and 72 transitions. [2022-01-31 20:36:43,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-01-31 20:36:43,140 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 1.380952380952381) internal successors, (29), 20 states have internal predecessors, (29), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 43 [2022-01-31 20:36:43,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 20:36:43,142 INFO L225 Difference]: With dead ends: 67 [2022-01-31 20:36:43,142 INFO L226 Difference]: Without dead ends: 65 [2022-01-31 20:36:43,143 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 317 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=259, Invalid=1547, Unknown=0, NotChecked=0, Total=1806 [2022-01-31 20:36:43,143 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 41 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 568 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 568 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-31 20:36:43,144 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 81 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 568 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-31 20:36:43,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-01-31 20:36:43,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 59. [2022-01-31 20:36:43,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 48 states have (on average 1.0833333333333333) internal successors, (52), 50 states have internal predecessors, (52), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 3 states have call predecessors, (5), 5 states have call successors, (5) [2022-01-31 20:36:43,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2022-01-31 20:36:43,166 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 43 [2022-01-31 20:36:43,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 20:36:43,167 INFO L470 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2022-01-31 20:36:43,167 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 1.380952380952381) internal successors, (29), 20 states have internal predecessors, (29), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 20:36:43,167 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2022-01-31 20:36:43,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-01-31 20:36:43,168 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 20:36:43,168 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 20:36:43,168 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-31 20:36:43,168 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 20:36:43,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 20:36:43,169 INFO L85 PathProgramCache]: Analyzing trace with hash -1926528494, now seen corresponding path program 2 times [2022-01-31 20:36:43,169 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 20:36:43,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [812655327] [2022-01-31 20:36:43,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 20:36:43,171 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 20:36:43,171 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 20:36:43,171 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 20:36:43,172 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 20:36:43,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:36:43,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 20:36:43,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:36:43,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-01-31 20:36:43,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:36:43,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 20:36:43,328 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 20:36:43,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [812655327] [2022-01-31 20:36:43,329 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [812655327] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 20:36:43,329 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 20:36:43,329 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-31 20:36:43,329 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639866831] [2022-01-31 20:36:43,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 20:36:43,329 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-31 20:36:43,329 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 20:36:43,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-31 20:36:43,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-01-31 20:36:43,330 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand has 10 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 20:36:43,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 20:36:43,573 INFO L93 Difference]: Finished difference Result 83 states and 88 transitions. [2022-01-31 20:36:43,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-31 20:36:43,573 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 45 [2022-01-31 20:36:43,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 20:36:43,574 INFO L225 Difference]: With dead ends: 83 [2022-01-31 20:36:43,574 INFO L226 Difference]: Without dead ends: 64 [2022-01-31 20:36:43,574 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2022-01-31 20:36:43,575 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 64 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 20:36:43,575 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 35 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 20:36:43,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-01-31 20:36:43,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 54. [2022-01-31 20:36:43,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 44 states have (on average 1.0454545454545454) internal successors, (46), 45 states have internal predecessors, (46), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 20:36:43,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 55 transitions. [2022-01-31 20:36:43,597 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 55 transitions. Word has length 45 [2022-01-31 20:36:43,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 20:36:43,597 INFO L470 AbstractCegarLoop]: Abstraction has 54 states and 55 transitions. [2022-01-31 20:36:43,597 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 20:36:43,598 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2022-01-31 20:36:43,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-01-31 20:36:43,598 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 20:36:43,598 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 20:36:43,598 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-31 20:36:43,598 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 20:36:43,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 20:36:43,599 INFO L85 PathProgramCache]: Analyzing trace with hash 814759662, now seen corresponding path program 3 times [2022-01-31 20:36:43,599 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 20:36:43,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1214343760] [2022-01-31 20:36:43,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 20:36:43,601 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 20:36:43,601 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 20:36:43,601 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 20:36:43,602 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 20:36:43,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:36:44,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 20:36:44,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:36:44,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-01-31 20:36:44,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:36:44,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-01-31 20:36:44,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:36:44,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 20:36:44,855 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 20:36:44,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1214343760] [2022-01-31 20:36:44,855 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1214343760] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 20:36:44,856 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 20:36:44,856 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-01-31 20:36:44,856 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193774490] [2022-01-31 20:36:44,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 20:36:44,856 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-01-31 20:36:44,856 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 20:36:44,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-01-31 20:36:44,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=527, Unknown=0, NotChecked=0, Total=600 [2022-01-31 20:36:44,857 INFO L87 Difference]: Start difference. First operand 54 states and 55 transitions. Second operand has 25 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 23 states have internal predecessors, (34), 4 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-31 20:36:46,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 20:36:46,351 INFO L93 Difference]: Finished difference Result 65 states and 66 transitions. [2022-01-31 20:36:46,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-01-31 20:36:46,351 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 23 states have internal predecessors, (34), 4 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 51 [2022-01-31 20:36:46,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 20:36:46,352 INFO L225 Difference]: With dead ends: 65 [2022-01-31 20:36:46,352 INFO L226 Difference]: Without dead ends: 63 [2022-01-31 20:36:46,353 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 415 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=282, Invalid=1880, Unknown=0, NotChecked=0, Total=2162 [2022-01-31 20:36:46,354 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 42 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 665 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 774 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 665 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-31 20:36:46,354 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 85 Invalid, 774 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 665 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-31 20:36:46,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-01-31 20:36:46,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2022-01-31 20:36:46,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 50 states have (on average 1.04) internal successors, (52), 51 states have internal predecessors, (52), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-01-31 20:36:46,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 63 transitions. [2022-01-31 20:36:46,380 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 63 transitions. Word has length 51 [2022-01-31 20:36:46,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 20:36:46,380 INFO L470 AbstractCegarLoop]: Abstraction has 62 states and 63 transitions. [2022-01-31 20:36:46,381 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 23 states have internal predecessors, (34), 4 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-31 20:36:46,381 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 63 transitions. [2022-01-31 20:36:46,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-01-31 20:36:46,382 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 20:36:46,382 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 20:36:46,382 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-31 20:36:46,382 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 20:36:46,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 20:36:46,383 INFO L85 PathProgramCache]: Analyzing trace with hash -1545771704, now seen corresponding path program 4 times [2022-01-31 20:36:46,383 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 20:36:46,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1900440690] [2022-01-31 20:36:46,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 20:36:46,386 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 20:36:46,386 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 20:36:46,386 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 20:36:46,388 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 20:36:46,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:36:47,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 20:36:47,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:36:47,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-01-31 20:36:47,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:36:47,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-01-31 20:36:47,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:36:47,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-31 20:36:47,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:36:47,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 20:36:47,678 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 20:36:47,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1900440690] [2022-01-31 20:36:47,678 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1900440690] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 20:36:47,678 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 20:36:47,678 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-01-31 20:36:47,678 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402832129] [2022-01-31 20:36:47,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 20:36:47,679 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-01-31 20:36:47,679 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 20:36:47,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-01-31 20:36:47,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=575, Unknown=0, NotChecked=0, Total=650 [2022-01-31 20:36:47,680 INFO L87 Difference]: Start difference. First operand 62 states and 63 transitions. Second operand has 26 states, 25 states have (on average 1.4) internal successors, (35), 24 states have internal predecessors, (35), 5 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 20:36:49,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 20:36:49,255 INFO L93 Difference]: Finished difference Result 73 states and 74 transitions. [2022-01-31 20:36:49,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-01-31 20:36:49,256 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 1.4) internal successors, (35), 24 states have internal predecessors, (35), 5 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 59 [2022-01-31 20:36:49,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 20:36:49,256 INFO L225 Difference]: With dead ends: 73 [2022-01-31 20:36:49,256 INFO L226 Difference]: Without dead ends: 71 [2022-01-31 20:36:49,257 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 416 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=302, Invalid=2050, Unknown=0, NotChecked=0, Total=2352 [2022-01-31 20:36:49,257 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 43 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 665 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 665 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-31 20:36:49,258 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 46 Invalid, 779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 665 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-31 20:36:49,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-01-31 20:36:49,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2022-01-31 20:36:49,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 56 states have (on average 1.0357142857142858) internal successors, (58), 57 states have internal predecessors, (58), 7 states have call successors, (7), 7 states have call predecessors, (7), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-01-31 20:36:49,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 71 transitions. [2022-01-31 20:36:49,277 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 71 transitions. Word has length 59 [2022-01-31 20:36:49,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 20:36:49,277 INFO L470 AbstractCegarLoop]: Abstraction has 70 states and 71 transitions. [2022-01-31 20:36:49,278 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 1.4) internal successors, (35), 24 states have internal predecessors, (35), 5 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 20:36:49,278 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 71 transitions. [2022-01-31 20:36:49,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-01-31 20:36:49,281 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 20:36:49,281 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 20:36:49,281 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-31 20:36:49,281 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 20:36:49,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 20:36:49,281 INFO L85 PathProgramCache]: Analyzing trace with hash -1028419166, now seen corresponding path program 5 times [2022-01-31 20:36:49,281 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 20:36:49,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1674784777] [2022-01-31 20:36:49,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 20:36:49,283 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 20:36:49,283 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 20:36:49,283 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 20:36:49,284 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 20:36:49,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:36:50,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 20:36:50,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:36:50,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-01-31 20:36:50,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:36:50,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-01-31 20:36:50,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:36:50,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-31 20:36:50,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:36:50,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-01-31 20:36:50,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:36:50,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 20:36:50,511 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 20:36:50,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1674784777] [2022-01-31 20:36:50,511 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1674784777] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 20:36:50,511 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 20:36:50,512 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2022-01-31 20:36:50,513 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173234573] [2022-01-31 20:36:50,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 20:36:50,513 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-01-31 20:36:50,513 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 20:36:50,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-01-31 20:36:50,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=901, Unknown=0, NotChecked=0, Total=1056 [2022-01-31 20:36:50,514 INFO L87 Difference]: Start difference. First operand 70 states and 71 transitions. Second operand has 33 states, 32 states have (on average 1.4375) internal successors, (46), 31 states have internal predecessors, (46), 6 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-01-31 20:36:54,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 20:36:54,329 INFO L93 Difference]: Finished difference Result 104 states and 112 transitions. [2022-01-31 20:36:54,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-01-31 20:36:54,330 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 1.4375) internal successors, (46), 31 states have internal predecessors, (46), 6 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 67 [2022-01-31 20:36:54,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 20:36:54,331 INFO L225 Difference]: With dead ends: 104 [2022-01-31 20:36:54,332 INFO L226 Difference]: Without dead ends: 102 [2022-01-31 20:36:54,333 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1661 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=1177, Invalid=5465, Unknown=0, NotChecked=0, Total=6642 [2022-01-31 20:36:54,334 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 156 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 986 mSolverCounterSat, 371 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 1357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 371 IncrementalHoareTripleChecker+Valid, 986 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-31 20:36:54,334 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [156 Valid, 63 Invalid, 1357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [371 Valid, 986 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-01-31 20:36:54,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-01-31 20:36:54,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 78. [2022-01-31 20:36:54,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 62 states have (on average 1.032258064516129) internal successors, (64), 63 states have internal predecessors, (64), 8 states have call successors, (8), 8 states have call predecessors, (8), 7 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-01-31 20:36:54,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 79 transitions. [2022-01-31 20:36:54,376 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 79 transitions. Word has length 67 [2022-01-31 20:36:54,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 20:36:54,377 INFO L470 AbstractCegarLoop]: Abstraction has 78 states and 79 transitions. [2022-01-31 20:36:54,377 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 1.4375) internal successors, (46), 31 states have internal predecessors, (46), 6 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-01-31 20:36:54,377 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 79 transitions. [2022-01-31 20:36:54,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-01-31 20:36:54,377 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 20:36:54,377 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 20:36:54,378 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-31 20:36:54,378 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 20:36:54,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 20:36:54,378 INFO L85 PathProgramCache]: Analyzing trace with hash -1901280260, now seen corresponding path program 6 times [2022-01-31 20:36:54,378 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 20:36:54,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [397334171] [2022-01-31 20:36:54,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 20:36:54,380 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 20:36:54,380 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 20:36:54,380 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 20:36:54,381 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 20:36:54,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:36:54,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 20:36:54,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:36:54,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-01-31 20:36:54,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:36:54,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-01-31 20:36:54,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:36:54,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-31 20:36:54,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:36:54,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-01-31 20:36:54,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:36:54,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-01-31 20:36:54,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:36:54,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 20:36:54,613 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 20:36:54,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [397334171] [2022-01-31 20:36:54,613 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [397334171] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 20:36:54,613 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 20:36:54,613 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-31 20:36:54,613 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30714660] [2022-01-31 20:36:54,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 20:36:54,614 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-31 20:36:54,614 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 20:36:54,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-31 20:36:54,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-01-31 20:36:54,614 INFO L87 Difference]: Start difference. First operand 78 states and 79 transitions. Second operand has 10 states, 10 states have (on average 3.3) internal successors, (33), 9 states have internal predecessors, (33), 7 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-01-31 20:36:54,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 20:36:54,928 INFO L93 Difference]: Finished difference Result 134 states and 136 transitions. [2022-01-31 20:36:54,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-31 20:36:54,929 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 9 states have internal predecessors, (33), 7 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 75 [2022-01-31 20:36:54,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 20:36:54,929 INFO L225 Difference]: With dead ends: 134 [2022-01-31 20:36:54,929 INFO L226 Difference]: Without dead ends: 0 [2022-01-31 20:36:54,930 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2022-01-31 20:36:54,930 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 49 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 20:36:54,931 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 52 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-31 20:36:54,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-01-31 20:36:54,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-01-31 20:36:54,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-31 20:36:54,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-01-31 20:36:54,931 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 75 [2022-01-31 20:36:54,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 20:36:54,931 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-01-31 20:36:54,932 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 9 states have internal predecessors, (33), 7 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-01-31 20:36:54,932 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-01-31 20:36:54,932 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-01-31 20:36:54,934 INFO L764 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-01-31 20:36:54,934 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-31 20:36:54,935 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-01-31 20:37:01,021 INFO L858 garLoopResultBuilder]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2022-01-31 20:37:01,022 INFO L858 garLoopResultBuilder]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2022-01-31 20:37:01,022 INFO L858 garLoopResultBuilder]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2022-01-31 20:37:01,022 INFO L854 garLoopResultBuilder]: At program point L33(line 33) the Hoare annotation is: (let ((.cse9 (+ main_~max~0 4294967295))) (let ((.cse22 (div .cse9 4294967296))) (let ((.cse21 (* .cse22 4294967296)) (.cse14 (select |#memory_int| |main_~#str2~0.base|))) (let ((.cse19 (select .cse14 (+ (* .cse22 (- 4294967296)) main_~max~0 4294967295 |main_~#str1~0.offset|))) (.cse10 (+ main_~i~0 .cse21)) (.cse20 (select |#memory_int| |main_~#str1~0.base|)) (.cse17 (+ main_~i~0 |main_~#str1~0.offset|))) (let ((.cse16 (select .cse20 .cse17)) (.cse0 (= |main_~#str2~0.offset| 0)) (.cse1 (<= 5 main_~max~0)) (.cse2 (<= main_~max~0 5)) (.cse3 (or (not (= .cse17 0)) (= (+ main_~max~0 4294967295 |main_~#str1~0.offset|) (+ main_~i~0 main_~j~0 |main_~#str2~0.offset| .cse21)))) (.cse4 (= (select .cse20 3) (select .cse14 1))) (.cse5 (= |main_~#str1~0.offset| 0)) (.cse6 (= (select .cse14 2) (select .cse20 2))) (.cse7 (= |main_#t~mem11| |main_#t~mem10|)) (.cse8 (<= 4294967296 .cse10)) (.cse15 (+ main_~j~0 |main_~#str2~0.offset|)) (.cse11 (not (= |main_~#str1~0.base| |main_~#str2~0.base|))) (.cse12 (= (select .cse20 0) .cse19)) (.cse13 (= (select .cse14 0) (select .cse20 (+ |main_~#str1~0.offset| 4))))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= main_~j~0 0) .cse8 (= .cse9 .cse10) .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 (= (select .cse14 .cse15) .cse16) .cse3 .cse4 .cse6 .cse7 .cse8 (= .cse17 1) (<= 3 main_~j~0) .cse11 (<= .cse10 4294967297) (<= 1 main_~i~0) .cse12 (<= main_~j~0 3) .cse13) (let ((.cse18 (+ main_~max~0 4294967293))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= main_~j~0 2) .cse7 .cse8 (<= 2 main_~j~0) .cse11 .cse12 (<= .cse18 .cse10) .cse13 (<= .cse10 .cse18))) (and .cse0 (= .cse19 .cse16) .cse1 .cse2 (= (select .cse14 3) (select .cse20 1)) .cse4 .cse5 .cse6 .cse7 .cse8 (= main_~i~0 0) .cse11 (= .cse9 (+ main_~i~0 main_~j~0 .cse21)) .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= 1 .cse15) .cse11 (<= main_~j~0 1) (<= 3 main_~i~0) .cse12 (<= main_~i~0 3) .cse13))))))) [2022-01-31 20:37:01,023 INFO L854 garLoopResultBuilder]: At program point L33-1(line 33) the Hoare annotation is: (let ((.cse16 (div (+ main_~max~0 4294967295) 4294967296))) (let ((.cse17 (* .cse16 4294967296))) (let ((.cse12 (+ main_~i~0 .cse17)) (.cse14 (select |#memory_int| |main_~#str1~0.base|)) (.cse13 (select |#memory_int| |main_~#str2~0.base|))) (let ((.cse0 (= |main_~#str2~0.offset| 0)) (.cse1 (<= 5 main_~max~0)) (.cse2 (<= main_~max~0 5)) (.cse3 (or (not (= (+ main_~i~0 |main_~#str1~0.offset|) 0)) (= (+ main_~max~0 4294967295 |main_~#str1~0.offset|) (+ main_~i~0 main_~j~0 |main_~#str2~0.offset| .cse17)))) (.cse4 (= (select .cse14 3) (select .cse13 1))) (.cse5 (= |main_~#str1~0.offset| 0)) (.cse6 (= (select .cse13 2) (select .cse14 2))) (.cse7 (<= 4294967296 .cse12)) (.cse8 (not (= |main_~#str1~0.base| |main_~#str2~0.base|))) (.cse9 (= (select .cse14 0) (select .cse13 (+ (* .cse16 (- 4294967296)) main_~max~0 4294967295 |main_~#str1~0.offset|)))) (.cse10 (= (select .cse13 0) (select .cse14 (+ |main_~#str1~0.offset| 4))))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= 1 (+ main_~j~0 |main_~#str2~0.offset|)) .cse8 (<= main_~j~0 1) (<= 3 main_~i~0) .cse9 (<= main_~i~0 3) .cse10) (let ((.cse11 (+ main_~max~0 4294967293))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= main_~j~0 2) .cse7 (<= 2 main_~j~0) .cse8 .cse9 (<= .cse11 .cse12) .cse10 (<= .cse12 .cse11))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= 3 main_~j~0) .cse8 (<= .cse12 (+ 4294967292 main_~max~0)) .cse9 (<= main_~j~0 3) .cse10) (and .cse0 .cse1 .cse2 (= (select .cse13 3) (select .cse14 1)) .cse3 .cse4 .cse5 .cse6 .cse7 (= main_~i~0 0) .cse8 .cse9 .cse10) (let ((.cse15 (+ main_~i~0 1))) (and .cse0 (<= .cse15 main_~max~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= main_~max~0 .cse15)))))))) [2022-01-31 20:37:01,023 INFO L854 garLoopResultBuilder]: At program point mainEXIT(lines 13 36) the Hoare annotation is: (and (not (<= (div (+ main_~max~0 4294967295) 4294967296) 0)) (<= main_~max~0 5)) [2022-01-31 20:37:01,023 INFO L854 garLoopResultBuilder]: At program point mainFINAL(lines 13 36) the Hoare annotation is: (and (not (<= (div (+ main_~max~0 4294967295) 4294967296) 0)) (<= main_~max~0 5)) [2022-01-31 20:37:01,023 INFO L854 garLoopResultBuilder]: At program point L32-2(lines 32 35) the Hoare annotation is: (let ((.cse19 (div (+ main_~max~0 4294967295) 4294967296))) (let ((.cse16 (select |#memory_int| |main_~#str1~0.base|)) (.cse20 (* .cse19 4294967296))) (let ((.cse17 (+ 4294967291 main_~max~0)) (.cse10 (+ main_~i~0 .cse20)) (.cse7 (select .cse16 2)) (.cse15 (select .cse16 3)) (.cse18 (select |#memory_int| |main_~#str2~0.base|))) (let ((.cse0 (= |main_~#str2~0.offset| 0)) (.cse1 (<= 5 main_~max~0)) (.cse2 (<= .cse19 1)) (.cse3 (= .cse15 (select .cse18 1))) (.cse4 (= |main_~#str1~0.offset| 0)) (.cse14 (= (select .cse18 2) .cse7)) (.cse5 (<= 4294967296 .cse10)) (.cse6 (<= .cse17 .cse20)) (.cse8 (select .cse18 (+ main_~j~0 |main_~#str2~0.offset|))) (.cse9 (not (= |main_~#str1~0.base| |main_~#str2~0.base|))) (.cse11 (= (select .cse16 0) (select .cse18 (+ (* .cse19 (- 4294967296)) main_~max~0 4294967295 |main_~#str1~0.offset|)))) (.cse12 (= (select .cse18 0) (select .cse16 (+ |main_~#str1~0.offset| 4))))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= main_~j~0 2) .cse5 .cse6 (= .cse7 .cse8) (<= 2 main_~j~0) .cse9 (<= .cse10 (+ 4294967292 main_~max~0)) (<= 1 main_~i~0) .cse11 .cse12) (let ((.cse13 (+ main_~i~0 1))) (and .cse0 (<= .cse13 main_~max~0) .cse1 .cse2 .cse3 .cse4 .cse14 .cse5 .cse6 .cse9 .cse11 .cse12 (<= main_~max~0 .cse13))) (and .cse0 .cse1 (<= 1 main_~j~0) .cse2 .cse4 .cse14 (<= main_~max~0 (+ main_~i~0 3)) .cse5 .cse9 (<= main_~i~0 2) (<= main_~j~0 1) .cse11 (= .cse15 .cse8) .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse14 (= main_~j~0 0) .cse5 (<= main_~max~0 (+ main_~i~0 2)) .cse9 .cse11 (<= main_~i~0 3) .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse14 .cse5 .cse6 (= (select .cse16 1) .cse8) (<= 3 main_~j~0) .cse9 (<= .cse10 .cse17) .cse11 (<= main_~j~0 3) .cse12)))))) [2022-01-31 20:37:01,023 INFO L861 garLoopResultBuilder]: At program point mainENTRY(lines 13 36) the Hoare annotation is: true [2022-01-31 20:37:01,024 INFO L854 garLoopResultBuilder]: At program point L32-3(lines 32 35) the Hoare annotation is: (let ((.cse14 (+ main_~max~0 4294967295))) (let ((.cse21 (div .cse14 4294967296))) (let ((.cse19 (* .cse21 4294967296)) (.cse17 (select |#memory_int| |main_~#str2~0.base|))) (let ((.cse15 (select .cse17 (+ (* .cse21 (- 4294967296)) main_~max~0 4294967295 |main_~#str1~0.offset|))) (.cse13 (+ main_~i~0 .cse19)) (.cse18 (select |#memory_int| |main_~#str1~0.base|)) (.cse20 (+ main_~i~0 |main_~#str1~0.offset|))) (let ((.cse8 (+ main_~j~0 |main_~#str2~0.offset|)) (.cse16 (select .cse18 .cse20)) (.cse0 (= |main_~#str2~0.offset| 0)) (.cse1 (<= 5 main_~max~0)) (.cse2 (<= main_~max~0 5)) (.cse3 (or (not (= .cse20 0)) (= (+ main_~max~0 4294967295 |main_~#str1~0.offset|) (+ main_~i~0 main_~j~0 |main_~#str2~0.offset| .cse19)))) (.cse4 (= (select .cse18 3) (select .cse17 1))) (.cse5 (= |main_~#str1~0.offset| 0)) (.cse6 (= (select .cse17 2) (select .cse18 2))) (.cse7 (<= 4294967296 .cse13)) (.cse9 (not (= |main_~#str1~0.base| |main_~#str2~0.base|))) (.cse10 (= (select .cse18 0) .cse15)) (.cse11 (= (select .cse17 0) (select .cse18 (+ |main_~#str1~0.offset| 4))))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= 1 .cse8) .cse9 (<= main_~j~0 1) (<= 3 main_~i~0) .cse10 (<= main_~i~0 3) .cse11) (let ((.cse12 (+ main_~max~0 4294967293))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= main_~j~0 2) .cse7 (<= 2 main_~j~0) .cse9 .cse10 (<= .cse12 .cse13) .cse11 (<= .cse13 .cse12))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= main_~j~0 0) .cse7 (= .cse14 .cse13) .cse9 .cse10 .cse11) (and .cse0 (= .cse15 .cse16) .cse1 .cse2 (= (select .cse17 3) (select .cse18 1)) .cse4 .cse5 .cse6 .cse7 (= main_~i~0 0) .cse9 (= .cse14 (+ main_~i~0 main_~j~0 .cse19)) .cse11) (and .cse0 .cse1 .cse2 (= (select .cse17 .cse8) .cse16) .cse3 .cse4 .cse6 .cse7 (= .cse20 1) (<= 3 main_~j~0) .cse9 (<= .cse13 4294967297) (<= 1 main_~i~0) .cse10 (<= main_~j~0 3) .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 (<= main_~max~0 main_~i~0) .cse10 (not (<= (+ (div main_~max~0 4294967296) 1) (div main_~i~0 4294967296))) .cse11))))))) [2022-01-31 20:37:01,024 INFO L854 garLoopResultBuilder]: At program point L32-4(lines 32 35) the Hoare annotation is: (and (not (<= (div (+ main_~max~0 4294967295) 4294967296) 0)) (<= main_~max~0 5)) [2022-01-31 20:37:01,024 INFO L854 garLoopResultBuilder]: At program point L26-2(lines 26 29) the Hoare annotation is: (let ((.cse21 (+ main_~max~0 4294967295))) (let ((.cse2 (div .cse21 4294967296)) (.cse1 (select |#memory_int| |main_~#str2~0.base|))) (let ((.cse20 (select .cse1 0)) (.cse22 (* .cse2 4294967296)) (.cse14 (select .cse1 2)) (.cse7 (select |#memory_int| |main_~#str1~0.base|)) (.cse18 (select .cse1 1))) (let ((.cse0 (= |main_~#str2~0.offset| 0)) (.cse6 (select .cse1 3)) (.cse8 (= (select .cse7 3) .cse18)) (.cse10 (= .cse14 (select .cse7 2))) (.cse11 (= (+ main_~i~0 main_~j~0 .cse22) (+ main_~max~0 4294967296))) (.cse13 (= .cse20 (select .cse7 (+ |main_~#str1~0.offset| 4)))) (.cse4 (<= 5 main_~max~0)) (.cse5 (<= main_~max~0 5)) (.cse9 (= |main_~#str1~0.offset| 0)) (.cse3 (select .cse7 (+ main_~i~0 |main_~#str1~0.offset|))) (.cse17 (+ main_~i~0 .cse22)) (.cse12 (not (= |main_~#str1~0.base| |main_~#str2~0.base|))) (.cse15 (+ main_~j~0 |main_~#str2~0.offset|))) (or (and .cse0 (= (select .cse1 (+ (* .cse2 (- 4294967296)) main_~max~0 4294967295 |main_~#str1~0.offset|)) .cse3) .cse4 .cse5 (= .cse6 (select .cse7 1)) .cse8 .cse9 .cse10 .cse11 (= main_~i~0 0) .cse12 .cse13) (let ((.cse16 (+ main_~max~0 4294967293))) (and .cse4 .cse5 .cse8 .cse9 .cse11 .cse12 (= .cse14 .cse3) (= .cse15 3) (<= .cse16 .cse17) .cse13 (<= .cse17 .cse16))) (let ((.cse19 (+ main_~max~0 4294967294))) (and .cse0 .cse4 .cse5 .cse9 (= .cse18 .cse3) .cse11 (<= .cse17 .cse19) .cse12 (<= .cse19 .cse17) .cse13)) (and .cse0 (= .cse6 .cse3) .cse8 .cse9 .cse10 .cse11 .cse12 (<= .cse17 (+ 4294967292 main_~max~0)) (<= main_~max~0 (+ main_~i~0 4)) (<= 4294967297 .cse17) (<= .cse17 4294967297) .cse13) (and .cse4 (= main_~j~0 1) .cse5 .cse9 (= .cse20 .cse3) (= .cse21 .cse17) .cse12 (= .cse15 1))))))) [2022-01-31 20:37:01,024 INFO L854 garLoopResultBuilder]: At program point L26-3(lines 26 29) the Hoare annotation is: (let ((.cse18 (+ main_~max~0 4294967295))) (let ((.cse16 (div .cse18 4294967296))) (let ((.cse10 (* .cse16 4294967296)) (.cse15 (select |#memory_int| |main_~#str2~0.base|)) (.cse14 (select |#memory_int| |main_~#str1~0.base|))) (let ((.cse12 (= (select .cse15 3) (select .cse14 1))) (.cse1 (= (select .cse14 3) (select .cse15 1))) (.cse8 (= (select .cse15 2) (select .cse14 2))) (.cse13 (< 0 .cse16)) (.cse11 (+ 4294967291 main_~max~0)) (.cse0 (= |main_~#str2~0.offset| 0)) (.cse17 (<= main_~max~0 5)) (.cse2 (= |main_~#str1~0.offset| 0)) (.cse4 (not (= |main_~#str1~0.base| |main_~#str2~0.base|))) (.cse9 (+ main_~j~0 |main_~#str2~0.offset|)) (.cse3 (+ main_~i~0 .cse10)) (.cse5 (let ((.cse20 (<= (+ main_~max~0 2147483648) .cse10))) (or (and (not .cse20) (= (+ main_~i~0 main_~j~0 .cse10 1) main_~max~0)) (and .cse20 (= .cse18 (+ main_~i~0 main_~j~0 .cse10)))))) (.cse7 (= (select .cse15 0) (select .cse14 (+ |main_~#str1~0.offset| 4))))) (or (let ((.cse6 (+ main_~max~0 4294967293))) (and .cse0 .cse1 .cse2 (<= 4294967298 .cse3) .cse4 .cse5 (<= .cse3 4294967298) (<= .cse6 .cse3) .cse7 (<= .cse3 .cse6))) (and .cse1 .cse2 .cse8 .cse4 (<= .cse3 (+ 4294967292 main_~max~0)) (<= main_~max~0 (+ main_~i~0 4)) (<= 4294967297 .cse3) (<= .cse3 4294967297) (= .cse9 3) .cse5 .cse7) (and .cse0 (<= .cse3 4294967295) (<= .cse10 .cse11) .cse12 .cse1 .cse2 .cse8 .cse13 .cse4 (= (select .cse14 0) (select .cse15 (+ (* .cse16 (- 4294967296)) main_~max~0 4294967295 |main_~#str1~0.offset|))) .cse5 (<= (+ 4294967290 main_~max~0) .cse3) .cse7) (and .cse0 .cse17 .cse12 .cse1 .cse2 .cse8 .cse13 (= main_~i~0 0) .cse4 (<= .cse3 .cse11) .cse5 .cse7) (and .cse0 (<= 5 main_~max~0) .cse17 .cse2 (= main_~j~0 0) (= .cse18 .cse3) .cse4) (let ((.cse19 (+ main_~max~0 4294967294))) (and (<= .cse3 4294967299) .cse2 (<= 4294967299 .cse3) (<= .cse3 .cse19) .cse4 (= .cse9 1) (<= .cse19 .cse3) .cse5 .cse7))))))) [2022-01-31 20:37:01,024 INFO L854 garLoopResultBuilder]: At program point L26-4(lines 26 29) the Hoare annotation is: (let ((.cse3 (+ main_~max~0 4294967295))) (let ((.cse5 (div .cse3 4294967296))) (let ((.cse4 (* .cse5 4294967296))) (let ((.cse0 (+ main_~i~0 .cse4)) (.cse1 (select |#memory_int| |main_~#str2~0.base|)) (.cse2 (select |#memory_int| |main_~#str1~0.base|))) (and (= |main_~#str2~0.offset| 0) (<= .cse0 4294967295) (<= 5 main_~max~0) (= (select .cse1 3) (select .cse2 1)) (= (select .cse2 3) (select .cse1 1)) (= |main_~#str1~0.offset| 0) (= (select .cse1 2) (select .cse2 2)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= .cse3 (+ main_~i~0 main_~j~0 .cse4)) (= (select .cse2 0) (select .cse1 (+ (* .cse5 (- 4294967296)) main_~max~0 4294967295 |main_~#str1~0.offset|))) (<= (+ 4294967290 main_~max~0) .cse0) (= (select .cse1 0) (select .cse2 (+ |main_~#str1~0.offset| 4)))))))) [2022-01-31 20:37:01,025 INFO L854 garLoopResultBuilder]: At program point L18-2(lines 18 20) the Hoare annotation is: (let ((.cse0 (= |main_~#str2~0.offset| 0)) (.cse1 (<= 5 main_~max~0)) (.cse2 (= |main_~#str1~0.offset| 0)) (.cse3 (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))) (or (and .cse0 .cse1 .cse2 (<= main_~i~0 4) .cse3 (<= main_~max~0 (+ main_~i~0 1))) (let ((.cse4 (+ main_~i~0 2))) (and .cse0 .cse2 (<= main_~max~0 .cse4) (<= .cse4 main_~max~0) .cse3 (<= 3 main_~i~0) (<= main_~i~0 3))) (and .cse0 .cse1 (<= main_~max~0 5) .cse2 .cse3 (<= (* (div main_~max~0 4294967296) 4294967296) main_~i~0) (<= (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)) 4294967298)))) [2022-01-31 20:37:01,025 INFO L854 garLoopResultBuilder]: At program point L18-3(lines 18 20) the Hoare annotation is: (let ((.cse5 (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296))) (.cse0 (= |main_~#str2~0.offset| 0)) (.cse1 (<= 5 main_~max~0)) (.cse2 (<= main_~max~0 5)) (.cse3 (= |main_~#str1~0.offset| 0)) (.cse4 (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))) (or (and .cse0 .cse1 .cse2 .cse3 (= main_~i~0 0) .cse4) (and .cse0 .cse1 .cse3 (<= main_~max~0 (+ main_~i~0 3)) .cse4 (<= .cse5 4294967298)) (let ((.cse6 (+ main_~i~0 4))) (and .cse0 .cse3 (<= .cse6 main_~max~0) .cse4 (<= main_~max~0 .cse6) (<= .cse5 4294967297) (<= 1 main_~i~0))) (and .cse0 .cse1 .cse3 (<= main_~i~0 4) .cse4 (<= main_~max~0 (+ main_~i~0 1))) (let ((.cse7 (+ main_~i~0 2))) (and .cse0 .cse3 (<= main_~max~0 .cse7) (<= .cse7 main_~max~0) .cse4 (<= 3 main_~i~0) (<= main_~i~0 3))) (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= main_~max~0 main_~i~0) (not (<= (+ (div main_~max~0 4294967296) 1) (div main_~i~0 4294967296)))))) [2022-01-31 20:37:01,025 INFO L854 garLoopResultBuilder]: At program point L18-4(lines 18 20) the Hoare annotation is: (and (= |main_~#str2~0.offset| 0) (<= 5 main_~max~0) (<= main_~max~0 5) (= |main_~#str1~0.offset| 0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~max~0 main_~i~0) (not (<= (+ (div main_~max~0 4294967296) 1) (div main_~i~0 4294967296)))) [2022-01-31 20:37:01,025 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-01-31 20:37:01,025 INFO L854 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-01-31 20:37:01,025 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-01-31 20:37:01,025 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-01-31 20:37:01,025 INFO L861 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-01-31 20:37:01,025 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-01-31 20:37:01,025 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-01-31 20:37:01,025 INFO L861 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 5 10) the Hoare annotation is: true [2022-01-31 20:37:01,026 INFO L854 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 5 10) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2022-01-31 20:37:01,026 INFO L854 garLoopResultBuilder]: At program point L7(line 7) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-01-31 20:37:01,026 INFO L854 garLoopResultBuilder]: At program point L6(lines 6 8) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2022-01-31 20:37:01,026 INFO L854 garLoopResultBuilder]: At program point L6-2(lines 5 10) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2022-01-31 20:37:01,026 INFO L854 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 7) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-01-31 20:37:01,028 INFO L732 BasicCegarLoop]: Path program histogram: [9, 6, 1, 1] [2022-01-31 20:37:01,029 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-01-31 20:37:01,075 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 08:37:01 BoogieIcfgContainer [2022-01-31 20:37:01,075 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-31 20:37:01,076 INFO L158 Benchmark]: Toolchain (without parser) took 27451.98ms. Allocated memory was 230.7MB in the beginning and 399.5MB in the end (delta: 168.8MB). Free memory was 181.9MB in the beginning and 328.0MB in the end (delta: -146.1MB). Peak memory consumption was 222.1MB. Max. memory is 8.0GB. [2022-01-31 20:37:01,076 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 230.7MB. Free memory is still 198.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-31 20:37:01,076 INFO L158 Benchmark]: CACSL2BoogieTranslator took 216.55ms. Allocated memory is still 230.7MB. Free memory was 181.6MB in the beginning and 206.8MB in the end (delta: -25.2MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-01-31 20:37:01,076 INFO L158 Benchmark]: Boogie Preprocessor took 48.32ms. Allocated memory is still 230.7MB. Free memory was 206.8MB in the beginning and 205.2MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-01-31 20:37:01,077 INFO L158 Benchmark]: RCFGBuilder took 223.51ms. Allocated memory is still 230.7MB. Free memory was 205.2MB in the beginning and 193.7MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-01-31 20:37:01,077 INFO L158 Benchmark]: TraceAbstraction took 26959.65ms. Allocated memory was 230.7MB in the beginning and 399.5MB in the end (delta: 168.8MB). Free memory was 193.2MB in the beginning and 328.0MB in the end (delta: -134.8MB). Peak memory consumption was 233.2MB. Max. memory is 8.0GB. [2022-01-31 20:37:01,078 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 230.7MB. Free memory is still 198.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 216.55ms. Allocated memory is still 230.7MB. Free memory was 181.6MB in the beginning and 206.8MB in the end (delta: -25.2MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 48.32ms. Allocated memory is still 230.7MB. Free memory was 206.8MB in the beginning and 205.2MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 223.51ms. Allocated memory is still 230.7MB. Free memory was 205.2MB in the beginning and 193.7MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 26959.65ms. Allocated memory was 230.7MB in the beginning and 399.5MB in the end (delta: 168.8MB). Free memory was 193.2MB in the beginning and 328.0MB in the end (delta: -134.8MB). Peak memory consumption was 233.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 7]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 30 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 26.9s, OverallIterations: 17, TraceHistogramMax: 6, PathProgramHistogramMax: 9, EmptinessCheckTime: 0.0s, AutomataDifference: 12.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 6.1s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 809 SdHoareTripleChecker+Valid, 3.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 804 mSDsluCounter, 808 SdHoareTripleChecker+Invalid, 3.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 502 mSDsCounter, 1052 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4521 IncrementalHoareTripleChecker+Invalid, 5573 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1052 mSolverCounterUnsat, 306 mSDtfsCounter, 4521 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 473 GetRequests, 91 SyntacticMatches, 4 SemanticMatches, 378 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3403 ImplicationChecksByTransitivity, 11.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=78occurred in iteration=16, InterpolantAutomatonStates: 244, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 17 MinimizatonAttempts, 85 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 27 LocationsWithAnnotation, 159 PreInvPairs, 219 NumberOfFragments, 4282 HoareAnnotationTreeSize, 159 FomulaSimplifications, 558 FormulaSimplificationTreeSizeReduction, 2.6s HoareSimplificationTime, 27 FomulaSimplificationsInter, 661470 FormulaSimplificationTreeSizeReductionInter, 3.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: ((((((((((((((((((str2 == 0 && 5 <= max) && max <= 5) && (!(i + str1 == 0) || max + 4294967295 + str1 == i + j + str2 + (max + 4294967295) / 4294967296 * 4294967296)) && unknown-#memory_int-unknown[str1][3] == unknown-#memory_int-unknown[str2][1]) && str1 == 0) && unknown-#memory_int-unknown[str2][2] == unknown-#memory_int-unknown[str1][2]) && 4294967296 <= i + (max + 4294967295) / 4294967296 * 4294967296) && 1 <= j + str2) && !(str1 == str2)) && j <= 1) && 3 <= i) && unknown-#memory_int-unknown[str1][0] == unknown-#memory_int-unknown[str2][(max + 4294967295) / 4294967296 * -4294967296 + max + 4294967295 + str1]) && i <= 3) && unknown-#memory_int-unknown[str2][0] == unknown-#memory_int-unknown[str1][str1 + 4]) || ((((((((((((((str2 == 0 && 5 <= max) && max <= 5) && (!(i + str1 == 0) || max + 4294967295 + str1 == i + j + str2 + (max + 4294967295) / 4294967296 * 4294967296)) && unknown-#memory_int-unknown[str1][3] == unknown-#memory_int-unknown[str2][1]) && str1 == 0) && unknown-#memory_int-unknown[str2][2] == unknown-#memory_int-unknown[str1][2]) && j <= 2) && 4294967296 <= i + (max + 4294967295) / 4294967296 * 4294967296) && 2 <= j) && !(str1 == str2)) && unknown-#memory_int-unknown[str1][0] == unknown-#memory_int-unknown[str2][(max + 4294967295) / 4294967296 * -4294967296 + max + 4294967295 + str1]) && max + 4294967293 <= i + (max + 4294967295) / 4294967296 * 4294967296) && unknown-#memory_int-unknown[str2][0] == unknown-#memory_int-unknown[str1][str1 + 4]) && i + (max + 4294967295) / 4294967296 * 4294967296 <= max + 4294967293)) || ((((((((((((str2 == 0 && 5 <= max) && max <= 5) && (!(i + str1 == 0) || max + 4294967295 + str1 == i + j + str2 + (max + 4294967295) / 4294967296 * 4294967296)) && unknown-#memory_int-unknown[str1][3] == unknown-#memory_int-unknown[str2][1]) && str1 == 0) && unknown-#memory_int-unknown[str2][2] == unknown-#memory_int-unknown[str1][2]) && j == 0) && 4294967296 <= i + (max + 4294967295) / 4294967296 * 4294967296) && max + 4294967295 == i + (max + 4294967295) / 4294967296 * 4294967296) && !(str1 == str2)) && unknown-#memory_int-unknown[str1][0] == unknown-#memory_int-unknown[str2][(max + 4294967295) / 4294967296 * -4294967296 + max + 4294967295 + str1]) && unknown-#memory_int-unknown[str2][0] == unknown-#memory_int-unknown[str1][str1 + 4])) || ((((((((((((str2 == 0 && unknown-#memory_int-unknown[str2][(max + 4294967295) / 4294967296 * -4294967296 + max + 4294967295 + str1] == unknown-#memory_int-unknown[str1][i + str1]) && 5 <= max) && max <= 5) && unknown-#memory_int-unknown[str2][3] == unknown-#memory_int-unknown[str1][1]) && unknown-#memory_int-unknown[str1][3] == unknown-#memory_int-unknown[str2][1]) && str1 == 0) && unknown-#memory_int-unknown[str2][2] == unknown-#memory_int-unknown[str1][2]) && 4294967296 <= i + (max + 4294967295) / 4294967296 * 4294967296) && i == 0) && !(str1 == str2)) && max + 4294967295 == i + j + (max + 4294967295) / 4294967296 * 4294967296) && unknown-#memory_int-unknown[str2][0] == unknown-#memory_int-unknown[str1][str1 + 4])) || (((((((((((((((str2 == 0 && 5 <= max) && max <= 5) && unknown-#memory_int-unknown[str2][j + str2] == unknown-#memory_int-unknown[str1][i + str1]) && (!(i + str1 == 0) || max + 4294967295 + str1 == i + j + str2 + (max + 4294967295) / 4294967296 * 4294967296)) && unknown-#memory_int-unknown[str1][3] == unknown-#memory_int-unknown[str2][1]) && unknown-#memory_int-unknown[str2][2] == unknown-#memory_int-unknown[str1][2]) && 4294967296 <= i + (max + 4294967295) / 4294967296 * 4294967296) && i + str1 == 1) && 3 <= j) && !(str1 == str2)) && i + (max + 4294967295) / 4294967296 * 4294967296 <= 4294967297) && 1 <= i) && unknown-#memory_int-unknown[str1][0] == unknown-#memory_int-unknown[str2][(max + 4294967295) / 4294967296 * -4294967296 + max + 4294967295 + str1]) && j <= 3) && unknown-#memory_int-unknown[str2][0] == unknown-#memory_int-unknown[str1][str1 + 4])) || ((((((((((((str2 == 0 && 5 <= max) && max <= 5) && (!(i + str1 == 0) || max + 4294967295 + str1 == i + j + str2 + (max + 4294967295) / 4294967296 * 4294967296)) && unknown-#memory_int-unknown[str1][3] == unknown-#memory_int-unknown[str2][1]) && str1 == 0) && unknown-#memory_int-unknown[str2][2] == unknown-#memory_int-unknown[str1][2]) && 4294967296 <= i + (max + 4294967295) / 4294967296 * 4294967296) && !(str1 == str2)) && max <= i) && unknown-#memory_int-unknown[str1][0] == unknown-#memory_int-unknown[str2][(max + 4294967295) / 4294967296 * -4294967296 + max + 4294967295 + str1]) && !(max / 4294967296 + 1 <= i / 4294967296)) && unknown-#memory_int-unknown[str2][0] == unknown-#memory_int-unknown[str1][str1 + 4]) - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: (((((((((((((str2 == 0 && unknown-#memory_int-unknown[str1][3] == unknown-#memory_int-unknown[str2][1]) && str1 == 0) && 4294967298 <= i + (max + 4294967295) / 4294967296 * 4294967296) && !(str1 == str2)) && ((!(max + 2147483648 <= (max + 4294967295) / 4294967296 * 4294967296) && i + j + (max + 4294967295) / 4294967296 * 4294967296 + 1 == max) || (max + 2147483648 <= (max + 4294967295) / 4294967296 * 4294967296 && max + 4294967295 == i + j + (max + 4294967295) / 4294967296 * 4294967296))) && i + (max + 4294967295) / 4294967296 * 4294967296 <= 4294967298) && max + 4294967293 <= i + (max + 4294967295) / 4294967296 * 4294967296) && unknown-#memory_int-unknown[str2][0] == unknown-#memory_int-unknown[str1][str1 + 4]) && i + (max + 4294967295) / 4294967296 * 4294967296 <= max + 4294967293) || ((((((((((unknown-#memory_int-unknown[str1][3] == unknown-#memory_int-unknown[str2][1] && str1 == 0) && unknown-#memory_int-unknown[str2][2] == unknown-#memory_int-unknown[str1][2]) && !(str1 == str2)) && i + (max + 4294967295) / 4294967296 * 4294967296 <= 4294967292 + max) && max <= i + 4) && 4294967297 <= i + (max + 4294967295) / 4294967296 * 4294967296) && i + (max + 4294967295) / 4294967296 * 4294967296 <= 4294967297) && j + str2 == 3) && ((!(max + 2147483648 <= (max + 4294967295) / 4294967296 * 4294967296) && i + j + (max + 4294967295) / 4294967296 * 4294967296 + 1 == max) || (max + 2147483648 <= (max + 4294967295) / 4294967296 * 4294967296 && max + 4294967295 == i + j + (max + 4294967295) / 4294967296 * 4294967296))) && unknown-#memory_int-unknown[str2][0] == unknown-#memory_int-unknown[str1][str1 + 4])) || ((((((((((((str2 == 0 && i + (max + 4294967295) / 4294967296 * 4294967296 <= 4294967295) && (max + 4294967295) / 4294967296 * 4294967296 <= 4294967291 + max) && unknown-#memory_int-unknown[str2][3] == unknown-#memory_int-unknown[str1][1]) && unknown-#memory_int-unknown[str1][3] == unknown-#memory_int-unknown[str2][1]) && str1 == 0) && unknown-#memory_int-unknown[str2][2] == unknown-#memory_int-unknown[str1][2]) && 0 < (max + 4294967295) / 4294967296) && !(str1 == str2)) && unknown-#memory_int-unknown[str1][0] == unknown-#memory_int-unknown[str2][(max + 4294967295) / 4294967296 * -4294967296 + max + 4294967295 + str1]) && ((!(max + 2147483648 <= (max + 4294967295) / 4294967296 * 4294967296) && i + j + (max + 4294967295) / 4294967296 * 4294967296 + 1 == max) || (max + 2147483648 <= (max + 4294967295) / 4294967296 * 4294967296 && max + 4294967295 == i + j + (max + 4294967295) / 4294967296 * 4294967296))) && 4294967290 + max <= i + (max + 4294967295) / 4294967296 * 4294967296) && unknown-#memory_int-unknown[str2][0] == unknown-#memory_int-unknown[str1][str1 + 4])) || (((((((((((str2 == 0 && max <= 5) && unknown-#memory_int-unknown[str2][3] == unknown-#memory_int-unknown[str1][1]) && unknown-#memory_int-unknown[str1][3] == unknown-#memory_int-unknown[str2][1]) && str1 == 0) && unknown-#memory_int-unknown[str2][2] == unknown-#memory_int-unknown[str1][2]) && 0 < (max + 4294967295) / 4294967296) && i == 0) && !(str1 == str2)) && i + (max + 4294967295) / 4294967296 * 4294967296 <= 4294967291 + max) && ((!(max + 2147483648 <= (max + 4294967295) / 4294967296 * 4294967296) && i + j + (max + 4294967295) / 4294967296 * 4294967296 + 1 == max) || (max + 2147483648 <= (max + 4294967295) / 4294967296 * 4294967296 && max + 4294967295 == i + j + (max + 4294967295) / 4294967296 * 4294967296))) && unknown-#memory_int-unknown[str2][0] == unknown-#memory_int-unknown[str1][str1 + 4])) || ((((((str2 == 0 && 5 <= max) && max <= 5) && str1 == 0) && j == 0) && max + 4294967295 == i + (max + 4294967295) / 4294967296 * 4294967296) && !(str1 == str2))) || ((((((((i + (max + 4294967295) / 4294967296 * 4294967296 <= 4294967299 && str1 == 0) && 4294967299 <= i + (max + 4294967295) / 4294967296 * 4294967296) && i + (max + 4294967295) / 4294967296 * 4294967296 <= max + 4294967294) && !(str1 == str2)) && j + str2 == 1) && max + 4294967294 <= i + (max + 4294967295) / 4294967296 * 4294967296) && ((!(max + 2147483648 <= (max + 4294967295) / 4294967296 * 4294967296) && i + j + (max + 4294967295) / 4294967296 * 4294967296 + 1 == max) || (max + 2147483648 <= (max + 4294967295) / 4294967296 * 4294967296 && max + 4294967295 == i + j + (max + 4294967295) / 4294967296 * 4294967296))) && unknown-#memory_int-unknown[str2][0] == unknown-#memory_int-unknown[str1][str1 + 4]) - InvariantResult [Line: 18]: Loop Invariant Derived loop invariant: (((((((((str2 == 0 && 5 <= max) && max <= 5) && str1 == 0) && i == 0) && !(str1 == str2)) || (((((str2 == 0 && 5 <= max) && str1 == 0) && max <= i + 3) && !(str1 == str2)) && i + (max + 4294967295) / 4294967296 * 4294967296 <= 4294967298)) || ((((((str2 == 0 && str1 == 0) && i + 4 <= max) && !(str1 == str2)) && max <= i + 4) && i + (max + 4294967295) / 4294967296 * 4294967296 <= 4294967297) && 1 <= i)) || (((((str2 == 0 && 5 <= max) && str1 == 0) && i <= 4) && !(str1 == str2)) && max <= i + 1)) || ((((((str2 == 0 && str1 == 0) && max <= i + 2) && i + 2 <= max) && !(str1 == str2)) && 3 <= i) && i <= 3)) || ((((((str2 == 0 && 5 <= max) && max <= 5) && str1 == 0) && !(str1 == str2)) && max <= i) && !(max / 4294967296 + 1 <= i / 4294967296)) - ProcedureContractResult [Line: 13]: Procedure Contract for main Derived contract for procedure main: !((max + 4294967295) / 4294967296 <= 0) && max <= 5 - ProcedureContractResult [Line: 5]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: \old(cond) == 0 || !(cond == 0) RESULT: Ultimate proved your program to be correct! [2022-01-31 20:37:01,130 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...