/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/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/locks/test_locks_5.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-b030c9e [2022-03-20 23:53:23,764 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-20 23:53:23,765 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-20 23:53:23,814 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-20 23:53:23,814 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-20 23:53:23,815 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-20 23:53:23,817 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-20 23:53:23,819 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-20 23:53:23,820 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-20 23:53:23,824 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-20 23:53:23,824 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-20 23:53:23,825 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-20 23:53:23,825 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-20 23:53:23,827 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-20 23:53:23,828 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-20 23:53:23,830 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-20 23:53:23,830 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-20 23:53:23,831 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-20 23:53:23,833 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-20 23:53:23,837 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-20 23:53:23,838 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-03-20 23:53:23,839 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-20 23:53:23,840 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-20 23:53:23,840 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-20 23:53:23,841 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-20 23:53:23,844 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-20 23:53:23,844 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-20 23:53:23,844 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-20 23:53:23,845 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-20 23:53:23,845 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-20 23:53:23,846 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-20 23:53:23,846 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-20 23:53:23,846 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-20 23:53:23,847 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-20 23:53:23,847 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-20 23:53:23,849 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-20 23:53:23,850 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-20 23:53:23,851 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-20 23:53:23,851 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-20 23:53:23,851 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-20 23:53:23,851 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-20 23:53:23,853 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-20 23:53:23,853 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-03-20 23:53:23,862 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-20 23:53:23,862 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-20 23:53:23,863 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-20 23:53:23,864 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-20 23:53:23,864 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-20 23:53:23,864 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-20 23:53:23,864 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-20 23:53:23,864 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-20 23:53:23,864 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-20 23:53:23,865 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-20 23:53:23,865 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-20 23:53:23,865 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-20 23:53:23,865 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-20 23:53:23,865 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-20 23:53:23,865 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-20 23:53:23,865 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-20 23:53:23,865 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-20 23:53:23,865 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-03-20 23:53:23,865 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-03-20 23:53:23,865 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-03-20 23:53:23,866 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-20 23:53:23,866 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-03-20 23:53:23,866 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-03-20 23:53:24,051 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-20 23:53:24,083 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-20 23:53:24,084 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-20 23:53:24,085 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-20 23:53:24,089 INFO L275 PluginConnector]: CDTParser initialized [2022-03-20 23:53:24,090 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_5.c [2022-03-20 23:53:24,144 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a462280a/4a5ecd487ada40a0acd93c26b756c217/FLAG38e665313 [2022-03-20 23:53:24,503 INFO L306 CDTParser]: Found 1 translation units. [2022-03-20 23:53:24,503 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_5.c [2022-03-20 23:53:24,507 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a462280a/4a5ecd487ada40a0acd93c26b756c217/FLAG38e665313 [2022-03-20 23:53:24,521 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a462280a/4a5ecd487ada40a0acd93c26b756c217 [2022-03-20 23:53:24,522 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-20 23:53:24,524 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-03-20 23:53:24,526 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-20 23:53:24,527 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-20 23:53:24,529 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-20 23:53:24,530 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.03 11:53:24" (1/1) ... [2022-03-20 23:53:24,530 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1eda1e5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 11:53:24, skipping insertion in model container [2022-03-20 23:53:24,530 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.03 11:53:24" (1/1) ... [2022-03-20 23:53:24,535 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-20 23:53:24,549 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-20 23:53:24,696 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_5.c[2207,2220] [2022-03-20 23:53:24,699 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-20 23:53:24,705 INFO L203 MainTranslator]: Completed pre-run [2022-03-20 23:53:24,727 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_5.c[2207,2220] [2022-03-20 23:53:24,732 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-20 23:53:24,741 INFO L208 MainTranslator]: Completed translation [2022-03-20 23:53:24,741 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 11:53:24 WrapperNode [2022-03-20 23:53:24,741 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-20 23:53:24,742 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-20 23:53:24,742 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-20 23:53:24,742 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-20 23:53:24,755 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 11:53:24" (1/1) ... [2022-03-20 23:53:24,755 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 11:53:24" (1/1) ... [2022-03-20 23:53:24,760 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 11:53:24" (1/1) ... [2022-03-20 23:53:24,760 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 11:53:24" (1/1) ... [2022-03-20 23:53:24,767 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 11:53:24" (1/1) ... [2022-03-20 23:53:24,773 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 11:53:24" (1/1) ... [2022-03-20 23:53:24,776 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 11:53:24" (1/1) ... [2022-03-20 23:53:24,779 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-20 23:53:24,779 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-20 23:53:24,779 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-20 23:53:24,780 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-20 23:53:24,780 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 11:53:24" (1/1) ... [2022-03-20 23:53:24,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-20 23:53:24,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 23:53:24,833 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-03-20 23:53:24,868 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-03-20 23:53:24,898 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-03-20 23:53:24,898 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-20 23:53:24,898 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-03-20 23:53:24,898 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-03-20 23:53:24,899 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-03-20 23:53:24,899 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-03-20 23:53:24,899 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-03-20 23:53:24,899 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-20 23:53:24,899 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-03-20 23:53:24,899 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-03-20 23:53:24,900 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-03-20 23:53:24,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-20 23:53:24,900 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-20 23:53:24,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-20 23:53:24,901 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-20 23:53:24,901 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-20 23:53:24,946 INFO L234 CfgBuilder]: Building ICFG [2022-03-20 23:53:24,948 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-20 23:53:25,090 INFO L275 CfgBuilder]: Performing block encoding [2022-03-20 23:53:25,101 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-20 23:53:25,101 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-03-20 23:53:25,102 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.03 11:53:25 BoogieIcfgContainer [2022-03-20 23:53:25,102 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-20 23:53:25,103 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-20 23:53:25,103 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-20 23:53:25,109 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-20 23:53:25,109 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.03 11:53:24" (1/3) ... [2022-03-20 23:53:25,110 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26a4be50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.03 11:53:25, skipping insertion in model container [2022-03-20 23:53:25,110 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 11:53:24" (2/3) ... [2022-03-20 23:53:25,110 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26a4be50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.03 11:53:25, skipping insertion in model container [2022-03-20 23:53:25,110 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.03 11:53:25" (3/3) ... [2022-03-20 23:53:25,111 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_5.c [2022-03-20 23:53:25,114 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-03-20 23:53:25,114 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-20 23:53:25,165 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-20 23:53:25,169 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-03-20 23:53:25,170 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-03-20 23:53:25,187 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 24 states have (on average 1.7916666666666667) internal successors, (43), 25 states have internal predecessors, (43), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-03-20 23:53:25,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-20 23:53:25,197 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 23:53:25,198 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 23:53:25,198 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 23:53:25,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 23:53:25,202 INFO L85 PathProgramCache]: Analyzing trace with hash -663266717, now seen corresponding path program 1 times [2022-03-20 23:53:25,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-20 23:53:25,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1672551050] [2022-03-20 23:53:25,215 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-20 23:53:25,215 INFO L85 PathProgramCache]: Analyzing trace with hash -663266717, now seen corresponding path program 2 times [2022-03-20 23:53:25,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 23:53:25,217 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376903065] [2022-03-20 23:53:25,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 23:53:25,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 23:53:25,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 23:53:25,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 23:53:25,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 23:53:25,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 23:53:25,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 23:53:25,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376903065] [2022-03-20 23:53:25,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376903065] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 23:53:25,394 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 23:53:25,394 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 23:53:25,396 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-20 23:53:25,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1672551050] [2022-03-20 23:53:25,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1672551050] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 23:53:25,397 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 23:53:25,397 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 23:53:25,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025458021] [2022-03-20 23:53:25,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 23:53:25,401 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-20 23:53:25,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-20 23:53:25,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-20 23:53:25,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-20 23:53:25,423 INFO L87 Difference]: Start difference. First operand has 30 states, 24 states have (on average 1.7916666666666667) internal successors, (43), 25 states have internal predecessors, (43), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 23:53:25,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 23:53:25,531 INFO L93 Difference]: Finished difference Result 58 states and 91 transitions. [2022-03-20 23:53:25,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-20 23:53:25,533 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), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-03-20 23:53:25,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 23:53:25,539 INFO L225 Difference]: With dead ends: 58 [2022-03-20 23:53:25,539 INFO L226 Difference]: Without dead ends: 43 [2022-03-20 23:53:25,541 INFO L912 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-03-20 23:53:25,543 INFO L913 BasicCegarLoop]: 50 mSDtfsCounter, 89 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 23:53:25,544 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [89 Valid, 59 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-20 23:53:25,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-03-20 23:53:25,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 31. [2022-03-20 23:53:25,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 27 states have (on average 1.7407407407407407) internal successors, (47), 27 states have internal predecessors, (47), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 23:53:25,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 50 transitions. [2022-03-20 23:53:25,577 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 50 transitions. Word has length 16 [2022-03-20 23:53:25,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 23:53:25,577 INFO L478 AbstractCegarLoop]: Abstraction has 31 states and 50 transitions. [2022-03-20 23:53:25,577 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 23:53:25,578 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 50 transitions. [2022-03-20 23:53:25,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-20 23:53:25,579 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 23:53:25,579 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 23:53:25,579 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-20 23:53:25,579 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 23:53:25,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 23:53:25,581 INFO L85 PathProgramCache]: Analyzing trace with hash -1472613343, now seen corresponding path program 1 times [2022-03-20 23:53:25,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-20 23:53:25,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [864960847] [2022-03-20 23:53:25,582 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-20 23:53:25,583 INFO L85 PathProgramCache]: Analyzing trace with hash -1472613343, now seen corresponding path program 2 times [2022-03-20 23:53:25,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 23:53:25,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819285414] [2022-03-20 23:53:25,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 23:53:25,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 23:53:25,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 23:53:25,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 23:53:25,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 23:53:25,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 23:53:25,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 23:53:25,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819285414] [2022-03-20 23:53:25,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819285414] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 23:53:25,659 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 23:53:25,659 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 23:53:25,660 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-20 23:53:25,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [864960847] [2022-03-20 23:53:25,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [864960847] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 23:53:25,661 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 23:53:25,661 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 23:53:25,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717760436] [2022-03-20 23:53:25,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 23:53:25,662 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-20 23:53:25,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-20 23:53:25,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-20 23:53:25,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-20 23:53:25,662 INFO L87 Difference]: Start difference. First operand 31 states and 50 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 23:53:25,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 23:53:25,731 INFO L93 Difference]: Finished difference Result 68 states and 113 transitions. [2022-03-20 23:53:25,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-20 23:53:25,731 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), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-03-20 23:53:25,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 23:53:25,732 INFO L225 Difference]: With dead ends: 68 [2022-03-20 23:53:25,732 INFO L226 Difference]: Without dead ends: 43 [2022-03-20 23:53:25,733 INFO L912 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-03-20 23:53:25,733 INFO L913 BasicCegarLoop]: 48 mSDtfsCounter, 73 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-20 23:53:25,734 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [73 Valid, 55 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-20 23:53:25,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-03-20 23:53:25,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 41. [2022-03-20 23:53:25,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 37 states have (on average 1.7027027027027026) internal successors, (63), 37 states have internal predecessors, (63), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 23:53:25,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 66 transitions. [2022-03-20 23:53:25,751 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 66 transitions. Word has length 16 [2022-03-20 23:53:25,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 23:53:25,751 INFO L478 AbstractCegarLoop]: Abstraction has 41 states and 66 transitions. [2022-03-20 23:53:25,751 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 23:53:25,751 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 66 transitions. [2022-03-20 23:53:25,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-20 23:53:25,752 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 23:53:25,752 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 23:53:25,752 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-20 23:53:25,752 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 23:53:25,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 23:53:25,753 INFO L85 PathProgramCache]: Analyzing trace with hash 913783256, now seen corresponding path program 1 times [2022-03-20 23:53:25,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-20 23:53:25,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [513076449] [2022-03-20 23:53:25,753 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-20 23:53:25,754 INFO L85 PathProgramCache]: Analyzing trace with hash 913783256, now seen corresponding path program 2 times [2022-03-20 23:53:25,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 23:53:25,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801161679] [2022-03-20 23:53:25,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 23:53:25,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 23:53:25,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 23:53:25,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 23:53:25,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 23:53:25,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-03-20 23:53:25,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 23:53:25,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801161679] [2022-03-20 23:53:25,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801161679] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 23:53:25,800 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 23:53:25,800 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 23:53:25,801 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-20 23:53:25,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [513076449] [2022-03-20 23:53:25,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [513076449] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 23:53:25,801 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 23:53:25,801 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 23:53:25,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154261305] [2022-03-20 23:53:25,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 23:53:25,802 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-20 23:53:25,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-20 23:53:25,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-20 23:53:25,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-20 23:53:25,803 INFO L87 Difference]: Start difference. First operand 41 states and 66 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 23:53:25,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 23:53:25,859 INFO L93 Difference]: Finished difference Result 64 states and 100 transitions. [2022-03-20 23:53:25,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-20 23:53:25,859 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-03-20 23:53:25,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 23:53:25,860 INFO L225 Difference]: With dead ends: 64 [2022-03-20 23:53:25,860 INFO L226 Difference]: Without dead ends: 46 [2022-03-20 23:53:25,860 INFO L912 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-03-20 23:53:25,861 INFO L913 BasicCegarLoop]: 56 mSDtfsCounter, 66 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-20 23:53:25,862 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [66 Valid, 63 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-20 23:53:25,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-03-20 23:53:25,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 44. [2022-03-20 23:53:25,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 40 states have (on average 1.625) internal successors, (65), 40 states have internal predecessors, (65), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 23:53:25,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 68 transitions. [2022-03-20 23:53:25,868 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 68 transitions. Word has length 17 [2022-03-20 23:53:25,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 23:53:25,869 INFO L478 AbstractCegarLoop]: Abstraction has 44 states and 68 transitions. [2022-03-20 23:53:25,869 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 23:53:25,869 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 68 transitions. [2022-03-20 23:53:25,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-20 23:53:25,869 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 23:53:25,869 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 23:53:25,870 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-20 23:53:25,870 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 23:53:25,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 23:53:25,870 INFO L85 PathProgramCache]: Analyzing trace with hash 1593841626, now seen corresponding path program 1 times [2022-03-20 23:53:25,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-20 23:53:25,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [754925388] [2022-03-20 23:53:25,871 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-20 23:53:25,871 INFO L85 PathProgramCache]: Analyzing trace with hash 1593841626, now seen corresponding path program 2 times [2022-03-20 23:53:25,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 23:53:25,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458791958] [2022-03-20 23:53:25,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 23:53:25,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 23:53:25,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 23:53:25,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 23:53:25,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 23:53:25,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 23:53:25,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 23:53:25,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458791958] [2022-03-20 23:53:25,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458791958] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 23:53:25,901 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 23:53:25,901 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 23:53:25,901 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-20 23:53:25,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [754925388] [2022-03-20 23:53:25,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [754925388] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 23:53:25,902 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 23:53:25,902 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 23:53:25,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58718827] [2022-03-20 23:53:25,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 23:53:25,902 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-20 23:53:25,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-20 23:53:25,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-20 23:53:25,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-20 23:53:25,903 INFO L87 Difference]: Start difference. First operand 44 states and 68 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 23:53:25,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 23:53:25,953 INFO L93 Difference]: Finished difference Result 112 states and 180 transitions. [2022-03-20 23:53:25,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-20 23:53:25,954 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-03-20 23:53:25,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 23:53:25,955 INFO L225 Difference]: With dead ends: 112 [2022-03-20 23:53:25,955 INFO L226 Difference]: Without dead ends: 77 [2022-03-20 23:53:25,955 INFO L912 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-03-20 23:53:25,956 INFO L913 BasicCegarLoop]: 42 mSDtfsCounter, 78 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-20 23:53:25,956 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [78 Valid, 49 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-20 23:53:25,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-03-20 23:53:25,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2022-03-20 23:53:25,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 71 states have (on average 1.6056338028169015) internal successors, (114), 71 states have internal predecessors, (114), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 23:53:25,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 117 transitions. [2022-03-20 23:53:25,966 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 117 transitions. Word has length 17 [2022-03-20 23:53:25,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 23:53:25,966 INFO L478 AbstractCegarLoop]: Abstraction has 75 states and 117 transitions. [2022-03-20 23:53:25,967 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 23:53:25,967 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 117 transitions. [2022-03-20 23:53:25,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-20 23:53:25,967 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 23:53:25,967 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 23:53:25,967 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-03-20 23:53:25,968 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 23:53:25,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 23:53:25,968 INFO L85 PathProgramCache]: Analyzing trace with hash -1891779044, now seen corresponding path program 1 times [2022-03-20 23:53:25,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-20 23:53:25,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2030613360] [2022-03-20 23:53:25,969 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-20 23:53:25,969 INFO L85 PathProgramCache]: Analyzing trace with hash -1891779044, now seen corresponding path program 2 times [2022-03-20 23:53:25,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 23:53:25,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092295210] [2022-03-20 23:53:25,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 23:53:25,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 23:53:25,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 23:53:25,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 23:53:25,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 23:53:26,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 23:53:26,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 23:53:26,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092295210] [2022-03-20 23:53:26,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092295210] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 23:53:26,006 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 23:53:26,006 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 23:53:26,007 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-20 23:53:26,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2030613360] [2022-03-20 23:53:26,007 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2030613360] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 23:53:26,007 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 23:53:26,007 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 23:53:26,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133046452] [2022-03-20 23:53:26,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 23:53:26,008 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-20 23:53:26,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-20 23:53:26,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-20 23:53:26,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-20 23:53:26,008 INFO L87 Difference]: Start difference. First operand 75 states and 117 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 23:53:26,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 23:53:26,060 INFO L93 Difference]: Finished difference Result 95 states and 147 transitions. [2022-03-20 23:53:26,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-20 23:53:26,060 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-03-20 23:53:26,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 23:53:26,064 INFO L225 Difference]: With dead ends: 95 [2022-03-20 23:53:26,064 INFO L226 Difference]: Without dead ends: 93 [2022-03-20 23:53:26,064 INFO L912 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-03-20 23:53:26,070 INFO L913 BasicCegarLoop]: 61 mSDtfsCounter, 51 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-20 23:53:26,074 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 68 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-20 23:53:26,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-03-20 23:53:26,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 75. [2022-03-20 23:53:26,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 71 states have (on average 1.5774647887323943) internal successors, (112), 71 states have internal predecessors, (112), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 23:53:26,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 115 transitions. [2022-03-20 23:53:26,094 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 115 transitions. Word has length 17 [2022-03-20 23:53:26,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 23:53:26,094 INFO L478 AbstractCegarLoop]: Abstraction has 75 states and 115 transitions. [2022-03-20 23:53:26,094 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 23:53:26,094 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 115 transitions. [2022-03-20 23:53:26,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-20 23:53:26,095 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 23:53:26,095 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 23:53:26,095 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-03-20 23:53:26,095 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 23:53:26,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 23:53:26,096 INFO L85 PathProgramCache]: Analyzing trace with hash -2130301802, now seen corresponding path program 1 times [2022-03-20 23:53:26,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-20 23:53:26,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [677249294] [2022-03-20 23:53:26,096 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-20 23:53:26,096 INFO L85 PathProgramCache]: Analyzing trace with hash -2130301802, now seen corresponding path program 2 times [2022-03-20 23:53:26,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 23:53:26,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186689507] [2022-03-20 23:53:26,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 23:53:26,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 23:53:26,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 23:53:26,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 23:53:26,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 23:53:26,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 23:53:26,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 23:53:26,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186689507] [2022-03-20 23:53:26,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186689507] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 23:53:26,169 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 23:53:26,169 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 23:53:26,170 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-20 23:53:26,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [677249294] [2022-03-20 23:53:26,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [677249294] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 23:53:26,170 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 23:53:26,170 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 23:53:26,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090766742] [2022-03-20 23:53:26,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 23:53:26,171 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-20 23:53:26,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-20 23:53:26,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-20 23:53:26,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-20 23:53:26,171 INFO L87 Difference]: Start difference. First operand 75 states and 115 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 23:53:26,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 23:53:26,235 INFO L93 Difference]: Finished difference Result 131 states and 203 transitions. [2022-03-20 23:53:26,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-20 23:53:26,235 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-03-20 23:53:26,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 23:53:26,237 INFO L225 Difference]: With dead ends: 131 [2022-03-20 23:53:26,237 INFO L226 Difference]: Without dead ends: 129 [2022-03-20 23:53:26,237 INFO L912 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-03-20 23:53:26,239 INFO L913 BasicCegarLoop]: 39 mSDtfsCounter, 69 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-20 23:53:26,240 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 46 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-20 23:53:26,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-03-20 23:53:26,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 103. [2022-03-20 23:53:26,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 99 states have (on average 1.5555555555555556) internal successors, (154), 99 states have internal predecessors, (154), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 23:53:26,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 157 transitions. [2022-03-20 23:53:26,268 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 157 transitions. Word has length 18 [2022-03-20 23:53:26,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 23:53:26,268 INFO L478 AbstractCegarLoop]: Abstraction has 103 states and 157 transitions. [2022-03-20 23:53:26,268 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 23:53:26,269 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 157 transitions. [2022-03-20 23:53:26,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-20 23:53:26,273 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 23:53:26,274 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 23:53:26,274 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-03-20 23:53:26,274 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 23:53:26,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 23:53:26,274 INFO L85 PathProgramCache]: Analyzing trace with hash 1355318868, now seen corresponding path program 1 times [2022-03-20 23:53:26,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-20 23:53:26,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2019125001] [2022-03-20 23:53:26,275 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-20 23:53:26,275 INFO L85 PathProgramCache]: Analyzing trace with hash 1355318868, now seen corresponding path program 2 times [2022-03-20 23:53:26,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 23:53:26,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392384394] [2022-03-20 23:53:26,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 23:53:26,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 23:53:26,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 23:53:26,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 23:53:26,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 23:53:26,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 23:53:26,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 23:53:26,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392384394] [2022-03-20 23:53:26,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392384394] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 23:53:26,319 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 23:53:26,319 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 23:53:26,319 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-20 23:53:26,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2019125001] [2022-03-20 23:53:26,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2019125001] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 23:53:26,320 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 23:53:26,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 23:53:26,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742044764] [2022-03-20 23:53:26,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 23:53:26,325 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-20 23:53:26,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-20 23:53:26,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-20 23:53:26,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-20 23:53:26,327 INFO L87 Difference]: Start difference. First operand 103 states and 157 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 23:53:26,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 23:53:26,382 INFO L93 Difference]: Finished difference Result 231 states and 355 transitions. [2022-03-20 23:53:26,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-20 23:53:26,383 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-03-20 23:53:26,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 23:53:26,384 INFO L225 Difference]: With dead ends: 231 [2022-03-20 23:53:26,384 INFO L226 Difference]: Without dead ends: 137 [2022-03-20 23:53:26,385 INFO L912 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-03-20 23:53:26,385 INFO L913 BasicCegarLoop]: 52 mSDtfsCounter, 61 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-20 23:53:26,385 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 59 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-20 23:53:26,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2022-03-20 23:53:26,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 135. [2022-03-20 23:53:26,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 131 states have (on average 1.4961832061068703) internal successors, (196), 131 states have internal predecessors, (196), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 23:53:26,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 199 transitions. [2022-03-20 23:53:26,405 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 199 transitions. Word has length 18 [2022-03-20 23:53:26,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 23:53:26,406 INFO L478 AbstractCegarLoop]: Abstraction has 135 states and 199 transitions. [2022-03-20 23:53:26,406 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 23:53:26,406 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 199 transitions. [2022-03-20 23:53:26,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-20 23:53:26,407 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 23:53:26,407 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 23:53:26,407 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-03-20 23:53:26,407 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 23:53:26,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 23:53:26,407 INFO L85 PathProgramCache]: Analyzing trace with hash -1614630737, now seen corresponding path program 1 times [2022-03-20 23:53:26,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-20 23:53:26,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1631218122] [2022-03-20 23:53:26,409 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-20 23:53:26,409 INFO L85 PathProgramCache]: Analyzing trace with hash -1614630737, now seen corresponding path program 2 times [2022-03-20 23:53:26,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 23:53:26,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273162826] [2022-03-20 23:53:26,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 23:53:26,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 23:53:26,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 23:53:26,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 23:53:26,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 23:53:26,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 23:53:26,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 23:53:26,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273162826] [2022-03-20 23:53:26,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273162826] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 23:53:26,462 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 23:53:26,462 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 23:53:26,462 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-20 23:53:26,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1631218122] [2022-03-20 23:53:26,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1631218122] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 23:53:26,462 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 23:53:26,462 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 23:53:26,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606773206] [2022-03-20 23:53:26,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 23:53:26,463 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-20 23:53:26,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-20 23:53:26,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-20 23:53:26,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-20 23:53:26,463 INFO L87 Difference]: Start difference. First operand 135 states and 199 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 23:53:26,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 23:53:26,514 INFO L93 Difference]: Finished difference Result 205 states and 301 transitions. [2022-03-20 23:53:26,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-20 23:53:26,514 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-03-20 23:53:26,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 23:53:26,515 INFO L225 Difference]: With dead ends: 205 [2022-03-20 23:53:26,515 INFO L226 Difference]: Without dead ends: 143 [2022-03-20 23:53:26,516 INFO L912 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-03-20 23:53:26,516 INFO L913 BasicCegarLoop]: 50 mSDtfsCounter, 64 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-20 23:53:26,517 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 57 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-20 23:53:26,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2022-03-20 23:53:26,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 141. [2022-03-20 23:53:26,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 137 states have (on average 1.4598540145985401) internal successors, (200), 137 states have internal predecessors, (200), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 23:53:26,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 203 transitions. [2022-03-20 23:53:26,529 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 203 transitions. Word has length 19 [2022-03-20 23:53:26,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 23:53:26,530 INFO L478 AbstractCegarLoop]: Abstraction has 141 states and 203 transitions. [2022-03-20 23:53:26,530 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 23:53:26,530 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 203 transitions. [2022-03-20 23:53:26,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-20 23:53:26,530 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 23:53:26,531 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 23:53:26,531 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-03-20 23:53:26,531 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 23:53:26,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 23:53:26,531 INFO L85 PathProgramCache]: Analyzing trace with hash -934572367, now seen corresponding path program 1 times [2022-03-20 23:53:26,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-20 23:53:26,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1767936325] [2022-03-20 23:53:26,532 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-20 23:53:26,532 INFO L85 PathProgramCache]: Analyzing trace with hash -934572367, now seen corresponding path program 2 times [2022-03-20 23:53:26,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 23:53:26,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829755009] [2022-03-20 23:53:26,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 23:53:26,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 23:53:26,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 23:53:26,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 23:53:26,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 23:53:26,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 23:53:26,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 23:53:26,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829755009] [2022-03-20 23:53:26,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829755009] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 23:53:26,568 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 23:53:26,568 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 23:53:26,568 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-20 23:53:26,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1767936325] [2022-03-20 23:53:26,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1767936325] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 23:53:26,569 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 23:53:26,569 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 23:53:26,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769784120] [2022-03-20 23:53:26,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 23:53:26,569 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-20 23:53:26,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-20 23:53:26,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-20 23:53:26,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-20 23:53:26,570 INFO L87 Difference]: Start difference. First operand 141 states and 203 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 23:53:26,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 23:53:26,626 INFO L93 Difference]: Finished difference Result 237 states and 341 transitions. [2022-03-20 23:53:26,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-20 23:53:26,626 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-03-20 23:53:26,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 23:53:26,628 INFO L225 Difference]: With dead ends: 237 [2022-03-20 23:53:26,628 INFO L226 Difference]: Without dead ends: 235 [2022-03-20 23:53:26,628 INFO L912 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-03-20 23:53:26,629 INFO L913 BasicCegarLoop]: 38 mSDtfsCounter, 62 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-20 23:53:26,630 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [62 Valid, 45 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-20 23:53:26,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2022-03-20 23:53:26,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 201. [2022-03-20 23:53:26,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 197 states have (on average 1.4213197969543148) internal successors, (280), 197 states have internal predecessors, (280), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 23:53:26,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 283 transitions. [2022-03-20 23:53:26,656 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 283 transitions. Word has length 19 [2022-03-20 23:53:26,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 23:53:26,656 INFO L478 AbstractCegarLoop]: Abstraction has 201 states and 283 transitions. [2022-03-20 23:53:26,656 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 23:53:26,657 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 283 transitions. [2022-03-20 23:53:26,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-20 23:53:26,657 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 23:53:26,657 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 23:53:26,657 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-03-20 23:53:26,657 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 23:53:26,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 23:53:26,658 INFO L85 PathProgramCache]: Analyzing trace with hash -1743918993, now seen corresponding path program 1 times [2022-03-20 23:53:26,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-20 23:53:26,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1074380026] [2022-03-20 23:53:26,658 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-20 23:53:26,658 INFO L85 PathProgramCache]: Analyzing trace with hash -1743918993, now seen corresponding path program 2 times [2022-03-20 23:53:26,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 23:53:26,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133579487] [2022-03-20 23:53:26,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 23:53:26,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 23:53:26,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 23:53:26,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 23:53:26,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 23:53:26,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 23:53:26,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 23:53:26,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133579487] [2022-03-20 23:53:26,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133579487] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 23:53:26,696 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 23:53:26,696 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 23:53:26,696 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-20 23:53:26,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1074380026] [2022-03-20 23:53:26,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1074380026] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 23:53:26,696 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 23:53:26,696 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 23:53:26,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247609952] [2022-03-20 23:53:26,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 23:53:26,697 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-20 23:53:26,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-20 23:53:26,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-20 23:53:26,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-20 23:53:26,697 INFO L87 Difference]: Start difference. First operand 201 states and 283 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 23:53:26,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 23:53:26,753 INFO L93 Difference]: Finished difference Result 445 states and 621 transitions. [2022-03-20 23:53:26,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-20 23:53:26,753 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-03-20 23:53:26,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 23:53:26,754 INFO L225 Difference]: With dead ends: 445 [2022-03-20 23:53:26,754 INFO L226 Difference]: Without dead ends: 259 [2022-03-20 23:53:26,758 INFO L912 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-03-20 23:53:26,758 INFO L913 BasicCegarLoop]: 54 mSDtfsCounter, 55 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-20 23:53:26,759 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [55 Valid, 61 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-20 23:53:26,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2022-03-20 23:53:26,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 257. [2022-03-20 23:53:26,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 253 states have (on average 1.3438735177865613) internal successors, (340), 253 states have internal predecessors, (340), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 23:53:26,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 343 transitions. [2022-03-20 23:53:26,779 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 343 transitions. Word has length 19 [2022-03-20 23:53:26,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 23:53:26,780 INFO L478 AbstractCegarLoop]: Abstraction has 257 states and 343 transitions. [2022-03-20 23:53:26,780 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 23:53:26,780 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 343 transitions. [2022-03-20 23:53:26,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-20 23:53:26,780 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 23:53:26,780 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 23:53:26,781 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-03-20 23:53:26,781 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 23:53:26,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 23:53:26,781 INFO L85 PathProgramCache]: Analyzing trace with hash 1093243721, now seen corresponding path program 1 times [2022-03-20 23:53:26,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-20 23:53:26,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1435624276] [2022-03-20 23:53:26,782 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-20 23:53:26,782 INFO L85 PathProgramCache]: Analyzing trace with hash 1093243721, now seen corresponding path program 2 times [2022-03-20 23:53:26,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 23:53:26,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135143436] [2022-03-20 23:53:26,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 23:53:26,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 23:53:26,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 23:53:26,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 23:53:26,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 23:53:26,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 23:53:26,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 23:53:26,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135143436] [2022-03-20 23:53:26,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135143436] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 23:53:26,827 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 23:53:26,828 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 23:53:26,828 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-20 23:53:26,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1435624276] [2022-03-20 23:53:26,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1435624276] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 23:53:26,828 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 23:53:26,828 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 23:53:26,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992260504] [2022-03-20 23:53:26,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 23:53:26,828 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-20 23:53:26,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-20 23:53:26,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-20 23:53:26,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-20 23:53:26,829 INFO L87 Difference]: Start difference. First operand 257 states and 343 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 23:53:26,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 23:53:26,886 INFO L93 Difference]: Finished difference Result 385 states and 509 transitions. [2022-03-20 23:53:26,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-20 23:53:26,887 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-03-20 23:53:26,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 23:53:26,888 INFO L225 Difference]: With dead ends: 385 [2022-03-20 23:53:26,888 INFO L226 Difference]: Without dead ends: 267 [2022-03-20 23:53:26,888 INFO L912 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-03-20 23:53:26,888 INFO L913 BasicCegarLoop]: 47 mSDtfsCounter, 63 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-20 23:53:26,889 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 54 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-20 23:53:26,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2022-03-20 23:53:26,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 265. [2022-03-20 23:53:26,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 261 states have (on average 1.3026819923371646) internal successors, (340), 261 states have internal predecessors, (340), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 23:53:26,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 343 transitions. [2022-03-20 23:53:26,908 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 343 transitions. Word has length 20 [2022-03-20 23:53:26,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 23:53:26,908 INFO L478 AbstractCegarLoop]: Abstraction has 265 states and 343 transitions. [2022-03-20 23:53:26,908 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 23:53:26,909 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 343 transitions. [2022-03-20 23:53:26,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-20 23:53:26,909 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 23:53:26,909 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 23:53:26,909 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-03-20 23:53:26,909 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 23:53:26,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 23:53:26,910 INFO L85 PathProgramCache]: Analyzing trace with hash 1773302091, now seen corresponding path program 1 times [2022-03-20 23:53:26,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-20 23:53:26,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [803646212] [2022-03-20 23:53:26,910 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-20 23:53:26,910 INFO L85 PathProgramCache]: Analyzing trace with hash 1773302091, now seen corresponding path program 2 times [2022-03-20 23:53:26,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 23:53:26,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603586730] [2022-03-20 23:53:26,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 23:53:26,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 23:53:26,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 23:53:26,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 23:53:26,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 23:53:26,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 23:53:26,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 23:53:26,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603586730] [2022-03-20 23:53:26,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603586730] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 23:53:26,935 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 23:53:26,935 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 23:53:26,935 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-20 23:53:26,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [803646212] [2022-03-20 23:53:26,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [803646212] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 23:53:26,936 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 23:53:26,936 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 23:53:26,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984364355] [2022-03-20 23:53:26,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 23:53:26,936 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-20 23:53:26,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-20 23:53:26,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-20 23:53:26,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-20 23:53:26,936 INFO L87 Difference]: Start difference. First operand 265 states and 343 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 23:53:26,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 23:53:26,990 INFO L93 Difference]: Finished difference Result 427 states and 544 transitions. [2022-03-20 23:53:26,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-20 23:53:26,991 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-03-20 23:53:26,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 23:53:26,992 INFO L225 Difference]: With dead ends: 427 [2022-03-20 23:53:26,992 INFO L226 Difference]: Without dead ends: 425 [2022-03-20 23:53:26,992 INFO L912 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-03-20 23:53:26,993 INFO L913 BasicCegarLoop]: 36 mSDtfsCounter, 54 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-20 23:53:26,993 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 43 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-20 23:53:26,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2022-03-20 23:53:27,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 393. [2022-03-20 23:53:27,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 389 states have (on average 1.2647814910025708) internal successors, (492), 389 states have internal predecessors, (492), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 23:53:27,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 495 transitions. [2022-03-20 23:53:27,016 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 495 transitions. Word has length 20 [2022-03-20 23:53:27,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 23:53:27,016 INFO L478 AbstractCegarLoop]: Abstraction has 393 states and 495 transitions. [2022-03-20 23:53:27,016 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 23:53:27,016 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 495 transitions. [2022-03-20 23:53:27,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-20 23:53:27,017 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 23:53:27,017 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 23:53:27,017 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-03-20 23:53:27,017 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 23:53:27,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 23:53:27,018 INFO L85 PathProgramCache]: Analyzing trace with hash 963955465, now seen corresponding path program 1 times [2022-03-20 23:53:27,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-20 23:53:27,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1184833833] [2022-03-20 23:53:27,018 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-20 23:53:27,018 INFO L85 PathProgramCache]: Analyzing trace with hash 963955465, now seen corresponding path program 2 times [2022-03-20 23:53:27,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 23:53:27,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322769549] [2022-03-20 23:53:27,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 23:53:27,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 23:53:27,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 23:53:27,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 23:53:27,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 23:53:27,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 23:53:27,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 23:53:27,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322769549] [2022-03-20 23:53:27,041 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322769549] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 23:53:27,041 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 23:53:27,041 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 23:53:27,041 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-20 23:53:27,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1184833833] [2022-03-20 23:53:27,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1184833833] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 23:53:27,042 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 23:53:27,042 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 23:53:27,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477699923] [2022-03-20 23:53:27,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 23:53:27,042 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-20 23:53:27,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-20 23:53:27,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-20 23:53:27,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-20 23:53:27,043 INFO L87 Difference]: Start difference. First operand 393 states and 495 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 23:53:27,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 23:53:27,119 INFO L93 Difference]: Finished difference Result 857 states and 1055 transitions. [2022-03-20 23:53:27,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-20 23:53:27,120 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-03-20 23:53:27,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 23:53:27,120 INFO L225 Difference]: With dead ends: 857 [2022-03-20 23:53:27,120 INFO L226 Difference]: Without dead ends: 0 [2022-03-20 23:53:27,121 INFO L912 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-03-20 23:53:27,122 INFO L913 BasicCegarLoop]: 55 mSDtfsCounter, 46 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-20 23:53:27,122 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 62 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-20 23:53:27,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-03-20 23:53:27,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-03-20 23:53:27,123 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-03-20 23:53:27,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-03-20 23:53:27,123 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 20 [2022-03-20 23:53:27,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 23:53:27,123 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-03-20 23:53:27,123 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 23:53:27,123 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-03-20 23:53:27,123 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-03-20 23:53:27,125 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-03-20 23:53:27,125 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-03-20 23:53:27,127 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-03-20 23:53:29,920 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2022-03-20 23:53:29,920 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2022-03-20 23:53:29,920 INFO L882 garLoopResultBuilder]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2022-03-20 23:53:29,920 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-03-20 23:53:29,920 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-03-20 23:53:29,920 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-03-20 23:53:29,920 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-03-20 23:53:29,920 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-03-20 23:53:29,920 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-03-20 23:53:29,920 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-03-20 23:53:29,921 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 6 95) the Hoare annotation is: true [2022-03-20 23:53:29,921 INFO L885 garLoopResultBuilder]: At program point L85-1(lines 26 90) the Hoare annotation is: true [2022-03-20 23:53:29,921 INFO L878 garLoopResultBuilder]: At program point L81(line 81) the Hoare annotation is: (let ((.cse0 (not (= main_~p4~0 0))) (.cse1 (= main_~lk4~0 1))) (or (and .cse0 .cse1 (= main_~p5~0 0)) (and (= main_~lk5~0 1) .cse0 .cse1))) [2022-03-20 23:53:29,921 INFO L878 garLoopResultBuilder]: At program point L65-1(lines 26 90) the Hoare annotation is: (let ((.cse4 (= main_~p4~0 0)) (.cse0 (= main_~lk5~0 1)) (.cse6 (= main_~p3~0 0)) (.cse5 (= main_~lk2~0 1)) (.cse1 (= main_~lk4~0 1)) (.cse2 (= main_~lk3~0 1)) (.cse7 (= main_~p5~0 0)) (.cse3 (= main_~p2~0 0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse0 .cse2 .cse3) (and .cse4 .cse0 .cse2 .cse5) (and .cse0 .cse1 .cse3 .cse6) (and .cse4 .cse7 .cse3 .cse6) (and .cse4 .cse2 .cse7 .cse3) (and .cse1 .cse2 .cse7 .cse5) (and .cse4 .cse2 .cse7 .cse5) (and .cse4 .cse7 .cse6 .cse5) (and .cse1 .cse7 .cse3 .cse6) (and .cse0 .cse1 .cse6 .cse5) (and .cse0 .cse1 .cse2 .cse5) (and .cse1 .cse7 .cse6 .cse5) (and .cse4 .cse0 .cse3 .cse6) (and .cse4 .cse0 .cse6 .cse5) (and .cse1 .cse2 .cse7 .cse3))) [2022-03-20 23:53:29,921 INFO L885 garLoopResultBuilder]: At program point L28(lines 28 30) the Hoare annotation is: true [2022-03-20 23:53:29,921 INFO L878 garLoopResultBuilder]: At program point L86(line 86) the Hoare annotation is: (= main_~lk5~0 1) [2022-03-20 23:53:29,921 INFO L878 garLoopResultBuilder]: At program point L86-1(lines 7 95) the Hoare annotation is: false [2022-03-20 23:53:29,921 INFO L878 garLoopResultBuilder]: At program point L70-1(lines 26 90) the Hoare annotation is: (let ((.cse5 (= main_~p3~0 0)) (.cse3 (= main_~p4~0 0)) (.cse2 (= main_~p5~0 0)) (.cse4 (= main_~lk5~0 1)) (.cse0 (= main_~lk4~0 1)) (.cse1 (= main_~lk3~0 1))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse5) (and .cse4 .cse0 .cse5) (and .cse3 .cse2 .cse5) (and .cse0 .cse2 .cse5) (and .cse3 .cse4 .cse1) (and .cse3 .cse1 .cse2) (and .cse4 .cse0 .cse1))) [2022-03-20 23:53:29,921 INFO L878 garLoopResultBuilder]: At program point L66(line 66) the Hoare annotation is: (let ((.cse6 (= main_~p4~0 0)) (.cse7 (= main_~lk5~0 1)) (.cse4 (= main_~p2~0 0)) (.cse5 (= main_~p3~0 0)) (.cse0 (not (= main_~p1~0 0))) (.cse1 (= main_~lk1~0 1)) (.cse2 (= main_~lk4~0 1)) (.cse9 (= main_~lk3~0 1)) (.cse3 (= main_~p5~0 0)) (.cse8 (= main_~lk2~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse7 .cse0 .cse1 .cse5 .cse8) (and .cse6 .cse0 .cse1 .cse9 .cse3 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse8) (and .cse7 .cse0 .cse1 .cse2 .cse4 .cse5) (and .cse6 .cse7 .cse0 .cse1 .cse9 .cse8) (and .cse6 .cse7 .cse0 .cse1 .cse9 .cse4) (and .cse6 .cse0 .cse1 .cse3 .cse4 .cse5) (and .cse6 .cse0 .cse1 .cse9 .cse3 .cse4) (and .cse7 .cse0 .cse1 .cse2 .cse9 .cse8) (and .cse7 .cse0 .cse1 .cse2 .cse5 .cse8) (and .cse0 .cse1 .cse2 .cse9 .cse3 .cse4) (and .cse7 .cse0 .cse1 .cse2 .cse9 .cse4) (and .cse6 .cse0 .cse1 .cse3 .cse5 .cse8) (and .cse6 .cse7 .cse0 .cse1 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse9 .cse3 .cse8))) [2022-03-20 23:53:29,921 INFO L885 garLoopResultBuilder]: At program point L91(lines 7 95) the Hoare annotation is: true [2022-03-20 23:53:29,921 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 6 95) the Hoare annotation is: true [2022-03-20 23:53:29,921 INFO L878 garLoopResultBuilder]: At program point L75-1(lines 26 90) the Hoare annotation is: (let ((.cse1 (= main_~p5~0 0)) (.cse2 (= main_~lk4~0 1)) (.cse0 (= main_~p4~0 0)) (.cse3 (= main_~lk5~0 1))) (or (and .cse0 .cse1) (and .cse2 .cse1) (and .cse3 .cse2) (and .cse0 .cse3))) [2022-03-20 23:53:29,922 INFO L878 garLoopResultBuilder]: At program point L71(line 71) the Hoare annotation is: (let ((.cse2 (= main_~lk3~0 1)) (.cse4 (= main_~lk4~0 1)) (.cse5 (= main_~p5~0 0)) (.cse0 (= main_~p4~0 0)) (.cse1 (= main_~lk5~0 1)) (.cse6 (= main_~p3~0 0)) (.cse3 (= main_~lk2~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse2 .cse5 .cse3) (and .cse0 .cse2 .cse5 .cse3) (and .cse0 .cse5 .cse6 .cse3) (and .cse1 .cse4 .cse6 .cse3) (and .cse1 .cse4 .cse2 .cse3) (and .cse4 .cse5 .cse6 .cse3) (and .cse0 .cse1 .cse6 .cse3))) [2022-03-20 23:53:29,922 INFO L878 garLoopResultBuilder]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 93) the Hoare annotation is: false [2022-03-20 23:53:29,922 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 6 95) the Hoare annotation is: true [2022-03-20 23:53:29,922 INFO L878 garLoopResultBuilder]: At program point L59-1(lines 26 90) the Hoare annotation is: (let ((.cse9 (= main_~lk2~0 1)) (.cse4 (= main_~p3~0 0)) (.cse5 (= main_~p4~0 0)) (.cse0 (= main_~lk5~0 1)) (.cse1 (= main_~lk1~0 1)) (.cse2 (= main_~lk4~0 1)) (.cse6 (= main_~lk3~0 1)) (.cse8 (= main_~p1~0 0)) (.cse7 (= main_~p5~0 0)) (.cse3 (= main_~p2~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse1 .cse6 .cse7 .cse3) (and .cse1 .cse2 .cse7 .cse3 .cse4) (and .cse2 .cse8 .cse7 .cse4 .cse9) (and .cse0 .cse2 .cse8 .cse3 .cse4) (and .cse5 .cse0 .cse8 .cse4 .cse9) (and .cse0 .cse2 .cse6 .cse8 .cse9) (and .cse5 .cse1 .cse7 .cse3 .cse4) (and .cse5 .cse6 .cse8 .cse7 .cse9) (and .cse0 .cse1 .cse2 .cse6 .cse3) (and .cse5 .cse0 .cse6 .cse8 .cse3) (and .cse0 .cse1 .cse2 .cse4 .cse9) (and .cse0 .cse1 .cse2 .cse6 .cse9) (and .cse5 .cse0 .cse1 .cse6 .cse9) (and .cse1 .cse2 .cse6 .cse7 .cse9) (and .cse1 .cse2 .cse7 .cse4 .cse9) (and .cse5 .cse0 .cse6 .cse8 .cse9) (and .cse0 .cse2 .cse6 .cse8 .cse3) (and .cse5 .cse0 .cse8 .cse3 .cse4) (and .cse5 .cse1 .cse7 .cse4 .cse9) (and .cse5 .cse8 .cse7 .cse3 .cse4) (and .cse2 .cse6 .cse8 .cse7 .cse9) (and .cse5 .cse0 .cse1 .cse4 .cse9) (and .cse2 .cse8 .cse7 .cse3 .cse4) (and .cse5 .cse1 .cse6 .cse7 .cse9) (and .cse1 .cse2 .cse6 .cse7 .cse3) (and .cse0 .cse2 .cse8 .cse4 .cse9) (and .cse5 .cse8 .cse7 .cse4 .cse9) (and .cse5 .cse6 .cse8 .cse7 .cse3) (and .cse5 .cse0 .cse1 .cse3 .cse4) (and .cse5 .cse0 .cse1 .cse6 .cse3) (and .cse2 .cse6 .cse8 .cse7 .cse3))) [2022-03-20 23:53:29,922 INFO L878 garLoopResultBuilder]: At program point L55-1(lines 26 90) the Hoare annotation is: (let ((.cse5 (= main_~lk1~0 1)) (.cse0 (= main_~lk4~0 1)) (.cse1 (= main_~lk3~0 1)) (.cse3 (= main_~p2~0 0)) (.cse4 (= main_~p4~0 0)) (.cse2 (= main_~p1~0 0)) (.cse6 (= main_~p3~0 0)) (.cse7 (= main_~lk2~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse1 .cse3) (and .cse5 .cse0 .cse6 .cse7) (and .cse4 .cse2 .cse3 .cse6) (and .cse4 .cse1 .cse2 .cse3) (and .cse0 .cse2 .cse3 .cse6) (and .cse5 .cse0 .cse3 .cse6) (and .cse4 .cse5 .cse6 .cse7) (and .cse5 .cse0 .cse1 .cse7) (and .cse4 .cse1 .cse2 .cse7) (and .cse0 .cse1 .cse2 .cse7) (and .cse4 .cse5 .cse3 .cse6) (and .cse0 .cse2 .cse6 .cse7) (and .cse4 .cse5 .cse1 .cse7) (and .cse5 .cse0 .cse1 .cse3) (and .cse4 .cse2 .cse6 .cse7))) [2022-03-20 23:53:29,922 INFO L878 garLoopResultBuilder]: At program point L51-1(lines 26 90) the Hoare annotation is: (let ((.cse4 (= main_~p1~0 0)) (.cse2 (= main_~p3~0 0)) (.cse5 (= main_~lk2~0 1)) (.cse0 (= main_~lk1~0 1)) (.cse3 (= main_~lk3~0 1)) (.cse1 (= main_~p2~0 0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse5) (and .cse4 .cse1 .cse2) (and .cse0 .cse3 .cse5) (and .cse3 .cse4 .cse1) (and .cse0 .cse2 .cse5) (and .cse4 .cse2 .cse5) (and .cse0 .cse3 .cse1))) [2022-03-20 23:53:29,922 INFO L878 garLoopResultBuilder]: At program point L80-1(lines 26 90) the Hoare annotation is: (or (= main_~lk5~0 1) (= main_~p5~0 0)) [2022-03-20 23:53:29,922 INFO L878 garLoopResultBuilder]: At program point L47-1(lines 26 90) the Hoare annotation is: (let ((.cse0 (= main_~lk1~0 1)) (.cse3 (= main_~p2~0 0)) (.cse2 (= main_~p1~0 0)) (.cse1 (= main_~lk2~0 1))) (or (and .cse0 .cse1) (and .cse2 .cse3) (and .cse0 .cse3) (and .cse2 .cse1))) [2022-03-20 23:53:29,922 INFO L878 garLoopResultBuilder]: At program point L76(line 76) the Hoare annotation is: (let ((.cse1 (= main_~p4~0 0)) (.cse2 (= main_~lk5~0 1)) (.cse0 (not (= main_~p3~0 0))) (.cse5 (= main_~lk4~0 1)) (.cse3 (= main_~lk3~0 1)) (.cse4 (= main_~p5~0 0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse3 .cse4) (and .cse0 .cse2 .cse5 .cse3) (and .cse0 .cse5 .cse3 .cse4))) [2022-03-20 23:53:29,922 INFO L885 garLoopResultBuilder]: At program point L43(lines 43 45) the Hoare annotation is: true [2022-03-20 23:53:29,923 INFO L878 garLoopResultBuilder]: At program point L43-2(lines 26 90) the Hoare annotation is: (or (= main_~lk1~0 1) (= main_~p1~0 0)) [2022-03-20 23:53:29,925 INFO L719 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2] [2022-03-20 23:53:29,925 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-20 23:53:29,932 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.03 11:53:29 BoogieIcfgContainer [2022-03-20 23:53:29,932 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-20 23:53:29,933 INFO L158 Benchmark]: Toolchain (without parser) took 5408.69ms. Allocated memory was 167.8MB in the beginning and 272.6MB in the end (delta: 104.9MB). Free memory was 118.9MB in the beginning and 147.3MB in the end (delta: -28.5MB). Peak memory consumption was 132.1MB. Max. memory is 8.0GB. [2022-03-20 23:53:29,933 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 167.8MB. Free memory is still 135.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-20 23:53:29,933 INFO L158 Benchmark]: CACSL2BoogieTranslator took 215.02ms. Allocated memory is still 167.8MB. Free memory was 118.6MB in the beginning and 143.5MB in the end (delta: -24.8MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-03-20 23:53:29,933 INFO L158 Benchmark]: Boogie Preprocessor took 36.94ms. Allocated memory is still 167.8MB. Free memory was 143.5MB in the beginning and 142.1MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-20 23:53:29,933 INFO L158 Benchmark]: RCFGBuilder took 322.88ms. Allocated memory is still 167.8MB. Free memory was 141.8MB in the beginning and 131.6MB in the end (delta: 10.2MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-03-20 23:53:29,933 INFO L158 Benchmark]: TraceAbstraction took 4828.86ms. Allocated memory was 167.8MB in the beginning and 272.6MB in the end (delta: 104.9MB). Free memory was 131.0MB in the beginning and 147.3MB in the end (delta: -16.3MB). Peak memory consumption was 144.9MB. Max. memory is 8.0GB. [2022-03-20 23:53:29,934 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.12ms. Allocated memory is still 167.8MB. Free memory is still 135.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 215.02ms. Allocated memory is still 167.8MB. Free memory was 118.6MB in the beginning and 143.5MB in the end (delta: -24.8MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 36.94ms. Allocated memory is still 167.8MB. Free memory was 143.5MB in the beginning and 142.1MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 322.88ms. Allocated memory is still 167.8MB. Free memory was 141.8MB in the beginning and 131.6MB in the end (delta: 10.2MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 4828.86ms. Allocated memory was 167.8MB in the beginning and 272.6MB in the end (delta: 104.9MB). Free memory was 131.0MB in the beginning and 147.3MB in the end (delta: -16.3MB). Peak memory consumption was 144.9MB. 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: 93]: 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 4 procedures, 33 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.8s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.8s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 831 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 831 mSDsluCounter, 721 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 93 mSDsCounter, 31 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 429 IncrementalHoareTripleChecker+Invalid, 460 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 31 mSolverCounterUnsat, 628 mSDtfsCounter, 429 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 91 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=393occurred in iteration=12, InterpolantAutomatonStates: 52, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 13 MinimizatonAttempts, 136 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 30 LocationsWithAnnotation, 30 PreInvPairs, 519 NumberOfFragments, 1696 HoareAnnotationTreeSize, 30 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.7s HoareSimplificationTime, 30 FomulaSimplificationsInter, 9655 FormulaSimplificationTreeSizeReductionInter, 2.1s 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: 7]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: 1 - ProcedureContractResult [Line: 6]: Procedure Contract for main Derived contract for procedure main: 1 RESULT: Ultimate proved your program to be correct! [2022-03-20 23:53:29,956 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...