/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/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf -i ../../../trunk/examples/svcomp/locks/test_locks_11.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-6c470ae [2022-02-15 00:39:33,384 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-15 00:39:33,385 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-15 00:39:33,436 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-15 00:39:33,436 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-15 00:39:33,437 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-15 00:39:33,438 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-15 00:39:33,439 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-15 00:39:33,440 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-15 00:39:33,440 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-15 00:39:33,441 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-15 00:39:33,442 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-15 00:39:33,442 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-15 00:39:33,443 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-15 00:39:33,443 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-15 00:39:33,444 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-15 00:39:33,444 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-15 00:39:33,445 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-15 00:39:33,446 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-15 00:39:33,447 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-15 00:39:33,448 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-15 00:39:33,464 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-15 00:39:33,465 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-15 00:39:33,465 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-15 00:39:33,467 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-15 00:39:33,467 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-15 00:39:33,467 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-15 00:39:33,468 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-15 00:39:33,468 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-15 00:39:33,469 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-15 00:39:33,469 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-15 00:39:33,469 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-15 00:39:33,470 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-15 00:39:33,470 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-15 00:39:33,471 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-15 00:39:33,471 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-15 00:39:33,472 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-15 00:39:33,472 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-15 00:39:33,472 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-15 00:39:33,472 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-15 00:39:33,473 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-15 00:39:33,476 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-02-15 00:39:33,482 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-15 00:39:33,482 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-15 00:39:33,483 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-15 00:39:33,483 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-15 00:39:33,483 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-15 00:39:33,483 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-15 00:39:33,483 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-15 00:39:33,484 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-15 00:39:33,484 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-15 00:39:33,484 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-15 00:39:33,484 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-15 00:39:33,484 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-15 00:39:33,484 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-15 00:39:33,484 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-15 00:39:33,485 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-15 00:39:33,485 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-15 00:39:33,485 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-02-15 00:39:33,485 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-15 00:39:33,485 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-15 00:39:33,485 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-15 00:39:33,486 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-15 00:39:33,486 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-15 00:39:33,486 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_JORDAN 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 00:39:33,675 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-15 00:39:33,695 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-15 00:39:33,696 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-15 00:39:33,697 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-15 00:39:33,698 INFO L275 PluginConnector]: CDTParser initialized [2022-02-15 00:39:33,699 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_11.c [2022-02-15 00:39:33,745 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32e16e94b/95929ec939124a5eb35eafda12415dbf/FLAG6c55dde8a [2022-02-15 00:39:34,141 INFO L306 CDTParser]: Found 1 translation units. [2022-02-15 00:39:34,142 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_11.c [2022-02-15 00:39:34,153 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32e16e94b/95929ec939124a5eb35eafda12415dbf/FLAG6c55dde8a [2022-02-15 00:39:34,164 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32e16e94b/95929ec939124a5eb35eafda12415dbf [2022-02-15 00:39:34,172 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-15 00:39:34,173 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-02-15 00:39:34,175 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-15 00:39:34,175 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-15 00:39:34,177 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-15 00:39:34,178 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 12:39:34" (1/1) ... [2022-02-15 00:39:34,178 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@246d84d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:39:34, skipping insertion in model container [2022-02-15 00:39:34,178 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 12:39:34" (1/1) ... [2022-02-15 00:39:34,186 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-15 00:39:34,200 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-15 00:39:34,327 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_11.c[4246,4259] [2022-02-15 00:39:34,330 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-15 00:39:34,335 INFO L203 MainTranslator]: Completed pre-run [2022-02-15 00:39:34,349 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_11.c[4246,4259] [2022-02-15 00:39:34,350 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-15 00:39:34,359 INFO L208 MainTranslator]: Completed translation [2022-02-15 00:39:34,360 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:39:34 WrapperNode [2022-02-15 00:39:34,360 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-15 00:39:34,361 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-15 00:39:34,361 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-15 00:39:34,361 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-15 00:39:34,368 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:39:34" (1/1) ... [2022-02-15 00:39:34,369 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:39:34" (1/1) ... [2022-02-15 00:39:34,373 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:39:34" (1/1) ... [2022-02-15 00:39:34,373 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:39:34" (1/1) ... [2022-02-15 00:39:34,377 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:39:34" (1/1) ... [2022-02-15 00:39:34,381 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:39:34" (1/1) ... [2022-02-15 00:39:34,382 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:39:34" (1/1) ... [2022-02-15 00:39:34,383 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-15 00:39:34,384 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-15 00:39:34,384 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-15 00:39:34,384 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-15 00:39:34,385 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:39:34" (1/1) ... [2022-02-15 00:39:34,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-15 00:39:34,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-15 00:39:34,416 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 00:39:34,437 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 00:39:34,449 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-02-15 00:39:34,449 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-15 00:39:34,450 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-02-15 00:39:34,450 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-02-15 00:39:34,450 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-02-15 00:39:34,450 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-02-15 00:39:34,451 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-02-15 00:39:34,451 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-15 00:39:34,451 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-02-15 00:39:34,451 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-02-15 00:39:34,451 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-02-15 00:39:34,451 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-15 00:39:34,451 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-15 00:39:34,452 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-15 00:39:34,452 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-15 00:39:34,452 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-15 00:39:34,508 INFO L234 CfgBuilder]: Building ICFG [2022-02-15 00:39:34,510 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-15 00:39:34,698 INFO L275 CfgBuilder]: Performing block encoding [2022-02-15 00:39:34,732 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-15 00:39:34,733 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-15 00:39:34,734 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 12:39:34 BoogieIcfgContainer [2022-02-15 00:39:34,734 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-15 00:39:34,735 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-02-15 00:39:34,735 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-02-15 00:39:34,736 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-02-15 00:39:34,738 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 12:39:34" (1/1) ... [2022-02-15 00:39:34,761 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.02 12:39:34 BasicIcfg [2022-02-15 00:39:34,762 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-02-15 00:39:34,763 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-15 00:39:34,763 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-15 00:39:34,765 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-15 00:39:34,765 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 12:39:34" (1/4) ... [2022-02-15 00:39:34,765 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ead94f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 12:39:34, skipping insertion in model container [2022-02-15 00:39:34,765 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:39:34" (2/4) ... [2022-02-15 00:39:34,765 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ead94f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 12:39:34, skipping insertion in model container [2022-02-15 00:39:34,765 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 12:39:34" (3/4) ... [2022-02-15 00:39:34,766 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ead94f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.02 12:39:34, skipping insertion in model container [2022-02-15 00:39:34,766 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.02 12:39:34" (4/4) ... [2022-02-15 00:39:34,766 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_11.cJordan [2022-02-15 00:39:34,773 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-02-15 00:39:34,774 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-15 00:39:34,844 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-15 00:39:34,851 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=ForwardPredicates, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, 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=FAST_UPR [2022-02-15 00:39:34,851 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-15 00:39:34,863 INFO L276 IsEmpty]: Start isEmpty. Operand has 48 states, 42 states have (on average 1.880952380952381) internal successors, (79), 43 states have internal predecessors, (79), 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 00:39:34,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-02-15 00:39:34,880 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:39:34,881 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 00:39:34,881 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:39:34,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:39:34,887 INFO L85 PathProgramCache]: Analyzing trace with hash -1766201146, now seen corresponding path program 1 times [2022-02-15 00:39:34,893 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:39:34,893 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581810831] [2022-02-15 00:39:34,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:39:34,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:39:35,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:35,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:39:35,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:35,122 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 00:39:35,123 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:39:35,123 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581810831] [2022-02-15 00:39:35,124 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581810831] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:39:35,124 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:39:35,124 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-15 00:39:35,125 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158497068] [2022-02-15 00:39:35,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:39:35,128 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-15 00:39:35,129 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:39:35,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-15 00:39:35,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-15 00:39:35,154 INFO L87 Difference]: Start difference. First operand has 48 states, 42 states have (on average 1.880952380952381) internal successors, (79), 43 states have internal predecessors, (79), 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 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 00:39:35,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:39:35,315 INFO L93 Difference]: Finished difference Result 87 states and 150 transitions. [2022-02-15 00:39:35,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-15 00:39:35,318 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 00:39:35,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:39:35,325 INFO L225 Difference]: With dead ends: 87 [2022-02-15 00:39:35,325 INFO L226 Difference]: Without dead ends: 79 [2022-02-15 00:39:35,327 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 00:39:35,330 INFO L933 BasicCegarLoop]: 86 mSDtfsCounter, 191 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-15 00:39:35,331 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [191 Valid, 95 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-15 00:39:35,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-02-15 00:39:35,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 55. [2022-02-15 00:39:35,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 51 states have (on average 1.8627450980392157) internal successors, (95), 51 states have internal predecessors, (95), 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 00:39:35,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 98 transitions. [2022-02-15 00:39:35,366 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 98 transitions. Word has length 22 [2022-02-15 00:39:35,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:39:35,367 INFO L470 AbstractCegarLoop]: Abstraction has 55 states and 98 transitions. [2022-02-15 00:39:35,367 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 00:39:35,368 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 98 transitions. [2022-02-15 00:39:35,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-02-15 00:39:35,369 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:39:35,369 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 00:39:35,369 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-15 00:39:35,370 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:39:35,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:39:35,372 INFO L85 PathProgramCache]: Analyzing trace with hash 2023207525, now seen corresponding path program 1 times [2022-02-15 00:39:35,372 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:39:35,372 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950051381] [2022-02-15 00:39:35,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:39:35,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:39:35,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:35,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:39:35,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:35,448 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 00:39:35,449 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:39:35,449 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950051381] [2022-02-15 00:39:35,449 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950051381] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:39:35,450 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:39:35,450 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-15 00:39:35,450 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129940220] [2022-02-15 00:39:35,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:39:35,456 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-15 00:39:35,456 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:39:35,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-15 00:39:35,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-15 00:39:35,457 INFO L87 Difference]: Start difference. First operand 55 states and 98 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 00:39:35,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:39:35,557 INFO L93 Difference]: Finished difference Result 79 states and 139 transitions. [2022-02-15 00:39:35,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-15 00:39:35,557 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 00:39:35,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:39:35,561 INFO L225 Difference]: With dead ends: 79 [2022-02-15 00:39:35,561 INFO L226 Difference]: Without dead ends: 79 [2022-02-15 00:39:35,564 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 00:39:35,567 INFO L933 BasicCegarLoop]: 96 mSDtfsCounter, 163 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-15 00:39:35,567 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [163 Valid, 103 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-15 00:39:35,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-02-15 00:39:35,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 77. [2022-02-15 00:39:35,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 73 states have (on average 1.8493150684931507) internal successors, (135), 73 states have internal predecessors, (135), 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 00:39:35,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 138 transitions. [2022-02-15 00:39:35,573 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 138 transitions. Word has length 22 [2022-02-15 00:39:35,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:39:35,573 INFO L470 AbstractCegarLoop]: Abstraction has 77 states and 138 transitions. [2022-02-15 00:39:35,573 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 00:39:35,573 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 138 transitions. [2022-02-15 00:39:35,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-02-15 00:39:35,574 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:39:35,574 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 00:39:35,574 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-15 00:39:35,574 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:39:35,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:39:35,575 INFO L85 PathProgramCache]: Analyzing trace with hash 1082371358, now seen corresponding path program 1 times [2022-02-15 00:39:35,575 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:39:35,575 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128548501] [2022-02-15 00:39:35,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:39:35,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:39:35,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:35,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:39:35,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:35,612 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 00:39:35,612 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:39:35,612 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128548501] [2022-02-15 00:39:35,612 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128548501] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:39:35,612 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:39:35,612 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-15 00:39:35,613 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585638109] [2022-02-15 00:39:35,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:39:35,613 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-15 00:39:35,613 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:39:35,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-15 00:39:35,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-15 00:39:35,614 INFO L87 Difference]: Start difference. First operand 77 states and 138 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 00:39:35,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:39:35,689 INFO L93 Difference]: Finished difference Result 82 states and 141 transitions. [2022-02-15 00:39:35,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-15 00:39:35,689 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 00:39:35,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:39:35,690 INFO L225 Difference]: With dead ends: 82 [2022-02-15 00:39:35,690 INFO L226 Difference]: Without dead ends: 82 [2022-02-15 00:39:35,690 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 00:39:35,691 INFO L933 BasicCegarLoop]: 116 mSDtfsCounter, 144 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-15 00:39:35,691 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [144 Valid, 123 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-15 00:39:35,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-02-15 00:39:35,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 80. [2022-02-15 00:39:35,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 76 states have (on average 1.8026315789473684) internal successors, (137), 76 states have internal predecessors, (137), 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 00:39:35,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 140 transitions. [2022-02-15 00:39:35,696 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 140 transitions. Word has length 23 [2022-02-15 00:39:35,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:39:35,696 INFO L470 AbstractCegarLoop]: Abstraction has 80 states and 140 transitions. [2022-02-15 00:39:35,696 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 00:39:35,696 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 140 transitions. [2022-02-15 00:39:35,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-02-15 00:39:35,697 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:39:35,697 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 00:39:35,697 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-15 00:39:35,697 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:39:35,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:39:35,698 INFO L85 PathProgramCache]: Analyzing trace with hash -1705044129, now seen corresponding path program 1 times [2022-02-15 00:39:35,698 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:39:35,698 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306881171] [2022-02-15 00:39:35,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:39:35,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:39:35,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:35,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:39:35,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:35,732 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 00:39:35,733 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:39:35,733 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306881171] [2022-02-15 00:39:35,733 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306881171] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:39:35,733 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:39:35,733 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-15 00:39:35,733 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913984835] [2022-02-15 00:39:35,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:39:35,734 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-15 00:39:35,734 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:39:35,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-15 00:39:35,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-15 00:39:35,734 INFO L87 Difference]: Start difference. First operand 80 states and 140 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 00:39:35,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:39:35,818 INFO L93 Difference]: Finished difference Result 147 states and 262 transitions. [2022-02-15 00:39:35,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-15 00:39:35,818 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 00:39:35,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:39:35,819 INFO L225 Difference]: With dead ends: 147 [2022-02-15 00:39:35,819 INFO L226 Difference]: Without dead ends: 147 [2022-02-15 00:39:35,820 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 00:39:35,820 INFO L933 BasicCegarLoop]: 76 mSDtfsCounter, 178 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-15 00:39:35,821 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [178 Valid, 83 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-15 00:39:35,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2022-02-15 00:39:35,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 105. [2022-02-15 00:39:35,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 101 states have (on average 1.801980198019802) internal successors, (182), 101 states have internal predecessors, (182), 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 00:39:35,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 185 transitions. [2022-02-15 00:39:35,826 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 185 transitions. Word has length 23 [2022-02-15 00:39:35,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:39:35,826 INFO L470 AbstractCegarLoop]: Abstraction has 105 states and 185 transitions. [2022-02-15 00:39:35,826 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 00:39:35,827 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 185 transitions. [2022-02-15 00:39:35,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-02-15 00:39:35,827 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:39:35,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 00:39:35,827 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-15 00:39:35,828 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:39:35,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:39:35,828 INFO L85 PathProgramCache]: Analyzing trace with hash 2084364542, now seen corresponding path program 1 times [2022-02-15 00:39:35,828 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:39:35,828 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454056933] [2022-02-15 00:39:35,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:39:35,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:39:35,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:35,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:39:35,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:35,861 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 00:39:35,861 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:39:35,861 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454056933] [2022-02-15 00:39:35,861 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454056933] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:39:35,861 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:39:35,862 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-15 00:39:35,862 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888435815] [2022-02-15 00:39:35,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:39:35,862 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-15 00:39:35,862 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:39:35,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-15 00:39:35,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-15 00:39:35,863 INFO L87 Difference]: Start difference. First operand 105 states and 185 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 00:39:35,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:39:35,942 INFO L93 Difference]: Finished difference Result 149 states and 260 transitions. [2022-02-15 00:39:35,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-15 00:39:35,942 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 00:39:35,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:39:35,943 INFO L225 Difference]: With dead ends: 149 [2022-02-15 00:39:35,943 INFO L226 Difference]: Without dead ends: 149 [2022-02-15 00:39:35,944 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 00:39:35,944 INFO L933 BasicCegarLoop]: 98 mSDtfsCounter, 157 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-15 00:39:35,945 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [157 Valid, 105 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-15 00:39:35,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2022-02-15 00:39:35,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 147. [2022-02-15 00:39:35,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 143 states have (on average 1.7902097902097902) internal successors, (256), 143 states have internal predecessors, (256), 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 00:39:35,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 259 transitions. [2022-02-15 00:39:35,950 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 259 transitions. Word has length 23 [2022-02-15 00:39:35,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:39:35,950 INFO L470 AbstractCegarLoop]: Abstraction has 147 states and 259 transitions. [2022-02-15 00:39:35,950 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 00:39:35,950 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 259 transitions. [2022-02-15 00:39:35,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-02-15 00:39:35,951 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:39:35,951 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 00:39:35,951 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-15 00:39:35,951 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:39:35,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:39:35,952 INFO L85 PathProgramCache]: Analyzing trace with hash -1316728287, now seen corresponding path program 1 times [2022-02-15 00:39:35,952 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:39:35,952 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031995511] [2022-02-15 00:39:35,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:39:35,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:39:35,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:35,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:39:35,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:35,981 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 00:39:35,982 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:39:35,982 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031995511] [2022-02-15 00:39:35,982 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031995511] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:39:35,982 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:39:35,982 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-15 00:39:35,982 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104723780] [2022-02-15 00:39:35,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:39:35,983 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-15 00:39:35,983 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:39:35,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-15 00:39:36,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-15 00:39:36,000 INFO L87 Difference]: Start difference. First operand 147 states and 259 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 00:39:36,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:39:36,067 INFO L93 Difference]: Finished difference Result 151 states and 260 transitions. [2022-02-15 00:39:36,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-15 00:39:36,068 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 00:39:36,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:39:36,068 INFO L225 Difference]: With dead ends: 151 [2022-02-15 00:39:36,069 INFO L226 Difference]: Without dead ends: 151 [2022-02-15 00:39:36,069 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 00:39:36,069 INFO L933 BasicCegarLoop]: 113 mSDtfsCounter, 143 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-15 00:39:36,070 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [143 Valid, 120 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-15 00:39:36,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2022-02-15 00:39:36,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 149. [2022-02-15 00:39:36,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 145 states have (on average 1.7655172413793103) internal successors, (256), 145 states have internal predecessors, (256), 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 00:39:36,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 259 transitions. [2022-02-15 00:39:36,089 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 259 transitions. Word has length 24 [2022-02-15 00:39:36,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:39:36,089 INFO L470 AbstractCegarLoop]: Abstraction has 149 states and 259 transitions. [2022-02-15 00:39:36,089 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 00:39:36,089 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 259 transitions. [2022-02-15 00:39:36,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-02-15 00:39:36,090 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:39:36,090 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 00:39:36,090 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-15 00:39:36,090 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:39:36,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:39:36,091 INFO L85 PathProgramCache]: Analyzing trace with hash 190823522, now seen corresponding path program 1 times [2022-02-15 00:39:36,091 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:39:36,091 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643939988] [2022-02-15 00:39:36,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:39:36,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:39:36,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:36,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:39:36,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:36,116 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 00:39:36,117 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:39:36,117 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643939988] [2022-02-15 00:39:36,117 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643939988] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:39:36,117 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:39:36,117 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-15 00:39:36,117 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026284026] [2022-02-15 00:39:36,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:39:36,118 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-15 00:39:36,118 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:39:36,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-15 00:39:36,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-15 00:39:36,118 INFO L87 Difference]: Start difference. First operand 149 states and 259 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 00:39:36,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:39:36,180 INFO L93 Difference]: Finished difference Result 275 states and 484 transitions. [2022-02-15 00:39:36,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-15 00:39:36,180 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 00:39:36,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:39:36,181 INFO L225 Difference]: With dead ends: 275 [2022-02-15 00:39:36,181 INFO L226 Difference]: Without dead ends: 275 [2022-02-15 00:39:36,181 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 00:39:36,182 INFO L933 BasicCegarLoop]: 75 mSDtfsCounter, 171 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-15 00:39:36,182 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [171 Valid, 82 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-15 00:39:36,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2022-02-15 00:39:36,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 201. [2022-02-15 00:39:36,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 197 states have (on average 1.7461928934010151) internal successors, (344), 197 states have internal predecessors, (344), 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 00:39:36,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 347 transitions. [2022-02-15 00:39:36,186 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 347 transitions. Word has length 24 [2022-02-15 00:39:36,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:39:36,187 INFO L470 AbstractCegarLoop]: Abstraction has 201 states and 347 transitions. [2022-02-15 00:39:36,187 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 00:39:36,187 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 347 transitions. [2022-02-15 00:39:36,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-02-15 00:39:36,188 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:39:36,188 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 00:39:36,188 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-15 00:39:36,188 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:39:36,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:39:36,188 INFO L85 PathProgramCache]: Analyzing trace with hash -314735103, now seen corresponding path program 1 times [2022-02-15 00:39:36,188 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:39:36,189 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258490693] [2022-02-15 00:39:36,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:39:36,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:39:36,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:36,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:39:36,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:36,212 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 00:39:36,212 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:39:36,212 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258490693] [2022-02-15 00:39:36,213 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258490693] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:39:36,213 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:39:36,213 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-15 00:39:36,213 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051570552] [2022-02-15 00:39:36,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:39:36,213 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-15 00:39:36,213 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:39:36,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-15 00:39:36,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-15 00:39:36,214 INFO L87 Difference]: Start difference. First operand 201 states and 347 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 00:39:36,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:39:36,282 INFO L93 Difference]: Finished difference Result 283 states and 484 transitions. [2022-02-15 00:39:36,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-15 00:39:36,282 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 00:39:36,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:39:36,283 INFO L225 Difference]: With dead ends: 283 [2022-02-15 00:39:36,283 INFO L226 Difference]: Without dead ends: 283 [2022-02-15 00:39:36,284 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 00:39:36,284 INFO L933 BasicCegarLoop]: 100 mSDtfsCounter, 151 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-15 00:39:36,284 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [151 Valid, 107 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-15 00:39:36,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2022-02-15 00:39:36,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 281. [2022-02-15 00:39:36,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 277 states have (on average 1.7328519855595668) internal successors, (480), 277 states have internal predecessors, (480), 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 00:39:36,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 483 transitions. [2022-02-15 00:39:36,289 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 483 transitions. Word has length 24 [2022-02-15 00:39:36,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:39:36,289 INFO L470 AbstractCegarLoop]: Abstraction has 281 states and 483 transitions. [2022-02-15 00:39:36,289 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 00:39:36,289 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 483 transitions. [2022-02-15 00:39:36,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-15 00:39:36,290 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:39:36,290 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, 1] [2022-02-15 00:39:36,290 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-15 00:39:36,290 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:39:36,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:39:36,291 INFO L85 PathProgramCache]: Analyzing trace with hash 1620594170, now seen corresponding path program 1 times [2022-02-15 00:39:36,291 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:39:36,291 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875566421] [2022-02-15 00:39:36,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:39:36,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:39:36,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:36,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:39:36,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:36,315 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 00:39:36,315 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:39:36,315 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875566421] [2022-02-15 00:39:36,315 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875566421] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:39:36,315 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:39:36,315 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-15 00:39:36,315 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672868849] [2022-02-15 00:39:36,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:39:36,316 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-15 00:39:36,316 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:39:36,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-15 00:39:36,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-15 00:39:36,316 INFO L87 Difference]: Start difference. First operand 281 states and 483 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 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 00:39:36,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:39:36,379 INFO L93 Difference]: Finished difference Result 287 states and 484 transitions. [2022-02-15 00:39:36,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-15 00:39:36,380 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 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 25 [2022-02-15 00:39:36,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:39:36,381 INFO L225 Difference]: With dead ends: 287 [2022-02-15 00:39:36,381 INFO L226 Difference]: Without dead ends: 287 [2022-02-15 00:39:36,381 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 00:39:36,382 INFO L933 BasicCegarLoop]: 110 mSDtfsCounter, 142 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-15 00:39:36,382 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [142 Valid, 117 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-15 00:39:36,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2022-02-15 00:39:36,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 285. [2022-02-15 00:39:36,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 281 states have (on average 1.708185053380783) internal successors, (480), 281 states have internal predecessors, (480), 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 00:39:36,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 483 transitions. [2022-02-15 00:39:36,386 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 483 transitions. Word has length 25 [2022-02-15 00:39:36,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:39:36,386 INFO L470 AbstractCegarLoop]: Abstraction has 285 states and 483 transitions. [2022-02-15 00:39:36,386 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 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 00:39:36,387 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 483 transitions. [2022-02-15 00:39:36,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-15 00:39:36,387 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:39:36,387 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, 1] [2022-02-15 00:39:36,387 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-15 00:39:36,387 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:39:36,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:39:36,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1166821317, now seen corresponding path program 1 times [2022-02-15 00:39:36,388 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:39:36,388 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171665978] [2022-02-15 00:39:36,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:39:36,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:39:36,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:36,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:39:36,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:36,416 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 00:39:36,417 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:39:36,417 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171665978] [2022-02-15 00:39:36,417 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171665978] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:39:36,417 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:39:36,417 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-15 00:39:36,417 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392605922] [2022-02-15 00:39:36,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:39:36,417 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-15 00:39:36,417 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:39:36,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-15 00:39:36,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-15 00:39:36,418 INFO L87 Difference]: Start difference. First operand 285 states and 483 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 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 00:39:36,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:39:36,483 INFO L93 Difference]: Finished difference Result 547 states and 912 transitions. [2022-02-15 00:39:36,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-15 00:39:36,483 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 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 25 [2022-02-15 00:39:36,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:39:36,486 INFO L225 Difference]: With dead ends: 547 [2022-02-15 00:39:36,486 INFO L226 Difference]: Without dead ends: 547 [2022-02-15 00:39:36,486 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 00:39:36,486 INFO L933 BasicCegarLoop]: 80 mSDtfsCounter, 170 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-15 00:39:36,487 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [170 Valid, 87 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-15 00:39:36,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2022-02-15 00:39:36,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 545. [2022-02-15 00:39:36,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 545 states, 541 states have (on average 1.6783733826247689) internal successors, (908), 541 states have internal predecessors, (908), 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 00:39:36,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 911 transitions. [2022-02-15 00:39:36,502 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 911 transitions. Word has length 25 [2022-02-15 00:39:36,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:39:36,502 INFO L470 AbstractCegarLoop]: Abstraction has 545 states and 911 transitions. [2022-02-15 00:39:36,502 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 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 00:39:36,502 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 911 transitions. [2022-02-15 00:39:36,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-15 00:39:36,504 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:39:36,504 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, 1] [2022-02-15 00:39:36,505 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-15 00:39:36,505 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:39:36,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:39:36,505 INFO L85 PathProgramCache]: Analyzing trace with hash -661262692, now seen corresponding path program 1 times [2022-02-15 00:39:36,505 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:39:36,505 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458900807] [2022-02-15 00:39:36,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:39:36,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:39:36,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:36,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:39:36,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:36,537 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 00:39:36,537 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:39:36,537 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458900807] [2022-02-15 00:39:36,537 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458900807] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:39:36,537 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:39:36,538 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-15 00:39:36,538 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941124134] [2022-02-15 00:39:36,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:39:36,538 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-15 00:39:36,538 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:39:36,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-15 00:39:36,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-15 00:39:36,539 INFO L87 Difference]: Start difference. First operand 545 states and 911 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 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 00:39:36,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:39:36,595 INFO L93 Difference]: Finished difference Result 675 states and 1144 transitions. [2022-02-15 00:39:36,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-15 00:39:36,595 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 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 25 [2022-02-15 00:39:36,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:39:36,597 INFO L225 Difference]: With dead ends: 675 [2022-02-15 00:39:36,597 INFO L226 Difference]: Without dead ends: 675 [2022-02-15 00:39:36,597 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 00:39:36,598 INFO L933 BasicCegarLoop]: 125 mSDtfsCounter, 109 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-15 00:39:36,598 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [109 Valid, 132 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-15 00:39:36,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675 states. [2022-02-15 00:39:36,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 545. [2022-02-15 00:39:36,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 545 states, 541 states have (on average 1.6635859519408502) internal successors, (900), 541 states have internal predecessors, (900), 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 00:39:36,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 903 transitions. [2022-02-15 00:39:36,606 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 903 transitions. Word has length 25 [2022-02-15 00:39:36,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:39:36,606 INFO L470 AbstractCegarLoop]: Abstraction has 545 states and 903 transitions. [2022-02-15 00:39:36,606 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 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 00:39:36,607 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 903 transitions. [2022-02-15 00:39:36,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-02-15 00:39:36,607 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:39:36,607 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, 1, 1] [2022-02-15 00:39:36,607 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-15 00:39:36,607 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:39:36,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:39:36,608 INFO L85 PathProgramCache]: Analyzing trace with hash -1811690051, now seen corresponding path program 1 times [2022-02-15 00:39:36,608 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:39:36,608 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440479420] [2022-02-15 00:39:36,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:39:36,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:39:36,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:36,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:39:36,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:36,628 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 00:39:36,629 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:39:36,629 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440479420] [2022-02-15 00:39:36,629 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440479420] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:39:36,629 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:39:36,629 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-15 00:39:36,629 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854185493] [2022-02-15 00:39:36,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:39:36,629 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-15 00:39:36,629 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:39:36,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-15 00:39:36,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-15 00:39:36,630 INFO L87 Difference]: Start difference. First operand 545 states and 903 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 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 00:39:36,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:39:36,689 INFO L93 Difference]: Finished difference Result 995 states and 1664 transitions. [2022-02-15 00:39:36,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-15 00:39:36,690 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 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 26 [2022-02-15 00:39:36,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:39:36,692 INFO L225 Difference]: With dead ends: 995 [2022-02-15 00:39:36,693 INFO L226 Difference]: Without dead ends: 995 [2022-02-15 00:39:36,693 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 00:39:36,693 INFO L933 BasicCegarLoop]: 73 mSDtfsCounter, 157 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-15 00:39:36,693 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [157 Valid, 80 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-15 00:39:36,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 995 states. [2022-02-15 00:39:36,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 995 to 769. [2022-02-15 00:39:36,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 769 states, 765 states have (on average 1.6261437908496732) internal successors, (1244), 765 states have internal predecessors, (1244), 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 00:39:36,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 769 states to 769 states and 1247 transitions. [2022-02-15 00:39:36,724 INFO L78 Accepts]: Start accepts. Automaton has 769 states and 1247 transitions. Word has length 26 [2022-02-15 00:39:36,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:39:36,724 INFO L470 AbstractCegarLoop]: Abstraction has 769 states and 1247 transitions. [2022-02-15 00:39:36,724 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 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 00:39:36,724 INFO L276 IsEmpty]: Start isEmpty. Operand 769 states and 1247 transitions. [2022-02-15 00:39:36,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-02-15 00:39:36,725 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:39:36,725 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, 1, 1] [2022-02-15 00:39:36,725 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-02-15 00:39:36,726 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:39:36,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:39:36,726 INFO L85 PathProgramCache]: Analyzing trace with hash 1977718620, now seen corresponding path program 1 times [2022-02-15 00:39:36,726 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:39:36,726 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728548234] [2022-02-15 00:39:36,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:39:36,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:39:36,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:36,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:39:36,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:36,751 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 00:39:36,751 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:39:36,751 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728548234] [2022-02-15 00:39:36,752 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728548234] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:39:36,752 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:39:36,752 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-15 00:39:36,752 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297884451] [2022-02-15 00:39:36,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:39:36,752 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-15 00:39:36,752 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:39:36,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-15 00:39:36,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-15 00:39:36,753 INFO L87 Difference]: Start difference. First operand 769 states and 1247 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 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 00:39:36,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:39:36,811 INFO L93 Difference]: Finished difference Result 1059 states and 1704 transitions. [2022-02-15 00:39:36,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-15 00:39:36,812 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 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 26 [2022-02-15 00:39:36,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:39:36,814 INFO L225 Difference]: With dead ends: 1059 [2022-02-15 00:39:36,815 INFO L226 Difference]: Without dead ends: 1059 [2022-02-15 00:39:36,815 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 00:39:36,815 INFO L933 BasicCegarLoop]: 104 mSDtfsCounter, 139 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-15 00:39:36,816 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [139 Valid, 111 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-15 00:39:36,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1059 states. [2022-02-15 00:39:36,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1059 to 1057. [2022-02-15 00:39:36,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1057 states, 1053 states have (on average 1.6144349477682811) internal successors, (1700), 1053 states have internal predecessors, (1700), 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 00:39:36,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1057 states to 1057 states and 1703 transitions. [2022-02-15 00:39:36,832 INFO L78 Accepts]: Start accepts. Automaton has 1057 states and 1703 transitions. Word has length 26 [2022-02-15 00:39:36,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:39:36,833 INFO L470 AbstractCegarLoop]: Abstraction has 1057 states and 1703 transitions. [2022-02-15 00:39:36,833 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 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 00:39:36,833 INFO L276 IsEmpty]: Start isEmpty. Operand 1057 states and 1703 transitions. [2022-02-15 00:39:36,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-02-15 00:39:36,834 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:39:36,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, 1, 1, 1, 1, 1, 1] [2022-02-15 00:39:36,834 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-02-15 00:39:36,834 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:39:36,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:39:36,835 INFO L85 PathProgramCache]: Analyzing trace with hash -327784201, now seen corresponding path program 1 times [2022-02-15 00:39:36,835 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:39:36,835 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82969058] [2022-02-15 00:39:36,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:39:36,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:39:36,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:36,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:39:36,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:36,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 00:39:36,860 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:39:36,860 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82969058] [2022-02-15 00:39:36,860 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82969058] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:39:36,860 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:39:36,860 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-15 00:39:36,861 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503660437] [2022-02-15 00:39:36,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:39:36,861 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-15 00:39:36,861 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:39:36,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-15 00:39:36,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-15 00:39:36,861 INFO L87 Difference]: Start difference. First operand 1057 states and 1703 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 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 00:39:36,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:39:36,938 INFO L93 Difference]: Finished difference Result 1083 states and 1720 transitions. [2022-02-15 00:39:36,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-15 00:39:36,938 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 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 27 [2022-02-15 00:39:36,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:39:36,941 INFO L225 Difference]: With dead ends: 1083 [2022-02-15 00:39:36,941 INFO L226 Difference]: Without dead ends: 1083 [2022-02-15 00:39:36,942 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 00:39:36,942 INFO L933 BasicCegarLoop]: 104 mSDtfsCounter, 140 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-15 00:39:36,942 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [140 Valid, 111 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-15 00:39:36,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1083 states. [2022-02-15 00:39:36,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1083 to 1081. [2022-02-15 00:39:36,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1081 states, 1077 states have (on average 1.5933147632311977) internal successors, (1716), 1077 states have internal predecessors, (1716), 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 00:39:36,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1081 states to 1081 states and 1719 transitions. [2022-02-15 00:39:36,957 INFO L78 Accepts]: Start accepts. Automaton has 1081 states and 1719 transitions. Word has length 27 [2022-02-15 00:39:36,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:39:36,957 INFO L470 AbstractCegarLoop]: Abstraction has 1081 states and 1719 transitions. [2022-02-15 00:39:36,957 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 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 00:39:36,957 INFO L276 IsEmpty]: Start isEmpty. Operand 1081 states and 1719 transitions. [2022-02-15 00:39:36,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-02-15 00:39:36,958 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:39:36,958 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, 1, 1, 1] [2022-02-15 00:39:36,959 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-02-15 00:39:36,959 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:39:36,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:39:36,959 INFO L85 PathProgramCache]: Analyzing trace with hash 1179767608, now seen corresponding path program 1 times [2022-02-15 00:39:36,959 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:39:36,959 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482824736] [2022-02-15 00:39:36,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:39:36,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:39:36,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:36,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:39:36,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:36,978 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 00:39:36,978 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:39:36,978 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482824736] [2022-02-15 00:39:36,978 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482824736] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:39:36,978 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:39:36,979 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-15 00:39:36,979 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654024939] [2022-02-15 00:39:36,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:39:36,979 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-15 00:39:36,979 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:39:36,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-15 00:39:36,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-15 00:39:36,979 INFO L87 Difference]: Start difference. First operand 1081 states and 1719 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 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 00:39:37,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:39:37,054 INFO L93 Difference]: Finished difference Result 1931 states and 3096 transitions. [2022-02-15 00:39:37,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-15 00:39:37,055 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 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 27 [2022-02-15 00:39:37,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:39:37,060 INFO L225 Difference]: With dead ends: 1931 [2022-02-15 00:39:37,060 INFO L226 Difference]: Without dead ends: 1931 [2022-02-15 00:39:37,060 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 00:39:37,061 INFO L933 BasicCegarLoop]: 72 mSDtfsCounter, 150 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-15 00:39:37,061 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [150 Valid, 79 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-15 00:39:37,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1931 states. [2022-02-15 00:39:37,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1931 to 1545. [2022-02-15 00:39:37,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1545 states, 1541 states have (on average 1.5496430889033095) internal successors, (2388), 1541 states have internal predecessors, (2388), 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 00:39:37,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1545 states to 1545 states and 2391 transitions. [2022-02-15 00:39:37,083 INFO L78 Accepts]: Start accepts. Automaton has 1545 states and 2391 transitions. Word has length 27 [2022-02-15 00:39:37,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:39:37,083 INFO L470 AbstractCegarLoop]: Abstraction has 1545 states and 2391 transitions. [2022-02-15 00:39:37,084 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 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 00:39:37,084 INFO L276 IsEmpty]: Start isEmpty. Operand 1545 states and 2391 transitions. [2022-02-15 00:39:37,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-02-15 00:39:37,085 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:39:37,085 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, 1, 1, 1] [2022-02-15 00:39:37,085 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-02-15 00:39:37,085 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:39:37,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:39:37,086 INFO L85 PathProgramCache]: Analyzing trace with hash 674208983, now seen corresponding path program 1 times [2022-02-15 00:39:37,086 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:39:37,086 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054759518] [2022-02-15 00:39:37,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:39:37,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:39:37,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:37,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:39:37,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:37,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 00:39:37,108 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:39:37,108 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054759518] [2022-02-15 00:39:37,108 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054759518] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:39:37,108 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:39:37,108 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-15 00:39:37,108 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785324383] [2022-02-15 00:39:37,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:39:37,109 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-15 00:39:37,109 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:39:37,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-15 00:39:37,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-15 00:39:37,109 INFO L87 Difference]: Start difference. First operand 1545 states and 2391 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 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 00:39:37,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:39:37,177 INFO L93 Difference]: Finished difference Result 2091 states and 3208 transitions. [2022-02-15 00:39:37,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-15 00:39:37,178 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 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 27 [2022-02-15 00:39:37,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:39:37,183 INFO L225 Difference]: With dead ends: 2091 [2022-02-15 00:39:37,183 INFO L226 Difference]: Without dead ends: 2091 [2022-02-15 00:39:37,183 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 00:39:37,184 INFO L933 BasicCegarLoop]: 106 mSDtfsCounter, 133 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-15 00:39:37,184 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [133 Valid, 113 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-15 00:39:37,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2091 states. [2022-02-15 00:39:37,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2091 to 2089. [2022-02-15 00:39:37,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2089 states, 2085 states have (on average 1.5366906474820143) internal successors, (3204), 2085 states have internal predecessors, (3204), 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 00:39:37,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2089 states to 2089 states and 3207 transitions. [2022-02-15 00:39:37,214 INFO L78 Accepts]: Start accepts. Automaton has 2089 states and 3207 transitions. Word has length 27 [2022-02-15 00:39:37,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:39:37,215 INFO L470 AbstractCegarLoop]: Abstraction has 2089 states and 3207 transitions. [2022-02-15 00:39:37,215 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 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 00:39:37,215 INFO L276 IsEmpty]: Start isEmpty. Operand 2089 states and 3207 transitions. [2022-02-15 00:39:37,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-02-15 00:39:37,216 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:39:37,216 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, 1, 1, 1, 1] [2022-02-15 00:39:37,217 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-02-15 00:39:37,217 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:39:37,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:39:37,217 INFO L85 PathProgramCache]: Analyzing trace with hash -2081877160, now seen corresponding path program 1 times [2022-02-15 00:39:37,217 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:39:37,217 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58153430] [2022-02-15 00:39:37,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:39:37,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:39:37,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:37,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:39:37,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:37,238 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 00:39:37,238 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:39:37,238 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58153430] [2022-02-15 00:39:37,238 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58153430] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:39:37,238 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:39:37,238 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-15 00:39:37,238 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142791223] [2022-02-15 00:39:37,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:39:37,239 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-15 00:39:37,239 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:39:37,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-15 00:39:37,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-15 00:39:37,239 INFO L87 Difference]: Start difference. First operand 2089 states and 3207 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 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 00:39:37,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:39:37,318 INFO L93 Difference]: Finished difference Result 2123 states and 3208 transitions. [2022-02-15 00:39:37,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-15 00:39:37,318 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 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 28 [2022-02-15 00:39:37,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:39:37,323 INFO L225 Difference]: With dead ends: 2123 [2022-02-15 00:39:37,323 INFO L226 Difference]: Without dead ends: 2123 [2022-02-15 00:39:37,323 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 00:39:37,324 INFO L933 BasicCegarLoop]: 101 mSDtfsCounter, 139 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-15 00:39:37,324 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [139 Valid, 108 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-15 00:39:37,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2123 states. [2022-02-15 00:39:37,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2123 to 2121. [2022-02-15 00:39:37,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2121 states, 2117 states have (on average 1.5134624468587623) internal successors, (3204), 2117 states have internal predecessors, (3204), 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 00:39:37,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2121 states to 2121 states and 3207 transitions. [2022-02-15 00:39:37,353 INFO L78 Accepts]: Start accepts. Automaton has 2121 states and 3207 transitions. Word has length 28 [2022-02-15 00:39:37,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:39:37,353 INFO L470 AbstractCegarLoop]: Abstraction has 2121 states and 3207 transitions. [2022-02-15 00:39:37,353 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 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 00:39:37,353 INFO L276 IsEmpty]: Start isEmpty. Operand 2121 states and 3207 transitions. [2022-02-15 00:39:37,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-02-15 00:39:37,354 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:39:37,354 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, 1, 1, 1, 1] [2022-02-15 00:39:37,355 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-02-15 00:39:37,355 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:39:37,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:39:37,355 INFO L85 PathProgramCache]: Analyzing trace with hash -574325351, now seen corresponding path program 1 times [2022-02-15 00:39:37,355 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:39:37,355 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682160074] [2022-02-15 00:39:37,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:39:37,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:39:37,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:37,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:39:37,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:37,373 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 00:39:37,373 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:39:37,374 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682160074] [2022-02-15 00:39:37,374 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682160074] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:39:37,374 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:39:37,374 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-15 00:39:37,374 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792632224] [2022-02-15 00:39:37,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:39:37,374 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-15 00:39:37,374 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:39:37,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-15 00:39:37,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-15 00:39:37,375 INFO L87 Difference]: Start difference. First operand 2121 states and 3207 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 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 00:39:37,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:39:37,437 INFO L93 Difference]: Finished difference Result 3723 states and 5672 transitions. [2022-02-15 00:39:37,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-15 00:39:37,437 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 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 28 [2022-02-15 00:39:37,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:39:37,447 INFO L225 Difference]: With dead ends: 3723 [2022-02-15 00:39:37,447 INFO L226 Difference]: Without dead ends: 3723 [2022-02-15 00:39:37,447 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 00:39:37,448 INFO L933 BasicCegarLoop]: 71 mSDtfsCounter, 143 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-15 00:39:37,448 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [143 Valid, 78 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-15 00:39:37,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3723 states. [2022-02-15 00:39:37,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3723 to 3081. [2022-02-15 00:39:37,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3081 states, 3077 states have (on average 1.4676633084172896) internal successors, (4516), 3077 states have internal predecessors, (4516), 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 00:39:37,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3081 states to 3081 states and 4519 transitions. [2022-02-15 00:39:37,496 INFO L78 Accepts]: Start accepts. Automaton has 3081 states and 4519 transitions. Word has length 28 [2022-02-15 00:39:37,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:39:37,496 INFO L470 AbstractCegarLoop]: Abstraction has 3081 states and 4519 transitions. [2022-02-15 00:39:37,497 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 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 00:39:37,497 INFO L276 IsEmpty]: Start isEmpty. Operand 3081 states and 4519 transitions. [2022-02-15 00:39:37,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-02-15 00:39:37,499 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:39:37,499 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, 1, 1, 1, 1] [2022-02-15 00:39:37,499 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-02-15 00:39:37,500 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:39:37,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:39:37,500 INFO L85 PathProgramCache]: Analyzing trace with hash -1079883976, now seen corresponding path program 1 times [2022-02-15 00:39:37,500 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:39:37,500 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413895253] [2022-02-15 00:39:37,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:39:37,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:39:37,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:37,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:39:37,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:37,523 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 00:39:37,523 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:39:37,523 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413895253] [2022-02-15 00:39:37,523 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413895253] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:39:37,523 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:39:37,523 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-15 00:39:37,523 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78039797] [2022-02-15 00:39:37,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:39:37,523 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-15 00:39:37,524 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:39:37,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-15 00:39:37,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-15 00:39:37,524 INFO L87 Difference]: Start difference. First operand 3081 states and 4519 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 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 00:39:37,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:39:37,593 INFO L93 Difference]: Finished difference Result 4107 states and 5960 transitions. [2022-02-15 00:39:37,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-15 00:39:37,593 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 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 28 [2022-02-15 00:39:37,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:39:37,603 INFO L225 Difference]: With dead ends: 4107 [2022-02-15 00:39:37,603 INFO L226 Difference]: Without dead ends: 4107 [2022-02-15 00:39:37,603 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 00:39:37,604 INFO L933 BasicCegarLoop]: 108 mSDtfsCounter, 127 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-15 00:39:37,604 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [127 Valid, 115 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-15 00:39:37,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4107 states. [2022-02-15 00:39:37,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4107 to 4105. [2022-02-15 00:39:37,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4105 states, 4101 states have (on average 1.4523287003169958) internal successors, (5956), 4101 states have internal predecessors, (5956), 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 00:39:37,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4105 states to 4105 states and 5959 transitions. [2022-02-15 00:39:37,666 INFO L78 Accepts]: Start accepts. Automaton has 4105 states and 5959 transitions. Word has length 28 [2022-02-15 00:39:37,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:39:37,666 INFO L470 AbstractCegarLoop]: Abstraction has 4105 states and 5959 transitions. [2022-02-15 00:39:37,667 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 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 00:39:37,667 INFO L276 IsEmpty]: Start isEmpty. Operand 4105 states and 5959 transitions. [2022-02-15 00:39:37,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-02-15 00:39:37,669 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:39:37,670 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, 1, 1, 1, 1, 1] [2022-02-15 00:39:37,670 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-02-15 00:39:37,670 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:39:37,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:39:37,670 INFO L85 PathProgramCache]: Analyzing trace with hash -624183917, now seen corresponding path program 1 times [2022-02-15 00:39:37,670 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:39:37,670 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658988979] [2022-02-15 00:39:37,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:39:37,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:39:37,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:37,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:39:37,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:37,733 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 00:39:37,733 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:39:37,733 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658988979] [2022-02-15 00:39:37,733 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658988979] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:39:37,733 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:39:37,733 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-15 00:39:37,733 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512932955] [2022-02-15 00:39:37,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:39:37,733 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-15 00:39:37,733 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:39:37,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-15 00:39:37,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-15 00:39:37,734 INFO L87 Difference]: Start difference. First operand 4105 states and 5959 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 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 00:39:37,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:39:37,805 INFO L93 Difference]: Finished difference Result 4171 states and 5960 transitions. [2022-02-15 00:39:37,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-15 00:39:37,806 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 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 29 [2022-02-15 00:39:37,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:39:37,818 INFO L225 Difference]: With dead ends: 4171 [2022-02-15 00:39:37,818 INFO L226 Difference]: Without dead ends: 4171 [2022-02-15 00:39:37,818 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 00:39:37,819 INFO L933 BasicCegarLoop]: 98 mSDtfsCounter, 138 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-15 00:39:37,819 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [138 Valid, 105 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-15 00:39:37,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4171 states. [2022-02-15 00:39:37,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4171 to 4169. [2022-02-15 00:39:37,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4169 states, 4165 states have (on average 1.4300120048019207) internal successors, (5956), 4165 states have internal predecessors, (5956), 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 00:39:37,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4169 states to 4169 states and 5959 transitions. [2022-02-15 00:39:37,887 INFO L78 Accepts]: Start accepts. Automaton has 4169 states and 5959 transitions. Word has length 29 [2022-02-15 00:39:37,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:39:37,888 INFO L470 AbstractCegarLoop]: Abstraction has 4169 states and 5959 transitions. [2022-02-15 00:39:37,888 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 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 00:39:37,888 INFO L276 IsEmpty]: Start isEmpty. Operand 4169 states and 5959 transitions. [2022-02-15 00:39:37,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-02-15 00:39:37,891 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:39:37,891 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, 1, 1, 1, 1, 1] [2022-02-15 00:39:37,891 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-02-15 00:39:37,891 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:39:37,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:39:37,891 INFO L85 PathProgramCache]: Analyzing trace with hash 883367892, now seen corresponding path program 1 times [2022-02-15 00:39:37,891 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:39:37,891 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618528236] [2022-02-15 00:39:37,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:39:37,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:39:37,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:37,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:39:37,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:37,908 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 00:39:37,908 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:39:37,908 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618528236] [2022-02-15 00:39:37,909 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618528236] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:39:37,909 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:39:37,909 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-15 00:39:37,909 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975431003] [2022-02-15 00:39:37,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:39:37,909 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-15 00:39:37,909 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:39:37,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-15 00:39:37,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-15 00:39:37,909 INFO L87 Difference]: Start difference. First operand 4169 states and 5959 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 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 00:39:37,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:39:37,985 INFO L93 Difference]: Finished difference Result 7179 states and 10312 transitions. [2022-02-15 00:39:37,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-15 00:39:37,986 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 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 29 [2022-02-15 00:39:37,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:39:37,998 INFO L225 Difference]: With dead ends: 7179 [2022-02-15 00:39:37,998 INFO L226 Difference]: Without dead ends: 7179 [2022-02-15 00:39:37,998 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 00:39:37,998 INFO L933 BasicCegarLoop]: 70 mSDtfsCounter, 136 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-15 00:39:37,999 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [136 Valid, 77 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-15 00:39:38,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7179 states. [2022-02-15 00:39:38,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7179 to 6153. [2022-02-15 00:39:38,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6153 states, 6149 states have (on average 1.3849406407545943) internal successors, (8516), 6149 states have internal predecessors, (8516), 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 00:39:38,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6153 states to 6153 states and 8519 transitions. [2022-02-15 00:39:38,115 INFO L78 Accepts]: Start accepts. Automaton has 6153 states and 8519 transitions. Word has length 29 [2022-02-15 00:39:38,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:39:38,115 INFO L470 AbstractCegarLoop]: Abstraction has 6153 states and 8519 transitions. [2022-02-15 00:39:38,115 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 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 00:39:38,115 INFO L276 IsEmpty]: Start isEmpty. Operand 6153 states and 8519 transitions. [2022-02-15 00:39:38,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-02-15 00:39:38,121 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:39:38,121 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, 1, 1, 1, 1, 1] [2022-02-15 00:39:38,121 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-02-15 00:39:38,121 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:39:38,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:39:38,122 INFO L85 PathProgramCache]: Analyzing trace with hash 377809267, now seen corresponding path program 1 times [2022-02-15 00:39:38,122 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:39:38,122 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100965501] [2022-02-15 00:39:38,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:39:38,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:39:38,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:38,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:39:38,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:38,139 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 00:39:38,139 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:39:38,139 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100965501] [2022-02-15 00:39:38,140 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100965501] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:39:38,140 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:39:38,140 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-15 00:39:38,140 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064300200] [2022-02-15 00:39:38,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:39:38,140 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-15 00:39:38,140 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:39:38,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-15 00:39:38,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-15 00:39:38,141 INFO L87 Difference]: Start difference. First operand 6153 states and 8519 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 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 00:39:38,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:39:38,205 INFO L93 Difference]: Finished difference Result 8075 states and 11016 transitions. [2022-02-15 00:39:38,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-15 00:39:38,206 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 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 29 [2022-02-15 00:39:38,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:39:38,216 INFO L225 Difference]: With dead ends: 8075 [2022-02-15 00:39:38,216 INFO L226 Difference]: Without dead ends: 8075 [2022-02-15 00:39:38,217 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 00:39:38,217 INFO L933 BasicCegarLoop]: 110 mSDtfsCounter, 121 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-15 00:39:38,217 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [121 Valid, 117 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-15 00:39:38,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8075 states. [2022-02-15 00:39:38,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8075 to 8073. [2022-02-15 00:39:38,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8073 states, 8069 states have (on average 1.3647292105589293) internal successors, (11012), 8069 states have internal predecessors, (11012), 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 00:39:38,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8073 states to 8073 states and 11015 transitions. [2022-02-15 00:39:38,319 INFO L78 Accepts]: Start accepts. Automaton has 8073 states and 11015 transitions. Word has length 29 [2022-02-15 00:39:38,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:39:38,319 INFO L470 AbstractCegarLoop]: Abstraction has 8073 states and 11015 transitions. [2022-02-15 00:39:38,320 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 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 00:39:38,320 INFO L276 IsEmpty]: Start isEmpty. Operand 8073 states and 11015 transitions. [2022-02-15 00:39:38,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-02-15 00:39:38,326 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:39:38,326 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, 1, 1, 1, 1, 1, 1] [2022-02-15 00:39:38,326 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-02-15 00:39:38,326 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:39:38,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:39:38,327 INFO L85 PathProgramCache]: Analyzing trace with hash 1614633780, now seen corresponding path program 1 times [2022-02-15 00:39:38,327 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:39:38,327 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681222415] [2022-02-15 00:39:38,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:39:38,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:39:38,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:38,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:39:38,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:38,350 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 00:39:38,350 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:39:38,350 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681222415] [2022-02-15 00:39:38,350 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681222415] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:39:38,350 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:39:38,350 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-15 00:39:38,350 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574326289] [2022-02-15 00:39:38,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:39:38,350 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-15 00:39:38,350 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:39:38,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-15 00:39:38,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-15 00:39:38,351 INFO L87 Difference]: Start difference. First operand 8073 states and 11015 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 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 00:39:38,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:39:38,463 INFO L93 Difference]: Finished difference Result 8203 states and 11016 transitions. [2022-02-15 00:39:38,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-15 00:39:38,463 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 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 30 [2022-02-15 00:39:38,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:39:38,474 INFO L225 Difference]: With dead ends: 8203 [2022-02-15 00:39:38,474 INFO L226 Difference]: Without dead ends: 8203 [2022-02-15 00:39:38,474 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 00:39:38,475 INFO L933 BasicCegarLoop]: 95 mSDtfsCounter, 137 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-15 00:39:38,475 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [137 Valid, 102 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-15 00:39:38,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8203 states. [2022-02-15 00:39:38,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8203 to 8201. [2022-02-15 00:39:38,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8201 states, 8197 states have (on average 1.3434183237769917) internal successors, (11012), 8197 states have internal predecessors, (11012), 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 00:39:38,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8201 states to 8201 states and 11015 transitions. [2022-02-15 00:39:38,589 INFO L78 Accepts]: Start accepts. Automaton has 8201 states and 11015 transitions. Word has length 30 [2022-02-15 00:39:38,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:39:38,589 INFO L470 AbstractCegarLoop]: Abstraction has 8201 states and 11015 transitions. [2022-02-15 00:39:38,589 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 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 00:39:38,590 INFO L276 IsEmpty]: Start isEmpty. Operand 8201 states and 11015 transitions. [2022-02-15 00:39:38,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-02-15 00:39:38,596 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:39:38,596 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, 1, 1, 1, 1, 1, 1] [2022-02-15 00:39:38,596 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-02-15 00:39:38,596 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:39:38,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:39:38,596 INFO L85 PathProgramCache]: Analyzing trace with hash -1172781707, now seen corresponding path program 1 times [2022-02-15 00:39:38,597 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:39:38,597 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588034049] [2022-02-15 00:39:38,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:39:38,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:39:38,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:38,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:39:38,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:38,617 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 00:39:38,617 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:39:38,617 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588034049] [2022-02-15 00:39:38,617 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588034049] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:39:38,617 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:39:38,617 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-15 00:39:38,618 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856201328] [2022-02-15 00:39:38,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:39:38,618 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-15 00:39:38,618 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:39:38,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-15 00:39:38,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-15 00:39:38,618 INFO L87 Difference]: Start difference. First operand 8201 states and 11015 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 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 00:39:38,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:39:38,697 INFO L93 Difference]: Finished difference Result 13835 states and 18568 transitions. [2022-02-15 00:39:38,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-15 00:39:38,697 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 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 30 [2022-02-15 00:39:38,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:39:38,717 INFO L225 Difference]: With dead ends: 13835 [2022-02-15 00:39:38,717 INFO L226 Difference]: Without dead ends: 13835 [2022-02-15 00:39:38,717 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 00:39:38,718 INFO L933 BasicCegarLoop]: 69 mSDtfsCounter, 129 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-15 00:39:38,718 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [129 Valid, 76 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-15 00:39:38,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13835 states. [2022-02-15 00:39:38,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13835 to 12297. [2022-02-15 00:39:38,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12297 states, 12293 states have (on average 1.3018791181973481) internal successors, (16004), 12293 states have internal predecessors, (16004), 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 00:39:38,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12297 states to 12297 states and 16007 transitions. [2022-02-15 00:39:38,918 INFO L78 Accepts]: Start accepts. Automaton has 12297 states and 16007 transitions. Word has length 30 [2022-02-15 00:39:38,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:39:38,918 INFO L470 AbstractCegarLoop]: Abstraction has 12297 states and 16007 transitions. [2022-02-15 00:39:38,918 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 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 00:39:38,919 INFO L276 IsEmpty]: Start isEmpty. Operand 12297 states and 16007 transitions. [2022-02-15 00:39:38,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-02-15 00:39:38,929 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:39:38,929 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, 1, 1, 1, 1, 1, 1] [2022-02-15 00:39:38,929 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-02-15 00:39:38,930 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:39:38,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:39:38,930 INFO L85 PathProgramCache]: Analyzing trace with hash -1678340332, now seen corresponding path program 1 times [2022-02-15 00:39:38,930 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:39:38,930 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080577494] [2022-02-15 00:39:38,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:39:38,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:39:38,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:38,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:39:38,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:38,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 00:39:38,952 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:39:38,953 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080577494] [2022-02-15 00:39:38,953 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080577494] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:39:38,953 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:39:38,953 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-15 00:39:38,953 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145572769] [2022-02-15 00:39:38,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:39:38,953 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-15 00:39:38,953 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:39:38,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-15 00:39:38,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-15 00:39:38,954 INFO L87 Difference]: Start difference. First operand 12297 states and 16007 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 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 00:39:39,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:39:39,029 INFO L93 Difference]: Finished difference Result 15883 states and 20232 transitions. [2022-02-15 00:39:39,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-15 00:39:39,030 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 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 30 [2022-02-15 00:39:39,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:39:39,049 INFO L225 Difference]: With dead ends: 15883 [2022-02-15 00:39:39,049 INFO L226 Difference]: Without dead ends: 15883 [2022-02-15 00:39:39,049 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 00:39:39,049 INFO L933 BasicCegarLoop]: 112 mSDtfsCounter, 115 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-15 00:39:39,052 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [115 Valid, 119 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-15 00:39:39,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15883 states. [2022-02-15 00:39:39,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15883 to 15881. [2022-02-15 00:39:39,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15881 states, 15877 states have (on average 1.2740442149020597) internal successors, (20228), 15877 states have internal predecessors, (20228), 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 00:39:39,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15881 states to 15881 states and 20231 transitions. [2022-02-15 00:39:39,302 INFO L78 Accepts]: Start accepts. Automaton has 15881 states and 20231 transitions. Word has length 30 [2022-02-15 00:39:39,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:39:39,303 INFO L470 AbstractCegarLoop]: Abstraction has 15881 states and 20231 transitions. [2022-02-15 00:39:39,303 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 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 00:39:39,303 INFO L276 IsEmpty]: Start isEmpty. Operand 15881 states and 20231 transitions. [2022-02-15 00:39:39,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-02-15 00:39:39,314 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:39:39,314 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, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 00:39:39,314 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-02-15 00:39:39,314 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:39:39,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:39:39,315 INFO L85 PathProgramCache]: Analyzing trace with hash -1996461521, now seen corresponding path program 1 times [2022-02-15 00:39:39,315 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:39:39,315 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129981353] [2022-02-15 00:39:39,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:39:39,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:39:39,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:39,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:39:39,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:39,337 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 00:39:39,337 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:39:39,337 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129981353] [2022-02-15 00:39:39,338 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129981353] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:39:39,338 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:39:39,338 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-15 00:39:39,338 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769385465] [2022-02-15 00:39:39,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:39:39,338 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-15 00:39:39,338 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:39:39,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-15 00:39:39,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-15 00:39:39,339 INFO L87 Difference]: Start difference. First operand 15881 states and 20231 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 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 00:39:39,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:39:39,417 INFO L93 Difference]: Finished difference Result 16139 states and 20232 transitions. [2022-02-15 00:39:39,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-15 00:39:39,417 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 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 31 [2022-02-15 00:39:39,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:39:39,436 INFO L225 Difference]: With dead ends: 16139 [2022-02-15 00:39:39,436 INFO L226 Difference]: Without dead ends: 16139 [2022-02-15 00:39:39,437 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 00:39:39,437 INFO L933 BasicCegarLoop]: 92 mSDtfsCounter, 136 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-15 00:39:39,438 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [136 Valid, 99 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-15 00:39:39,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16139 states. [2022-02-15 00:39:39,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16139 to 16137. [2022-02-15 00:39:39,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16137 states, 16133 states have (on average 1.2538275584206284) internal successors, (20228), 16133 states have internal predecessors, (20228), 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 00:39:39,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16137 states to 16137 states and 20231 transitions. [2022-02-15 00:39:39,657 INFO L78 Accepts]: Start accepts. Automaton has 16137 states and 20231 transitions. Word has length 31 [2022-02-15 00:39:39,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:39:39,657 INFO L470 AbstractCegarLoop]: Abstraction has 16137 states and 20231 transitions. [2022-02-15 00:39:39,657 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 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 00:39:39,657 INFO L276 IsEmpty]: Start isEmpty. Operand 16137 states and 20231 transitions. [2022-02-15 00:39:39,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-02-15 00:39:39,668 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:39:39,668 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, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 00:39:39,668 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-02-15 00:39:39,669 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:39:39,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:39:39,669 INFO L85 PathProgramCache]: Analyzing trace with hash -488909712, now seen corresponding path program 1 times [2022-02-15 00:39:39,669 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:39:39,669 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020137389] [2022-02-15 00:39:39,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:39:39,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:39:39,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:39,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:39:39,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:39,688 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 00:39:39,688 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:39:39,688 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020137389] [2022-02-15 00:39:39,688 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020137389] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:39:39,688 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:39:39,688 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-15 00:39:39,689 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572361762] [2022-02-15 00:39:39,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:39:39,689 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-15 00:39:39,689 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:39:39,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-15 00:39:39,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-15 00:39:39,689 INFO L87 Difference]: Start difference. First operand 16137 states and 20231 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 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 00:39:39,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:39:39,792 INFO L93 Difference]: Finished difference Result 26635 states and 33032 transitions. [2022-02-15 00:39:39,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-15 00:39:39,792 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 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 31 [2022-02-15 00:39:39,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:39:39,918 INFO L225 Difference]: With dead ends: 26635 [2022-02-15 00:39:39,918 INFO L226 Difference]: Without dead ends: 26635 [2022-02-15 00:39:39,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 00:39:39,918 INFO L933 BasicCegarLoop]: 68 mSDtfsCounter, 122 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-15 00:39:39,919 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [122 Valid, 75 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-15 00:39:39,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26635 states. [2022-02-15 00:39:40,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26635 to 24585. [2022-02-15 00:39:40,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24585 states, 24581 states have (on average 1.2186648224238232) internal successors, (29956), 24581 states have internal predecessors, (29956), 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 00:39:40,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24585 states to 24585 states and 29959 transitions. [2022-02-15 00:39:40,213 INFO L78 Accepts]: Start accepts. Automaton has 24585 states and 29959 transitions. Word has length 31 [2022-02-15 00:39:40,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:39:40,213 INFO L470 AbstractCegarLoop]: Abstraction has 24585 states and 29959 transitions. [2022-02-15 00:39:40,213 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 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 00:39:40,213 INFO L276 IsEmpty]: Start isEmpty. Operand 24585 states and 29959 transitions. [2022-02-15 00:39:40,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-02-15 00:39:40,236 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:39:40,236 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, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 00:39:40,236 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-02-15 00:39:40,236 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:39:40,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:39:40,236 INFO L85 PathProgramCache]: Analyzing trace with hash -994468337, now seen corresponding path program 1 times [2022-02-15 00:39:40,236 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:39:40,236 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334665117] [2022-02-15 00:39:40,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:39:40,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:39:40,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:40,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:39:40,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:40,254 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 00:39:40,254 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:39:40,254 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334665117] [2022-02-15 00:39:40,254 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334665117] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:39:40,255 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:39:40,255 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-15 00:39:40,255 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547045664] [2022-02-15 00:39:40,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:39:40,255 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-15 00:39:40,255 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:39:40,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-15 00:39:40,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-15 00:39:40,256 INFO L87 Difference]: Start difference. First operand 24585 states and 29959 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 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 00:39:40,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:39:40,365 INFO L93 Difference]: Finished difference Result 31243 states and 36872 transitions. [2022-02-15 00:39:40,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-15 00:39:40,366 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 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 31 [2022-02-15 00:39:40,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:39:40,410 INFO L225 Difference]: With dead ends: 31243 [2022-02-15 00:39:40,410 INFO L226 Difference]: Without dead ends: 31243 [2022-02-15 00:39:40,410 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 00:39:40,411 INFO L933 BasicCegarLoop]: 114 mSDtfsCounter, 109 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-15 00:39:40,411 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [109 Valid, 121 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-15 00:39:40,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31243 states. [2022-02-15 00:39:40,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31243 to 31241. [2022-02-15 00:39:40,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31241 states, 31237 states have (on average 1.1802669910682844) internal successors, (36868), 31237 states have internal predecessors, (36868), 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 00:39:40,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31241 states to 31241 states and 36871 transitions. [2022-02-15 00:39:40,863 INFO L78 Accepts]: Start accepts. Automaton has 31241 states and 36871 transitions. Word has length 31 [2022-02-15 00:39:40,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:39:40,863 INFO L470 AbstractCegarLoop]: Abstraction has 31241 states and 36871 transitions. [2022-02-15 00:39:40,863 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 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 00:39:40,863 INFO L276 IsEmpty]: Start isEmpty. Operand 31241 states and 36871 transitions. [2022-02-15 00:39:40,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-02-15 00:39:40,877 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:39:40,877 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 00:39:40,878 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-02-15 00:39:40,878 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:39:40,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:39:40,878 INFO L85 PathProgramCache]: Analyzing trace with hash 2023701264, now seen corresponding path program 1 times [2022-02-15 00:39:40,878 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:39:40,878 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942238704] [2022-02-15 00:39:40,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:39:40,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:39:40,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:40,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:39:40,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:40,896 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 00:39:40,896 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:39:40,896 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942238704] [2022-02-15 00:39:40,896 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942238704] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:39:40,896 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:39:40,896 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-15 00:39:40,896 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224862685] [2022-02-15 00:39:40,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:39:40,896 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-15 00:39:40,897 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:39:40,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-15 00:39:40,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-15 00:39:40,897 INFO L87 Difference]: Start difference. First operand 31241 states and 36871 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 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 00:39:41,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:39:41,006 INFO L93 Difference]: Finished difference Result 31755 states and 36872 transitions. [2022-02-15 00:39:41,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-15 00:39:41,006 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 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 32 [2022-02-15 00:39:41,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:39:41,047 INFO L225 Difference]: With dead ends: 31755 [2022-02-15 00:39:41,047 INFO L226 Difference]: Without dead ends: 31755 [2022-02-15 00:39:41,048 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 00:39:41,048 INFO L933 BasicCegarLoop]: 89 mSDtfsCounter, 135 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-15 00:39:41,048 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [135 Valid, 96 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-15 00:39:41,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31755 states. [2022-02-15 00:39:41,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31755 to 31753. [2022-02-15 00:39:41,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31753 states, 31749 states have (on average 1.1612334246747928) internal successors, (36868), 31749 states have internal predecessors, (36868), 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 00:39:41,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31753 states to 31753 states and 36871 transitions. [2022-02-15 00:39:41,607 INFO L78 Accepts]: Start accepts. Automaton has 31753 states and 36871 transitions. Word has length 32 [2022-02-15 00:39:41,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:39:41,607 INFO L470 AbstractCegarLoop]: Abstraction has 31753 states and 36871 transitions. [2022-02-15 00:39:41,608 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 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 00:39:41,608 INFO L276 IsEmpty]: Start isEmpty. Operand 31753 states and 36871 transitions. [2022-02-15 00:39:41,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-02-15 00:39:41,620 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:39:41,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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 00:39:41,620 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-02-15 00:39:41,620 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:39:41,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:39:41,621 INFO L85 PathProgramCache]: Analyzing trace with hash -763714223, now seen corresponding path program 1 times [2022-02-15 00:39:41,621 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:39:41,621 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117217648] [2022-02-15 00:39:41,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:39:41,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:39:41,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:41,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:39:41,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:41,637 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 00:39:41,637 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:39:41,637 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117217648] [2022-02-15 00:39:41,637 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117217648] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:39:41,637 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:39:41,637 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-15 00:39:41,637 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625532785] [2022-02-15 00:39:41,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:39:41,638 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-15 00:39:41,638 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:39:41,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-15 00:39:41,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-15 00:39:41,638 INFO L87 Difference]: Start difference. First operand 31753 states and 36871 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 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 00:39:41,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:39:41,771 INFO L93 Difference]: Finished difference Result 51209 states and 57863 transitions. [2022-02-15 00:39:41,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-15 00:39:41,772 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 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 32 [2022-02-15 00:39:41,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:39:41,832 INFO L225 Difference]: With dead ends: 51209 [2022-02-15 00:39:41,832 INFO L226 Difference]: Without dead ends: 51209 [2022-02-15 00:39:41,832 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 00:39:41,833 INFO L933 BasicCegarLoop]: 66 mSDtfsCounter, 114 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-15 00:39:41,833 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [114 Valid, 73 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-15 00:39:41,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51209 states. [2022-02-15 00:39:42,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51209 to 49161. [2022-02-15 00:39:42,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49161 states, 49157 states have (on average 1.13538254978945) internal successors, (55812), 49157 states have internal predecessors, (55812), 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 00:39:42,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49161 states to 49161 states and 55815 transitions. [2022-02-15 00:39:42,521 INFO L78 Accepts]: Start accepts. Automaton has 49161 states and 55815 transitions. Word has length 32 [2022-02-15 00:39:42,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:39:42,522 INFO L470 AbstractCegarLoop]: Abstraction has 49161 states and 55815 transitions. [2022-02-15 00:39:42,522 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 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 00:39:42,522 INFO L276 IsEmpty]: Start isEmpty. Operand 49161 states and 55815 transitions. [2022-02-15 00:39:42,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-02-15 00:39:42,560 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:39:42,560 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 00:39:42,560 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-02-15 00:39:42,560 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:39:42,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:39:42,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1269272848, now seen corresponding path program 1 times [2022-02-15 00:39:42,560 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:39:42,561 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127395581] [2022-02-15 00:39:42,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:39:42,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:39:42,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:42,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:39:42,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:39:42,585 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 00:39:42,585 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:39:42,585 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127395581] [2022-02-15 00:39:42,586 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127395581] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:39:42,586 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:39:42,586 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-15 00:39:42,586 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892833306] [2022-02-15 00:39:42,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:39:42,586 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-15 00:39:42,586 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:39:42,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-15 00:39:42,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-15 00:39:42,587 INFO L87 Difference]: Start difference. First operand 49161 states and 55815 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 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 00:39:42,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:39:42,775 INFO L93 Difference]: Finished difference Result 61447 states and 66566 transitions. [2022-02-15 00:39:42,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-15 00:39:42,776 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 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 32 [2022-02-15 00:39:42,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:39:42,776 INFO L225 Difference]: With dead ends: 61447 [2022-02-15 00:39:42,776 INFO L226 Difference]: Without dead ends: 0 [2022-02-15 00:39:42,776 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 00:39:42,777 INFO L933 BasicCegarLoop]: 115 mSDtfsCounter, 100 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-15 00:39:42,778 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [100 Valid, 122 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-15 00:39:42,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-02-15 00:39:42,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-02-15 00:39:42,778 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 00:39:42,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-02-15 00:39:42,778 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 32 [2022-02-15 00:39:42,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:39:42,778 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-15 00:39:42,778 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 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 00:39:42,779 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-15 00:39:42,779 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-15 00:39:42,781 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-15 00:39:42,781 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-02-15 00:39:42,783 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 00:39:42,784 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-15 00:39:42,786 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.02 12:39:42 BasicIcfg [2022-02-15 00:39:42,786 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-15 00:39:42,786 INFO L158 Benchmark]: Toolchain (without parser) took 8613.56ms. Allocated memory was 185.6MB in the beginning and 3.4GB in the end (delta: 3.2GB). Free memory was 137.7MB in the beginning and 2.7GB in the end (delta: -2.6GB). Peak memory consumption was 596.0MB. Max. memory is 8.0GB. [2022-02-15 00:39:42,786 INFO L158 Benchmark]: CDTParser took 0.51ms. Allocated memory is still 185.6MB. Free memory is still 153.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-02-15 00:39:42,787 INFO L158 Benchmark]: CACSL2BoogieTranslator took 185.49ms. Allocated memory is still 185.6MB. Free memory was 137.4MB in the beginning and 163.1MB in the end (delta: -25.7MB). Peak memory consumption was 11.1MB. Max. memory is 8.0GB. [2022-02-15 00:39:42,787 INFO L158 Benchmark]: Boogie Preprocessor took 22.73ms. Allocated memory is still 185.6MB. Free memory was 163.1MB in the beginning and 161.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-02-15 00:39:42,787 INFO L158 Benchmark]: RCFGBuilder took 350.34ms. Allocated memory is still 185.6MB. Free memory was 161.6MB in the beginning and 147.9MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-02-15 00:39:42,787 INFO L158 Benchmark]: IcfgTransformer took 27.08ms. Allocated memory is still 185.6MB. Free memory was 147.9MB in the beginning and 146.2MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-02-15 00:39:42,787 INFO L158 Benchmark]: TraceAbstraction took 8023.38ms. Allocated memory was 185.6MB in the beginning and 3.4GB in the end (delta: 3.2GB). Free memory was 145.7MB in the beginning and 2.7GB in the end (delta: -2.6GB). Peak memory consumption was 603.7MB. Max. memory is 8.0GB. [2022-02-15 00:39:42,788 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.51ms. Allocated memory is still 185.6MB. Free memory is still 153.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 185.49ms. Allocated memory is still 185.6MB. Free memory was 137.4MB in the beginning and 163.1MB in the end (delta: -25.7MB). Peak memory consumption was 11.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 22.73ms. Allocated memory is still 185.6MB. Free memory was 163.1MB in the beginning and 161.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 350.34ms. Allocated memory is still 185.6MB. Free memory was 161.6MB in the beginning and 147.9MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * IcfgTransformer took 27.08ms. Allocated memory is still 185.6MB. Free memory was 147.9MB in the beginning and 146.2MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * TraceAbstraction took 8023.38ms. Allocated memory was 185.6MB in the beginning and 3.4GB in the end (delta: 3.2GB). Free memory was 145.7MB in the beginning and 2.7GB in the end (delta: -2.6GB). Peak memory consumption was 603.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 177]: 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 3 procedures, 48 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.9s, OverallIterations: 31, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4339 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4339 mSDsluCounter, 3131 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 219 mSDsCounter, 73 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2036 IncrementalHoareTripleChecker+Invalid, 2109 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 73 mSolverCounterUnsat, 2912 mSDtfsCounter, 2036 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 217 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=49161occurred in iteration=30, InterpolantAutomatonStates: 124, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.4s AutomataMinimizationTime, 31 MinimizatonAttempts, 8224 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 843 NumberOfCodeBlocks, 843 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 812 ConstructedInterpolants, 0 QuantifiedInterpolants, 1801 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 31 InterpolantComputations, 31 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, 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 RESULT: Ultimate proved your program to be correct! [2022-02-15 00:39:42,817 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...