/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/locks/test_locks_5.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-d966a43 [2022-01-31 22:22:26,485 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-31 22:22:26,486 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-31 22:22:26,514 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-31 22:22:26,515 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-31 22:22:26,517 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-31 22:22:26,520 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-31 22:22:26,532 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-31 22:22:26,533 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-31 22:22:26,537 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-31 22:22:26,537 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-31 22:22:26,538 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-31 22:22:26,539 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-31 22:22:26,540 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-31 22:22:26,546 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-31 22:22:26,547 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-31 22:22:26,548 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-31 22:22:26,548 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-31 22:22:26,551 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-31 22:22:26,555 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-31 22:22:26,556 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-31 22:22:26,556 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-31 22:22:26,559 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-31 22:22:26,559 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-31 22:22:26,563 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-31 22:22:26,564 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-31 22:22:26,564 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-31 22:22:26,565 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-31 22:22:26,565 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-31 22:22:26,566 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-31 22:22:26,566 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-31 22:22:26,566 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-31 22:22:26,567 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-31 22:22:26,568 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-31 22:22:26,569 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-31 22:22:26,569 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-31 22:22:26,569 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-31 22:22:26,569 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-31 22:22:26,569 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-31 22:22:26,570 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-31 22:22:26,570 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-31 22:22:26,571 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-01-31 22:22:26,580 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-31 22:22:26,581 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-31 22:22:26,582 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-31 22:22:26,582 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-31 22:22:26,582 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-31 22:22:26,582 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-31 22:22:26,582 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-31 22:22:26,582 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-31 22:22:26,582 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-31 22:22:26,582 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-31 22:22:26,583 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-31 22:22:26,583 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-31 22:22:26,583 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-31 22:22:26,583 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-31 22:22:26,583 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-31 22:22:26,583 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-31 22:22:26,584 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-31 22:22:26,584 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-31 22:22:26,584 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 22:22:26,584 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-31 22:22:26,584 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2022-01-31 22:22:26,584 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-31 22:22:26,584 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-01-31 22:22:26,584 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-31 22:22:26,746 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-31 22:22:26,763 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-31 22:22:26,765 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-31 22:22:26,765 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-31 22:22:26,766 INFO L275 PluginConnector]: CDTParser initialized [2022-01-31 22:22:26,766 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-01-31 22:22:26,822 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d7d8c9a98/7141ec47eecf44b5b86ce3759ff67d9c/FLAG4e7ff7170 [2022-01-31 22:22:27,243 INFO L306 CDTParser]: Found 1 translation units. [2022-01-31 22:22:27,244 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_5.c [2022-01-31 22:22:27,251 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d7d8c9a98/7141ec47eecf44b5b86ce3759ff67d9c/FLAG4e7ff7170 [2022-01-31 22:22:27,264 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d7d8c9a98/7141ec47eecf44b5b86ce3759ff67d9c [2022-01-31 22:22:27,266 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-31 22:22:27,267 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-01-31 22:22:27,270 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-31 22:22:27,270 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-31 22:22:27,273 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-31 22:22:27,273 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 10:22:27" (1/1) ... [2022-01-31 22:22:27,274 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1751167a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 10:22:27, skipping insertion in model container [2022-01-31 22:22:27,274 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 10:22:27" (1/1) ... [2022-01-31 22:22:27,278 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-31 22:22:27,291 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-31 22:22:27,422 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-01-31 22:22:27,426 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 22:22:27,430 INFO L203 MainTranslator]: Completed pre-run [2022-01-31 22:22:27,445 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-01-31 22:22:27,450 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 22:22:27,458 INFO L208 MainTranslator]: Completed translation [2022-01-31 22:22:27,459 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 10:22:27 WrapperNode [2022-01-31 22:22:27,459 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-31 22:22:27,459 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-31 22:22:27,459 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-31 22:22:27,459 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-31 22:22:27,467 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 10:22:27" (1/1) ... [2022-01-31 22:22:27,467 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 10:22:27" (1/1) ... [2022-01-31 22:22:27,471 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 10:22:27" (1/1) ... [2022-01-31 22:22:27,471 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 10:22:27" (1/1) ... [2022-01-31 22:22:27,474 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 10:22:27" (1/1) ... [2022-01-31 22:22:27,477 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 10:22:27" (1/1) ... [2022-01-31 22:22:27,477 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 10:22:27" (1/1) ... [2022-01-31 22:22:27,482 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-31 22:22:27,483 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-31 22:22:27,483 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-31 22:22:27,483 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-31 22:22:27,484 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 10:22:27" (1/1) ... [2022-01-31 22:22:27,494 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 22:22:27,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 22:22:27,509 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-31 22:22:27,515 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-31 22:22:27,532 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-01-31 22:22:27,532 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-31 22:22:27,532 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-01-31 22:22:27,532 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-01-31 22:22:27,532 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-01-31 22:22:27,532 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-01-31 22:22:27,532 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-01-31 22:22:27,532 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-31 22:22:27,533 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-01-31 22:22:27,533 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-01-31 22:22:27,533 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-01-31 22:22:27,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-31 22:22:27,535 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-31 22:22:27,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-31 22:22:27,535 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-31 22:22:27,536 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-31 22:22:27,589 INFO L234 CfgBuilder]: Building ICFG [2022-01-31 22:22:27,590 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-31 22:22:27,699 INFO L275 CfgBuilder]: Performing block encoding [2022-01-31 22:22:27,703 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-31 22:22:27,703 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-01-31 22:22:27,704 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 10:22:27 BoogieIcfgContainer [2022-01-31 22:22:27,704 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-31 22:22:27,705 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-31 22:22:27,705 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-31 22:22:27,710 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-31 22:22:27,710 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 10:22:27" (1/3) ... [2022-01-31 22:22:27,711 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a34643d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 10:22:27, skipping insertion in model container [2022-01-31 22:22:27,711 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 10:22:27" (2/3) ... [2022-01-31 22:22:27,711 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a34643d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 10:22:27, skipping insertion in model container [2022-01-31 22:22:27,711 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 10:22:27" (3/3) ... [2022-01-31 22:22:27,712 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_5.c [2022-01-31 22:22:27,715 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-01-31 22:22:27,715 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-31 22:22:27,740 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-31 22:22:27,744 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=AcceleratedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=JORDAN [2022-01-31 22:22:27,744 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-31 22:22:27,752 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-01-31 22:22:27,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-01-31 22:22:27,756 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 22:22:27,757 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 22:22:27,757 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 22:22:27,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 22:22:27,760 INFO L85 PathProgramCache]: Analyzing trace with hash -663266717, now seen corresponding path program 1 times [2022-01-31 22:22:27,765 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 22:22:27,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [894062439] [2022-01-31 22:22:27,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 22:22:27,773 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 22:22:27,801 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 22:22:27,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:22:27,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 22:22:27,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:22:27,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 22:22:27,896 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 22:22:27,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [894062439] [2022-01-31 22:22:27,897 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [894062439] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 22:22:27,898 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 22:22:27,898 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-31 22:22:27,898 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362258785] [2022-01-31 22:22:27,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 22:22:27,901 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-31 22:22:27,902 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 22:22:27,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-31 22:22:27,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-31 22:22:27,919 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-01-31 22:22:28,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 22:22:28,006 INFO L93 Difference]: Finished difference Result 58 states and 91 transitions. [2022-01-31 22:22:28,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-31 22:22:28,009 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-01-31 22:22:28,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 22:22:28,014 INFO L225 Difference]: With dead ends: 58 [2022-01-31 22:22:28,014 INFO L226 Difference]: Without dead ends: 43 [2022-01-31 22:22:28,016 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-31 22:22:28,018 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 89 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2022-01-31 22:22:28,019 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [89 Valid, 59 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 22:22:28,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-01-31 22:22:28,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 31. [2022-01-31 22:22:28,043 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-01-31 22:22:28,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 50 transitions. [2022-01-31 22:22:28,045 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 50 transitions. Word has length 16 [2022-01-31 22:22:28,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 22:22:28,045 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 50 transitions. [2022-01-31 22:22:28,046 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 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-01-31 22:22:28,046 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 50 transitions. [2022-01-31 22:22:28,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-01-31 22:22:28,046 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 22:22:28,046 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 22:22:28,047 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-31 22:22:28,047 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 22:22:28,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 22:22:28,047 INFO L85 PathProgramCache]: Analyzing trace with hash -1472613343, now seen corresponding path program 1 times [2022-01-31 22:22:28,048 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 22:22:28,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [701911164] [2022-01-31 22:22:28,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 22:22:28,049 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 22:22:28,050 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 22:22:28,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:22:28,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 22:22:28,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:22:28,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 22:22:28,120 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 22:22:28,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [701911164] [2022-01-31 22:22:28,121 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [701911164] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 22:22:28,121 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 22:22:28,121 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-31 22:22:28,121 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193814845] [2022-01-31 22:22:28,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 22:22:28,122 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-31 22:22:28,122 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 22:22:28,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-31 22:22:28,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-31 22:22:28,123 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-01-31 22:22:28,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 22:22:28,187 INFO L93 Difference]: Finished difference Result 68 states and 113 transitions. [2022-01-31 22:22:28,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-31 22:22:28,188 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-01-31 22:22:28,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 22:22:28,189 INFO L225 Difference]: With dead ends: 68 [2022-01-31 22:22:28,189 INFO L226 Difference]: Without dead ends: 43 [2022-01-31 22:22:28,189 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-31 22:22:28,190 INFO L933 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-01-31 22:22:28,191 INFO L934 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-01-31 22:22:28,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-01-31 22:22:28,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 41. [2022-01-31 22:22:28,198 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-01-31 22:22:28,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 66 transitions. [2022-01-31 22:22:28,199 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 66 transitions. Word has length 16 [2022-01-31 22:22:28,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 22:22:28,199 INFO L470 AbstractCegarLoop]: Abstraction has 41 states and 66 transitions. [2022-01-31 22:22:28,199 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 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-01-31 22:22:28,200 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 66 transitions. [2022-01-31 22:22:28,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-01-31 22:22:28,200 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 22:22:28,200 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 22:22:28,200 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-31 22:22:28,201 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 22:22:28,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 22:22:28,201 INFO L85 PathProgramCache]: Analyzing trace with hash 913783256, now seen corresponding path program 1 times [2022-01-31 22:22:28,201 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 22:22:28,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1371119283] [2022-01-31 22:22:28,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 22:22:28,202 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 22:22:28,204 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 22:22:28,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:22:28,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 22:22:28,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:22:28,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 22:22:28,273 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 22:22:28,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1371119283] [2022-01-31 22:22:28,273 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1371119283] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 22:22:28,273 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 22:22:28,273 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-31 22:22:28,273 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781380044] [2022-01-31 22:22:28,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 22:22:28,274 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-31 22:22:28,274 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 22:22:28,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-31 22:22:28,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-31 22:22:28,275 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-01-31 22:22:28,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 22:22:28,337 INFO L93 Difference]: Finished difference Result 64 states and 100 transitions. [2022-01-31 22:22:28,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-31 22:22:28,339 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-01-31 22:22:28,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 22:22:28,340 INFO L225 Difference]: With dead ends: 64 [2022-01-31 22:22:28,340 INFO L226 Difference]: Without dead ends: 46 [2022-01-31 22:22:28,340 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-31 22:22:28,341 INFO L933 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-01-31 22:22:28,341 INFO L934 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-01-31 22:22:28,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-01-31 22:22:28,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 44. [2022-01-31 22:22:28,347 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-01-31 22:22:28,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 68 transitions. [2022-01-31 22:22:28,348 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 68 transitions. Word has length 17 [2022-01-31 22:22:28,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 22:22:28,348 INFO L470 AbstractCegarLoop]: Abstraction has 44 states and 68 transitions. [2022-01-31 22:22:28,348 INFO L471 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-01-31 22:22:28,349 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 68 transitions. [2022-01-31 22:22:28,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-01-31 22:22:28,349 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 22:22:28,349 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 22:22:28,349 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-31 22:22:28,349 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 22:22:28,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 22:22:28,350 INFO L85 PathProgramCache]: Analyzing trace with hash 1593841626, now seen corresponding path program 1 times [2022-01-31 22:22:28,350 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 22:22:28,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [861498124] [2022-01-31 22:22:28,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 22:22:28,351 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 22:22:28,355 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 22:22:28,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:22:28,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 22:22:28,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:22:28,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 22:22:28,420 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 22:22:28,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [861498124] [2022-01-31 22:22:28,420 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [861498124] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 22:22:28,420 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 22:22:28,420 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-31 22:22:28,420 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661460072] [2022-01-31 22:22:28,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 22:22:28,421 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-31 22:22:28,421 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 22:22:28,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-31 22:22:28,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-31 22:22:28,431 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-01-31 22:22:28,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 22:22:28,499 INFO L93 Difference]: Finished difference Result 112 states and 180 transitions. [2022-01-31 22:22:28,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-31 22:22:28,499 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-01-31 22:22:28,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 22:22:28,503 INFO L225 Difference]: With dead ends: 112 [2022-01-31 22:22:28,504 INFO L226 Difference]: Without dead ends: 77 [2022-01-31 22:22:28,504 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-31 22:22:28,514 INFO L933 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-01-31 22:22:28,514 INFO L934 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-01-31 22:22:28,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-01-31 22:22:28,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2022-01-31 22:22:28,534 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-01-31 22:22:28,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 117 transitions. [2022-01-31 22:22:28,541 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 117 transitions. Word has length 17 [2022-01-31 22:22:28,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 22:22:28,541 INFO L470 AbstractCegarLoop]: Abstraction has 75 states and 117 transitions. [2022-01-31 22:22:28,541 INFO L471 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-01-31 22:22:28,542 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 117 transitions. [2022-01-31 22:22:28,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-01-31 22:22:28,543 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 22:22:28,543 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 22:22:28,543 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-31 22:22:28,543 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 22:22:28,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 22:22:28,544 INFO L85 PathProgramCache]: Analyzing trace with hash -1891779044, now seen corresponding path program 1 times [2022-01-31 22:22:28,544 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 22:22:28,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1258966712] [2022-01-31 22:22:28,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 22:22:28,545 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 22:22:28,547 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 22:22:28,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:22:28,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 22:22:28,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:22:28,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 22:22:28,577 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 22:22:28,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1258966712] [2022-01-31 22:22:28,578 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1258966712] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 22:22:28,578 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 22:22:28,578 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-31 22:22:28,578 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165990863] [2022-01-31 22:22:28,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 22:22:28,579 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-31 22:22:28,579 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 22:22:28,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-31 22:22:28,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-31 22:22:28,580 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-01-31 22:22:28,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 22:22:28,634 INFO L93 Difference]: Finished difference Result 95 states and 147 transitions. [2022-01-31 22:22:28,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-31 22:22:28,635 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-01-31 22:22:28,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 22:22:28,637 INFO L225 Difference]: With dead ends: 95 [2022-01-31 22:22:28,638 INFO L226 Difference]: Without dead ends: 93 [2022-01-31 22:22:28,638 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-31 22:22:28,643 INFO L933 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-01-31 22:22:28,644 INFO L934 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-01-31 22:22:28,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-01-31 22:22:28,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 75. [2022-01-31 22:22:28,658 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-01-31 22:22:28,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 115 transitions. [2022-01-31 22:22:28,659 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 115 transitions. Word has length 17 [2022-01-31 22:22:28,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 22:22:28,659 INFO L470 AbstractCegarLoop]: Abstraction has 75 states and 115 transitions. [2022-01-31 22:22:28,659 INFO L471 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-01-31 22:22:28,659 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 115 transitions. [2022-01-31 22:22:28,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-01-31 22:22:28,660 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 22:22:28,660 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 22:22:28,660 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-31 22:22:28,660 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 22:22:28,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 22:22:28,661 INFO L85 PathProgramCache]: Analyzing trace with hash -2130301802, now seen corresponding path program 1 times [2022-01-31 22:22:28,661 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 22:22:28,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1331331580] [2022-01-31 22:22:28,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 22:22:28,661 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 22:22:28,662 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 22:22:28,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:22:28,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 22:22:28,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:22:28,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 22:22:28,698 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 22:22:28,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1331331580] [2022-01-31 22:22:28,698 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1331331580] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 22:22:28,698 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 22:22:28,698 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-31 22:22:28,698 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831811220] [2022-01-31 22:22:28,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 22:22:28,699 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-31 22:22:28,699 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 22:22:28,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-31 22:22:28,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-31 22:22:28,699 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-01-31 22:22:28,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 22:22:28,748 INFO L93 Difference]: Finished difference Result 131 states and 203 transitions. [2022-01-31 22:22:28,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-31 22:22:28,748 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-01-31 22:22:28,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 22:22:28,749 INFO L225 Difference]: With dead ends: 131 [2022-01-31 22:22:28,749 INFO L226 Difference]: Without dead ends: 129 [2022-01-31 22:22:28,750 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-31 22:22:28,751 INFO L933 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-01-31 22:22:28,753 INFO L934 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-01-31 22:22:28,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-01-31 22:22:28,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 103. [2022-01-31 22:22:28,772 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-01-31 22:22:28,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 157 transitions. [2022-01-31 22:22:28,774 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 157 transitions. Word has length 18 [2022-01-31 22:22:28,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 22:22:28,774 INFO L470 AbstractCegarLoop]: Abstraction has 103 states and 157 transitions. [2022-01-31 22:22:28,774 INFO L471 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-01-31 22:22:28,775 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 157 transitions. [2022-01-31 22:22:28,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-01-31 22:22:28,779 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 22:22:28,779 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 22:22:28,779 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-31 22:22:28,779 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 22:22:28,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 22:22:28,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1355318868, now seen corresponding path program 1 times [2022-01-31 22:22:28,780 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 22:22:28,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [948348847] [2022-01-31 22:22:28,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 22:22:28,781 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 22:22:28,782 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 22:22:28,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:22:28,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 22:22:28,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:22:28,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 22:22:28,823 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 22:22:28,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [948348847] [2022-01-31 22:22:28,824 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [948348847] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 22:22:28,824 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 22:22:28,824 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-31 22:22:28,824 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494996021] [2022-01-31 22:22:28,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 22:22:28,824 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-31 22:22:28,824 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 22:22:28,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-31 22:22:28,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-31 22:22:28,825 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-01-31 22:22:28,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 22:22:28,871 INFO L93 Difference]: Finished difference Result 231 states and 355 transitions. [2022-01-31 22:22:28,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-31 22:22:28,871 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-01-31 22:22:28,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 22:22:28,872 INFO L225 Difference]: With dead ends: 231 [2022-01-31 22:22:28,872 INFO L226 Difference]: Without dead ends: 137 [2022-01-31 22:22:28,873 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-31 22:22:28,874 INFO L933 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-01-31 22:22:28,874 INFO L934 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-01-31 22:22:28,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2022-01-31 22:22:28,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 135. [2022-01-31 22:22:28,893 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-01-31 22:22:28,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 199 transitions. [2022-01-31 22:22:28,894 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 199 transitions. Word has length 18 [2022-01-31 22:22:28,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 22:22:28,894 INFO L470 AbstractCegarLoop]: Abstraction has 135 states and 199 transitions. [2022-01-31 22:22:28,894 INFO L471 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-01-31 22:22:28,894 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 199 transitions. [2022-01-31 22:22:28,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-01-31 22:22:28,895 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 22:22:28,896 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 22:22:28,896 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-31 22:22:28,896 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 22:22:28,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 22:22:28,896 INFO L85 PathProgramCache]: Analyzing trace with hash -1614630737, now seen corresponding path program 1 times [2022-01-31 22:22:28,897 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 22:22:28,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [127613209] [2022-01-31 22:22:28,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 22:22:28,898 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 22:22:28,899 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 22:22:28,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:22:28,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 22:22:28,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:22:28,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 22:22:28,922 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 22:22:28,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [127613209] [2022-01-31 22:22:28,923 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [127613209] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 22:22:28,923 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 22:22:28,923 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-31 22:22:28,923 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122041348] [2022-01-31 22:22:28,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 22:22:28,923 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-31 22:22:28,923 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 22:22:28,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-31 22:22:28,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-31 22:22:28,924 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-01-31 22:22:28,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 22:22:28,966 INFO L93 Difference]: Finished difference Result 205 states and 301 transitions. [2022-01-31 22:22:28,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-31 22:22:28,966 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-01-31 22:22:28,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 22:22:28,967 INFO L225 Difference]: With dead ends: 205 [2022-01-31 22:22:28,967 INFO L226 Difference]: Without dead ends: 143 [2022-01-31 22:22:28,967 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-31 22:22:28,968 INFO L933 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-01-31 22:22:28,968 INFO L934 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-01-31 22:22:28,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2022-01-31 22:22:28,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 141. [2022-01-31 22:22:28,976 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-01-31 22:22:28,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 203 transitions. [2022-01-31 22:22:28,977 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 203 transitions. Word has length 19 [2022-01-31 22:22:28,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 22:22:28,977 INFO L470 AbstractCegarLoop]: Abstraction has 141 states and 203 transitions. [2022-01-31 22:22:28,977 INFO L471 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-01-31 22:22:28,977 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 203 transitions. [2022-01-31 22:22:28,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-01-31 22:22:28,978 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 22:22:28,978 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 22:22:28,978 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-31 22:22:28,978 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 22:22:28,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 22:22:28,978 INFO L85 PathProgramCache]: Analyzing trace with hash -934572367, now seen corresponding path program 1 times [2022-01-31 22:22:28,978 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 22:22:28,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1547438698] [2022-01-31 22:22:28,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 22:22:28,979 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 22:22:28,980 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 22:22:28,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:22:28,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 22:22:28,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:22:29,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 22:22:29,000 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 22:22:29,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1547438698] [2022-01-31 22:22:29,000 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1547438698] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 22:22:29,000 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 22:22:29,000 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-31 22:22:29,001 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824283643] [2022-01-31 22:22:29,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 22:22:29,001 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-31 22:22:29,001 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 22:22:29,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-31 22:22:29,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-31 22:22:29,002 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-01-31 22:22:29,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 22:22:29,056 INFO L93 Difference]: Finished difference Result 237 states and 341 transitions. [2022-01-31 22:22:29,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-31 22:22:29,057 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-01-31 22:22:29,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 22:22:29,058 INFO L225 Difference]: With dead ends: 237 [2022-01-31 22:22:29,058 INFO L226 Difference]: Without dead ends: 235 [2022-01-31 22:22:29,058 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-31 22:22:29,060 INFO L933 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-01-31 22:22:29,060 INFO L934 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-01-31 22:22:29,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2022-01-31 22:22:29,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 201. [2022-01-31 22:22:29,073 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-01-31 22:22:29,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 283 transitions. [2022-01-31 22:22:29,074 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 283 transitions. Word has length 19 [2022-01-31 22:22:29,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 22:22:29,074 INFO L470 AbstractCegarLoop]: Abstraction has 201 states and 283 transitions. [2022-01-31 22:22:29,074 INFO L471 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-01-31 22:22:29,074 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 283 transitions. [2022-01-31 22:22:29,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-01-31 22:22:29,075 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 22:22:29,075 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 22:22:29,075 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-31 22:22:29,075 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 22:22:29,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 22:22:29,075 INFO L85 PathProgramCache]: Analyzing trace with hash -1743918993, now seen corresponding path program 1 times [2022-01-31 22:22:29,075 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 22:22:29,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1263002936] [2022-01-31 22:22:29,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 22:22:29,076 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 22:22:29,077 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 22:22:29,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:22:29,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 22:22:29,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:22:29,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 22:22:29,108 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 22:22:29,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1263002936] [2022-01-31 22:22:29,108 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1263002936] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 22:22:29,108 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 22:22:29,108 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-31 22:22:29,108 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575250812] [2022-01-31 22:22:29,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 22:22:29,108 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-31 22:22:29,108 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 22:22:29,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-31 22:22:29,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-31 22:22:29,109 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-01-31 22:22:29,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 22:22:29,170 INFO L93 Difference]: Finished difference Result 445 states and 621 transitions. [2022-01-31 22:22:29,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-31 22:22:29,171 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-01-31 22:22:29,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 22:22:29,172 INFO L225 Difference]: With dead ends: 445 [2022-01-31 22:22:29,172 INFO L226 Difference]: Without dead ends: 259 [2022-01-31 22:22:29,175 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-31 22:22:29,175 INFO L933 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-01-31 22:22:29,176 INFO L934 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-01-31 22:22:29,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2022-01-31 22:22:29,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 257. [2022-01-31 22:22:29,195 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-01-31 22:22:29,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 343 transitions. [2022-01-31 22:22:29,196 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 343 transitions. Word has length 19 [2022-01-31 22:22:29,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 22:22:29,196 INFO L470 AbstractCegarLoop]: Abstraction has 257 states and 343 transitions. [2022-01-31 22:22:29,196 INFO L471 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-01-31 22:22:29,196 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 343 transitions. [2022-01-31 22:22:29,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-01-31 22:22:29,196 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 22:22:29,197 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 22:22:29,197 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-31 22:22:29,197 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 22:22:29,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 22:22:29,197 INFO L85 PathProgramCache]: Analyzing trace with hash 1093243721, now seen corresponding path program 1 times [2022-01-31 22:22:29,197 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 22:22:29,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [252673852] [2022-01-31 22:22:29,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 22:22:29,198 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 22:22:29,199 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 22:22:29,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:22:29,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 22:22:29,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:22:29,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 22:22:29,231 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 22:22:29,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [252673852] [2022-01-31 22:22:29,232 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [252673852] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 22:22:29,233 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 22:22:29,238 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-31 22:22:29,238 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956185118] [2022-01-31 22:22:29,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 22:22:29,238 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-31 22:22:29,238 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 22:22:29,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-31 22:22:29,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-31 22:22:29,239 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-01-31 22:22:29,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 22:22:29,315 INFO L93 Difference]: Finished difference Result 385 states and 509 transitions. [2022-01-31 22:22:29,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-31 22:22:29,315 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-01-31 22:22:29,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 22:22:29,316 INFO L225 Difference]: With dead ends: 385 [2022-01-31 22:22:29,316 INFO L226 Difference]: Without dead ends: 267 [2022-01-31 22:22:29,316 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-31 22:22:29,317 INFO L933 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-01-31 22:22:29,317 INFO L934 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-01-31 22:22:29,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2022-01-31 22:22:29,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 265. [2022-01-31 22:22:29,337 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-01-31 22:22:29,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 343 transitions. [2022-01-31 22:22:29,338 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 343 transitions. Word has length 20 [2022-01-31 22:22:29,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 22:22:29,338 INFO L470 AbstractCegarLoop]: Abstraction has 265 states and 343 transitions. [2022-01-31 22:22:29,338 INFO L471 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-01-31 22:22:29,338 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 343 transitions. [2022-01-31 22:22:29,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-01-31 22:22:29,339 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 22:22:29,339 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 22:22:29,339 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-31 22:22:29,339 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 22:22:29,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 22:22:29,340 INFO L85 PathProgramCache]: Analyzing trace with hash 1773302091, now seen corresponding path program 1 times [2022-01-31 22:22:29,340 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 22:22:29,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1002672882] [2022-01-31 22:22:29,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 22:22:29,340 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 22:22:29,341 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 22:22:29,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:22:29,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 22:22:29,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:22:29,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 22:22:29,358 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 22:22:29,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1002672882] [2022-01-31 22:22:29,358 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1002672882] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 22:22:29,358 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 22:22:29,359 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-31 22:22:29,359 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93574661] [2022-01-31 22:22:29,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 22:22:29,359 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-31 22:22:29,359 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 22:22:29,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-31 22:22:29,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-31 22:22:29,359 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-01-31 22:22:29,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 22:22:29,414 INFO L93 Difference]: Finished difference Result 427 states and 544 transitions. [2022-01-31 22:22:29,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-31 22:22:29,415 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-01-31 22:22:29,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 22:22:29,416 INFO L225 Difference]: With dead ends: 427 [2022-01-31 22:22:29,416 INFO L226 Difference]: Without dead ends: 425 [2022-01-31 22:22:29,416 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-31 22:22:29,416 INFO L933 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-01-31 22:22:29,417 INFO L934 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-01-31 22:22:29,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2022-01-31 22:22:29,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 393. [2022-01-31 22:22:29,442 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-01-31 22:22:29,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 495 transitions. [2022-01-31 22:22:29,443 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 495 transitions. Word has length 20 [2022-01-31 22:22:29,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 22:22:29,443 INFO L470 AbstractCegarLoop]: Abstraction has 393 states and 495 transitions. [2022-01-31 22:22:29,443 INFO L471 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-01-31 22:22:29,443 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 495 transitions. [2022-01-31 22:22:29,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-01-31 22:22:29,445 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 22:22:29,445 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 22:22:29,445 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-31 22:22:29,445 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 22:22:29,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 22:22:29,445 INFO L85 PathProgramCache]: Analyzing trace with hash 963955465, now seen corresponding path program 1 times [2022-01-31 22:22:29,445 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 22:22:29,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1483130871] [2022-01-31 22:22:29,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 22:22:29,446 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 22:22:29,447 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 22:22:29,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:22:29,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 22:22:29,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:22:29,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 22:22:29,475 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 22:22:29,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1483130871] [2022-01-31 22:22:29,475 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1483130871] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 22:22:29,475 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 22:22:29,475 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-31 22:22:29,475 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845679471] [2022-01-31 22:22:29,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 22:22:29,476 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-31 22:22:29,476 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 22:22:29,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-31 22:22:29,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-31 22:22:29,476 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-01-31 22:22:29,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 22:22:29,543 INFO L93 Difference]: Finished difference Result 857 states and 1055 transitions. [2022-01-31 22:22:29,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-31 22:22:29,543 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-01-31 22:22:29,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 22:22:29,553 INFO L225 Difference]: With dead ends: 857 [2022-01-31 22:22:29,553 INFO L226 Difference]: Without dead ends: 0 [2022-01-31 22:22:29,554 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-31 22:22:29,556 INFO L933 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-01-31 22:22:29,556 INFO L934 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-01-31 22:22:29,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-01-31 22:22:29,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-01-31 22:22:29,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-31 22:22:29,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-01-31 22:22:29,557 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 20 [2022-01-31 22:22:29,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 22:22:29,557 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-01-31 22:22:29,557 INFO L471 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-01-31 22:22:29,557 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-01-31 22:22:29,557 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-01-31 22:22:29,559 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-01-31 22:22:29,559 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-31 22:22:29,560 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-01-31 22:22:32,109 INFO L858 garLoopResultBuilder]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2022-01-31 22:22:32,109 INFO L858 garLoopResultBuilder]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2022-01-31 22:22:32,109 INFO L858 garLoopResultBuilder]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2022-01-31 22:22:32,109 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-01-31 22:22:32,109 INFO L854 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-01-31 22:22:32,110 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-01-31 22:22:32,110 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-01-31 22:22:32,110 INFO L861 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-01-31 22:22:32,110 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-01-31 22:22:32,110 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-01-31 22:22:32,110 INFO L861 garLoopResultBuilder]: At program point mainEXIT(lines 6 95) the Hoare annotation is: true [2022-01-31 22:22:32,110 INFO L861 garLoopResultBuilder]: At program point L85-1(lines 26 90) the Hoare annotation is: true [2022-01-31 22:22:32,110 INFO L854 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-01-31 22:22:32,110 INFO L854 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-01-31 22:22:32,110 INFO L861 garLoopResultBuilder]: At program point L28(lines 28 30) the Hoare annotation is: true [2022-01-31 22:22:32,110 INFO L854 garLoopResultBuilder]: At program point L86(line 86) the Hoare annotation is: (= main_~lk5~0 1) [2022-01-31 22:22:32,110 INFO L854 garLoopResultBuilder]: At program point L86-1(lines 7 95) the Hoare annotation is: false [2022-01-31 22:22:32,111 INFO L854 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-01-31 22:22:32,111 INFO L854 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-01-31 22:22:32,111 INFO L861 garLoopResultBuilder]: At program point L91(lines 7 95) the Hoare annotation is: true [2022-01-31 22:22:32,111 INFO L861 garLoopResultBuilder]: At program point mainFINAL(lines 6 95) the Hoare annotation is: true [2022-01-31 22:22:32,111 INFO L854 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-01-31 22:22:32,111 INFO L854 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-01-31 22:22:32,111 INFO L854 garLoopResultBuilder]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 93) the Hoare annotation is: false [2022-01-31 22:22:32,111 INFO L861 garLoopResultBuilder]: At program point mainENTRY(lines 6 95) the Hoare annotation is: true [2022-01-31 22:22:32,112 INFO L854 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-01-31 22:22:32,112 INFO L854 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-01-31 22:22:32,112 INFO L854 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-01-31 22:22:32,112 INFO L854 garLoopResultBuilder]: At program point L80-1(lines 26 90) the Hoare annotation is: (or (= main_~lk5~0 1) (= main_~p5~0 0)) [2022-01-31 22:22:32,112 INFO L854 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-01-31 22:22:32,112 INFO L854 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-01-31 22:22:32,112 INFO L861 garLoopResultBuilder]: At program point L43(lines 43 45) the Hoare annotation is: true [2022-01-31 22:22:32,112 INFO L854 garLoopResultBuilder]: At program point L43-2(lines 26 90) the Hoare annotation is: (or (= main_~lk1~0 1) (= main_~p1~0 0)) [2022-01-31 22:22:32,114 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 22:22:32,115 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-01-31 22:22:32,121 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 10:22:32 BoogieIcfgContainer [2022-01-31 22:22:32,121 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-31 22:22:32,121 INFO L158 Benchmark]: Toolchain (without parser) took 4853.80ms. Allocated memory was 220.2MB in the beginning and 317.7MB in the end (delta: 97.5MB). Free memory was 171.3MB in the beginning and 165.7MB in the end (delta: 5.6MB). Peak memory consumption was 161.5MB. Max. memory is 8.0GB. [2022-01-31 22:22:32,121 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 220.2MB. Free memory is still 187.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-31 22:22:32,121 INFO L158 Benchmark]: CACSL2BoogieTranslator took 188.53ms. Allocated memory is still 220.2MB. Free memory was 171.2MB in the beginning and 197.3MB in the end (delta: -26.1MB). Peak memory consumption was 9.0MB. Max. memory is 8.0GB. [2022-01-31 22:22:32,122 INFO L158 Benchmark]: Boogie Preprocessor took 22.82ms. Allocated memory is still 220.2MB. Free memory was 197.3MB in the beginning and 195.7MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-31 22:22:32,122 INFO L158 Benchmark]: RCFGBuilder took 221.75ms. Allocated memory is still 220.2MB. Free memory was 195.7MB in the beginning and 184.7MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-01-31 22:22:32,122 INFO L158 Benchmark]: TraceAbstraction took 4415.50ms. Allocated memory was 220.2MB in the beginning and 317.7MB in the end (delta: 97.5MB). Free memory was 184.7MB in the beginning and 165.7MB in the end (delta: 18.9MB). Peak memory consumption was 175.7MB. Max. memory is 8.0GB. [2022-01-31 22:22:32,123 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 220.2MB. Free memory is still 187.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 188.53ms. Allocated memory is still 220.2MB. Free memory was 171.2MB in the beginning and 197.3MB in the end (delta: -26.1MB). Peak memory consumption was 9.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 22.82ms. Allocated memory is still 220.2MB. Free memory was 197.3MB in the beginning and 195.7MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 221.75ms. Allocated memory is still 220.2MB. Free memory was 195.7MB in the beginning and 184.7MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 4415.50ms. Allocated memory was 220.2MB in the beginning and 317.7MB in the end (delta: 97.5MB). Free memory was 184.7MB in the beginning and 165.7MB in the end (delta: 18.9MB). Peak memory consumption was 175.7MB. 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.4s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.5s, 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.1s 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, 1.9s 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-01-31 22:22:32,148 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...