/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/locks/test_locks_7.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-6c470ae [2022-02-15 04:27:28,796 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-15 04:27:28,798 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-15 04:27:28,862 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-15 04:27:28,863 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-15 04:27:28,865 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-15 04:27:28,867 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-15 04:27:28,871 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-15 04:27:28,873 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-15 04:27:28,876 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-15 04:27:28,876 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-15 04:27:28,877 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-15 04:27:28,878 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-15 04:27:28,879 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-15 04:27:28,880 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-15 04:27:28,881 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-15 04:27:28,881 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-15 04:27:28,882 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-15 04:27:28,888 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-15 04:27:28,889 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-15 04:27:28,890 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-15 04:27:28,891 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-15 04:27:28,892 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-15 04:27:28,892 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-15 04:27:28,894 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-15 04:27:28,894 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-15 04:27:28,894 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-15 04:27:28,895 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-15 04:27:28,895 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-15 04:27:28,895 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-15 04:27:28,896 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-15 04:27:28,896 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-15 04:27:28,896 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-15 04:27:28,897 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-15 04:27:28,897 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-15 04:27:28,898 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-15 04:27:28,898 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-15 04:27:28,898 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-15 04:27:28,898 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-15 04:27:28,899 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-15 04:27:28,899 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-15 04:27:28,903 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-02-15 04:27:28,912 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-15 04:27:28,912 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-15 04:27:28,913 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-15 04:27:28,914 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-15 04:27:28,914 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-15 04:27:28,914 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-15 04:27:28,914 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-15 04:27:28,914 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-15 04:27:28,914 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-15 04:27:28,914 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-15 04:27:28,915 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-15 04:27:28,915 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-15 04:27:28,916 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-15 04:27:28,916 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-02-15 04:27:28,916 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-15 04:27:28,916 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-15 04:27:28,916 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-15 04:27:28,916 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2022-02-15 04:27:28,916 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-15 04:27:28,917 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-02-15 04:27:28,917 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-02-15 04:27:29,113 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-15 04:27:29,140 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-15 04:27:29,141 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-15 04:27:29,142 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-15 04:27:29,143 INFO L275 PluginConnector]: CDTParser initialized [2022-02-15 04:27:29,144 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_7.c [2022-02-15 04:27:29,189 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1aee50610/6d368b6e803f4ea990649aef59dc891b/FLAGcddaea826 [2022-02-15 04:27:29,493 INFO L306 CDTParser]: Found 1 translation units. [2022-02-15 04:27:29,493 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_7.c [2022-02-15 04:27:29,500 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1aee50610/6d368b6e803f4ea990649aef59dc891b/FLAGcddaea826 [2022-02-15 04:27:29,921 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1aee50610/6d368b6e803f4ea990649aef59dc891b [2022-02-15 04:27:29,922 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-15 04:27:29,923 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-02-15 04:27:29,924 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-15 04:27:29,924 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-15 04:27:29,927 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-15 04:27:29,927 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 04:27:29" (1/1) ... [2022-02-15 04:27:29,928 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40825408 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 04:27:29, skipping insertion in model container [2022-02-15 04:27:29,928 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 04:27:29" (1/1) ... [2022-02-15 04:27:29,933 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-15 04:27:29,943 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-15 04:27:30,074 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_7.c[2881,2894] [2022-02-15 04:27:30,077 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-15 04:27:30,081 INFO L203 MainTranslator]: Completed pre-run [2022-02-15 04:27:30,095 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_7.c[2881,2894] [2022-02-15 04:27:30,096 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-15 04:27:30,104 INFO L208 MainTranslator]: Completed translation [2022-02-15 04:27:30,104 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 04:27:30 WrapperNode [2022-02-15 04:27:30,104 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-15 04:27:30,105 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-15 04:27:30,105 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-15 04:27:30,105 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-15 04:27:30,112 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 04:27:30" (1/1) ... [2022-02-15 04:27:30,112 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 04:27:30" (1/1) ... [2022-02-15 04:27:30,116 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 04:27:30" (1/1) ... [2022-02-15 04:27:30,116 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 04:27:30" (1/1) ... [2022-02-15 04:27:30,119 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 04:27:30" (1/1) ... [2022-02-15 04:27:30,122 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 04:27:30" (1/1) ... [2022-02-15 04:27:30,123 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 04:27:30" (1/1) ... [2022-02-15 04:27:30,124 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-15 04:27:30,125 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-15 04:27:30,125 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-15 04:27:30,125 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-15 04:27:30,126 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 04:27:30" (1/1) ... [2022-02-15 04:27:30,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-15 04:27:30,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-15 04:27:30,166 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-02-15 04:27:30,182 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-02-15 04:27:30,208 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-02-15 04:27:30,208 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-15 04:27:30,208 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-02-15 04:27:30,208 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-02-15 04:27:30,209 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-02-15 04:27:30,209 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-02-15 04:27:30,209 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-02-15 04:27:30,209 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-15 04:27:30,209 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-02-15 04:27:30,209 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-02-15 04:27:30,209 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-02-15 04:27:30,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-15 04:27:30,210 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-15 04:27:30,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-15 04:27:30,210 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-15 04:27:30,211 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-15 04:27:30,263 INFO L234 CfgBuilder]: Building ICFG [2022-02-15 04:27:30,264 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-15 04:27:30,369 INFO L275 CfgBuilder]: Performing block encoding [2022-02-15 04:27:30,374 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-15 04:27:30,374 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-15 04:27:30,375 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 04:27:30 BoogieIcfgContainer [2022-02-15 04:27:30,375 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-15 04:27:30,376 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-15 04:27:30,376 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-15 04:27:30,379 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-15 04:27:30,379 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 04:27:29" (1/3) ... [2022-02-15 04:27:30,379 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@389a9f8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 04:27:30, skipping insertion in model container [2022-02-15 04:27:30,379 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 04:27:30" (2/3) ... [2022-02-15 04:27:30,380 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@389a9f8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 04:27:30, skipping insertion in model container [2022-02-15 04:27:30,380 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 04:27:30" (3/3) ... [2022-02-15 04:27:30,380 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_7.c [2022-02-15 04:27:30,383 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-02-15 04:27:30,384 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-15 04:27:30,410 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-15 04:27:30,430 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=QVASR [2022-02-15 04:27:30,430 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-15 04:27:30,439 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 30 states have (on average 1.8333333333333333) internal successors, (55), 31 states have internal predecessors, (55), 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-02-15 04:27:30,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-15 04:27:30,443 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 04:27:30,444 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 04:27:30,444 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 04:27:30,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 04:27:30,447 INFO L85 PathProgramCache]: Analyzing trace with hash -1576798563, now seen corresponding path program 1 times [2022-02-15 04:27:30,453 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 04:27:30,453 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1304723481] [2022-02-15 04:27:30,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 04:27:30,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 04:27:30,522 INFO L274 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-15 04:27:30,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 04:27:30,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 04:27:30,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 04:27:30,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 04:27:30,673 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 04:27:30,673 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1304723481] [2022-02-15 04:27:30,674 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1304723481] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 04:27:30,675 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 04:27:30,675 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-15 04:27:30,676 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181546052] [2022-02-15 04:27:30,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 04:27:30,681 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-15 04:27:30,681 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 04:27:30,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-15 04:27:30,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-15 04:27:30,704 INFO L87 Difference]: Start difference. First operand has 36 states, 30 states have (on average 1.8333333333333333) internal successors, (55), 31 states have internal predecessors, (55), 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.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-02-15 04:27:30,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 04:27:30,846 INFO L93 Difference]: Finished difference Result 70 states and 115 transitions. [2022-02-15 04:27:30,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-15 04:27:30,848 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-02-15 04:27:30,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 04:27:30,859 INFO L225 Difference]: With dead ends: 70 [2022-02-15 04:27:30,859 INFO L226 Difference]: Without dead ends: 55 [2022-02-15 04:27:30,867 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-02-15 04:27:30,869 INFO L933 BasicCegarLoop]: 62 mSDtfsCounter, 123 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-15 04:27:30,870 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [123 Valid, 71 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-15 04:27:30,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-02-15 04:27:30,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 39. [2022-02-15 04:27:30,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 35 states have (on average 1.8) internal successors, (63), 35 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-02-15 04:27:30,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 66 transitions. [2022-02-15 04:27:30,899 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 66 transitions. Word has length 18 [2022-02-15 04:27:30,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 04:27:30,899 INFO L470 AbstractCegarLoop]: Abstraction has 39 states and 66 transitions. [2022-02-15 04:27:30,899 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-02-15 04:27:30,900 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 66 transitions. [2022-02-15 04:27:30,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-15 04:27:30,900 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 04:27:30,900 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 04:27:30,900 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-15 04:27:30,901 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 04:27:30,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 04:27:30,901 INFO L85 PathProgramCache]: Analyzing trace with hash -1969825573, now seen corresponding path program 1 times [2022-02-15 04:27:30,901 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 04:27:30,902 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [817260306] [2022-02-15 04:27:30,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 04:27:30,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 04:27:30,904 INFO L274 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-15 04:27:30,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 04:27:30,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 04:27:30,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 04:27:30,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 04:27:30,944 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 04:27:30,944 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [817260306] [2022-02-15 04:27:30,944 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [817260306] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 04:27:30,944 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 04:27:30,944 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-15 04:27:30,944 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372276365] [2022-02-15 04:27:30,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 04:27:30,945 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-15 04:27:30,945 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 04:27:30,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-15 04:27:30,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-15 04:27:30,946 INFO L87 Difference]: Start difference. First operand 39 states and 66 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-02-15 04:27:31,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 04:27:31,010 INFO L93 Difference]: Finished difference Result 88 states and 153 transitions. [2022-02-15 04:27:31,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-15 04:27:31,011 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-02-15 04:27:31,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 04:27:31,012 INFO L225 Difference]: With dead ends: 88 [2022-02-15 04:27:31,012 INFO L226 Difference]: Without dead ends: 55 [2022-02-15 04:27:31,012 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-02-15 04:27:31,013 INFO L933 BasicCegarLoop]: 64 mSDtfsCounter, 103 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-15 04:27:31,014 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [103 Valid, 71 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-15 04:27:31,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-02-15 04:27:31,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 53. [2022-02-15 04:27:31,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 49 states have (on average 1.7755102040816326) internal successors, (87), 49 states have internal predecessors, (87), 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-02-15 04:27:31,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 90 transitions. [2022-02-15 04:27:31,023 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 90 transitions. Word has length 18 [2022-02-15 04:27:31,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 04:27:31,023 INFO L470 AbstractCegarLoop]: Abstraction has 53 states and 90 transitions. [2022-02-15 04:27:31,024 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-02-15 04:27:31,024 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 90 transitions. [2022-02-15 04:27:31,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-15 04:27:31,024 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 04:27:31,024 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-02-15 04:27:31,024 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-15 04:27:31,025 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 04:27:31,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 04:27:31,025 INFO L85 PathProgramCache]: Analyzing trace with hash -1635900842, now seen corresponding path program 1 times [2022-02-15 04:27:31,025 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 04:27:31,026 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1151467369] [2022-02-15 04:27:31,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 04:27:31,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 04:27:31,028 INFO L274 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-15 04:27:31,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 04:27:31,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 04:27:31,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 04:27:31,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 04:27:31,064 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 04:27:31,064 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1151467369] [2022-02-15 04:27:31,064 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1151467369] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 04:27:31,065 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 04:27:31,065 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-15 04:27:31,065 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494981566] [2022-02-15 04:27:31,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 04:27:31,065 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-15 04:27:31,065 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 04:27:31,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-15 04:27:31,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-15 04:27:31,066 INFO L87 Difference]: Start difference. First operand 53 states and 90 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-02-15 04:27:31,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 04:27:31,124 INFO L93 Difference]: Finished difference Result 82 states and 136 transitions. [2022-02-15 04:27:31,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-15 04:27:31,124 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-02-15 04:27:31,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 04:27:31,125 INFO L225 Difference]: With dead ends: 82 [2022-02-15 04:27:31,125 INFO L226 Difference]: Without dead ends: 58 [2022-02-15 04:27:31,125 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-02-15 04:27:31,126 INFO L933 BasicCegarLoop]: 76 mSDtfsCounter, 92 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-15 04:27:31,127 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [92 Valid, 83 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-15 04:27:31,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-02-15 04:27:31,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2022-02-15 04:27:31,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 52 states have (on average 1.7115384615384615) internal successors, (89), 52 states have internal predecessors, (89), 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-02-15 04:27:31,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 92 transitions. [2022-02-15 04:27:31,134 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 92 transitions. Word has length 19 [2022-02-15 04:27:31,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 04:27:31,134 INFO L470 AbstractCegarLoop]: Abstraction has 56 states and 92 transitions. [2022-02-15 04:27:31,134 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-02-15 04:27:31,134 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 92 transitions. [2022-02-15 04:27:31,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-15 04:27:31,135 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 04:27:31,135 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-02-15 04:27:31,135 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-15 04:27:31,135 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 04:27:31,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 04:27:31,136 INFO L85 PathProgramCache]: Analyzing trace with hash -934836264, now seen corresponding path program 1 times [2022-02-15 04:27:31,136 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 04:27:31,136 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1123888349] [2022-02-15 04:27:31,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 04:27:31,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 04:27:31,138 INFO L274 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-15 04:27:31,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 04:27:31,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 04:27:31,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 04:27:31,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 04:27:31,171 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 04:27:31,172 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1123888349] [2022-02-15 04:27:31,172 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1123888349] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 04:27:31,172 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 04:27:31,172 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-15 04:27:31,172 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742426696] [2022-02-15 04:27:31,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 04:27:31,172 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-15 04:27:31,173 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 04:27:31,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-15 04:27:31,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-15 04:27:31,173 INFO L87 Difference]: Start difference. First operand 56 states and 92 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-02-15 04:27:31,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 04:27:31,236 INFO L93 Difference]: Finished difference Result 148 states and 252 transitions. [2022-02-15 04:27:31,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-15 04:27:31,236 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-02-15 04:27:31,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 04:27:31,240 INFO L225 Difference]: With dead ends: 148 [2022-02-15 04:27:31,241 INFO L226 Difference]: Without dead ends: 101 [2022-02-15 04:27:31,241 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-02-15 04:27:31,248 INFO L933 BasicCegarLoop]: 54 mSDtfsCounter, 112 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-15 04:27:31,248 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [112 Valid, 61 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-15 04:27:31,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-02-15 04:27:31,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 99. [2022-02-15 04:27:31,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 95 states have (on average 1.7052631578947368) internal successors, (162), 95 states have internal predecessors, (162), 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-02-15 04:27:31,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 165 transitions. [2022-02-15 04:27:31,258 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 165 transitions. Word has length 19 [2022-02-15 04:27:31,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 04:27:31,258 INFO L470 AbstractCegarLoop]: Abstraction has 99 states and 165 transitions. [2022-02-15 04:27:31,258 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-02-15 04:27:31,258 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 165 transitions. [2022-02-15 04:27:31,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-15 04:27:31,261 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 04:27:31,261 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-02-15 04:27:31,261 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-15 04:27:31,261 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 04:27:31,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 04:27:31,262 INFO L85 PathProgramCache]: Analyzing trace with hash -541809254, now seen corresponding path program 1 times [2022-02-15 04:27:31,262 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 04:27:31,262 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1303901601] [2022-02-15 04:27:31,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 04:27:31,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 04:27:31,267 INFO L274 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-15 04:27:31,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 04:27:31,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 04:27:31,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 04:27:31,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 04:27:31,321 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 04:27:31,321 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1303901601] [2022-02-15 04:27:31,321 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1303901601] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 04:27:31,321 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 04:27:31,321 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-15 04:27:31,321 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549743896] [2022-02-15 04:27:31,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 04:27:31,322 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-15 04:27:31,322 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 04:27:31,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-15 04:27:31,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-15 04:27:31,322 INFO L87 Difference]: Start difference. First operand 99 states and 165 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-02-15 04:27:31,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 04:27:31,383 INFO L93 Difference]: Finished difference Result 127 states and 211 transitions. [2022-02-15 04:27:31,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-15 04:27:31,383 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-02-15 04:27:31,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 04:27:31,384 INFO L225 Difference]: With dead ends: 127 [2022-02-15 04:27:31,384 INFO L226 Difference]: Without dead ends: 125 [2022-02-15 04:27:31,385 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-02-15 04:27:31,388 INFO L933 BasicCegarLoop]: 85 mSDtfsCounter, 73 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-15 04:27:31,389 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [73 Valid, 92 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-15 04:27:31,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-02-15 04:27:31,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 99. [2022-02-15 04:27:31,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 95 states have (on average 1.6842105263157894) internal successors, (160), 95 states have internal predecessors, (160), 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-02-15 04:27:31,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 163 transitions. [2022-02-15 04:27:31,414 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 163 transitions. Word has length 19 [2022-02-15 04:27:31,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 04:27:31,415 INFO L470 AbstractCegarLoop]: Abstraction has 99 states and 163 transitions. [2022-02-15 04:27:31,415 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-02-15 04:27:31,416 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 163 transitions. [2022-02-15 04:27:31,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-15 04:27:31,417 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 04:27:31,417 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-02-15 04:27:31,417 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-15 04:27:31,418 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 04:27:31,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 04:27:31,418 INFO L85 PathProgramCache]: Analyzing trace with hash 1085061584, now seen corresponding path program 1 times [2022-02-15 04:27:31,418 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 04:27:31,418 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [676255125] [2022-02-15 04:27:31,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 04:27:31,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 04:27:31,420 INFO L274 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-15 04:27:31,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 04:27:31,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 04:27:31,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 04:27:31,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 04:27:31,477 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 04:27:31,477 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [676255125] [2022-02-15 04:27:31,478 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [676255125] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 04:27:31,478 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 04:27:31,478 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-15 04:27:31,478 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828168560] [2022-02-15 04:27:31,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 04:27:31,478 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-15 04:27:31,478 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 04:27:31,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-15 04:27:31,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-15 04:27:31,479 INFO L87 Difference]: Start difference. First operand 99 states and 163 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-02-15 04:27:31,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 04:27:31,548 INFO L93 Difference]: Finished difference Result 179 states and 299 transitions. [2022-02-15 04:27:31,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-15 04:27:31,548 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-02-15 04:27:31,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 04:27:31,549 INFO L225 Difference]: With dead ends: 179 [2022-02-15 04:27:31,549 INFO L226 Difference]: Without dead ends: 177 [2022-02-15 04:27:31,550 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-02-15 04:27:31,552 INFO L933 BasicCegarLoop]: 51 mSDtfsCounter, 103 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-15 04:27:31,553 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [103 Valid, 58 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-15 04:27:31,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2022-02-15 04:27:31,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 135. [2022-02-15 04:27:31,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 131 states have (on average 1.6641221374045803) internal successors, (218), 131 states have internal predecessors, (218), 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-02-15 04:27:31,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 221 transitions. [2022-02-15 04:27:31,575 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 221 transitions. Word has length 20 [2022-02-15 04:27:31,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 04:27:31,575 INFO L470 AbstractCegarLoop]: Abstraction has 135 states and 221 transitions. [2022-02-15 04:27:31,575 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-02-15 04:27:31,575 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 221 transitions. [2022-02-15 04:27:31,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-15 04:27:31,579 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 04:27:31,579 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-02-15 04:27:31,580 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-15 04:27:31,580 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 04:27:31,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 04:27:31,580 INFO L85 PathProgramCache]: Analyzing trace with hash 692034574, now seen corresponding path program 1 times [2022-02-15 04:27:31,580 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 04:27:31,580 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [714138812] [2022-02-15 04:27:31,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 04:27:31,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 04:27:31,584 INFO L274 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-15 04:27:31,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 04:27:31,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 04:27:31,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 04:27:31,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 04:27:31,611 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 04:27:31,611 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [714138812] [2022-02-15 04:27:31,612 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [714138812] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 04:27:31,612 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 04:27:31,612 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-15 04:27:31,612 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724391544] [2022-02-15 04:27:31,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 04:27:31,612 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-15 04:27:31,612 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 04:27:31,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-15 04:27:31,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-15 04:27:31,613 INFO L87 Difference]: Start difference. First operand 135 states and 221 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-02-15 04:27:31,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 04:27:31,680 INFO L93 Difference]: Finished difference Result 311 states and 515 transitions. [2022-02-15 04:27:31,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-15 04:27:31,681 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-02-15 04:27:31,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 04:27:31,682 INFO L225 Difference]: With dead ends: 311 [2022-02-15 04:27:31,682 INFO L226 Difference]: Without dead ends: 185 [2022-02-15 04:27:31,683 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-02-15 04:27:31,684 INFO L933 BasicCegarLoop]: 68 mSDtfsCounter, 91 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-15 04:27:31,684 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [91 Valid, 75 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-15 04:27:31,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2022-02-15 04:27:31,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 183. [2022-02-15 04:27:31,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 179 states have (on average 1.6312849162011174) internal successors, (292), 179 states have internal predecessors, (292), 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-02-15 04:27:31,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 295 transitions. [2022-02-15 04:27:31,700 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 295 transitions. Word has length 20 [2022-02-15 04:27:31,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 04:27:31,700 INFO L470 AbstractCegarLoop]: Abstraction has 183 states and 295 transitions. [2022-02-15 04:27:31,700 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-02-15 04:27:31,700 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 295 transitions. [2022-02-15 04:27:31,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-02-15 04:27:31,702 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 04:27:31,702 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, 1] [2022-02-15 04:27:31,702 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-15 04:27:31,703 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 04:27:31,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 04:27:31,703 INFO L85 PathProgramCache]: Analyzing trace with hash -722614227, now seen corresponding path program 1 times [2022-02-15 04:27:31,703 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 04:27:31,703 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [579907175] [2022-02-15 04:27:31,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 04:27:31,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 04:27:31,706 INFO L274 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-15 04:27:31,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 04:27:31,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 04:27:31,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 04:27:31,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 04:27:31,742 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 04:27:31,742 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [579907175] [2022-02-15 04:27:31,742 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [579907175] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 04:27:31,742 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 04:27:31,743 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-15 04:27:31,743 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227210034] [2022-02-15 04:27:31,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 04:27:31,743 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-15 04:27:31,743 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 04:27:31,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-15 04:27:31,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-15 04:27:31,744 INFO L87 Difference]: Start difference. First operand 183 states and 295 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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-02-15 04:27:31,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 04:27:31,814 INFO L93 Difference]: Finished difference Result 277 states and 445 transitions. [2022-02-15 04:27:31,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-15 04:27:31,814 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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 21 [2022-02-15 04:27:31,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 04:27:31,815 INFO L225 Difference]: With dead ends: 277 [2022-02-15 04:27:31,815 INFO L226 Difference]: Without dead ends: 191 [2022-02-15 04:27:31,816 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-02-15 04:27:31,816 INFO L933 BasicCegarLoop]: 70 mSDtfsCounter, 90 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 77 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-02-15 04:27:31,816 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [90 Valid, 77 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-15 04:27:31,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2022-02-15 04:27:31,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 189. [2022-02-15 04:27:31,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 185 states have (on average 1.6) internal successors, (296), 185 states have internal predecessors, (296), 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-02-15 04:27:31,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 299 transitions. [2022-02-15 04:27:31,833 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 299 transitions. Word has length 21 [2022-02-15 04:27:31,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 04:27:31,834 INFO L470 AbstractCegarLoop]: Abstraction has 189 states and 299 transitions. [2022-02-15 04:27:31,834 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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-02-15 04:27:31,834 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 299 transitions. [2022-02-15 04:27:31,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-02-15 04:27:31,834 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 04:27:31,834 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, 1] [2022-02-15 04:27:31,834 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-15 04:27:31,834 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 04:27:31,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 04:27:31,835 INFO L85 PathProgramCache]: Analyzing trace with hash -21549649, now seen corresponding path program 1 times [2022-02-15 04:27:31,835 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 04:27:31,835 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [108229497] [2022-02-15 04:27:31,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 04:27:31,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 04:27:31,836 INFO L274 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-15 04:27:31,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 04:27:31,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 04:27:31,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 04:27:31,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 04:27:31,858 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 04:27:31,859 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [108229497] [2022-02-15 04:27:31,859 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [108229497] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 04:27:31,859 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 04:27:31,859 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-15 04:27:31,859 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17269267] [2022-02-15 04:27:31,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 04:27:31,859 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-15 04:27:31,859 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 04:27:31,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-15 04:27:31,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-15 04:27:31,860 INFO L87 Difference]: Start difference. First operand 189 states and 299 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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-02-15 04:27:31,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 04:27:31,916 INFO L93 Difference]: Finished difference Result 333 states and 533 transitions. [2022-02-15 04:27:31,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-15 04:27:31,916 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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 21 [2022-02-15 04:27:31,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 04:27:31,917 INFO L225 Difference]: With dead ends: 333 [2022-02-15 04:27:31,917 INFO L226 Difference]: Without dead ends: 331 [2022-02-15 04:27:31,918 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-02-15 04:27:31,918 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 96 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-15 04:27:31,918 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [96 Valid, 57 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-15 04:27:31,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2022-02-15 04:27:31,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 265. [2022-02-15 04:27:31,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 261 states have (on average 1.5632183908045978) internal successors, (408), 261 states have internal predecessors, (408), 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-02-15 04:27:31,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 411 transitions. [2022-02-15 04:27:31,932 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 411 transitions. Word has length 21 [2022-02-15 04:27:31,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 04:27:31,932 INFO L470 AbstractCegarLoop]: Abstraction has 265 states and 411 transitions. [2022-02-15 04:27:31,932 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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-02-15 04:27:31,932 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 411 transitions. [2022-02-15 04:27:31,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-02-15 04:27:31,933 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 04:27:31,933 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, 1] [2022-02-15 04:27:31,933 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-15 04:27:31,933 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 04:27:31,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 04:27:31,933 INFO L85 PathProgramCache]: Analyzing trace with hash -414576659, now seen corresponding path program 1 times [2022-02-15 04:27:31,933 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 04:27:31,934 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1031425657] [2022-02-15 04:27:31,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 04:27:31,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 04:27:31,935 INFO L274 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-15 04:27:31,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 04:27:31,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 04:27:31,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 04:27:31,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 04:27:31,953 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 04:27:31,954 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1031425657] [2022-02-15 04:27:31,954 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1031425657] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 04:27:31,954 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 04:27:31,954 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-15 04:27:31,954 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712319924] [2022-02-15 04:27:31,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 04:27:31,954 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-15 04:27:31,954 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 04:27:31,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-15 04:27:31,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-15 04:27:31,955 INFO L87 Difference]: Start difference. First operand 265 states and 411 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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-02-15 04:27:32,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 04:27:32,013 INFO L93 Difference]: Finished difference Result 605 states and 941 transitions. [2022-02-15 04:27:32,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-15 04:27:32,014 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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 21 [2022-02-15 04:27:32,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 04:27:32,015 INFO L225 Difference]: With dead ends: 605 [2022-02-15 04:27:32,015 INFO L226 Difference]: Without dead ends: 355 [2022-02-15 04:27:32,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-02-15 04:27:32,016 INFO L933 BasicCegarLoop]: 70 mSDtfsCounter, 85 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-15 04:27:32,016 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [85 Valid, 77 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-15 04:27:32,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2022-02-15 04:27:32,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 353. [2022-02-15 04:27:32,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 349 states have (on average 1.524355300859599) internal successors, (532), 349 states have internal predecessors, (532), 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-02-15 04:27:32,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 535 transitions. [2022-02-15 04:27:32,035 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 535 transitions. Word has length 21 [2022-02-15 04:27:32,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 04:27:32,035 INFO L470 AbstractCegarLoop]: Abstraction has 353 states and 535 transitions. [2022-02-15 04:27:32,035 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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-02-15 04:27:32,035 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 535 transitions. [2022-02-15 04:27:32,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-02-15 04:27:32,036 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 04:27:32,036 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, 1, 1] [2022-02-15 04:27:32,036 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-15 04:27:32,036 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 04:27:32,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 04:27:32,036 INFO L85 PathProgramCache]: Analyzing trace with hash -667823741, now seen corresponding path program 1 times [2022-02-15 04:27:32,037 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 04:27:32,037 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1687224147] [2022-02-15 04:27:32,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 04:27:32,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 04:27:32,038 INFO L274 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-15 04:27:32,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 04:27:32,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 04:27:32,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 04:27:32,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 04:27:32,056 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 04:27:32,056 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1687224147] [2022-02-15 04:27:32,056 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1687224147] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 04:27:32,057 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 04:27:32,057 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-15 04:27:32,057 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082325067] [2022-02-15 04:27:32,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 04:27:32,057 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-15 04:27:32,057 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 04:27:32,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-15 04:27:32,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-15 04:27:32,057 INFO L87 Difference]: Start difference. First operand 353 states and 535 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 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-02-15 04:27:32,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 04:27:32,115 INFO L93 Difference]: Finished difference Result 529 states and 797 transitions. [2022-02-15 04:27:32,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-15 04:27:32,115 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 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 22 [2022-02-15 04:27:32,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 04:27:32,117 INFO L225 Difference]: With dead ends: 529 [2022-02-15 04:27:32,117 INFO L226 Difference]: Without dead ends: 363 [2022-02-15 04:27:32,117 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-02-15 04:27:32,118 INFO L933 BasicCegarLoop]: 67 mSDtfsCounter, 89 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-15 04:27:32,118 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [89 Valid, 74 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-15 04:27:32,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2022-02-15 04:27:32,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 361. [2022-02-15 04:27:32,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 357 states have (on average 1.4901960784313726) internal successors, (532), 357 states have internal predecessors, (532), 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-02-15 04:27:32,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 535 transitions. [2022-02-15 04:27:32,137 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 535 transitions. Word has length 22 [2022-02-15 04:27:32,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 04:27:32,137 INFO L470 AbstractCegarLoop]: Abstraction has 361 states and 535 transitions. [2022-02-15 04:27:32,137 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 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-02-15 04:27:32,137 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 535 transitions. [2022-02-15 04:27:32,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-02-15 04:27:32,138 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 04:27:32,138 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, 1, 1] [2022-02-15 04:27:32,138 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-15 04:27:32,138 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 04:27:32,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 04:27:32,139 INFO L85 PathProgramCache]: Analyzing trace with hash 33240837, now seen corresponding path program 1 times [2022-02-15 04:27:32,139 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 04:27:32,139 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1662368903] [2022-02-15 04:27:32,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 04:27:32,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 04:27:32,140 INFO L274 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-15 04:27:32,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 04:27:32,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 04:27:32,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 04:27:32,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 04:27:32,159 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 04:27:32,159 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1662368903] [2022-02-15 04:27:32,159 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1662368903] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 04:27:32,159 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 04:27:32,159 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-15 04:27:32,159 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497261846] [2022-02-15 04:27:32,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 04:27:32,159 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-15 04:27:32,159 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 04:27:32,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-15 04:27:32,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-15 04:27:32,160 INFO L87 Difference]: Start difference. First operand 361 states and 535 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 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-02-15 04:27:32,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 04:27:32,255 INFO L93 Difference]: Finished difference Result 621 states and 929 transitions. [2022-02-15 04:27:32,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-15 04:27:32,255 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 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 22 [2022-02-15 04:27:32,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 04:27:32,257 INFO L225 Difference]: With dead ends: 621 [2022-02-15 04:27:32,257 INFO L226 Difference]: Without dead ends: 619 [2022-02-15 04:27:32,257 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-02-15 04:27:32,258 INFO L933 BasicCegarLoop]: 49 mSDtfsCounter, 89 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-15 04:27:32,258 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [89 Valid, 56 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-15 04:27:32,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2022-02-15 04:27:32,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 521. [2022-02-15 04:27:32,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 521 states, 517 states have (on average 1.446808510638298) internal successors, (748), 517 states have internal predecessors, (748), 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-02-15 04:27:32,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 751 transitions. [2022-02-15 04:27:32,286 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 751 transitions. Word has length 22 [2022-02-15 04:27:32,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 04:27:32,286 INFO L470 AbstractCegarLoop]: Abstraction has 521 states and 751 transitions. [2022-02-15 04:27:32,286 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 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-02-15 04:27:32,286 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 751 transitions. [2022-02-15 04:27:32,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-02-15 04:27:32,287 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 04:27:32,287 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, 1, 1] [2022-02-15 04:27:32,287 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-02-15 04:27:32,287 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 04:27:32,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 04:27:32,287 INFO L85 PathProgramCache]: Analyzing trace with hash -359786173, now seen corresponding path program 1 times [2022-02-15 04:27:32,287 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 04:27:32,287 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1756437560] [2022-02-15 04:27:32,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 04:27:32,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 04:27:32,288 INFO L274 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-15 04:27:32,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 04:27:32,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 04:27:32,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 04:27:32,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 04:27:32,311 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 04:27:32,311 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1756437560] [2022-02-15 04:27:32,311 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1756437560] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 04:27:32,311 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 04:27:32,311 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-15 04:27:32,311 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474299688] [2022-02-15 04:27:32,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 04:27:32,311 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-15 04:27:32,312 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 04:27:32,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-15 04:27:32,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-15 04:27:32,312 INFO L87 Difference]: Start difference. First operand 521 states and 751 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 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-02-15 04:27:32,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 04:27:32,414 INFO L93 Difference]: Finished difference Result 1181 states and 1697 transitions. [2022-02-15 04:27:32,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-15 04:27:32,415 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 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 22 [2022-02-15 04:27:32,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 04:27:32,417 INFO L225 Difference]: With dead ends: 1181 [2022-02-15 04:27:32,417 INFO L226 Difference]: Without dead ends: 683 [2022-02-15 04:27:32,417 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-02-15 04:27:32,418 INFO L933 BasicCegarLoop]: 72 mSDtfsCounter, 79 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-15 04:27:32,418 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [79 Valid, 79 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-15 04:27:32,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2022-02-15 04:27:32,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 681. [2022-02-15 04:27:32,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 681 states, 677 states have (on average 1.4002954209748892) internal successors, (948), 677 states have internal predecessors, (948), 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-02-15 04:27:32,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 681 states to 681 states and 951 transitions. [2022-02-15 04:27:32,457 INFO L78 Accepts]: Start accepts. Automaton has 681 states and 951 transitions. Word has length 22 [2022-02-15 04:27:32,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 04:27:32,458 INFO L470 AbstractCegarLoop]: Abstraction has 681 states and 951 transitions. [2022-02-15 04:27:32,458 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 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-02-15 04:27:32,458 INFO L276 IsEmpty]: Start isEmpty. Operand 681 states and 951 transitions. [2022-02-15 04:27:32,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-02-15 04:27:32,458 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 04:27:32,459 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, 1, 1, 1] [2022-02-15 04:27:32,459 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-02-15 04:27:32,459 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 04:27:32,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 04:27:32,459 INFO L85 PathProgramCache]: Analyzing trace with hash 1030681666, now seen corresponding path program 1 times [2022-02-15 04:27:32,459 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 04:27:32,459 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1240941487] [2022-02-15 04:27:32,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 04:27:32,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 04:27:32,460 INFO L274 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-15 04:27:32,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 04:27:32,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 04:27:32,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 04:27:32,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 04:27:32,478 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 04:27:32,478 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1240941487] [2022-02-15 04:27:32,478 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1240941487] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 04:27:32,478 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 04:27:32,478 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-15 04:27:32,478 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001521933] [2022-02-15 04:27:32,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 04:27:32,478 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-15 04:27:32,478 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 04:27:32,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-15 04:27:32,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-15 04:27:32,479 INFO L87 Difference]: Start difference. First operand 681 states and 951 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 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-02-15 04:27:32,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 04:27:32,577 INFO L93 Difference]: Finished difference Result 1021 states and 1417 transitions. [2022-02-15 04:27:32,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-15 04:27:32,578 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 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 23 [2022-02-15 04:27:32,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 04:27:32,580 INFO L225 Difference]: With dead ends: 1021 [2022-02-15 04:27:32,580 INFO L226 Difference]: Without dead ends: 699 [2022-02-15 04:27:32,581 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-02-15 04:27:32,581 INFO L933 BasicCegarLoop]: 64 mSDtfsCounter, 88 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-15 04:27:32,581 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [88 Valid, 71 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-15 04:27:32,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2022-02-15 04:27:32,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 697. [2022-02-15 04:27:32,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 697 states, 693 states have (on average 1.367965367965368) internal successors, (948), 693 states have internal predecessors, (948), 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-02-15 04:27:32,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 951 transitions. [2022-02-15 04:27:32,618 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 951 transitions. Word has length 23 [2022-02-15 04:27:32,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 04:27:32,619 INFO L470 AbstractCegarLoop]: Abstraction has 697 states and 951 transitions. [2022-02-15 04:27:32,619 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 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-02-15 04:27:32,619 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 951 transitions. [2022-02-15 04:27:32,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-02-15 04:27:32,619 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 04:27:32,620 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, 1, 1, 1] [2022-02-15 04:27:32,620 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-02-15 04:27:32,620 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 04:27:32,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 04:27:32,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1731746244, now seen corresponding path program 1 times [2022-02-15 04:27:32,620 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 04:27:32,620 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1949640428] [2022-02-15 04:27:32,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 04:27:32,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 04:27:32,621 INFO L274 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-15 04:27:32,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 04:27:32,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 04:27:32,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 04:27:32,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 04:27:32,640 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 04:27:32,640 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1949640428] [2022-02-15 04:27:32,640 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1949640428] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 04:27:32,640 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 04:27:32,641 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-15 04:27:32,641 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583620642] [2022-02-15 04:27:32,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 04:27:32,641 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-15 04:27:32,641 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 04:27:32,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-15 04:27:32,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-15 04:27:32,641 INFO L87 Difference]: Start difference. First operand 697 states and 951 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 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-02-15 04:27:32,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 04:27:32,738 INFO L93 Difference]: Finished difference Result 1165 states and 1593 transitions. [2022-02-15 04:27:32,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-15 04:27:32,738 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 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 23 [2022-02-15 04:27:32,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 04:27:32,741 INFO L225 Difference]: With dead ends: 1165 [2022-02-15 04:27:32,741 INFO L226 Difference]: Without dead ends: 1163 [2022-02-15 04:27:32,742 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-02-15 04:27:32,742 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 82 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 55 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-02-15 04:27:32,742 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [82 Valid, 55 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-15 04:27:32,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1163 states. [2022-02-15 04:27:32,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1163 to 1033. [2022-02-15 04:27:32,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1033 states, 1029 states have (on average 1.3255587949465502) internal successors, (1364), 1029 states have internal predecessors, (1364), 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-02-15 04:27:32,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1033 states to 1033 states and 1367 transitions. [2022-02-15 04:27:32,825 INFO L78 Accepts]: Start accepts. Automaton has 1033 states and 1367 transitions. Word has length 23 [2022-02-15 04:27:32,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 04:27:32,825 INFO L470 AbstractCegarLoop]: Abstraction has 1033 states and 1367 transitions. [2022-02-15 04:27:32,825 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 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-02-15 04:27:32,826 INFO L276 IsEmpty]: Start isEmpty. Operand 1033 states and 1367 transitions. [2022-02-15 04:27:32,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-02-15 04:27:32,827 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 04:27:32,827 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, 1, 1, 1] [2022-02-15 04:27:32,827 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-02-15 04:27:32,827 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 04:27:32,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 04:27:32,827 INFO L85 PathProgramCache]: Analyzing trace with hash 1338719234, now seen corresponding path program 1 times [2022-02-15 04:27:32,827 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 04:27:32,827 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1682534518] [2022-02-15 04:27:32,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 04:27:32,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 04:27:32,828 INFO L274 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-15 04:27:32,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 04:27:32,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 04:27:32,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 04:27:32,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 04:27:32,846 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 04:27:32,846 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1682534518] [2022-02-15 04:27:32,846 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1682534518] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 04:27:32,846 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 04:27:32,846 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-15 04:27:32,846 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127885564] [2022-02-15 04:27:32,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 04:27:32,847 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-15 04:27:32,847 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 04:27:32,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-15 04:27:32,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-15 04:27:32,847 INFO L87 Difference]: Start difference. First operand 1033 states and 1367 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 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-02-15 04:27:32,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 04:27:32,972 INFO L93 Difference]: Finished difference Result 2317 states and 3033 transitions. [2022-02-15 04:27:32,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-15 04:27:32,972 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 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 23 [2022-02-15 04:27:32,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 04:27:32,975 INFO L225 Difference]: With dead ends: 2317 [2022-02-15 04:27:32,975 INFO L226 Difference]: Without dead ends: 1323 [2022-02-15 04:27:32,977 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-02-15 04:27:32,977 INFO L933 BasicCegarLoop]: 74 mSDtfsCounter, 73 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-15 04:27:32,978 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [73 Valid, 81 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-15 04:27:32,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1323 states. [2022-02-15 04:27:33,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1323 to 1321. [2022-02-15 04:27:33,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1321 states, 1317 states have (on average 1.2665148063781322) internal successors, (1668), 1317 states have internal predecessors, (1668), 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-02-15 04:27:33,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1321 states to 1321 states and 1671 transitions. [2022-02-15 04:27:33,059 INFO L78 Accepts]: Start accepts. Automaton has 1321 states and 1671 transitions. Word has length 23 [2022-02-15 04:27:33,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 04:27:33,059 INFO L470 AbstractCegarLoop]: Abstraction has 1321 states and 1671 transitions. [2022-02-15 04:27:33,059 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 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-02-15 04:27:33,059 INFO L276 IsEmpty]: Start isEmpty. Operand 1321 states and 1671 transitions. [2022-02-15 04:27:33,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-02-15 04:27:33,060 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 04:27:33,060 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, 1, 1, 1, 1] [2022-02-15 04:27:33,060 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-02-15 04:27:33,060 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 04:27:33,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 04:27:33,061 INFO L85 PathProgramCache]: Analyzing trace with hash 2144742072, now seen corresponding path program 1 times [2022-02-15 04:27:33,061 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 04:27:33,061 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [83383020] [2022-02-15 04:27:33,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 04:27:33,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 04:27:33,062 INFO L274 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-15 04:27:33,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 04:27:33,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 04:27:33,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 04:27:33,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 04:27:33,078 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 04:27:33,078 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [83383020] [2022-02-15 04:27:33,078 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [83383020] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 04:27:33,078 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 04:27:33,078 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-15 04:27:33,078 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205341523] [2022-02-15 04:27:33,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 04:27:33,079 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-15 04:27:33,079 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 04:27:33,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-15 04:27:33,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-15 04:27:33,079 INFO L87 Difference]: Start difference. First operand 1321 states and 1671 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 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-02-15 04:27:33,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 04:27:33,208 INFO L93 Difference]: Finished difference Result 1981 states and 2489 transitions. [2022-02-15 04:27:33,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-15 04:27:33,208 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 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 24 [2022-02-15 04:27:33,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 04:27:33,211 INFO L225 Difference]: With dead ends: 1981 [2022-02-15 04:27:33,211 INFO L226 Difference]: Without dead ends: 1355 [2022-02-15 04:27:33,213 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-02-15 04:27:33,213 INFO L933 BasicCegarLoop]: 61 mSDtfsCounter, 87 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-15 04:27:33,213 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [87 Valid, 68 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-15 04:27:33,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1355 states. [2022-02-15 04:27:33,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1355 to 1353. [2022-02-15 04:27:33,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1353 states, 1349 states have (on average 1.2364714603409934) internal successors, (1668), 1349 states have internal predecessors, (1668), 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-02-15 04:27:33,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1353 states to 1353 states and 1671 transitions. [2022-02-15 04:27:33,295 INFO L78 Accepts]: Start accepts. Automaton has 1353 states and 1671 transitions. Word has length 24 [2022-02-15 04:27:33,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 04:27:33,295 INFO L470 AbstractCegarLoop]: Abstraction has 1353 states and 1671 transitions. [2022-02-15 04:27:33,296 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 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-02-15 04:27:33,296 INFO L276 IsEmpty]: Start isEmpty. Operand 1353 states and 1671 transitions. [2022-02-15 04:27:33,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-02-15 04:27:33,297 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 04:27:33,297 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, 1, 1, 1, 1] [2022-02-15 04:27:33,297 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-02-15 04:27:33,297 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 04:27:33,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 04:27:33,298 INFO L85 PathProgramCache]: Analyzing trace with hash -1449160646, now seen corresponding path program 1 times [2022-02-15 04:27:33,298 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 04:27:33,298 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1921608386] [2022-02-15 04:27:33,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 04:27:33,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 04:27:33,299 INFO L274 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-15 04:27:33,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 04:27:33,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 04:27:33,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 04:27:33,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 04:27:33,314 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 04:27:33,314 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1921608386] [2022-02-15 04:27:33,314 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1921608386] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 04:27:33,314 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 04:27:33,314 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-15 04:27:33,314 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029317211] [2022-02-15 04:27:33,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 04:27:33,315 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-15 04:27:33,315 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 04:27:33,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-15 04:27:33,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-15 04:27:33,315 INFO L87 Difference]: Start difference. First operand 1353 states and 1671 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 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-02-15 04:27:33,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 04:27:33,490 INFO L93 Difference]: Finished difference Result 2187 states and 2664 transitions. [2022-02-15 04:27:33,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-15 04:27:33,490 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 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 24 [2022-02-15 04:27:33,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 04:27:33,495 INFO L225 Difference]: With dead ends: 2187 [2022-02-15 04:27:33,495 INFO L226 Difference]: Without dead ends: 2185 [2022-02-15 04:27:33,496 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-02-15 04:27:33,496 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 74 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-15 04:27:33,496 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [74 Valid, 53 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-15 04:27:33,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2185 states. [2022-02-15 04:27:33,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2185 to 2057. [2022-02-15 04:27:33,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2057 states, 2053 states have (on average 1.2021432050657574) internal successors, (2468), 2053 states have internal predecessors, (2468), 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-02-15 04:27:33,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2057 states to 2057 states and 2471 transitions. [2022-02-15 04:27:33,647 INFO L78 Accepts]: Start accepts. Automaton has 2057 states and 2471 transitions. Word has length 24 [2022-02-15 04:27:33,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 04:27:33,647 INFO L470 AbstractCegarLoop]: Abstraction has 2057 states and 2471 transitions. [2022-02-15 04:27:33,647 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 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-02-15 04:27:33,647 INFO L276 IsEmpty]: Start isEmpty. Operand 2057 states and 2471 transitions. [2022-02-15 04:27:33,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-02-15 04:27:33,650 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 04:27:33,650 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, 1, 1, 1, 1] [2022-02-15 04:27:33,650 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-02-15 04:27:33,651 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 04:27:33,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 04:27:33,651 INFO L85 PathProgramCache]: Analyzing trace with hash -1842187656, now seen corresponding path program 1 times [2022-02-15 04:27:33,651 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 04:27:33,651 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1033828432] [2022-02-15 04:27:33,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 04:27:33,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 04:27:33,652 INFO L274 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-15 04:27:33,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 04:27:33,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 04:27:33,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 04:27:33,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 04:27:33,675 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 04:27:33,675 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1033828432] [2022-02-15 04:27:33,675 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1033828432] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 04:27:33,675 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 04:27:33,675 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-15 04:27:33,675 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992053632] [2022-02-15 04:27:33,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 04:27:33,676 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-15 04:27:33,676 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 04:27:33,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-15 04:27:33,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-15 04:27:33,676 INFO L87 Difference]: Start difference. First operand 2057 states and 2471 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 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-02-15 04:27:33,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 04:27:33,869 INFO L93 Difference]: Finished difference Result 4553 states and 5351 transitions. [2022-02-15 04:27:33,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-15 04:27:33,869 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 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 24 [2022-02-15 04:27:33,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 04:27:33,870 INFO L225 Difference]: With dead ends: 4553 [2022-02-15 04:27:33,870 INFO L226 Difference]: Without dead ends: 0 [2022-02-15 04:27:33,876 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-02-15 04:27:33,876 INFO L933 BasicCegarLoop]: 75 mSDtfsCounter, 64 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-15 04:27:33,877 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 82 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-15 04:27:33,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-02-15 04:27:33,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-02-15 04:27:33,877 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-02-15 04:27:33,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-02-15 04:27:33,877 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 24 [2022-02-15 04:27:33,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 04:27:33,877 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-15 04:27:33,877 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 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-02-15 04:27:33,878 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-15 04:27:33,878 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-15 04:27:33,879 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-15 04:27:33,880 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-02-15 04:27:33,881 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-02-15 04:28:00,999 INFO L858 garLoopResultBuilder]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2022-02-15 04:28:00,999 INFO L858 garLoopResultBuilder]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2022-02-15 04:28:00,999 INFO L858 garLoopResultBuilder]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2022-02-15 04:28:00,999 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-02-15 04:28:00,999 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-02-15 04:28:00,999 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-02-15 04:28:00,999 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-02-15 04:28:00,999 INFO L861 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-02-15 04:28:00,999 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-02-15 04:28:00,999 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-02-15 04:28:00,999 INFO L854 garLoopResultBuilder]: At program point L93-1(lines 32 118) the Hoare annotation is: (let ((.cse0 (= main_~lk5~0 1)) (.cse2 (= main_~p7~0 0)) (.cse1 (= main_~lk4~0 1)) (.cse3 (= main_~p6~0 0)) (.cse4 (= main_~lk7~0 1)) (.cse5 (= main_~p4~0 0)) (.cse7 (= main_~p5~0 0)) (.cse6 (= main_~lk6~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse0 .cse3) (and .cse0 .cse1 .cse2 .cse6) (and .cse4 .cse0 .cse1 .cse3) (and .cse5 .cse2 .cse7 .cse6) (and .cse4 .cse0 .cse1 .cse6) (and .cse5 .cse0 .cse2 .cse3) (and .cse5 .cse2 .cse7 .cse3) (and .cse1 .cse2 .cse7 .cse6) (and .cse4 .cse5 .cse7 .cse3) (and .cse4 .cse5 .cse0 .cse6) (and .cse1 .cse2 .cse7 .cse3) (and .cse4 .cse1 .cse7 .cse6) (and .cse5 .cse0 .cse2 .cse6) (and .cse4 .cse1 .cse7 .cse3) (and .cse4 .cse5 .cse7 .cse6))) [2022-02-15 04:28:01,000 INFO L861 garLoopResultBuilder]: At program point mainEXIT(lines 6 123) the Hoare annotation is: true [2022-02-15 04:28:01,000 INFO L854 garLoopResultBuilder]: At program point L77-1(lines 32 118) the Hoare annotation is: (let ((.cse9 (= main_~lk3~0 1)) (.cse7 (= main_~lk5~0 1)) (.cse8 (= main_~lk1~0 1)) (.cse11 (= main_~lk4~0 1)) (.cse2 (= main_~p7~0 0)) (.cse13 (= main_~p2~0 0)) (.cse4 (= main_~lk6~0 1)) (.cse12 (= main_~lk7~0 1)) (.cse0 (= main_~p4~0 0)) (.cse1 (= main_~p1~0 0)) (.cse3 (= main_~p5~0 0)) (.cse10 (= main_~p6~0 0)) (.cse5 (= main_~p3~0 0)) (.cse6 (= main_~lk2~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse7 .cse8 .cse9 .cse2 .cse10 .cse6) (and .cse7 .cse11 .cse1 .cse2 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse11 .cse2 .cse4 .cse5 .cse6) (and .cse12 .cse11 .cse1 .cse3 .cse13 .cse4 .cse5) (and .cse12 .cse8 .cse11 .cse3 .cse13 .cse4 .cse5) (and .cse8 .cse11 .cse9 .cse2 .cse3 .cse13 .cse4) (and .cse0 .cse8 .cse2 .cse3 .cse13 .cse10 .cse5) (and .cse12 .cse7 .cse11 .cse9 .cse1 .cse13 .cse10) (and .cse12 .cse0 .cse8 .cse9 .cse3 .cse10 .cse6) (and .cse0 .cse8 .cse9 .cse2 .cse3 .cse4 .cse6) (and .cse7 .cse8 .cse11 .cse9 .cse2 .cse13 .cse4) (and .cse7 .cse11 .cse9 .cse1 .cse2 .cse13 .cse4) (and .cse12 .cse8 .cse11 .cse9 .cse3 .cse10 .cse6) (and .cse7 .cse8 .cse11 .cse2 .cse13 .cse4 .cse5) (and .cse8 .cse11 .cse9 .cse2 .cse3 .cse13 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse13 .cse10 .cse5) (and .cse12 .cse0 .cse7 .cse1 .cse13 .cse4 .cse5) (and .cse8 .cse11 .cse9 .cse2 .cse3 .cse4 .cse6) (and .cse0 .cse7 .cse8 .cse2 .cse4 .cse5 .cse6) (and .cse0 .cse9 .cse1 .cse2 .cse3 .cse13 .cse10) (and .cse12 .cse0 .cse7 .cse9 .cse1 .cse13 .cse4) (and .cse0 .cse7 .cse1 .cse2 .cse13 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse13 .cse4 .cse5) (and .cse12 .cse0 .cse8 .cse3 .cse4 .cse5 .cse6) (and .cse12 .cse0 .cse7 .cse1 .cse4 .cse5 .cse6) (and .cse11 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse8 .cse9 .cse2 .cse3 .cse13 .cse4) (and .cse12 .cse7 .cse11 .cse1 .cse13 .cse10 .cse5) (and .cse12 .cse7 .cse11 .cse1 .cse13 .cse4 .cse5) (and .cse12 .cse0 .cse7 .cse9 .cse1 .cse4 .cse6) (and .cse0 .cse9 .cse1 .cse2 .cse3 .cse10 .cse6) (and .cse12 .cse7 .cse11 .cse9 .cse1 .cse4 .cse6) (and .cse12 .cse0 .cse7 .cse8 .cse9 .cse4 .cse6) (and .cse7 .cse11 .cse9 .cse1 .cse2 .cse4 .cse6) (and .cse12 .cse7 .cse8 .cse11 .cse13 .cse10 .cse5) (and .cse12 .cse0 .cse8 .cse3 .cse13 .cse10 .cse5) (and .cse12 .cse0 .cse9 .cse1 .cse3 .cse13 .cse4) (and .cse0 .cse8 .cse2 .cse3 .cse13 .cse4 .cse5) (and .cse12 .cse0 .cse8 .cse3 .cse13 .cse4 .cse5) (and .cse12 .cse11 .cse1 .cse3 .cse13 .cse10 .cse5) (and .cse12 .cse11 .cse9 .cse1 .cse3 .cse4 .cse6) (and .cse0 .cse7 .cse1 .cse2 .cse10 .cse5 .cse6) (and .cse0 .cse7 .cse9 .cse1 .cse2 .cse10 .cse6) (and .cse11 .cse1 .cse2 .cse3 .cse10 .cse5 .cse6) (and .cse12 .cse7 .cse8 .cse11 .cse9 .cse10 .cse6) (and .cse11 .cse1 .cse2 .cse3 .cse13 .cse4 .cse5) (and .cse12 .cse8 .cse11 .cse9 .cse3 .cse4 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse10 .cse5 .cse6) (and .cse12 .cse0 .cse9 .cse1 .cse3 .cse4 .cse6) (and .cse12 .cse7 .cse8 .cse11 .cse9 .cse13 .cse4) (and .cse12 .cse0 .cse7 .cse8 .cse13 .cse4 .cse5) (and .cse0 .cse7 .cse9 .cse1 .cse2 .cse13 .cse10) (and .cse12 .cse0 .cse8 .cse9 .cse3 .cse13 .cse4) (and .cse0 .cse7 .cse8 .cse9 .cse2 .cse4 .cse6) (and .cse11 .cse9 .cse1 .cse2 .cse3 .cse4 .cse6) (and .cse0 .cse7 .cse1 .cse2 .cse13 .cse10 .cse5) (and .cse12 .cse0 .cse7 .cse9 .cse1 .cse13 .cse10) (and .cse0 .cse7 .cse9 .cse1 .cse2 .cse4 .cse6) (and .cse8 .cse11 .cse2 .cse3 .cse13 .cse10 .cse5) (and .cse12 .cse0 .cse7 .cse8 .cse9 .cse10 .cse6) (and .cse0 .cse9 .cse1 .cse2 .cse3 .cse13 .cse4) (and .cse12 .cse0 .cse7 .cse8 .cse10 .cse5 .cse6) (and .cse7 .cse11 .cse1 .cse2 .cse13 .cse10 .cse5) (and .cse11 .cse9 .cse1 .cse2 .cse3 .cse13 .cse4) (and .cse12 .cse8 .cse11 .cse3 .cse10 .cse5 .cse6) (and .cse7 .cse11 .cse9 .cse1 .cse2 .cse13 .cse10) (and .cse11 .cse1 .cse2 .cse3 .cse13 .cse10 .cse5) (and .cse12 .cse0 .cse7 .cse8 .cse9 .cse13 .cse4) (and .cse0 .cse8 .cse9 .cse2 .cse3 .cse13 .cse10) (and .cse0 .cse8 .cse9 .cse2 .cse3 .cse10 .cse6) (and .cse12 .cse7 .cse8 .cse11 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse11 .cse9 .cse2 .cse10 .cse6) (and .cse0 .cse8 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse12 .cse7 .cse11 .cse9 .cse1 .cse10 .cse6) (and .cse12 .cse0 .cse1 .cse3 .cse13 .cse4 .cse5) (and .cse0 .cse9 .cse1 .cse2 .cse3 .cse4 .cse6) (and .cse12 .cse7 .cse11 .cse9 .cse1 .cse13 .cse4) (and .cse12 .cse8 .cse11 .cse3 .cse13 .cse10 .cse5) (and .cse12 .cse11 .cse9 .cse1 .cse3 .cse10 .cse6) (and .cse12 .cse0 .cse7 .cse9 .cse1 .cse10 .cse6) (and .cse7 .cse11 .cse9 .cse1 .cse2 .cse10 .cse6) (and .cse12 .cse7 .cse8 .cse11 .cse13 .cse4 .cse5) (and .cse12 .cse11 .cse1 .cse3 .cse10 .cse5 .cse6) (and .cse7 .cse8 .cse11 .cse9 .cse2 .cse4 .cse6) (and .cse12 .cse0 .cse8 .cse9 .cse3 .cse4 .cse6) (and .cse7 .cse11 .cse1 .cse2 .cse13 .cse4 .cse5) (and .cse0 .cse7 .cse8 .cse2 .cse10 .cse5 .cse6) (and .cse12 .cse0 .cse9 .cse1 .cse3 .cse10 .cse6) (and .cse12 .cse0 .cse8 .cse3 .cse10 .cse5 .cse6) (and .cse12 .cse0 .cse1 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse7 .cse9 .cse1 .cse2 .cse13 .cse4) (and .cse8 .cse11 .cse9 .cse2 .cse3 .cse10 .cse6) (and .cse12 .cse11 .cse9 .cse1 .cse3 .cse13 .cse10) (and .cse7 .cse8 .cse11 .cse2 .cse13 .cse10 .cse5) (and .cse12 .cse8 .cse11 .cse3 .cse4 .cse5 .cse6) (and .cse12 .cse0 .cse1 .cse3 .cse13 .cse10 .cse5) (and .cse0 .cse7 .cse8 .cse9 .cse2 .cse13 .cse4) (and .cse12 .cse8 .cse11 .cse9 .cse3 .cse13 .cse4) (and .cse12 .cse0 .cse7 .cse8 .cse9 .cse13 .cse10) (and .cse0 .cse7 .cse1 .cse2 .cse4 .cse5 .cse6) (and .cse12 .cse7 .cse11 .cse1 .cse4 .cse5 .cse6) (and .cse12 .cse11 .cse1 .cse3 .cse4 .cse5 .cse6) (and .cse12 .cse0 .cse9 .cse1 .cse3 .cse13 .cse10) (and .cse12 .cse7 .cse8 .cse11 .cse10 .cse5 .cse6) (and .cse12 .cse7 .cse8 .cse11 .cse9 .cse13 .cse10) (and .cse12 .cse0 .cse7 .cse8 .cse4 .cse5 .cse6) (and .cse7 .cse11 .cse1 .cse2 .cse10 .cse5 .cse6) (and .cse12 .cse0 .cse7 .cse1 .cse13 .cse10 .cse5) (and .cse8 .cse11 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse7 .cse8 .cse2 .cse13 .cse4 .cse5) (and .cse7 .cse8 .cse11 .cse9 .cse2 .cse13 .cse10) (and .cse12 .cse7 .cse8 .cse11 .cse9 .cse4 .cse6) (and .cse11 .cse9 .cse1 .cse2 .cse3 .cse10 .cse6) (and .cse11 .cse9 .cse1 .cse2 .cse3 .cse13 .cse10) (and .cse12 .cse0 .cse7 .cse1 .cse10 .cse5 .cse6) (and .cse0 .cse7 .cse8 .cse9 .cse2 .cse13 .cse10) (and .cse0 .cse8 .cse2 .cse3 .cse10 .cse5 .cse6) (and .cse12 .cse0 .cse8 .cse9 .cse3 .cse13 .cse10) (and .cse12 .cse11 .cse9 .cse1 .cse3 .cse13 .cse4) (and .cse12 .cse7 .cse11 .cse1 .cse10 .cse5 .cse6) (and .cse12 .cse0 .cse7 .cse8 .cse13 .cse10 .cse5) (and .cse0 .cse7 .cse8 .cse2 .cse13 .cse10 .cse5) (and .cse12 .cse8 .cse11 .cse9 .cse3 .cse13 .cse10) (and .cse7 .cse8 .cse11 .cse2 .cse10 .cse5 .cse6) (and .cse8 .cse11 .cse2 .cse3 .cse10 .cse5 .cse6) (and .cse8 .cse11 .cse2 .cse3 .cse13 .cse4 .cse5) (and .cse12 .cse0 .cse1 .cse3 .cse10 .cse5 .cse6))) [2022-02-15 04:28:01,001 INFO L854 garLoopResultBuilder]: At program point L69-1(lines 32 118) 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-02-15 04:28:01,001 INFO L854 garLoopResultBuilder]: At program point L94(line 94) the Hoare annotation is: (let ((.cse6 (= main_~p7~0 0)) (.cse2 (= main_~p4~0 0)) (.cse7 (= main_~p5~0 0)) (.cse8 (= main_~lk6~0 1)) (.cse0 (not (= main_~p3~0 0))) (.cse1 (= main_~lk7~0 1)) (.cse3 (= main_~lk5~0 1)) (.cse9 (= main_~lk4~0 1)) (.cse4 (= main_~lk3~0 1)) (.cse5 (= main_~p6~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse2 .cse4 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse8) (and .cse0 .cse1 .cse3 .cse9 .cse4 .cse8) (and .cse0 .cse2 .cse4 .cse6 .cse7 .cse5) (and .cse0 .cse9 .cse4 .cse6 .cse7 .cse8) (and .cse0 .cse2 .cse3 .cse4 .cse6 .cse5) (and .cse0 .cse1 .cse9 .cse4 .cse7 .cse5) (and .cse0 .cse3 .cse9 .cse4 .cse6 .cse8) (and .cse0 .cse1 .cse9 .cse4 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse4 .cse7 .cse5) (and .cse0 .cse2 .cse3 .cse4 .cse6 .cse8) (and .cse0 .cse3 .cse9 .cse4 .cse6 .cse5) (and .cse0 .cse9 .cse4 .cse6 .cse7 .cse5) (and .cse0 .cse1 .cse2 .cse4 .cse7 .cse8) (and .cse0 .cse1 .cse3 .cse9 .cse4 .cse5))) [2022-02-15 04:28:01,001 INFO L854 garLoopResultBuilder]: At program point L61-1(lines 32 118) 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-02-15 04:28:01,001 INFO L861 garLoopResultBuilder]: At program point L119(lines 7 123) the Hoare annotation is: true [2022-02-15 04:28:01,001 INFO L861 garLoopResultBuilder]: At program point L53(lines 53 55) the Hoare annotation is: true [2022-02-15 04:28:01,001 INFO L854 garLoopResultBuilder]: At program point L53-2(lines 32 118) the Hoare annotation is: (or (= main_~lk1~0 1) (= main_~p1~0 0)) [2022-02-15 04:28:01,001 INFO L854 garLoopResultBuilder]: At program point L103-1(lines 32 118) the Hoare annotation is: (let ((.cse1 (= main_~lk6~0 1)) (.cse0 (= main_~lk7~0 1)) (.cse2 (= main_~p7~0 0)) (.cse3 (= main_~p6~0 0))) (or (and .cse0 .cse1) (and .cse2 .cse1) (and .cse0 .cse3) (and .cse2 .cse3))) [2022-02-15 04:28:01,002 INFO L861 garLoopResultBuilder]: At program point mainFINAL(lines 6 123) the Hoare annotation is: true [2022-02-15 04:28:01,002 INFO L854 garLoopResultBuilder]: At program point L104(line 104) the Hoare annotation is: (let ((.cse3 (= main_~p6~0 0)) (.cse1 (= main_~lk7~0 1)) (.cse0 (not (= main_~p5~0 0))) (.cse2 (= main_~lk5~0 1)) (.cse4 (= main_~p7~0 0)) (.cse5 (= main_~lk6~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse2 .cse4 .cse3) (and .cse0 .cse1 .cse2 .cse5) (and .cse0 .cse2 .cse4 .cse5))) [2022-02-15 04:28:01,002 INFO L854 garLoopResultBuilder]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 121) the Hoare annotation is: false [2022-02-15 04:28:01,002 INFO L861 garLoopResultBuilder]: At program point mainENTRY(lines 6 123) the Hoare annotation is: true [2022-02-15 04:28:01,003 INFO L854 garLoopResultBuilder]: At program point L88-1(lines 32 118) the Hoare annotation is: (let ((.cse8 (= main_~p7~0 0)) (.cse6 (= main_~p5~0 0)) (.cse7 (= main_~p6~0 0)) (.cse1 (= main_~p4~0 0)) (.cse9 (= main_~lk3~0 1)) (.cse0 (= main_~lk7~0 1)) (.cse2 (= main_~lk5~0 1)) (.cse5 (= main_~lk4~0 1)) (.cse3 (= main_~lk6~0 1)) (.cse4 (= main_~p3~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse5 .cse6 .cse7 .cse4) (and .cse5 .cse8 .cse6 .cse3 .cse4) (and .cse2 .cse5 .cse9 .cse8 .cse7) (and .cse0 .cse2 .cse5 .cse7 .cse4) (and .cse0 .cse1 .cse9 .cse6 .cse3) (and .cse1 .cse2 .cse9 .cse8 .cse3) (and .cse2 .cse5 .cse8 .cse3 .cse4) (and .cse1 .cse8 .cse6 .cse3 .cse4) (and .cse1 .cse8 .cse6 .cse7 .cse4) (and .cse2 .cse5 .cse9 .cse8 .cse3) (and .cse0 .cse1 .cse2 .cse7 .cse4) (and .cse0 .cse1 .cse6 .cse7 .cse4) (and .cse1 .cse2 .cse8 .cse3 .cse4) (and .cse5 .cse8 .cse6 .cse7 .cse4) (and .cse0 .cse5 .cse9 .cse6 .cse7) (and .cse0 .cse5 .cse6 .cse3 .cse4) (and .cse0 .cse5 .cse9 .cse6 .cse3) (and .cse5 .cse9 .cse8 .cse6 .cse7) (and .cse0 .cse2 .cse5 .cse9 .cse3) (and .cse1 .cse9 .cse8 .cse6 .cse3) (and .cse1 .cse2 .cse8 .cse7 .cse4) (and .cse0 .cse2 .cse5 .cse9 .cse7) (and .cse5 .cse9 .cse8 .cse6 .cse3) (and .cse1 .cse2 .cse9 .cse8 .cse7) (and .cse0 .cse1 .cse2 .cse9 .cse7) (and .cse0 .cse1 .cse9 .cse6 .cse7) (and .cse2 .cse5 .cse8 .cse7 .cse4) (and .cse0 .cse1 .cse6 .cse3 .cse4) (and .cse1 .cse9 .cse8 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse9 .cse3) (and .cse0 .cse2 .cse5 .cse3 .cse4))) [2022-02-15 04:28:01,003 INFO L861 garLoopResultBuilder]: At program point L113-1(lines 32 118) the Hoare annotation is: true [2022-02-15 04:28:01,003 INFO L854 garLoopResultBuilder]: At program point L89(line 89) the Hoare annotation is: (let ((.cse4 (= main_~lk6~0 1)) (.cse6 (= main_~p4~0 0)) (.cse2 (= main_~lk3~0 1)) (.cse7 (= main_~lk5~0 1)) (.cse8 (= main_~p7~0 0)) (.cse0 (= main_~lk7~0 1)) (.cse1 (= main_~lk4~0 1)) (.cse3 (= main_~p5~0 0)) (.cse10 (= main_~p6~0 0)) (.cse9 (= main_~p3~0 0)) (.cse5 (= main_~lk2~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse7 .cse2 .cse8 .cse4 .cse5) (and .cse0 .cse1 .cse3 .cse4 .cse9 .cse5) (and .cse0 .cse6 .cse3 .cse4 .cse9 .cse5) (and .cse6 .cse2 .cse8 .cse3 .cse10 .cse5) (and .cse7 .cse1 .cse2 .cse8 .cse10 .cse5) (and .cse1 .cse2 .cse8 .cse3 .cse10 .cse5) (and .cse1 .cse8 .cse3 .cse4 .cse9 .cse5) (and .cse7 .cse1 .cse2 .cse8 .cse4 .cse5) (and .cse6 .cse7 .cse2 .cse8 .cse10 .cse5) (and .cse0 .cse7 .cse1 .cse2 .cse10 .cse5) (and .cse6 .cse7 .cse8 .cse10 .cse9 .cse5) (and .cse1 .cse8 .cse3 .cse10 .cse9 .cse5) (and .cse1 .cse2 .cse8 .cse3 .cse4 .cse5) (and .cse6 .cse8 .cse3 .cse4 .cse9 .cse5) (and .cse0 .cse6 .cse7 .cse2 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse10 .cse5) (and .cse6 .cse8 .cse3 .cse10 .cse9 .cse5) (and .cse0 .cse6 .cse7 .cse10 .cse9 .cse5) (and .cse6 .cse2 .cse8 .cse3 .cse4 .cse5) (and .cse0 .cse7 .cse1 .cse2 .cse4 .cse5) (and .cse0 .cse6 .cse7 .cse4 .cse9 .cse5) (and .cse0 .cse7 .cse1 .cse4 .cse9 .cse5) (and .cse0 .cse6 .cse3 .cse10 .cse9 .cse5) (and .cse0 .cse6 .cse2 .cse3 .cse10 .cse5) (and .cse0 .cse6 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse7 .cse1 .cse10 .cse9 .cse5) (and .cse6 .cse7 .cse8 .cse4 .cse9 .cse5) (and .cse7 .cse1 .cse8 .cse4 .cse9 .cse5) (and .cse0 .cse6 .cse7 .cse2 .cse10 .cse5) (and .cse7 .cse1 .cse8 .cse10 .cse9 .cse5) (and .cse0 .cse1 .cse3 .cse10 .cse9 .cse5))) [2022-02-15 04:28:01,003 INFO L854 garLoopResultBuilder]: At program point L114(line 114) the Hoare annotation is: (= main_~lk7~0 1) [2022-02-15 04:28:01,003 INFO L854 garLoopResultBuilder]: At program point L114-1(lines 7 123) the Hoare annotation is: false [2022-02-15 04:28:01,003 INFO L854 garLoopResultBuilder]: At program point L73-1(lines 32 118) the Hoare annotation is: (let ((.cse3 (= main_~p2~0 0)) (.cse7 (= main_~p4~0 0)) (.cse0 (= main_~lk5~0 1)) (.cse9 (= main_~p1~0 0)) (.cse4 (= main_~lk6~0 1)) (.cse8 (= main_~lk3~0 1)) (.cse1 (= main_~lk1~0 1)) (.cse2 (= main_~lk4~0 1)) (.cse11 (= main_~p5~0 0)) (.cse6 (= main_~p6~0 0)) (.cse5 (= main_~p3~0 0)) (.cse10 (= main_~lk2~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse6 .cse5) (and .cse7 .cse0 .cse8 .cse9 .cse6 .cse10) (and .cse7 .cse8 .cse9 .cse11 .cse3 .cse4) (and .cse7 .cse1 .cse8 .cse11 .cse6 .cse10) (and .cse0 .cse2 .cse9 .cse4 .cse5 .cse10) (and .cse7 .cse1 .cse11 .cse4 .cse5 .cse10) (and .cse7 .cse0 .cse1 .cse3 .cse6 .cse5) (and .cse7 .cse0 .cse9 .cse3 .cse6 .cse5) (and .cse7 .cse0 .cse9 .cse6 .cse5 .cse10) (and .cse2 .cse8 .cse9 .cse11 .cse6 .cse10) (and .cse7 .cse1 .cse11 .cse3 .cse4 .cse5) (and .cse7 .cse0 .cse1 .cse4 .cse5 .cse10) (and .cse1 .cse2 .cse8 .cse11 .cse3 .cse6) (and .cse0 .cse1 .cse2 .cse8 .cse4 .cse10) (and .cse7 .cse0 .cse8 .cse9 .cse3 .cse6) (and .cse0 .cse2 .cse8 .cse9 .cse4 .cse10) (and .cse7 .cse9 .cse11 .cse3 .cse6 .cse5) (and .cse7 .cse0 .cse8 .cse9 .cse3 .cse4) (and .cse7 .cse8 .cse9 .cse11 .cse6 .cse10) (and .cse2 .cse9 .cse11 .cse4 .cse5 .cse10) (and .cse7 .cse0 .cse1 .cse8 .cse4 .cse10) (and .cse7 .cse1 .cse11 .cse3 .cse6 .cse5) (and .cse7 .cse0 .cse8 .cse9 .cse4 .cse10) (and .cse1 .cse2 .cse11 .cse4 .cse5 .cse10) (and .cse7 .cse9 .cse11 .cse4 .cse5 .cse10) (and .cse7 .cse8 .cse9 .cse11 .cse4 .cse10) (and .cse7 .cse1 .cse8 .cse11 .cse3 .cse6) (and .cse0 .cse2 .cse9 .cse6 .cse5 .cse10) (and .cse1 .cse2 .cse11 .cse3 .cse4 .cse5) (and .cse0 .cse2 .cse9 .cse3 .cse6 .cse5) (and .cse0 .cse2 .cse9 .cse3 .cse4 .cse5) (and .cse1 .cse2 .cse8 .cse11 .cse3 .cse4) (and .cse0 .cse2 .cse8 .cse9 .cse3 .cse6) (and .cse0 .cse1 .cse2 .cse8 .cse6 .cse10) (and .cse7 .cse0 .cse1 .cse8 .cse3 .cse4) (and .cse7 .cse9 .cse11 .cse6 .cse5 .cse10) (and .cse7 .cse0 .cse1 .cse6 .cse5 .cse10) (and .cse7 .cse0 .cse1 .cse8 .cse3 .cse6) (and .cse7 .cse0 .cse9 .cse3 .cse4 .cse5) (and .cse7 .cse0 .cse1 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse8 .cse3 .cse6) (and .cse0 .cse2 .cse8 .cse9 .cse6 .cse10) (and .cse2 .cse8 .cse9 .cse11 .cse3 .cse6) (and .cse7 .cse0 .cse1 .cse8 .cse6 .cse10) (and .cse2 .cse9 .cse11 .cse6 .cse5 .cse10) (and .cse7 .cse1 .cse11 .cse6 .cse5 .cse10) (and .cse2 .cse9 .cse11 .cse3 .cse6 .cse5) (and .cse7 .cse9 .cse11 .cse3 .cse4 .cse5) (and .cse7 .cse8 .cse9 .cse11 .cse3 .cse6) (and .cse2 .cse8 .cse9 .cse11 .cse3 .cse4) (and .cse7 .cse1 .cse8 .cse11 .cse4 .cse10) (and .cse0 .cse1 .cse2 .cse6 .cse5 .cse10) (and .cse2 .cse8 .cse9 .cse11 .cse4 .cse10) (and .cse1 .cse2 .cse8 .cse11 .cse4 .cse10) (and .cse1 .cse2 .cse11 .cse3 .cse6 .cse5) (and .cse0 .cse1 .cse2 .cse8 .cse3 .cse4) (and .cse2 .cse9 .cse11 .cse3 .cse4 .cse5) (and .cse7 .cse1 .cse8 .cse11 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse10) (and .cse0 .cse2 .cse8 .cse9 .cse3 .cse4) (and .cse7 .cse0 .cse9 .cse4 .cse5 .cse10) (and .cse1 .cse2 .cse8 .cse11 .cse6 .cse10) (and .cse1 .cse2 .cse11 .cse6 .cse5 .cse10))) [2022-02-15 04:28:01,003 INFO L854 garLoopResultBuilder]: At program point L98-1(lines 32 118) the Hoare annotation is: (let ((.cse5 (= main_~p5~0 0)) (.cse3 (= main_~lk7~0 1)) (.cse2 (= main_~lk6~0 1)) (.cse0 (= main_~lk5~0 1)) (.cse1 (= main_~p7~0 0)) (.cse4 (= main_~p6~0 0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse0 .cse4) (and .cse1 .cse5 .cse4) (and .cse1 .cse5 .cse2) (and .cse3 .cse5 .cse4) (and .cse3 .cse5 .cse2) (and .cse3 .cse0 .cse2) (and .cse0 .cse1 .cse4))) [2022-02-15 04:28:01,004 INFO L854 garLoopResultBuilder]: At program point L65-1(lines 32 118) 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-02-15 04:28:01,004 INFO L854 garLoopResultBuilder]: At program point L57-1(lines 32 118) 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-02-15 04:28:01,004 INFO L854 garLoopResultBuilder]: At program point L99(line 99) the Hoare annotation is: (let ((.cse4 (= main_~p6~0 0)) (.cse0 (= main_~lk5~0 1)) (.cse3 (= main_~p7~0 0)) (.cse6 (= main_~lk7~0 1)) (.cse1 (not (= main_~p4~0 0))) (.cse2 (= main_~lk4~0 1)) (.cse5 (= main_~p5~0 0)) (.cse7 (= main_~lk6~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse5 .cse4) (and .cse6 .cse0 .cse1 .cse2 .cse7) (and .cse6 .cse0 .cse1 .cse2 .cse4) (and .cse6 .cse1 .cse2 .cse5 .cse4) (and .cse0 .cse1 .cse2 .cse3 .cse7) (and .cse1 .cse2 .cse3 .cse5 .cse7) (and .cse6 .cse1 .cse2 .cse5 .cse7))) [2022-02-15 04:28:01,004 INFO L854 garLoopResultBuilder]: At program point L83-1(lines 32 118) the Hoare annotation is: (let ((.cse6 (= main_~p4~0 0)) (.cse10 (= main_~p7~0 0)) (.cse3 (= main_~p5~0 0)) (.cse11 (= main_~p6~0 0)) (.cse8 (= main_~p3~0 0)) (.cse5 (= main_~lk2~0 1)) (.cse0 (= main_~lk7~0 1)) (.cse9 (= main_~lk5~0 1)) (.cse1 (= main_~lk4~0 1)) (.cse2 (= main_~lk3~0 1)) (.cse7 (= main_~p2~0 0)) (.cse4 (= main_~lk6~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse6 .cse3 .cse7 .cse4 .cse8) (and .cse6 .cse9 .cse2 .cse10 .cse4 .cse5) (and .cse0 .cse1 .cse3 .cse4 .cse8 .cse5) (and .cse0 .cse6 .cse3 .cse4 .cse8 .cse5) (and .cse6 .cse2 .cse10 .cse3 .cse11 .cse5) (and .cse0 .cse6 .cse2 .cse3 .cse7 .cse11) (and .cse0 .cse9 .cse1 .cse2 .cse7 .cse11) (and .cse9 .cse1 .cse2 .cse10 .cse11 .cse5) (and .cse0 .cse6 .cse9 .cse7 .cse11 .cse8) (and .cse6 .cse2 .cse10 .cse3 .cse7 .cse11) (and .cse1 .cse2 .cse10 .cse3 .cse11 .cse5) (and .cse1 .cse10 .cse3 .cse4 .cse8 .cse5) (and .cse9 .cse1 .cse2 .cse10 .cse4 .cse5) (and .cse0 .cse6 .cse2 .cse3 .cse7 .cse4) (and .cse6 .cse2 .cse10 .cse3 .cse7 .cse4) (and .cse9 .cse1 .cse10 .cse7 .cse11 .cse8) (and .cse6 .cse9 .cse2 .cse10 .cse11 .cse5) (and .cse0 .cse9 .cse1 .cse2 .cse11 .cse5) (and .cse6 .cse9 .cse10 .cse11 .cse8 .cse5) (and .cse1 .cse10 .cse3 .cse11 .cse8 .cse5) (and .cse0 .cse1 .cse3 .cse7 .cse11 .cse8) (and .cse0 .cse9 .cse1 .cse7 .cse11 .cse8) (and .cse1 .cse2 .cse10 .cse3 .cse4 .cse5) (and .cse1 .cse10 .cse3 .cse7 .cse4 .cse8) (and .cse0 .cse6 .cse9 .cse7 .cse4 .cse8) (and .cse6 .cse10 .cse3 .cse4 .cse8 .cse5) (and .cse6 .cse9 .cse2 .cse10 .cse7 .cse4) (and .cse0 .cse6 .cse9 .cse2 .cse4 .cse5) (and .cse9 .cse1 .cse2 .cse10 .cse7 .cse4) (and .cse0 .cse1 .cse2 .cse3 .cse11 .cse5) (and .cse6 .cse10 .cse3 .cse11 .cse8 .cse5) (and .cse0 .cse6 .cse9 .cse2 .cse7 .cse11) (and .cse6 .cse10 .cse3 .cse7 .cse11 .cse8) (and .cse6 .cse10 .cse3 .cse7 .cse4 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse7 .cse4) (and .cse0 .cse6 .cse9 .cse11 .cse8 .cse5) (and .cse9 .cse1 .cse2 .cse10 .cse7 .cse11) (and .cse0 .cse9 .cse1 .cse7 .cse4 .cse8) (and .cse1 .cse2 .cse10 .cse3 .cse7 .cse4) (and .cse9 .cse1 .cse10 .cse7 .cse4 .cse8) (and .cse6 .cse2 .cse10 .cse3 .cse4 .cse5) (and .cse0 .cse6 .cse9 .cse2 .cse7 .cse4) (and .cse0 .cse9 .cse1 .cse2 .cse4 .cse5) (and .cse0 .cse6 .cse9 .cse4 .cse8 .cse5) (and .cse0 .cse9 .cse1 .cse4 .cse8 .cse5) (and .cse0 .cse6 .cse3 .cse11 .cse8 .cse5) (and .cse0 .cse6 .cse2 .cse3 .cse11 .cse5) (and .cse6 .cse9 .cse10 .cse7 .cse4 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse7 .cse11) (and .cse6 .cse9 .cse2 .cse10 .cse7 .cse11) (and .cse1 .cse10 .cse3 .cse7 .cse11 .cse8) (and .cse0 .cse6 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse9 .cse1 .cse11 .cse8 .cse5) (and .cse6 .cse9 .cse10 .cse7 .cse11 .cse8) (and .cse0 .cse6 .cse3 .cse7 .cse11 .cse8) (and .cse6 .cse9 .cse10 .cse4 .cse8 .cse5) (and .cse0 .cse1 .cse3 .cse7 .cse4 .cse8) (and .cse9 .cse1 .cse10 .cse4 .cse8 .cse5) (and .cse0 .cse6 .cse9 .cse2 .cse11 .cse5) (and .cse9 .cse1 .cse10 .cse11 .cse8 .cse5) (and .cse1 .cse2 .cse10 .cse3 .cse7 .cse11) (and .cse0 .cse1 .cse3 .cse11 .cse8 .cse5) (and .cse0 .cse9 .cse1 .cse2 .cse7 .cse4))) [2022-02-15 04:28:01,004 INFO L854 garLoopResultBuilder]: At program point L108-1(lines 32 118) the Hoare annotation is: (or (= main_~lk7~0 1) (= main_~p7~0 0)) [2022-02-15 04:28:01,004 INFO L861 garLoopResultBuilder]: At program point L34(lines 34 36) the Hoare annotation is: true [2022-02-15 04:28:01,004 INFO L854 garLoopResultBuilder]: At program point L84(line 84) the Hoare annotation is: (let ((.cse9 (= main_~p7~0 0)) (.cse10 (= main_~lk2~0 1)) (.cse8 (= main_~lk5~0 1)) (.cse13 (= main_~lk4~0 1)) (.cse4 (= main_~lk3~0 1)) (.cse11 (= main_~lk6~0 1)) (.cse0 (= main_~lk7~0 1)) (.cse1 (= main_~p4~0 0)) (.cse2 (not (= main_~p1~0 0))) (.cse3 (= main_~lk1~0 1)) (.cse5 (= main_~p5~0 0)) (.cse6 (= main_~p2~0 0)) (.cse7 (= main_~p6~0 0)) (.cse12 (= main_~p3~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse1 .cse8 .cse2 .cse3 .cse4 .cse9 .cse7 .cse10) (and .cse1 .cse2 .cse3 .cse4 .cse9 .cse5 .cse11 .cse10) (and .cse1 .cse2 .cse3 .cse9 .cse5 .cse11 .cse12 .cse10) (and .cse8 .cse2 .cse3 .cse13 .cse9 .cse6 .cse11 .cse12) (and .cse8 .cse2 .cse3 .cse13 .cse9 .cse7 .cse12 .cse10) (and .cse1 .cse2 .cse3 .cse4 .cse9 .cse5 .cse7 .cse10) (and .cse8 .cse2 .cse3 .cse13 .cse4 .cse9 .cse11 .cse10) (and .cse8 .cse2 .cse3 .cse13 .cse4 .cse9 .cse6 .cse7) (and .cse2 .cse3 .cse13 .cse9 .cse5 .cse6 .cse11 .cse12) (and .cse2 .cse3 .cse13 .cse4 .cse9 .cse5 .cse6 .cse11) (and .cse1 .cse2 .cse3 .cse4 .cse9 .cse5 .cse6 .cse7) (and .cse1 .cse2 .cse3 .cse9 .cse5 .cse6 .cse7 .cse12) (and .cse0 .cse8 .cse2 .cse3 .cse13 .cse4 .cse7 .cse10) (and .cse1 .cse8 .cse2 .cse3 .cse9 .cse7 .cse12 .cse10) (and .cse2 .cse3 .cse13 .cse4 .cse9 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse8 .cse2 .cse3 .cse4 .cse6 .cse11) (and .cse1 .cse2 .cse3 .cse4 .cse9 .cse5 .cse6 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse11 .cse12) (and .cse8 .cse2 .cse3 .cse13 .cse4 .cse9 .cse7 .cse10) (and .cse0 .cse8 .cse2 .cse3 .cse13 .cse4 .cse11 .cse10) (and .cse0 .cse1 .cse8 .cse2 .cse3 .cse6 .cse7 .cse12) (and .cse0 .cse1 .cse8 .cse2 .cse3 .cse4 .cse11 .cse10) (and .cse0 .cse2 .cse3 .cse13 .cse4 .cse5 .cse11 .cse10) (and .cse8 .cse2 .cse3 .cse13 .cse9 .cse6 .cse7 .cse12) (and .cse0 .cse1 .cse8 .cse2 .cse3 .cse4 .cse7 .cse10) (and .cse8 .cse2 .cse3 .cse13 .cse4 .cse9 .cse6 .cse11) (and .cse0 .cse2 .cse3 .cse13 .cse4 .cse5 .cse7 .cse10) (and .cse0 .cse8 .cse2 .cse3 .cse13 .cse4 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse11 .cse10) (and .cse0 .cse2 .cse3 .cse13 .cse5 .cse6 .cse11 .cse12) (and .cse1 .cse8 .cse2 .cse3 .cse9 .cse11 .cse12 .cse10) (and .cse0 .cse8 .cse2 .cse3 .cse13 .cse6 .cse7 .cse12) (and .cse0 .cse1 .cse8 .cse2 .cse3 .cse11 .cse12 .cse10) (and .cse2 .cse3 .cse13 .cse4 .cse9 .cse5 .cse11 .cse10) (and .cse1 .cse8 .cse2 .cse3 .cse4 .cse9 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse7 .cse12 .cse10) (and .cse2 .cse3 .cse13 .cse9 .cse5 .cse7 .cse12 .cse10) (and .cse2 .cse3 .cse13 .cse4 .cse9 .cse5 .cse7 .cse10) (and .cse0 .cse2 .cse3 .cse13 .cse5 .cse7 .cse12 .cse10) (and .cse0 .cse1 .cse8 .cse2 .cse3 .cse7 .cse12 .cse10) (and .cse0 .cse2 .cse3 .cse13 .cse5 .cse6 .cse7 .cse12) (and .cse0 .cse2 .cse3 .cse13 .cse5 .cse11 .cse12 .cse10) (and .cse1 .cse8 .cse2 .cse3 .cse4 .cse9 .cse11 .cse10) (and .cse0 .cse1 .cse8 .cse2 .cse3 .cse4 .cse6 .cse7) (and .cse1 .cse8 .cse2 .cse3 .cse4 .cse9 .cse6 .cse11) (and .cse2 .cse3 .cse13 .cse9 .cse5 .cse6 .cse7 .cse12) (and .cse1 .cse2 .cse3 .cse9 .cse5 .cse6 .cse11 .cse12) (and .cse0 .cse8 .cse2 .cse3 .cse13 .cse11 .cse12 .cse10) (and .cse1 .cse2 .cse3 .cse9 .cse5 .cse7 .cse12 .cse10) (and .cse0 .cse8 .cse2 .cse3 .cse13 .cse4 .cse6 .cse11) (and .cse0 .cse2 .cse3 .cse13 .cse4 .cse5 .cse6 .cse7) (and .cse1 .cse8 .cse2 .cse3 .cse9 .cse6 .cse11 .cse12) (and .cse2 .cse3 .cse13 .cse9 .cse5 .cse11 .cse12 .cse10) (and .cse0 .cse8 .cse2 .cse3 .cse13 .cse7 .cse12 .cse10) (and .cse1 .cse8 .cse2 .cse3 .cse9 .cse6 .cse7 .cse12) (and .cse8 .cse2 .cse3 .cse13 .cse9 .cse11 .cse12 .cse10) (and .cse0 .cse1 .cse8 .cse2 .cse3 .cse6 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse11 .cse12 .cse10) (and .cse0 .cse8 .cse2 .cse3 .cse13 .cse6 .cse11 .cse12) (and .cse0 .cse2 .cse3 .cse13 .cse4 .cse5 .cse6 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse12))) [2022-02-15 04:28:01,004 INFO L854 garLoopResultBuilder]: At program point L109(line 109) the Hoare annotation is: (let ((.cse0 (= main_~lk6~0 1)) (.cse1 (not (= main_~p6~0 0)))) (or (and (= main_~lk7~0 1) .cse0 .cse1) (and (= main_~p7~0 0) .cse0 .cse1))) [2022-02-15 04:28:01,006 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 04:28:01,007 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-15 04:28:01,018 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.02 04:28:01 BoogieIcfgContainer [2022-02-15 04:28:01,018 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-15 04:28:01,019 INFO L158 Benchmark]: Toolchain (without parser) took 31095.55ms. Allocated memory was 192.9MB in the beginning and 870.3MB in the end (delta: 677.4MB). Free memory was 139.3MB in the beginning and 336.4MB in the end (delta: -197.1MB). Peak memory consumption was 518.4MB. Max. memory is 8.0GB. [2022-02-15 04:28:01,019 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 192.9MB. Free memory is still 155.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-02-15 04:28:01,020 INFO L158 Benchmark]: CACSL2BoogieTranslator took 180.30ms. Allocated memory was 192.9MB in the beginning and 276.8MB in the end (delta: 83.9MB). Free memory was 139.1MB in the beginning and 248.9MB in the end (delta: -109.8MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-02-15 04:28:01,020 INFO L158 Benchmark]: Boogie Preprocessor took 19.31ms. Allocated memory is still 276.8MB. Free memory was 248.9MB in the beginning and 247.3MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-02-15 04:28:01,021 INFO L158 Benchmark]: RCFGBuilder took 250.43ms. Allocated memory is still 276.8MB. Free memory was 247.3MB in the beginning and 234.8MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-02-15 04:28:01,021 INFO L158 Benchmark]: TraceAbstraction took 30642.06ms. Allocated memory was 276.8MB in the beginning and 870.3MB in the end (delta: 593.5MB). Free memory was 234.2MB in the beginning and 336.4MB in the end (delta: -102.1MB). Peak memory consumption was 529.1MB. Max. memory is 8.0GB. [2022-02-15 04:28:01,026 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.09ms. Allocated memory is still 192.9MB. Free memory is still 155.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 180.30ms. Allocated memory was 192.9MB in the beginning and 276.8MB in the end (delta: 83.9MB). Free memory was 139.1MB in the beginning and 248.9MB in the end (delta: -109.8MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * Boogie Preprocessor took 19.31ms. Allocated memory is still 276.8MB. Free memory was 248.9MB in the beginning and 247.3MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 250.43ms. Allocated memory is still 276.8MB. Free memory was 247.3MB in the beginning and 234.8MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 30642.06ms. Allocated memory was 276.8MB in the beginning and 870.3MB in the end (delta: 593.5MB). Free memory was 234.2MB in the beginning and 336.4MB in the end (delta: -102.1MB). Peak memory consumption was 529.1MB. 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: 121]: 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, 39 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 30.6s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 27.1s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1693 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1693 mSDsluCounter, 1341 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 135 mSDsCounter, 45 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 832 IncrementalHoareTripleChecker+Invalid, 877 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 45 mSolverCounterUnsat, 1206 mSDtfsCounter, 832 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 133 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2057occurred in iteration=18, InterpolantAutomatonStates: 76, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 19 MinimizatonAttempts, 528 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 36 LocationsWithAnnotation, 36 PreInvPairs, 2605 NumberOfFragments, 9766 HoareAnnotationTreeSize, 36 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 11.9s HoareSimplificationTime, 36 FomulaSimplificationsInter, 148195 FormulaSimplificationTreeSizeReductionInter, 15.2s 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: 32]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 0 - ProcedureContractResult [Line: 6]: Procedure Contract for main Derived contract for procedure main: 1 RESULT: Ultimate proved your program to be correct! [2022-02-15 04:28:01,093 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...