/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/loopacceleration/qvasr/qvasr_64.epf -i ../../../trunk/examples/svcomp/ntdrivers-simplified/floppy_simpl4.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-5d317bd [2022-03-19 01:38:31,202 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-19 01:38:31,204 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-19 01:38:31,240 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-19 01:38:31,241 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-19 01:38:31,242 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-19 01:38:31,245 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-19 01:38:31,247 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-19 01:38:31,249 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-19 01:38:31,253 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-19 01:38:31,254 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-19 01:38:31,256 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-19 01:38:31,256 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-19 01:38:31,258 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-19 01:38:31,259 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-19 01:38:31,262 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-19 01:38:31,262 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-19 01:38:31,263 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-19 01:38:31,266 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-19 01:38:31,272 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-19 01:38:31,274 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-03-19 01:38:31,275 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-19 01:38:31,276 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-19 01:38:31,277 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-19 01:38:31,278 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-19 01:38:31,281 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-19 01:38:31,281 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-19 01:38:31,282 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-19 01:38:31,282 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-19 01:38:31,283 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-19 01:38:31,284 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-19 01:38:31,284 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-19 01:38:31,285 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-19 01:38:31,286 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-19 01:38:31,286 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-19 01:38:31,287 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-19 01:38:31,287 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-19 01:38:31,288 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-19 01:38:31,288 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-19 01:38:31,288 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-19 01:38:31,288 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-19 01:38:31,291 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-19 01:38:31,292 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-03-19 01:38:31,319 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-19 01:38:31,319 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-19 01:38:31,321 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-19 01:38:31,321 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-19 01:38:31,322 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-19 01:38:31,322 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-19 01:38:31,322 INFO L138 SettingsManager]: * Use SBE=true [2022-03-19 01:38:31,322 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-19 01:38:31,322 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-19 01:38:31,323 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-19 01:38:31,323 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-19 01:38:31,323 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-19 01:38:31,323 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-19 01:38:31,323 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-19 01:38:31,323 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-19 01:38:31,323 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-19 01:38:31,323 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-19 01:38:31,323 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-19 01:38:31,323 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-19 01:38:31,323 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-19 01:38:31,324 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-19 01:38:31,324 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-03-19 01:38:31,324 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-19 01:38:31,324 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-19 01:38:31,324 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-19 01:38:31,324 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-19 01:38:31,324 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-03-19 01:38:31,324 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-03-19 01:38:31,325 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-03-19 01:38:31,325 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_QVASR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-03-19 01:38:31,542 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-19 01:38:31,566 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-19 01:38:31,568 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-19 01:38:31,569 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-19 01:38:31,569 INFO L275 PluginConnector]: CDTParser initialized [2022-03-19 01:38:31,571 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ntdrivers-simplified/floppy_simpl4.cil-2.c [2022-03-19 01:38:31,626 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1354a38c9/a3633c62d8204dffb60239da6d6aa9ba/FLAG0d1c1b627 [2022-03-19 01:38:32,063 INFO L306 CDTParser]: Found 1 translation units. [2022-03-19 01:38:32,063 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers-simplified/floppy_simpl4.cil-2.c [2022-03-19 01:38:32,073 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1354a38c9/a3633c62d8204dffb60239da6d6aa9ba/FLAG0d1c1b627 [2022-03-19 01:38:32,084 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1354a38c9/a3633c62d8204dffb60239da6d6aa9ba [2022-03-19 01:38:32,085 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-19 01:38:32,086 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-19 01:38:32,087 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-19 01:38:32,088 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-19 01:38:32,090 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-19 01:38:32,091 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.03 01:38:32" (1/1) ... [2022-03-19 01:38:32,091 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7dbe88e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 01:38:32, skipping insertion in model container [2022-03-19 01:38:32,092 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.03 01:38:32" (1/1) ... [2022-03-19 01:38:32,096 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-19 01:38:32,141 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-19 01:38:32,447 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers-simplified/floppy_simpl4.cil-2.c[48585,48598] [2022-03-19 01:38:32,456 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-19 01:38:32,463 INFO L203 MainTranslator]: Completed pre-run [2022-03-19 01:38:32,517 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers-simplified/floppy_simpl4.cil-2.c[48585,48598] [2022-03-19 01:38:32,518 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-19 01:38:32,528 INFO L208 MainTranslator]: Completed translation [2022-03-19 01:38:32,528 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 01:38:32 WrapperNode [2022-03-19 01:38:32,528 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-19 01:38:32,529 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-19 01:38:32,529 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-19 01:38:32,529 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-19 01:38:32,547 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 01:38:32" (1/1) ... [2022-03-19 01:38:32,547 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 01:38:32" (1/1) ... [2022-03-19 01:38:32,576 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 01:38:32" (1/1) ... [2022-03-19 01:38:32,576 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 01:38:32" (1/1) ... [2022-03-19 01:38:32,621 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 01:38:32" (1/1) ... [2022-03-19 01:38:32,629 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 01:38:32" (1/1) ... [2022-03-19 01:38:32,632 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 01:38:32" (1/1) ... [2022-03-19 01:38:32,638 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-19 01:38:32,638 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-19 01:38:32,639 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-19 01:38:32,639 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-19 01:38:32,639 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 01:38:32" (1/1) ... [2022-03-19 01:38:32,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-19 01:38:32,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-19 01:38:32,687 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-03-19 01:38:32,689 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-03-19 01:38:32,724 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-03-19 01:38:32,725 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-19 01:38:32,726 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-03-19 01:38:32,726 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2022-03-19 01:38:32,726 INFO L138 BoogieDeclarations]: Found implementation of procedure FlAcpiConfigureFloppy [2022-03-19 01:38:32,726 INFO L138 BoogieDeclarations]: Found implementation of procedure FlQueueIrpToThread [2022-03-19 01:38:32,726 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyPnp [2022-03-19 01:38:32,727 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyStartDevice [2022-03-19 01:38:32,729 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyPnpComplete [2022-03-19 01:38:32,729 INFO L138 BoogieDeclarations]: Found implementation of procedure FlFdcDeviceIo [2022-03-19 01:38:32,729 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyProcessQueuedRequests [2022-03-19 01:38:32,729 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2022-03-19 01:38:32,730 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-03-19 01:38:32,730 INFO L138 BoogieDeclarations]: Found implementation of procedure IoBuildDeviceIoControlRequest [2022-03-19 01:38:32,730 INFO L138 BoogieDeclarations]: Found implementation of procedure IoDeleteSymbolicLink [2022-03-19 01:38:32,730 INFO L138 BoogieDeclarations]: Found implementation of procedure IoQueryDeviceDescription [2022-03-19 01:38:32,732 INFO L138 BoogieDeclarations]: Found implementation of procedure IoRegisterDeviceInterface [2022-03-19 01:38:32,732 INFO L138 BoogieDeclarations]: Found implementation of procedure IoSetDeviceInterfaceState [2022-03-19 01:38:32,732 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2022-03-19 01:38:32,732 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2022-03-19 01:38:32,732 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2022-03-19 01:38:32,732 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2022-03-19 01:38:32,733 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2022-03-19 01:38:32,733 INFO L138 BoogieDeclarations]: Found implementation of procedure ObReferenceObjectByHandle [2022-03-19 01:38:32,733 INFO L138 BoogieDeclarations]: Found implementation of procedure PsCreateSystemThread [2022-03-19 01:38:32,733 INFO L138 BoogieDeclarations]: Found implementation of procedure ZwClose [2022-03-19 01:38:32,733 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyCreateClose [2022-03-19 01:38:32,733 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyDeviceControl [2022-03-19 01:38:32,733 INFO L138 BoogieDeclarations]: Found implementation of procedure FlCheckFormatParameters [2022-03-19 01:38:32,733 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyQueueRequest [2022-03-19 01:38:32,733 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2022-03-19 01:38:32,733 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-03-19 01:38:32,733 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-03-19 01:38:32,733 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-03-19 01:38:32,733 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-19 01:38:32,734 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-03-19 01:38:32,734 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-03-19 01:38:32,734 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-03-19 01:38:32,734 INFO L130 BoogieDeclarations]: Found specification of procedure FlAcpiConfigureFloppy [2022-03-19 01:38:32,734 INFO L130 BoogieDeclarations]: Found specification of procedure FlQueueIrpToThread [2022-03-19 01:38:32,734 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyPnp [2022-03-19 01:38:32,734 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyStartDevice [2022-03-19 01:38:32,734 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyPnpComplete [2022-03-19 01:38:32,734 INFO L130 BoogieDeclarations]: Found specification of procedure FlFdcDeviceIo [2022-03-19 01:38:32,734 INFO L130 BoogieDeclarations]: Found specification of procedure IoBuildDeviceIoControlRequest [2022-03-19 01:38:32,734 INFO L130 BoogieDeclarations]: Found specification of procedure IoDeleteSymbolicLink [2022-03-19 01:38:32,735 INFO L130 BoogieDeclarations]: Found specification of procedure IoQueryDeviceDescription [2022-03-19 01:38:32,735 INFO L130 BoogieDeclarations]: Found specification of procedure IoRegisterDeviceInterface [2022-03-19 01:38:32,735 INFO L130 BoogieDeclarations]: Found specification of procedure IoSetDeviceInterfaceState [2022-03-19 01:38:32,735 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2022-03-19 01:38:32,740 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2022-03-19 01:38:32,741 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2022-03-19 01:38:32,741 INFO L130 BoogieDeclarations]: Found specification of procedure ObReferenceObjectByHandle [2022-03-19 01:38:32,741 INFO L130 BoogieDeclarations]: Found specification of procedure PsCreateSystemThread [2022-03-19 01:38:32,741 INFO L130 BoogieDeclarations]: Found specification of procedure ZwClose [2022-03-19 01:38:32,741 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyCreateClose [2022-03-19 01:38:32,741 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyQueueRequest [2022-03-19 01:38:32,741 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyDeviceControl [2022-03-19 01:38:32,741 INFO L130 BoogieDeclarations]: Found specification of procedure FlCheckFormatParameters [2022-03-19 01:38:32,741 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2022-03-19 01:38:32,741 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2022-03-19 01:38:32,741 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2022-03-19 01:38:32,741 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyProcessQueuedRequests [2022-03-19 01:38:32,742 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2022-03-19 01:38:32,742 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-03-19 01:38:32,742 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2022-03-19 01:38:32,742 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-03-19 01:38:32,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-19 01:38:32,742 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-19 01:38:32,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-19 01:38:32,742 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-19 01:38:32,742 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-19 01:38:32,915 INFO L234 CfgBuilder]: Building ICFG [2022-03-19 01:38:32,923 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-19 01:38:32,955 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-03-19 01:38:32,978 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-03-19 01:38:32,978 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-03-19 01:38:32,984 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-03-19 01:38:32,989 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-03-19 01:38:32,990 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-03-19 01:38:32,993 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-03-19 01:38:33,101 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##21: assume !false; [2022-03-19 01:38:33,102 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##20: assume false; [2022-03-19 01:38:33,103 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-03-19 01:38:33,151 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##17: assume !false; [2022-03-19 01:38:33,151 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume false; [2022-03-19 01:38:33,161 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-03-19 01:38:33,173 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2022-03-19 01:38:33,173 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2022-03-19 01:38:33,261 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-03-19 01:38:33,271 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-03-19 01:38:33,271 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-03-19 01:38:33,271 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-03-19 01:38:33,278 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-03-19 01:38:33,278 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-03-19 01:38:33,279 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-03-19 01:38:33,290 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-03-19 01:38:33,291 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-03-19 01:38:33,343 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-03-19 01:38:33,372 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##12: assume !false; [2022-03-19 01:38:33,372 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume false; [2022-03-19 01:38:33,378 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-03-19 01:38:33,504 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##38: assume !false; [2022-03-19 01:38:33,505 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##37: assume false; [2022-03-19 01:38:33,543 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-03-19 01:38:33,547 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-03-19 01:38:33,547 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-03-19 01:38:33,548 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-03-19 01:38:33,560 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-03-19 01:38:33,561 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-03-19 01:38:33,561 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-03-19 01:38:33,565 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-03-19 01:38:33,565 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-03-19 01:38:33,580 INFO L275 CfgBuilder]: Performing block encoding [2022-03-19 01:38:33,590 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-19 01:38:33,591 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-03-19 01:38:33,593 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.03 01:38:33 BoogieIcfgContainer [2022-03-19 01:38:33,593 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-19 01:38:33,594 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-03-19 01:38:33,594 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-03-19 01:38:33,595 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-03-19 01:38:33,598 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.03 01:38:33" (1/1) ... [2022-03-19 01:38:33,640 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 19.03 01:38:33 BasicIcfg [2022-03-19 01:38:33,640 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-03-19 01:38:33,642 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-19 01:38:33,642 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-19 01:38:33,644 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-19 01:38:33,644 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.03 01:38:32" (1/4) ... [2022-03-19 01:38:33,645 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5207cf3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.03 01:38:33, skipping insertion in model container [2022-03-19 01:38:33,645 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 01:38:32" (2/4) ... [2022-03-19 01:38:33,645 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5207cf3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.03 01:38:33, skipping insertion in model container [2022-03-19 01:38:33,646 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.03 01:38:33" (3/4) ... [2022-03-19 01:38:33,647 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5207cf3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.03 01:38:33, skipping insertion in model container [2022-03-19 01:38:33,647 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 19.03 01:38:33" (4/4) ... [2022-03-19 01:38:33,650 INFO L111 eAbstractionObserver]: Analyzing ICFG floppy_simpl4.cil-2.cqvasr [2022-03-19 01:38:33,657 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-03-19 01:38:33,662 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-19 01:38:33,716 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-19 01:38:33,722 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-03-19 01:38:33,723 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-03-19 01:38:33,754 INFO L276 IsEmpty]: Start isEmpty. Operand has 389 states, 288 states have (on average 1.46875) internal successors, (423), 314 states have internal predecessors, (423), 71 states have call successors, (71), 28 states have call predecessors, (71), 28 states have return successors, (71), 66 states have call predecessors, (71), 71 states have call successors, (71) [2022-03-19 01:38:33,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-19 01:38:33,758 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 01:38:33,758 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 01:38:33,758 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 01:38:33,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 01:38:33,762 INFO L85 PathProgramCache]: Analyzing trace with hash 871879161, now seen corresponding path program 1 times [2022-03-19 01:38:33,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 01:38:33,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360256860] [2022-03-19 01:38:33,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 01:38:33,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 01:38:33,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:38:34,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 01:38:34,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:38:34,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-19 01:38:34,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:38:34,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 01:38:34,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 01:38:34,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360256860] [2022-03-19 01:38:34,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360256860] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 01:38:34,163 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 01:38:34,163 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-19 01:38:34,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105170217] [2022-03-19 01:38:34,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 01:38:34,168 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-19 01:38:34,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-19 01:38:34,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-19 01:38:34,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-03-19 01:38:34,206 INFO L87 Difference]: Start difference. First operand has 389 states, 288 states have (on average 1.46875) internal successors, (423), 314 states have internal predecessors, (423), 71 states have call successors, (71), 28 states have call predecessors, (71), 28 states have return successors, (71), 66 states have call predecessors, (71), 71 states have call successors, (71) Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-03-19 01:38:35,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 01:38:35,174 INFO L93 Difference]: Finished difference Result 666 states and 978 transitions. [2022-03-19 01:38:35,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-19 01:38:35,177 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-03-19 01:38:35,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 01:38:35,188 INFO L225 Difference]: With dead ends: 666 [2022-03-19 01:38:35,188 INFO L226 Difference]: Without dead ends: 422 [2022-03-19 01:38:35,193 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-03-19 01:38:35,196 INFO L912 BasicCegarLoop]: 496 mSDtfsCounter, 408 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 717 mSolverCounterSat, 160 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 418 SdHoareTripleChecker+Valid, 735 SdHoareTripleChecker+Invalid, 877 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 160 IncrementalHoareTripleChecker+Valid, 717 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-19 01:38:35,196 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [418 Valid, 735 Invalid, 877 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [160 Valid, 717 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-19 01:38:35,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2022-03-19 01:38:35,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 380. [2022-03-19 01:38:35,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 282 states have (on average 1.429078014184397) internal successors, (403), 306 states have internal predecessors, (403), 71 states have call successors, (71), 28 states have call predecessors, (71), 26 states have return successors, (49), 48 states have call predecessors, (49), 49 states have call successors, (49) [2022-03-19 01:38:35,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 523 transitions. [2022-03-19 01:38:35,254 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 523 transitions. Word has length 20 [2022-03-19 01:38:35,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 01:38:35,254 INFO L478 AbstractCegarLoop]: Abstraction has 380 states and 523 transitions. [2022-03-19 01:38:35,254 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-03-19 01:38:35,254 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 523 transitions. [2022-03-19 01:38:35,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-19 01:38:35,255 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 01:38:35,255 INFO L500 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-03-19 01:38:35,255 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-19 01:38:35,256 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 01:38:35,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 01:38:35,256 INFO L85 PathProgramCache]: Analyzing trace with hash 291212257, now seen corresponding path program 1 times [2022-03-19 01:38:35,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 01:38:35,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060838957] [2022-03-19 01:38:35,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 01:38:35,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 01:38:35,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:38:35,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 01:38:35,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:38:35,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-19 01:38:35,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:38:35,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-19 01:38:35,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:38:35,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 01:38:35,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 01:38:35,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060838957] [2022-03-19 01:38:35,383 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060838957] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 01:38:35,383 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 01:38:35,383 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-19 01:38:35,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505845116] [2022-03-19 01:38:35,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 01:38:35,384 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-19 01:38:35,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-19 01:38:35,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-19 01:38:35,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-03-19 01:38:35,385 INFO L87 Difference]: Start difference. First operand 380 states and 523 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 3 states have internal predecessors, (15), 3 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-03-19 01:38:36,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 01:38:36,745 INFO L93 Difference]: Finished difference Result 747 states and 1022 transitions. [2022-03-19 01:38:36,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-19 01:38:36,745 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 3 states have internal predecessors, (15), 3 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 25 [2022-03-19 01:38:36,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 01:38:36,751 INFO L225 Difference]: With dead ends: 747 [2022-03-19 01:38:36,751 INFO L226 Difference]: Without dead ends: 584 [2022-03-19 01:38:36,752 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-03-19 01:38:36,753 INFO L912 BasicCegarLoop]: 634 mSDtfsCounter, 717 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 981 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 723 SdHoareTripleChecker+Valid, 892 SdHoareTripleChecker+Invalid, 1129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 981 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-03-19 01:38:36,753 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [723 Valid, 892 Invalid, 1129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 981 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-03-19 01:38:36,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2022-03-19 01:38:36,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 525. [2022-03-19 01:38:36,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 525 states, 405 states have (on average 1.3530864197530865) internal successors, (548), 410 states have internal predecessors, (548), 78 states have call successors, (78), 41 states have call predecessors, (78), 41 states have return successors, (90), 75 states have call predecessors, (90), 66 states have call successors, (90) [2022-03-19 01:38:36,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 716 transitions. [2022-03-19 01:38:36,791 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 716 transitions. Word has length 25 [2022-03-19 01:38:36,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 01:38:36,792 INFO L478 AbstractCegarLoop]: Abstraction has 525 states and 716 transitions. [2022-03-19 01:38:36,792 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 3 states have internal predecessors, (15), 3 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-03-19 01:38:36,792 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 716 transitions. [2022-03-19 01:38:36,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-03-19 01:38:36,793 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 01:38:36,793 INFO L500 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-03-19 01:38:36,793 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-19 01:38:36,793 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 01:38:36,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 01:38:36,794 INFO L85 PathProgramCache]: Analyzing trace with hash 525888156, now seen corresponding path program 1 times [2022-03-19 01:38:36,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 01:38:36,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235173070] [2022-03-19 01:38:36,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 01:38:36,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 01:38:36,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:38:36,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 01:38:36,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:38:36,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-19 01:38:36,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:38:36,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-19 01:38:36,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:38:36,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 01:38:36,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 01:38:36,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235173070] [2022-03-19 01:38:36,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235173070] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 01:38:36,959 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 01:38:36,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-19 01:38:36,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946578209] [2022-03-19 01:38:36,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 01:38:36,963 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-19 01:38:36,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-19 01:38:36,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-19 01:38:36,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-03-19 01:38:36,963 INFO L87 Difference]: Start difference. First operand 525 states and 716 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 3 states have internal predecessors, (21), 3 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-03-19 01:38:37,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 01:38:37,602 INFO L93 Difference]: Finished difference Result 695 states and 934 transitions. [2022-03-19 01:38:37,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-19 01:38:37,603 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 3 states have internal predecessors, (21), 3 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 31 [2022-03-19 01:38:37,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 01:38:37,606 INFO L225 Difference]: With dead ends: 695 [2022-03-19 01:38:37,607 INFO L226 Difference]: Without dead ends: 676 [2022-03-19 01:38:37,607 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-03-19 01:38:37,608 INFO L912 BasicCegarLoop]: 459 mSDtfsCounter, 946 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 224 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 953 SdHoareTripleChecker+Valid, 603 SdHoareTripleChecker+Invalid, 635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 224 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-19 01:38:37,608 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [953 Valid, 603 Invalid, 635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [224 Valid, 411 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-19 01:38:37,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2022-03-19 01:38:37,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 583. [2022-03-19 01:38:37,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 583 states, 450 states have (on average 1.3488888888888888) internal successors, (607), 463 states have internal predecessors, (607), 82 states have call successors, (82), 46 states have call predecessors, (82), 50 states have return successors, (101), 78 states have call predecessors, (101), 72 states have call successors, (101) [2022-03-19 01:38:37,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 790 transitions. [2022-03-19 01:38:37,634 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 790 transitions. Word has length 31 [2022-03-19 01:38:37,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 01:38:37,635 INFO L478 AbstractCegarLoop]: Abstraction has 583 states and 790 transitions. [2022-03-19 01:38:37,635 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 3 states have internal predecessors, (21), 3 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-03-19 01:38:37,635 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 790 transitions. [2022-03-19 01:38:37,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-03-19 01:38:37,636 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 01:38:37,636 INFO L500 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, 1] [2022-03-19 01:38:37,636 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-19 01:38:37,636 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 01:38:37,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 01:38:37,636 INFO L85 PathProgramCache]: Analyzing trace with hash -2004508172, now seen corresponding path program 1 times [2022-03-19 01:38:37,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 01:38:37,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230130531] [2022-03-19 01:38:37,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 01:38:37,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 01:38:37,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:38:37,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 01:38:37,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:38:37,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-19 01:38:37,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:38:37,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-19 01:38:37,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:38:37,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 01:38:37,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 01:38:37,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230130531] [2022-03-19 01:38:37,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230130531] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 01:38:37,761 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 01:38:37,761 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-19 01:38:37,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652795753] [2022-03-19 01:38:37,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 01:38:37,761 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-19 01:38:37,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-19 01:38:37,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-19 01:38:37,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-03-19 01:38:37,762 INFO L87 Difference]: Start difference. First operand 583 states and 790 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 3 states have internal predecessors, (23), 3 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-03-19 01:38:38,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 01:38:38,732 INFO L93 Difference]: Finished difference Result 1117 states and 1501 transitions. [2022-03-19 01:38:38,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-19 01:38:38,733 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 3 states have internal predecessors, (23), 3 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 33 [2022-03-19 01:38:38,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 01:38:38,737 INFO L225 Difference]: With dead ends: 1117 [2022-03-19 01:38:38,737 INFO L226 Difference]: Without dead ends: 819 [2022-03-19 01:38:38,738 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-03-19 01:38:38,739 INFO L912 BasicCegarLoop]: 541 mSDtfsCounter, 724 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 776 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 732 SdHoareTripleChecker+Valid, 744 SdHoareTripleChecker+Invalid, 914 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 776 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-19 01:38:38,740 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [732 Valid, 744 Invalid, 914 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 776 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-19 01:38:38,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2022-03-19 01:38:38,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 771. [2022-03-19 01:38:38,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 771 states, 606 states have (on average 1.33993399339934) internal successors, (812), 616 states have internal predecessors, (812), 99 states have call successors, (99), 61 states have call predecessors, (99), 65 states have return successors, (136), 97 states have call predecessors, (136), 91 states have call successors, (136) [2022-03-19 01:38:38,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 1047 transitions. [2022-03-19 01:38:38,785 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 1047 transitions. Word has length 33 [2022-03-19 01:38:38,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 01:38:38,785 INFO L478 AbstractCegarLoop]: Abstraction has 771 states and 1047 transitions. [2022-03-19 01:38:38,786 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 3 states have internal predecessors, (23), 3 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-03-19 01:38:38,786 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 1047 transitions. [2022-03-19 01:38:38,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-03-19 01:38:38,787 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 01:38:38,787 INFO L500 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, 1, 1, 1, 1, 1, 1] [2022-03-19 01:38:38,788 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-03-19 01:38:38,788 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 01:38:38,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 01:38:38,788 INFO L85 PathProgramCache]: Analyzing trace with hash 1331218314, now seen corresponding path program 1 times [2022-03-19 01:38:38,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 01:38:38,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65487441] [2022-03-19 01:38:38,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 01:38:38,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 01:38:38,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:38:38,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 01:38:38,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:38:38,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-19 01:38:38,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:38:38,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-19 01:38:38,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:38:38,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-03-19 01:38:38,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:38:38,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-19 01:38:38,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:38:38,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 01:38:38,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 01:38:38,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65487441] [2022-03-19 01:38:38,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65487441] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 01:38:38,918 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 01:38:38,918 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-03-19 01:38:38,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901539154] [2022-03-19 01:38:38,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 01:38:38,919 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-19 01:38:38,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-19 01:38:38,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-19 01:38:38,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-03-19 01:38:38,919 INFO L87 Difference]: Start difference. First operand 771 states and 1047 transitions. Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-03-19 01:38:39,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 01:38:39,966 INFO L93 Difference]: Finished difference Result 865 states and 1163 transitions. [2022-03-19 01:38:39,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-19 01:38:39,967 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 38 [2022-03-19 01:38:39,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 01:38:39,971 INFO L225 Difference]: With dead ends: 865 [2022-03-19 01:38:39,971 INFO L226 Difference]: Without dead ends: 860 [2022-03-19 01:38:39,971 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2022-03-19 01:38:39,972 INFO L912 BasicCegarLoop]: 476 mSDtfsCounter, 516 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 1024 mSolverCounterSat, 156 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 517 SdHoareTripleChecker+Valid, 945 SdHoareTripleChecker+Invalid, 1180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 156 IncrementalHoareTripleChecker+Valid, 1024 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-19 01:38:39,972 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [517 Valid, 945 Invalid, 1180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [156 Valid, 1024 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-19 01:38:39,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 860 states. [2022-03-19 01:38:40,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 860 to 808. [2022-03-19 01:38:40,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 808 states, 636 states have (on average 1.3333333333333333) internal successors, (848), 648 states have internal predecessors, (848), 99 states have call successors, (99), 61 states have call predecessors, (99), 72 states have return successors, (143), 100 states have call predecessors, (143), 91 states have call successors, (143) [2022-03-19 01:38:40,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 808 states and 1090 transitions. [2022-03-19 01:38:40,006 INFO L78 Accepts]: Start accepts. Automaton has 808 states and 1090 transitions. Word has length 38 [2022-03-19 01:38:40,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 01:38:40,006 INFO L478 AbstractCegarLoop]: Abstraction has 808 states and 1090 transitions. [2022-03-19 01:38:40,006 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-03-19 01:38:40,006 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states and 1090 transitions. [2022-03-19 01:38:40,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-03-19 01:38:40,007 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 01:38:40,008 INFO L500 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, 1, 1, 1, 1, 1, 1] [2022-03-19 01:38:40,008 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-03-19 01:38:40,008 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 01:38:40,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 01:38:40,008 INFO L85 PathProgramCache]: Analyzing trace with hash 528133378, now seen corresponding path program 1 times [2022-03-19 01:38:40,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 01:38:40,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420561125] [2022-03-19 01:38:40,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 01:38:40,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 01:38:40,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:38:40,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 01:38:40,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:38:40,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-19 01:38:40,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:38:40,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-19 01:38:40,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:38:40,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 01:38:40,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 01:38:40,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420561125] [2022-03-19 01:38:40,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420561125] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 01:38:40,130 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 01:38:40,130 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-19 01:38:40,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772195375] [2022-03-19 01:38:40,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 01:38:40,130 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-19 01:38:40,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-19 01:38:40,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-19 01:38:40,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-03-19 01:38:40,131 INFO L87 Difference]: Start difference. First operand 808 states and 1090 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 3 states have internal predecessors, (28), 3 states have call successors, (7), 6 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-03-19 01:38:41,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 01:38:41,158 INFO L93 Difference]: Finished difference Result 842 states and 1132 transitions. [2022-03-19 01:38:41,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-19 01:38:41,159 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 3 states have internal predecessors, (28), 3 states have call successors, (7), 6 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 38 [2022-03-19 01:38:41,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 01:38:41,163 INFO L225 Difference]: With dead ends: 842 [2022-03-19 01:38:41,163 INFO L226 Difference]: Without dead ends: 839 [2022-03-19 01:38:41,163 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-03-19 01:38:41,165 INFO L912 BasicCegarLoop]: 467 mSDtfsCounter, 256 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 1088 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 743 SdHoareTripleChecker+Invalid, 1163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 1088 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-19 01:38:41,166 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [260 Valid, 743 Invalid, 1163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 1088 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-19 01:38:41,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2022-03-19 01:38:41,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 819. [2022-03-19 01:38:41,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 819 states, 647 states have (on average 1.3323029366306027) internal successors, (862), 658 states have internal predecessors, (862), 99 states have call successors, (99), 62 states have call predecessors, (99), 72 states have return successors, (143), 100 states have call predecessors, (143), 91 states have call successors, (143) [2022-03-19 01:38:41,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 1104 transitions. [2022-03-19 01:38:41,200 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 1104 transitions. Word has length 38 [2022-03-19 01:38:41,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 01:38:41,201 INFO L478 AbstractCegarLoop]: Abstraction has 819 states and 1104 transitions. [2022-03-19 01:38:41,201 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 3 states have internal predecessors, (28), 3 states have call successors, (7), 6 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-03-19 01:38:41,201 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 1104 transitions. [2022-03-19 01:38:41,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-03-19 01:38:41,203 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 01:38:41,203 INFO L500 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 01:38:41,203 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-03-19 01:38:41,203 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 01:38:41,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 01:38:41,203 INFO L85 PathProgramCache]: Analyzing trace with hash 1133526780, now seen corresponding path program 1 times [2022-03-19 01:38:41,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 01:38:41,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050598818] [2022-03-19 01:38:41,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 01:38:41,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 01:38:41,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:38:41,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 01:38:41,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:38:41,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-19 01:38:41,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:38:41,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-19 01:38:41,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:38:41,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-03-19 01:38:41,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:38:41,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-19 01:38:41,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:38:41,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 01:38:41,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 01:38:41,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050598818] [2022-03-19 01:38:41,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050598818] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 01:38:41,437 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 01:38:41,437 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-03-19 01:38:41,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719802074] [2022-03-19 01:38:41,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 01:38:41,437 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-19 01:38:41,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-19 01:38:41,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-19 01:38:41,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-03-19 01:38:41,438 INFO L87 Difference]: Start difference. First operand 819 states and 1104 transitions. Second operand has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-03-19 01:38:43,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 01:38:43,149 INFO L93 Difference]: Finished difference Result 877 states and 1176 transitions. [2022-03-19 01:38:43,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-19 01:38:43,150 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Word has length 40 [2022-03-19 01:38:43,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 01:38:43,153 INFO L225 Difference]: With dead ends: 877 [2022-03-19 01:38:43,153 INFO L226 Difference]: Without dead ends: 871 [2022-03-19 01:38:43,154 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=111, Invalid=269, Unknown=0, NotChecked=0, Total=380 [2022-03-19 01:38:43,154 INFO L912 BasicCegarLoop]: 455 mSDtfsCounter, 1349 mSDsluCounter, 713 mSDsCounter, 0 mSdLazyCounter, 2031 mSolverCounterSat, 359 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1364 SdHoareTripleChecker+Valid, 1168 SdHoareTripleChecker+Invalid, 2390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 359 IncrementalHoareTripleChecker+Valid, 2031 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-03-19 01:38:43,154 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [1364 Valid, 1168 Invalid, 2390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [359 Valid, 2031 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-03-19 01:38:43,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871 states. [2022-03-19 01:38:43,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871 to 819. [2022-03-19 01:38:43,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 819 states, 647 states have (on average 1.330757341576507) internal successors, (861), 658 states have internal predecessors, (861), 99 states have call successors, (99), 62 states have call predecessors, (99), 72 states have return successors, (143), 100 states have call predecessors, (143), 91 states have call successors, (143) [2022-03-19 01:38:43,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 1103 transitions. [2022-03-19 01:38:43,194 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 1103 transitions. Word has length 40 [2022-03-19 01:38:43,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 01:38:43,195 INFO L478 AbstractCegarLoop]: Abstraction has 819 states and 1103 transitions. [2022-03-19 01:38:43,195 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-03-19 01:38:43,195 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 1103 transitions. [2022-03-19 01:38:43,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-03-19 01:38:43,196 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 01:38:43,196 INFO L500 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 01:38:43,196 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-03-19 01:38:43,196 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 01:38:43,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 01:38:43,196 INFO L85 PathProgramCache]: Analyzing trace with hash -174684695, now seen corresponding path program 1 times [2022-03-19 01:38:43,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 01:38:43,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407706179] [2022-03-19 01:38:43,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 01:38:43,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 01:38:43,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:38:43,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 01:38:43,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:38:43,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-19 01:38:43,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:38:43,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-19 01:38:43,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:38:43,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-03-19 01:38:43,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:38:43,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-19 01:38:43,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:38:43,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 01:38:43,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 01:38:43,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407706179] [2022-03-19 01:38:43,383 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407706179] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 01:38:43,383 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 01:38:43,383 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-03-19 01:38:43,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113622289] [2022-03-19 01:38:43,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 01:38:43,384 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-19 01:38:43,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-19 01:38:43,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-19 01:38:43,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-03-19 01:38:43,385 INFO L87 Difference]: Start difference. First operand 819 states and 1103 transitions. Second operand has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 7 states have internal predecessors, (29), 3 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-03-19 01:38:44,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 01:38:44,693 INFO L93 Difference]: Finished difference Result 877 states and 1175 transitions. [2022-03-19 01:38:44,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-19 01:38:44,694 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 7 states have internal predecessors, (29), 3 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Word has length 41 [2022-03-19 01:38:44,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 01:38:44,699 INFO L225 Difference]: With dead ends: 877 [2022-03-19 01:38:44,699 INFO L226 Difference]: Without dead ends: 871 [2022-03-19 01:38:44,699 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=111, Invalid=269, Unknown=0, NotChecked=0, Total=380 [2022-03-19 01:38:44,700 INFO L912 BasicCegarLoop]: 456 mSDtfsCounter, 1634 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 1346 mSolverCounterSat, 478 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1649 SdHoareTripleChecker+Valid, 885 SdHoareTripleChecker+Invalid, 1824 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 478 IncrementalHoareTripleChecker+Valid, 1346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-19 01:38:44,700 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [1649 Valid, 885 Invalid, 1824 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [478 Valid, 1346 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-19 01:38:44,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871 states. [2022-03-19 01:38:44,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871 to 819. [2022-03-19 01:38:44,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 819 states, 647 states have (on average 1.3292117465224111) internal successors, (860), 658 states have internal predecessors, (860), 99 states have call successors, (99), 62 states have call predecessors, (99), 72 states have return successors, (143), 100 states have call predecessors, (143), 91 states have call successors, (143) [2022-03-19 01:38:44,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 1102 transitions. [2022-03-19 01:38:44,742 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 1102 transitions. Word has length 41 [2022-03-19 01:38:44,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 01:38:44,742 INFO L478 AbstractCegarLoop]: Abstraction has 819 states and 1102 transitions. [2022-03-19 01:38:44,742 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 7 states have internal predecessors, (29), 3 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-03-19 01:38:44,742 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 1102 transitions. [2022-03-19 01:38:44,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-03-19 01:38:44,743 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 01:38:44,743 INFO L500 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 01:38:44,744 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-03-19 01:38:44,744 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 01:38:44,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 01:38:44,744 INFO L85 PathProgramCache]: Analyzing trace with hash -1816872397, now seen corresponding path program 1 times [2022-03-19 01:38:44,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 01:38:44,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300902565] [2022-03-19 01:38:44,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 01:38:44,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 01:38:44,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:38:44,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 01:38:44,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:38:44,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-19 01:38:44,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:38:44,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-19 01:38:44,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:38:44,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-03-19 01:38:44,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:38:44,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-19 01:38:44,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:38:44,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 01:38:44,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 01:38:44,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300902565] [2022-03-19 01:38:44,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300902565] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 01:38:44,879 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 01:38:44,879 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-19 01:38:44,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299523103] [2022-03-19 01:38:44,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 01:38:44,879 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-19 01:38:44,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-19 01:38:44,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-19 01:38:44,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-03-19 01:38:44,880 INFO L87 Difference]: Start difference. First operand 819 states and 1102 transitions. Second operand has 10 states, 10 states have (on average 3.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-03-19 01:38:45,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 01:38:45,932 INFO L93 Difference]: Finished difference Result 882 states and 1180 transitions. [2022-03-19 01:38:45,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-19 01:38:45,932 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 42 [2022-03-19 01:38:45,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 01:38:45,936 INFO L225 Difference]: With dead ends: 882 [2022-03-19 01:38:45,936 INFO L226 Difference]: Without dead ends: 867 [2022-03-19 01:38:45,937 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-03-19 01:38:45,937 INFO L912 BasicCegarLoop]: 488 mSDtfsCounter, 671 mSDsluCounter, 802 mSDsCounter, 0 mSdLazyCounter, 1543 mSolverCounterSat, 220 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 680 SdHoareTripleChecker+Valid, 1290 SdHoareTripleChecker+Invalid, 1763 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 220 IncrementalHoareTripleChecker+Valid, 1543 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-03-19 01:38:45,937 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [680 Valid, 1290 Invalid, 1763 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [220 Valid, 1543 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-03-19 01:38:45,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 867 states. [2022-03-19 01:38:45,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 867 to 817. [2022-03-19 01:38:45,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 817 states, 646 states have (on average 1.328173374613003) internal successors, (858), 657 states have internal predecessors, (858), 98 states have call successors, (98), 62 states have call predecessors, (98), 72 states have return successors, (142), 99 states have call predecessors, (142), 90 states have call successors, (142) [2022-03-19 01:38:45,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 817 states to 817 states and 1098 transitions. [2022-03-19 01:38:45,994 INFO L78 Accepts]: Start accepts. Automaton has 817 states and 1098 transitions. Word has length 42 [2022-03-19 01:38:45,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 01:38:45,994 INFO L478 AbstractCegarLoop]: Abstraction has 817 states and 1098 transitions. [2022-03-19 01:38:45,995 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-03-19 01:38:45,995 INFO L276 IsEmpty]: Start isEmpty. Operand 817 states and 1098 transitions. [2022-03-19 01:38:45,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-03-19 01:38:45,995 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 01:38:45,995 INFO L500 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 01:38:45,996 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-03-19 01:38:45,996 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 01:38:45,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 01:38:45,996 INFO L85 PathProgramCache]: Analyzing trace with hash -1390592098, now seen corresponding path program 1 times [2022-03-19 01:38:45,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 01:38:45,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955097575] [2022-03-19 01:38:45,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 01:38:45,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 01:38:46,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:38:46,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 01:38:46,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:38:46,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-19 01:38:46,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:38:46,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-19 01:38:46,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:38:46,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-03-19 01:38:46,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:38:46,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-19 01:38:46,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:38:46,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 01:38:46,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 01:38:46,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955097575] [2022-03-19 01:38:46,193 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955097575] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 01:38:46,193 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 01:38:46,193 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-19 01:38:46,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199389368] [2022-03-19 01:38:46,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 01:38:46,193 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-19 01:38:46,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-19 01:38:46,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-19 01:38:46,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-03-19 01:38:46,194 INFO L87 Difference]: Start difference. First operand 817 states and 1098 transitions. Second operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-03-19 01:38:47,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 01:38:47,291 INFO L93 Difference]: Finished difference Result 880 states and 1176 transitions. [2022-03-19 01:38:47,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-19 01:38:47,291 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 41 [2022-03-19 01:38:47,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 01:38:47,294 INFO L225 Difference]: With dead ends: 880 [2022-03-19 01:38:47,294 INFO L226 Difference]: Without dead ends: 860 [2022-03-19 01:38:47,295 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-03-19 01:38:47,296 INFO L912 BasicCegarLoop]: 475 mSDtfsCounter, 515 mSDsluCounter, 826 mSDsCounter, 0 mSdLazyCounter, 1697 mSolverCounterSat, 158 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 523 SdHoareTripleChecker+Valid, 1301 SdHoareTripleChecker+Invalid, 1855 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 158 IncrementalHoareTripleChecker+Valid, 1697 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-03-19 01:38:47,297 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [523 Valid, 1301 Invalid, 1855 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [158 Valid, 1697 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-03-19 01:38:47,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 860 states. [2022-03-19 01:38:47,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 860 to 810. [2022-03-19 01:38:47,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 810 states, 642 states have (on average 1.3286604361370717) internal successors, (853), 653 states have internal predecessors, (853), 96 states have call successors, (96), 61 states have call predecessors, (96), 71 states have return successors, (140), 97 states have call predecessors, (140), 88 states have call successors, (140) [2022-03-19 01:38:47,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 810 states to 810 states and 1089 transitions. [2022-03-19 01:38:47,337 INFO L78 Accepts]: Start accepts. Automaton has 810 states and 1089 transitions. Word has length 41 [2022-03-19 01:38:47,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 01:38:47,338 INFO L478 AbstractCegarLoop]: Abstraction has 810 states and 1089 transitions. [2022-03-19 01:38:47,338 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-03-19 01:38:47,338 INFO L276 IsEmpty]: Start isEmpty. Operand 810 states and 1089 transitions. [2022-03-19 01:38:47,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-03-19 01:38:47,339 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 01:38:47,339 INFO L500 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 01:38:47,339 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-03-19 01:38:47,339 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 01:38:47,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 01:38:47,340 INFO L85 PathProgramCache]: Analyzing trace with hash -4159802, now seen corresponding path program 1 times [2022-03-19 01:38:47,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 01:38:47,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148218095] [2022-03-19 01:38:47,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 01:38:47,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 01:38:47,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:38:47,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 01:38:47,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:38:47,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-19 01:38:47,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:38:47,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-19 01:38:47,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:38:47,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-03-19 01:38:47,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:38:47,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 01:38:47,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 01:38:47,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148218095] [2022-03-19 01:38:47,517 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148218095] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 01:38:47,517 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 01:38:47,517 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-03-19 01:38:47,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743301759] [2022-03-19 01:38:47,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 01:38:47,518 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-19 01:38:47,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-19 01:38:47,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-19 01:38:47,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-03-19 01:38:47,518 INFO L87 Difference]: Start difference. First operand 810 states and 1089 transitions. Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-03-19 01:38:48,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 01:38:48,546 INFO L93 Difference]: Finished difference Result 857 states and 1144 transitions. [2022-03-19 01:38:48,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-19 01:38:48,547 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 42 [2022-03-19 01:38:48,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 01:38:48,549 INFO L225 Difference]: With dead ends: 857 [2022-03-19 01:38:48,549 INFO L226 Difference]: Without dead ends: 835 [2022-03-19 01:38:48,550 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-03-19 01:38:48,550 INFO L912 BasicCegarLoop]: 456 mSDtfsCounter, 391 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 1369 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 1012 SdHoareTripleChecker+Invalid, 1509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 1369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-19 01:38:48,551 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [395 Valid, 1012 Invalid, 1509 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 1369 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-19 01:38:48,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 835 states. [2022-03-19 01:38:48,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 835 to 812. [2022-03-19 01:38:48,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 812 states, 644 states have (on average 1.3276397515527951) internal successors, (855), 655 states have internal predecessors, (855), 96 states have call successors, (96), 61 states have call predecessors, (96), 71 states have return successors, (140), 97 states have call predecessors, (140), 88 states have call successors, (140) [2022-03-19 01:38:48,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 812 states to 812 states and 1091 transitions. [2022-03-19 01:38:48,585 INFO L78 Accepts]: Start accepts. Automaton has 812 states and 1091 transitions. Word has length 42 [2022-03-19 01:38:48,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 01:38:48,585 INFO L478 AbstractCegarLoop]: Abstraction has 812 states and 1091 transitions. [2022-03-19 01:38:48,585 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-03-19 01:38:48,585 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 1091 transitions. [2022-03-19 01:38:48,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-03-19 01:38:48,586 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 01:38:48,586 INFO L500 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 01:38:48,586 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-03-19 01:38:48,586 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 01:38:48,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 01:38:48,587 INFO L85 PathProgramCache]: Analyzing trace with hash 383655172, now seen corresponding path program 1 times [2022-03-19 01:38:48,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 01:38:48,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073098861] [2022-03-19 01:38:48,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 01:38:48,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 01:38:48,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:38:48,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 01:38:48,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:38:48,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-19 01:38:48,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:38:48,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-19 01:38:48,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:38:48,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-03-19 01:38:48,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:38:48,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 01:38:48,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 01:38:48,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073098861] [2022-03-19 01:38:48,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073098861] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 01:38:48,721 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 01:38:48,722 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-03-19 01:38:48,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053246998] [2022-03-19 01:38:48,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 01:38:48,722 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-19 01:38:48,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-19 01:38:48,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-19 01:38:48,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-03-19 01:38:48,722 INFO L87 Difference]: Start difference. First operand 812 states and 1091 transitions. Second operand has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-03-19 01:38:49,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 01:38:49,901 INFO L93 Difference]: Finished difference Result 908 states and 1209 transitions. [2022-03-19 01:38:49,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-19 01:38:49,901 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 44 [2022-03-19 01:38:49,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 01:38:49,904 INFO L225 Difference]: With dead ends: 908 [2022-03-19 01:38:49,904 INFO L226 Difference]: Without dead ends: 840 [2022-03-19 01:38:49,904 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-03-19 01:38:49,905 INFO L912 BasicCegarLoop]: 432 mSDtfsCounter, 378 mSDsluCounter, 482 mSDsCounter, 0 mSdLazyCounter, 1868 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 396 SdHoareTripleChecker+Valid, 914 SdHoareTripleChecker+Invalid, 1963 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 1868 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-03-19 01:38:49,905 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [396 Valid, 914 Invalid, 1963 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 1868 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-03-19 01:38:49,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 840 states. [2022-03-19 01:38:49,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 840 to 816. [2022-03-19 01:38:49,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 816 states, 647 states have (on average 1.3261205564142196) internal successors, (858), 658 states have internal predecessors, (858), 96 states have call successors, (96), 61 states have call predecessors, (96), 72 states have return successors, (142), 98 states have call predecessors, (142), 88 states have call successors, (142) [2022-03-19 01:38:49,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 816 states to 816 states and 1096 transitions. [2022-03-19 01:38:49,940 INFO L78 Accepts]: Start accepts. Automaton has 816 states and 1096 transitions. Word has length 44 [2022-03-19 01:38:49,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 01:38:49,940 INFO L478 AbstractCegarLoop]: Abstraction has 816 states and 1096 transitions. [2022-03-19 01:38:49,940 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-03-19 01:38:49,940 INFO L276 IsEmpty]: Start isEmpty. Operand 816 states and 1096 transitions. [2022-03-19 01:38:49,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-03-19 01:38:49,941 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 01:38:49,941 INFO L500 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 01:38:49,941 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-03-19 01:38:49,941 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 01:38:49,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 01:38:49,941 INFO L85 PathProgramCache]: Analyzing trace with hash -864015436, now seen corresponding path program 1 times [2022-03-19 01:38:49,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 01:38:49,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681034645] [2022-03-19 01:38:49,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 01:38:49,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 01:38:49,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:38:50,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 01:38:50,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:38:50,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-19 01:38:50,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:38:50,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-19 01:38:50,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:38:50,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-03-19 01:38:50,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:38:50,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 01:38:50,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 01:38:50,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681034645] [2022-03-19 01:38:50,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681034645] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 01:38:50,085 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 01:38:50,085 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-03-19 01:38:50,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399490638] [2022-03-19 01:38:50,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 01:38:50,086 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-19 01:38:50,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-19 01:38:50,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-19 01:38:50,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-03-19 01:38:50,087 INFO L87 Difference]: Start difference. First operand 816 states and 1096 transitions. Second operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-03-19 01:38:51,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 01:38:51,245 INFO L93 Difference]: Finished difference Result 860 states and 1147 transitions. [2022-03-19 01:38:51,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-19 01:38:51,245 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 43 [2022-03-19 01:38:51,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 01:38:51,248 INFO L225 Difference]: With dead ends: 860 [2022-03-19 01:38:51,248 INFO L226 Difference]: Without dead ends: 838 [2022-03-19 01:38:51,248 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2022-03-19 01:38:51,249 INFO L912 BasicCegarLoop]: 461 mSDtfsCounter, 293 mSDsluCounter, 549 mSDsCounter, 0 mSdLazyCounter, 1376 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 1010 SdHoareTripleChecker+Invalid, 1476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 1376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-03-19 01:38:51,249 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [298 Valid, 1010 Invalid, 1476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 1376 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-03-19 01:38:51,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2022-03-19 01:38:51,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 816. [2022-03-19 01:38:51,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 816 states, 647 states have (on average 1.3261205564142196) internal successors, (858), 658 states have internal predecessors, (858), 96 states have call successors, (96), 61 states have call predecessors, (96), 72 states have return successors, (142), 98 states have call predecessors, (142), 88 states have call successors, (142) [2022-03-19 01:38:51,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 816 states to 816 states and 1096 transitions. [2022-03-19 01:38:51,284 INFO L78 Accepts]: Start accepts. Automaton has 816 states and 1096 transitions. Word has length 43 [2022-03-19 01:38:51,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 01:38:51,284 INFO L478 AbstractCegarLoop]: Abstraction has 816 states and 1096 transitions. [2022-03-19 01:38:51,284 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-03-19 01:38:51,284 INFO L276 IsEmpty]: Start isEmpty. Operand 816 states and 1096 transitions. [2022-03-19 01:38:51,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-03-19 01:38:51,285 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 01:38:51,285 INFO L500 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 01:38:51,285 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-03-19 01:38:51,285 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 01:38:51,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 01:38:51,286 INFO L85 PathProgramCache]: Analyzing trace with hash -392590886, now seen corresponding path program 1 times [2022-03-19 01:38:51,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 01:38:51,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330783585] [2022-03-19 01:38:51,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 01:38:51,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 01:38:51,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:38:51,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 01:38:51,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:38:51,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-19 01:38:51,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:38:51,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-19 01:38:51,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:38:51,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-03-19 01:38:51,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:38:51,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-03-19 01:38:51,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:38:51,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 01:38:51,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 01:38:51,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330783585] [2022-03-19 01:38:51,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330783585] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 01:38:51,434 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 01:38:51,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-19 01:38:51,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660984673] [2022-03-19 01:38:51,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 01:38:51,434 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-19 01:38:51,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-19 01:38:51,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-19 01:38:51,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-03-19 01:38:51,435 INFO L87 Difference]: Start difference. First operand 816 states and 1096 transitions. Second operand has 10 states, 10 states have (on average 3.3) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-03-19 01:38:52,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 01:38:52,302 INFO L93 Difference]: Finished difference Result 861 states and 1149 transitions. [2022-03-19 01:38:52,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-19 01:38:52,303 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 45 [2022-03-19 01:38:52,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 01:38:52,306 INFO L225 Difference]: With dead ends: 861 [2022-03-19 01:38:52,306 INFO L226 Difference]: Without dead ends: 843 [2022-03-19 01:38:52,307 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-03-19 01:38:52,307 INFO L912 BasicCegarLoop]: 457 mSDtfsCounter, 784 mSDsluCounter, 869 mSDsCounter, 0 mSdLazyCounter, 1502 mSolverCounterSat, 250 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 788 SdHoareTripleChecker+Valid, 1326 SdHoareTripleChecker+Invalid, 1752 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 250 IncrementalHoareTripleChecker+Valid, 1502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-19 01:38:52,307 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [788 Valid, 1326 Invalid, 1752 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [250 Valid, 1502 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-19 01:38:52,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 843 states. [2022-03-19 01:38:52,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 843 to 814. [2022-03-19 01:38:52,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 814 states, 646 states have (on average 1.325077399380805) internal successors, (856), 657 states have internal predecessors, (856), 95 states have call successors, (95), 61 states have call predecessors, (95), 72 states have return successors, (141), 97 states have call predecessors, (141), 87 states have call successors, (141) [2022-03-19 01:38:52,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 814 states to 814 states and 1092 transitions. [2022-03-19 01:38:52,390 INFO L78 Accepts]: Start accepts. Automaton has 814 states and 1092 transitions. Word has length 45 [2022-03-19 01:38:52,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 01:38:52,391 INFO L478 AbstractCegarLoop]: Abstraction has 814 states and 1092 transitions. [2022-03-19 01:38:52,391 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-03-19 01:38:52,391 INFO L276 IsEmpty]: Start isEmpty. Operand 814 states and 1092 transitions. [2022-03-19 01:38:52,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-03-19 01:38:52,403 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 01:38:52,403 INFO L500 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 01:38:52,403 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-03-19 01:38:52,404 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 01:38:52,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 01:38:52,404 INFO L85 PathProgramCache]: Analyzing trace with hash -1509958495, now seen corresponding path program 1 times [2022-03-19 01:38:52,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 01:38:52,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391461893] [2022-03-19 01:38:52,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 01:38:52,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 01:38:52,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:38:52,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 01:38:52,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:38:52,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-19 01:38:52,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:38:52,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-19 01:38:52,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:38:52,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-03-19 01:38:52,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:38:52,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-03-19 01:38:52,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:38:52,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 01:38:52,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 01:38:52,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391461893] [2022-03-19 01:38:52,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391461893] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 01:38:52,536 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 01:38:52,536 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-03-19 01:38:52,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977526671] [2022-03-19 01:38:52,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 01:38:52,537 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-19 01:38:52,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-19 01:38:52,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-19 01:38:52,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-03-19 01:38:52,537 INFO L87 Difference]: Start difference. First operand 814 states and 1092 transitions. Second operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-03-19 01:38:53,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 01:38:53,357 INFO L93 Difference]: Finished difference Result 880 states and 1173 transitions. [2022-03-19 01:38:53,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-19 01:38:53,357 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 46 [2022-03-19 01:38:53,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 01:38:53,362 INFO L225 Difference]: With dead ends: 880 [2022-03-19 01:38:53,362 INFO L226 Difference]: Without dead ends: 804 [2022-03-19 01:38:53,364 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-03-19 01:38:53,365 INFO L912 BasicCegarLoop]: 486 mSDtfsCounter, 730 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 1072 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 734 SdHoareTripleChecker+Valid, 878 SdHoareTripleChecker+Invalid, 1278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 1072 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-19 01:38:53,365 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [734 Valid, 878 Invalid, 1278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 1072 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-19 01:38:53,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2022-03-19 01:38:53,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 775. [2022-03-19 01:38:53,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 775 states, 616 states have (on average 1.3246753246753247) internal successors, (816), 628 states have internal predecessors, (816), 93 states have call successors, (93), 60 states have call predecessors, (93), 65 states have return successors, (132), 88 states have call predecessors, (132), 85 states have call successors, (132) [2022-03-19 01:38:53,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 1041 transitions. [2022-03-19 01:38:53,418 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 1041 transitions. Word has length 46 [2022-03-19 01:38:53,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 01:38:53,419 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 1041 transitions. [2022-03-19 01:38:53,419 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-03-19 01:38:53,419 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 1041 transitions. [2022-03-19 01:38:53,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-03-19 01:38:53,420 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 01:38:53,420 INFO L500 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 01:38:53,420 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-03-19 01:38:53,420 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 01:38:53,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 01:38:53,421 INFO L85 PathProgramCache]: Analyzing trace with hash -214129706, now seen corresponding path program 1 times [2022-03-19 01:38:53,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 01:38:53,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356330305] [2022-03-19 01:38:53,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 01:38:53,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 01:38:53,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:38:53,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 01:38:53,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:38:53,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-19 01:38:53,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:38:53,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-19 01:38:53,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:38:53,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-03-19 01:38:53,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:38:53,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 01:38:53,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 01:38:53,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356330305] [2022-03-19 01:38:53,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356330305] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 01:38:53,553 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 01:38:53,553 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-03-19 01:38:53,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672947631] [2022-03-19 01:38:53,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 01:38:53,554 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-19 01:38:53,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-19 01:38:53,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-19 01:38:53,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-03-19 01:38:53,554 INFO L87 Difference]: Start difference. First operand 775 states and 1041 transitions. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (8), 6 states have call predecessors, (8), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-03-19 01:38:54,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 01:38:54,902 INFO L93 Difference]: Finished difference Result 1134 states and 1535 transitions. [2022-03-19 01:38:54,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-19 01:38:54,903 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (8), 6 states have call predecessors, (8), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 47 [2022-03-19 01:38:54,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 01:38:54,907 INFO L225 Difference]: With dead ends: 1134 [2022-03-19 01:38:54,908 INFO L226 Difference]: Without dead ends: 1131 [2022-03-19 01:38:54,908 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-03-19 01:38:54,909 INFO L912 BasicCegarLoop]: 533 mSDtfsCounter, 583 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 1272 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 600 SdHoareTripleChecker+Valid, 782 SdHoareTripleChecker+Invalid, 1442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 1272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-03-19 01:38:54,910 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [600 Valid, 782 Invalid, 1442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 1272 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-03-19 01:38:54,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1131 states. [2022-03-19 01:38:54,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1131 to 888. [2022-03-19 01:38:54,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 888 states, 707 states have (on average 1.3295615275813295) internal successors, (940), 721 states have internal predecessors, (940), 103 states have call successors, (103), 70 states have call predecessors, (103), 77 states have return successors, (152), 98 states have call predecessors, (152), 95 states have call successors, (152) [2022-03-19 01:38:54,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 888 states to 888 states and 1195 transitions. [2022-03-19 01:38:54,971 INFO L78 Accepts]: Start accepts. Automaton has 888 states and 1195 transitions. Word has length 47 [2022-03-19 01:38:54,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 01:38:54,971 INFO L478 AbstractCegarLoop]: Abstraction has 888 states and 1195 transitions. [2022-03-19 01:38:54,972 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (8), 6 states have call predecessors, (8), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-03-19 01:38:54,972 INFO L276 IsEmpty]: Start isEmpty. Operand 888 states and 1195 transitions. [2022-03-19 01:38:54,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-03-19 01:38:54,973 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 01:38:54,973 INFO L500 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 01:38:54,973 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-03-19 01:38:54,973 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 01:38:54,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 01:38:54,974 INFO L85 PathProgramCache]: Analyzing trace with hash 530917733, now seen corresponding path program 1 times [2022-03-19 01:38:54,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 01:38:54,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922135690] [2022-03-19 01:38:54,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 01:38:54,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 01:38:54,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:38:55,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 01:38:55,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:38:55,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-19 01:38:55,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:38:55,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-19 01:38:55,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:38:55,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-03-19 01:38:55,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:38:55,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-03-19 01:38:55,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:38:55,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 01:38:55,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 01:38:55,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922135690] [2022-03-19 01:38:55,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922135690] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 01:38:55,171 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 01:38:55,171 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-19 01:38:55,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568155025] [2022-03-19 01:38:55,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 01:38:55,172 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-19 01:38:55,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-19 01:38:55,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-19 01:38:55,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-03-19 01:38:55,173 INFO L87 Difference]: Start difference. First operand 888 states and 1195 transitions. Second operand has 10 states, 10 states have (on average 3.5) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-03-19 01:38:56,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 01:38:56,354 INFO L93 Difference]: Finished difference Result 933 states and 1248 transitions. [2022-03-19 01:38:56,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-19 01:38:56,354 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.5) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 47 [2022-03-19 01:38:56,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 01:38:56,357 INFO L225 Difference]: With dead ends: 933 [2022-03-19 01:38:56,357 INFO L226 Difference]: Without dead ends: 915 [2022-03-19 01:38:56,358 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-03-19 01:38:56,358 INFO L912 BasicCegarLoop]: 448 mSDtfsCounter, 308 mSDsluCounter, 813 mSDsCounter, 0 mSdLazyCounter, 1667 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 1261 SdHoareTripleChecker+Invalid, 1745 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 1667 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-03-19 01:38:56,359 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [312 Valid, 1261 Invalid, 1745 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 1667 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-03-19 01:38:56,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 915 states. [2022-03-19 01:38:56,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 915 to 886. [2022-03-19 01:38:56,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 886 states, 706 states have (on average 1.3286118980169972) internal successors, (938), 720 states have internal predecessors, (938), 102 states have call successors, (102), 70 states have call predecessors, (102), 77 states have return successors, (151), 97 states have call predecessors, (151), 94 states have call successors, (151) [2022-03-19 01:38:56,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 886 states to 886 states and 1191 transitions. [2022-03-19 01:38:56,426 INFO L78 Accepts]: Start accepts. Automaton has 886 states and 1191 transitions. Word has length 47 [2022-03-19 01:38:56,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 01:38:56,427 INFO L478 AbstractCegarLoop]: Abstraction has 886 states and 1191 transitions. [2022-03-19 01:38:56,427 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.5) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-03-19 01:38:56,427 INFO L276 IsEmpty]: Start isEmpty. Operand 886 states and 1191 transitions. [2022-03-19 01:38:56,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-03-19 01:38:56,429 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 01:38:56,429 INFO L500 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 01:38:56,429 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-03-19 01:38:56,429 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 01:38:56,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 01:38:56,429 INFO L85 PathProgramCache]: Analyzing trace with hash 1920468263, now seen corresponding path program 1 times [2022-03-19 01:38:56,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 01:38:56,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372966526] [2022-03-19 01:38:56,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 01:38:56,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 01:38:56,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:38:56,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 01:38:56,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:38:56,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-19 01:38:56,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:38:56,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-19 01:38:56,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:38:56,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-03-19 01:38:56,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:38:56,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 01:38:56,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 01:38:56,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372966526] [2022-03-19 01:38:56,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372966526] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 01:38:56,636 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 01:38:56,636 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-19 01:38:56,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255381442] [2022-03-19 01:38:56,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 01:38:56,637 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-19 01:38:56,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-19 01:38:56,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-19 01:38:56,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-03-19 01:38:56,637 INFO L87 Difference]: Start difference. First operand 886 states and 1191 transitions. Second operand has 10 states, 10 states have (on average 3.6) internal successors, (36), 6 states have internal predecessors, (36), 4 states have call successors, (8), 7 states have call predecessors, (8), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-03-19 01:38:58,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 01:38:58,316 INFO L93 Difference]: Finished difference Result 1483 states and 1950 transitions. [2022-03-19 01:38:58,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-19 01:38:58,316 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 6 states have internal predecessors, (36), 4 states have call successors, (8), 7 states have call predecessors, (8), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 48 [2022-03-19 01:38:58,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 01:38:58,321 INFO L225 Difference]: With dead ends: 1483 [2022-03-19 01:38:58,321 INFO L226 Difference]: Without dead ends: 936 [2022-03-19 01:38:58,322 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=84, Invalid=188, Unknown=0, NotChecked=0, Total=272 [2022-03-19 01:38:58,324 INFO L912 BasicCegarLoop]: 556 mSDtfsCounter, 1843 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 1219 mSolverCounterSat, 572 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1855 SdHoareTripleChecker+Valid, 779 SdHoareTripleChecker+Invalid, 1791 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 572 IncrementalHoareTripleChecker+Valid, 1219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-03-19 01:38:58,326 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [1855 Valid, 779 Invalid, 1791 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [572 Valid, 1219 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-03-19 01:38:58,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 936 states. [2022-03-19 01:38:58,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 936 to 877. [2022-03-19 01:38:58,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 877 states, 697 states have (on average 1.3156384505021521) internal successors, (917), 711 states have internal predecessors, (917), 102 states have call successors, (102), 70 states have call predecessors, (102), 77 states have return successors, (151), 97 states have call predecessors, (151), 94 states have call successors, (151) [2022-03-19 01:38:58,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 877 states to 877 states and 1170 transitions. [2022-03-19 01:38:58,392 INFO L78 Accepts]: Start accepts. Automaton has 877 states and 1170 transitions. Word has length 48 [2022-03-19 01:38:58,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 01:38:58,393 INFO L478 AbstractCegarLoop]: Abstraction has 877 states and 1170 transitions. [2022-03-19 01:38:58,393 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 6 states have internal predecessors, (36), 4 states have call successors, (8), 7 states have call predecessors, (8), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-03-19 01:38:58,393 INFO L276 IsEmpty]: Start isEmpty. Operand 877 states and 1170 transitions. [2022-03-19 01:38:58,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-03-19 01:38:58,394 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 01:38:58,394 INFO L500 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 01:38:58,394 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-03-19 01:38:58,394 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 01:38:58,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 01:38:58,394 INFO L85 PathProgramCache]: Analyzing trace with hash 1683726876, now seen corresponding path program 1 times [2022-03-19 01:38:58,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 01:38:58,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590675141] [2022-03-19 01:38:58,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 01:38:58,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 01:38:58,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:38:58,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 01:38:58,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:38:58,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-19 01:38:58,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:38:58,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-19 01:38:58,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:38:58,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-03-19 01:38:58,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:38:58,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-19 01:38:58,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:38:58,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 01:38:58,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 01:38:58,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590675141] [2022-03-19 01:38:58,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590675141] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 01:38:58,621 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 01:38:58,622 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-03-19 01:38:58,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860903955] [2022-03-19 01:38:58,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 01:38:58,623 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-19 01:38:58,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-19 01:38:58,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-19 01:38:58,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-03-19 01:38:58,624 INFO L87 Difference]: Start difference. First operand 877 states and 1170 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 7 states have internal predecessors, (38), 4 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-03-19 01:39:00,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 01:39:00,230 INFO L93 Difference]: Finished difference Result 1151 states and 1528 transitions. [2022-03-19 01:39:00,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-03-19 01:39:00,230 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 7 states have internal predecessors, (38), 4 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 50 [2022-03-19 01:39:00,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 01:39:00,234 INFO L225 Difference]: With dead ends: 1151 [2022-03-19 01:39:00,234 INFO L226 Difference]: Without dead ends: 1075 [2022-03-19 01:39:00,235 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=185, Invalid=571, Unknown=0, NotChecked=0, Total=756 [2022-03-19 01:39:00,236 INFO L912 BasicCegarLoop]: 545 mSDtfsCounter, 1640 mSDsluCounter, 788 mSDsCounter, 0 mSdLazyCounter, 1669 mSolverCounterSat, 518 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1643 SdHoareTripleChecker+Valid, 1333 SdHoareTripleChecker+Invalid, 2187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 518 IncrementalHoareTripleChecker+Valid, 1669 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-03-19 01:39:00,236 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [1643 Valid, 1333 Invalid, 2187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [518 Valid, 1669 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-03-19 01:39:00,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1075 states. [2022-03-19 01:39:00,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1075 to 932. [2022-03-19 01:39:00,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 932 states, 741 states have (on average 1.3090418353576248) internal successors, (970), 757 states have internal predecessors, (970), 105 states have call successors, (105), 71 states have call predecessors, (105), 85 states have return successors, (168), 104 states have call predecessors, (168), 97 states have call successors, (168) [2022-03-19 01:39:00,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 932 states to 932 states and 1243 transitions. [2022-03-19 01:39:00,285 INFO L78 Accepts]: Start accepts. Automaton has 932 states and 1243 transitions. Word has length 50 [2022-03-19 01:39:00,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 01:39:00,285 INFO L478 AbstractCegarLoop]: Abstraction has 932 states and 1243 transitions. [2022-03-19 01:39:00,285 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 7 states have internal predecessors, (38), 4 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-03-19 01:39:00,285 INFO L276 IsEmpty]: Start isEmpty. Operand 932 states and 1243 transitions. [2022-03-19 01:39:00,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-03-19 01:39:00,288 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 01:39:00,288 INFO L500 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 01:39:00,288 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-03-19 01:39:00,288 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 01:39:00,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 01:39:00,289 INFO L85 PathProgramCache]: Analyzing trace with hash -415030459, now seen corresponding path program 1 times [2022-03-19 01:39:00,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 01:39:00,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319208624] [2022-03-19 01:39:00,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 01:39:00,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 01:39:00,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:00,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 01:39:00,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:00,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-19 01:39:00,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:00,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-19 01:39:00,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:00,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-03-19 01:39:00,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:00,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-03-19 01:39:00,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:00,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 01:39:00,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 01:39:00,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319208624] [2022-03-19 01:39:00,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319208624] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 01:39:00,467 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 01:39:00,468 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-03-19 01:39:00,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994808938] [2022-03-19 01:39:00,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 01:39:00,468 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-19 01:39:00,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-19 01:39:00,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-19 01:39:00,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-03-19 01:39:00,469 INFO L87 Difference]: Start difference. First operand 932 states and 1243 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-03-19 01:39:01,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 01:39:01,506 INFO L93 Difference]: Finished difference Result 979 states and 1296 transitions. [2022-03-19 01:39:01,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-19 01:39:01,506 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 50 [2022-03-19 01:39:01,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 01:39:01,509 INFO L225 Difference]: With dead ends: 979 [2022-03-19 01:39:01,509 INFO L226 Difference]: Without dead ends: 959 [2022-03-19 01:39:01,510 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2022-03-19 01:39:01,510 INFO L912 BasicCegarLoop]: 452 mSDtfsCounter, 620 mSDsluCounter, 1070 mSDsCounter, 0 mSdLazyCounter, 1773 mSolverCounterSat, 196 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 624 SdHoareTripleChecker+Valid, 1522 SdHoareTripleChecker+Invalid, 1969 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 196 IncrementalHoareTripleChecker+Valid, 1773 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-19 01:39:01,510 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [624 Valid, 1522 Invalid, 1969 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [196 Valid, 1773 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-19 01:39:01,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959 states. [2022-03-19 01:39:01,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959 to 932. [2022-03-19 01:39:01,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 932 states, 741 states have (on average 1.2928475033738192) internal successors, (958), 757 states have internal predecessors, (958), 105 states have call successors, (105), 71 states have call predecessors, (105), 85 states have return successors, (168), 104 states have call predecessors, (168), 97 states have call successors, (168) [2022-03-19 01:39:01,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 932 states to 932 states and 1231 transitions. [2022-03-19 01:39:01,559 INFO L78 Accepts]: Start accepts. Automaton has 932 states and 1231 transitions. Word has length 50 [2022-03-19 01:39:01,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 01:39:01,559 INFO L478 AbstractCegarLoop]: Abstraction has 932 states and 1231 transitions. [2022-03-19 01:39:01,559 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-03-19 01:39:01,559 INFO L276 IsEmpty]: Start isEmpty. Operand 932 states and 1231 transitions. [2022-03-19 01:39:01,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-03-19 01:39:01,560 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 01:39:01,560 INFO L500 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 01:39:01,560 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-03-19 01:39:01,560 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 01:39:01,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 01:39:01,561 INFO L85 PathProgramCache]: Analyzing trace with hash 527542300, now seen corresponding path program 1 times [2022-03-19 01:39:01,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 01:39:01,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919653379] [2022-03-19 01:39:01,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 01:39:01,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 01:39:01,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:01,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 01:39:01,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:01,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-19 01:39:01,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:01,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-19 01:39:01,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:01,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-03-19 01:39:01,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:01,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 01:39:01,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 01:39:01,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919653379] [2022-03-19 01:39:01,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919653379] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 01:39:01,680 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 01:39:01,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-03-19 01:39:01,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184360838] [2022-03-19 01:39:01,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 01:39:01,680 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-19 01:39:01,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-19 01:39:01,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-19 01:39:01,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-03-19 01:39:01,681 INFO L87 Difference]: Start difference. First operand 932 states and 1231 transitions. Second operand has 8 states, 8 states have (on average 4.875) internal successors, (39), 4 states have internal predecessors, (39), 3 states have call successors, (9), 6 states have call predecessors, (9), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-03-19 01:39:02,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 01:39:02,709 INFO L93 Difference]: Finished difference Result 1041 states and 1345 transitions. [2022-03-19 01:39:02,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-19 01:39:02,710 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 4 states have internal predecessors, (39), 3 states have call successors, (9), 6 states have call predecessors, (9), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 52 [2022-03-19 01:39:02,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 01:39:02,712 INFO L225 Difference]: With dead ends: 1041 [2022-03-19 01:39:02,712 INFO L226 Difference]: Without dead ends: 685 [2022-03-19 01:39:02,712 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2022-03-19 01:39:02,713 INFO L912 BasicCegarLoop]: 470 mSDtfsCounter, 747 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 903 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 756 SdHoareTripleChecker+Valid, 814 SdHoareTripleChecker+Invalid, 1040 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 903 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-19 01:39:02,713 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [756 Valid, 814 Invalid, 1040 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 903 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-19 01:39:02,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2022-03-19 01:39:02,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 623. [2022-03-19 01:39:02,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 623 states, 498 states have (on average 1.2751004016064258) internal successors, (635), 509 states have internal predecessors, (635), 71 states have call successors, (71), 46 states have call predecessors, (71), 53 states have return successors, (85), 68 states have call predecessors, (85), 63 states have call successors, (85) [2022-03-19 01:39:02,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 791 transitions. [2022-03-19 01:39:02,750 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 791 transitions. Word has length 52 [2022-03-19 01:39:02,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 01:39:02,750 INFO L478 AbstractCegarLoop]: Abstraction has 623 states and 791 transitions. [2022-03-19 01:39:02,750 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 4 states have internal predecessors, (39), 3 states have call successors, (9), 6 states have call predecessors, (9), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-03-19 01:39:02,750 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 791 transitions. [2022-03-19 01:39:02,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-03-19 01:39:02,753 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 01:39:02,753 INFO L500 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 01:39:02,753 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-03-19 01:39:02,753 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 01:39:02,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 01:39:02,753 INFO L85 PathProgramCache]: Analyzing trace with hash 868088371, now seen corresponding path program 1 times [2022-03-19 01:39:02,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 01:39:02,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949615197] [2022-03-19 01:39:02,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 01:39:02,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 01:39:02,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:02,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 01:39:02,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:02,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-19 01:39:02,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:02,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-19 01:39:02,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:02,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-03-19 01:39:02,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:02,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-03-19 01:39:02,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:02,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 01:39:02,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 01:39:02,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949615197] [2022-03-19 01:39:02,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949615197] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 01:39:02,944 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 01:39:02,945 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-03-19 01:39:02,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427486408] [2022-03-19 01:39:02,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 01:39:02,945 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-19 01:39:02,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-19 01:39:02,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-19 01:39:02,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-03-19 01:39:02,946 INFO L87 Difference]: Start difference. First operand 623 states and 791 transitions. Second operand has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 5 states have internal predecessors, (39), 3 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-03-19 01:39:03,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 01:39:03,969 INFO L93 Difference]: Finished difference Result 673 states and 848 transitions. [2022-03-19 01:39:03,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-19 01:39:03,971 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 5 states have internal predecessors, (39), 3 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 51 [2022-03-19 01:39:03,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 01:39:03,973 INFO L225 Difference]: With dead ends: 673 [2022-03-19 01:39:03,974 INFO L226 Difference]: Without dead ends: 645 [2022-03-19 01:39:03,974 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2022-03-19 01:39:03,974 INFO L912 BasicCegarLoop]: 439 mSDtfsCounter, 725 mSDsluCounter, 1054 mSDsCounter, 0 mSdLazyCounter, 1740 mSolverCounterSat, 241 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 734 SdHoareTripleChecker+Valid, 1493 SdHoareTripleChecker+Invalid, 1981 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 241 IncrementalHoareTripleChecker+Valid, 1740 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-19 01:39:03,974 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [734 Valid, 1493 Invalid, 1981 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [241 Valid, 1740 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-19 01:39:03,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states. [2022-03-19 01:39:04,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 613. [2022-03-19 01:39:04,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 613 states, 488 states have (on average 1.2704918032786885) internal successors, (620), 499 states have internal predecessors, (620), 71 states have call successors, (71), 46 states have call predecessors, (71), 53 states have return successors, (85), 68 states have call predecessors, (85), 63 states have call successors, (85) [2022-03-19 01:39:04,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 776 transitions. [2022-03-19 01:39:04,036 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 776 transitions. Word has length 51 [2022-03-19 01:39:04,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 01:39:04,036 INFO L478 AbstractCegarLoop]: Abstraction has 613 states and 776 transitions. [2022-03-19 01:39:04,036 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 5 states have internal predecessors, (39), 3 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-03-19 01:39:04,036 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 776 transitions. [2022-03-19 01:39:04,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-03-19 01:39:04,038 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 01:39:04,038 INFO L500 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 01:39:04,038 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-03-19 01:39:04,038 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 01:39:04,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 01:39:04,039 INFO L85 PathProgramCache]: Analyzing trace with hash -1730699339, now seen corresponding path program 1 times [2022-03-19 01:39:04,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 01:39:04,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006682362] [2022-03-19 01:39:04,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 01:39:04,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 01:39:04,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:04,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 01:39:04,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:04,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-19 01:39:04,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:04,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-19 01:39:04,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:04,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-03-19 01:39:04,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:04,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-03-19 01:39:04,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:04,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 01:39:04,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 01:39:04,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006682362] [2022-03-19 01:39:04,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006682362] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 01:39:04,236 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 01:39:04,236 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-03-19 01:39:04,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464938873] [2022-03-19 01:39:04,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 01:39:04,237 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-19 01:39:04,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-19 01:39:04,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-19 01:39:04,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-03-19 01:39:04,238 INFO L87 Difference]: Start difference. First operand 613 states and 776 transitions. Second operand has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-03-19 01:39:05,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 01:39:05,228 INFO L93 Difference]: Finished difference Result 669 states and 843 transitions. [2022-03-19 01:39:05,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-19 01:39:05,228 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) Word has length 51 [2022-03-19 01:39:05,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 01:39:05,231 INFO L225 Difference]: With dead ends: 669 [2022-03-19 01:39:05,231 INFO L226 Difference]: Without dead ends: 647 [2022-03-19 01:39:05,232 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2022-03-19 01:39:05,232 INFO L912 BasicCegarLoop]: 400 mSDtfsCounter, 418 mSDsluCounter, 622 mSDsCounter, 0 mSdLazyCounter, 2170 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 434 SdHoareTripleChecker+Valid, 1022 SdHoareTripleChecker+Invalid, 2306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 2170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-19 01:39:05,233 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [434 Valid, 1022 Invalid, 2306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 2170 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-19 01:39:05,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2022-03-19 01:39:05,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 616. [2022-03-19 01:39:05,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 616 states, 491 states have (on average 1.2688391038696538) internal successors, (623), 501 states have internal predecessors, (623), 71 states have call successors, (71), 46 states have call predecessors, (71), 53 states have return successors, (85), 69 states have call predecessors, (85), 63 states have call successors, (85) [2022-03-19 01:39:05,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 779 transitions. [2022-03-19 01:39:05,288 INFO L78 Accepts]: Start accepts. Automaton has 616 states and 779 transitions. Word has length 51 [2022-03-19 01:39:05,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 01:39:05,289 INFO L478 AbstractCegarLoop]: Abstraction has 616 states and 779 transitions. [2022-03-19 01:39:05,289 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-03-19 01:39:05,289 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 779 transitions. [2022-03-19 01:39:05,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-03-19 01:39:05,290 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 01:39:05,290 INFO L500 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 01:39:05,290 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-03-19 01:39:05,290 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 01:39:05,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 01:39:05,290 INFO L85 PathProgramCache]: Analyzing trace with hash -585236833, now seen corresponding path program 1 times [2022-03-19 01:39:05,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 01:39:05,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106286160] [2022-03-19 01:39:05,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 01:39:05,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 01:39:05,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:05,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 01:39:05,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:05,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-19 01:39:05,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:05,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-19 01:39:05,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:05,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-03-19 01:39:05,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:05,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-19 01:39:05,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:05,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 01:39:05,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 01:39:05,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106286160] [2022-03-19 01:39:05,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106286160] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 01:39:05,451 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 01:39:05,451 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-19 01:39:05,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89814226] [2022-03-19 01:39:05,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 01:39:05,451 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-19 01:39:05,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-19 01:39:05,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-19 01:39:05,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-03-19 01:39:05,452 INFO L87 Difference]: Start difference. First operand 616 states and 779 transitions. Second operand has 10 states, 10 states have (on average 4.0) internal successors, (40), 5 states have internal predecessors, (40), 3 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-03-19 01:39:06,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 01:39:06,307 INFO L93 Difference]: Finished difference Result 1050 states and 1349 transitions. [2022-03-19 01:39:06,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-19 01:39:06,308 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 5 states have internal predecessors, (40), 3 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 52 [2022-03-19 01:39:06,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 01:39:06,310 INFO L225 Difference]: With dead ends: 1050 [2022-03-19 01:39:06,310 INFO L226 Difference]: Without dead ends: 676 [2022-03-19 01:39:06,311 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2022-03-19 01:39:06,311 INFO L912 BasicCegarLoop]: 397 mSDtfsCounter, 1298 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 618 mSolverCounterSat, 382 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1314 SdHoareTripleChecker+Valid, 740 SdHoareTripleChecker+Invalid, 1000 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 382 IncrementalHoareTripleChecker+Valid, 618 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-19 01:39:06,312 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [1314 Valid, 740 Invalid, 1000 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [382 Valid, 618 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-19 01:39:06,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2022-03-19 01:39:06,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 627. [2022-03-19 01:39:06,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 627 states, 502 states have (on average 1.2729083665338645) internal successors, (639), 512 states have internal predecessors, (639), 71 states have call successors, (71), 46 states have call predecessors, (71), 53 states have return successors, (85), 69 states have call predecessors, (85), 63 states have call successors, (85) [2022-03-19 01:39:06,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 795 transitions. [2022-03-19 01:39:06,356 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 795 transitions. Word has length 52 [2022-03-19 01:39:06,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 01:39:06,356 INFO L478 AbstractCegarLoop]: Abstraction has 627 states and 795 transitions. [2022-03-19 01:39:06,356 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 5 states have internal predecessors, (40), 3 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-03-19 01:39:06,356 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 795 transitions. [2022-03-19 01:39:06,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-03-19 01:39:06,360 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 01:39:06,360 INFO L500 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 01:39:06,360 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-03-19 01:39:06,361 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 01:39:06,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 01:39:06,361 INFO L85 PathProgramCache]: Analyzing trace with hash 768072864, now seen corresponding path program 1 times [2022-03-19 01:39:06,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 01:39:06,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541340901] [2022-03-19 01:39:06,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 01:39:06,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 01:39:06,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:06,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 01:39:06,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:06,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-19 01:39:06,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:06,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-19 01:39:06,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:06,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-03-19 01:39:06,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:06,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-19 01:39:06,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:06,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 01:39:06,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 01:39:06,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541340901] [2022-03-19 01:39:06,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541340901] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 01:39:06,553 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 01:39:06,553 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-03-19 01:39:06,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744951023] [2022-03-19 01:39:06,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 01:39:06,554 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-19 01:39:06,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-19 01:39:06,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-19 01:39:06,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-03-19 01:39:06,554 INFO L87 Difference]: Start difference. First operand 627 states and 795 transitions. Second operand has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 8 states have internal predecessors, (40), 4 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-03-19 01:39:07,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 01:39:07,938 INFO L93 Difference]: Finished difference Result 749 states and 943 transitions. [2022-03-19 01:39:07,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-19 01:39:07,938 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 8 states have internal predecessors, (40), 4 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 52 [2022-03-19 01:39:07,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 01:39:07,940 INFO L225 Difference]: With dead ends: 749 [2022-03-19 01:39:07,940 INFO L226 Difference]: Without dead ends: 670 [2022-03-19 01:39:07,941 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=133, Invalid=419, Unknown=0, NotChecked=0, Total=552 [2022-03-19 01:39:07,941 INFO L912 BasicCegarLoop]: 399 mSDtfsCounter, 653 mSDsluCounter, 822 mSDsCounter, 0 mSdLazyCounter, 2231 mSolverCounterSat, 169 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 661 SdHoareTripleChecker+Valid, 1221 SdHoareTripleChecker+Invalid, 2400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 169 IncrementalHoareTripleChecker+Valid, 2231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-03-19 01:39:07,941 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [661 Valid, 1221 Invalid, 2400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [169 Valid, 2231 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-03-19 01:39:07,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2022-03-19 01:39:07,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 620. [2022-03-19 01:39:07,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 620 states, 495 states have (on average 1.2686868686868686) internal successors, (628), 505 states have internal predecessors, (628), 71 states have call successors, (71), 46 states have call predecessors, (71), 53 states have return successors, (85), 69 states have call predecessors, (85), 63 states have call successors, (85) [2022-03-19 01:39:07,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 784 transitions. [2022-03-19 01:39:07,979 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 784 transitions. Word has length 52 [2022-03-19 01:39:07,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 01:39:07,979 INFO L478 AbstractCegarLoop]: Abstraction has 620 states and 784 transitions. [2022-03-19 01:39:07,979 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 8 states have internal predecessors, (40), 4 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-03-19 01:39:07,979 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 784 transitions. [2022-03-19 01:39:07,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-03-19 01:39:07,980 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 01:39:07,980 INFO L500 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 01:39:07,980 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-03-19 01:39:07,980 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 01:39:07,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 01:39:07,980 INFO L85 PathProgramCache]: Analyzing trace with hash 1124310208, now seen corresponding path program 1 times [2022-03-19 01:39:07,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 01:39:07,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921760580] [2022-03-19 01:39:07,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 01:39:07,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 01:39:07,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:08,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 01:39:08,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:08,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-19 01:39:08,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:08,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-19 01:39:08,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:08,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-03-19 01:39:08,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:08,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-19 01:39:08,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:08,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 01:39:08,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 01:39:08,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921760580] [2022-03-19 01:39:08,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921760580] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 01:39:08,143 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 01:39:08,143 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-03-19 01:39:08,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139908683] [2022-03-19 01:39:08,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 01:39:08,143 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-19 01:39:08,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-19 01:39:08,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-19 01:39:08,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-03-19 01:39:08,145 INFO L87 Difference]: Start difference. First operand 620 states and 784 transitions. Second operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-03-19 01:39:09,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 01:39:09,529 INFO L93 Difference]: Finished difference Result 815 states and 1051 transitions. [2022-03-19 01:39:09,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-19 01:39:09,529 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 52 [2022-03-19 01:39:09,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 01:39:09,532 INFO L225 Difference]: With dead ends: 815 [2022-03-19 01:39:09,532 INFO L226 Difference]: Without dead ends: 738 [2022-03-19 01:39:09,532 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2022-03-19 01:39:09,533 INFO L912 BasicCegarLoop]: 556 mSDtfsCounter, 450 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 1518 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 460 SdHoareTripleChecker+Valid, 1030 SdHoareTripleChecker+Invalid, 1612 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 1518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-03-19 01:39:09,535 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [460 Valid, 1030 Invalid, 1612 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 1518 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-03-19 01:39:09,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2022-03-19 01:39:09,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 575. [2022-03-19 01:39:09,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 575 states, 455 states have (on average 1.2747252747252746) internal successors, (580), 465 states have internal predecessors, (580), 69 states have call successors, (69), 44 states have call predecessors, (69), 50 states have return successors, (82), 66 states have call predecessors, (82), 61 states have call successors, (82) [2022-03-19 01:39:09,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 731 transitions. [2022-03-19 01:39:09,588 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 731 transitions. Word has length 52 [2022-03-19 01:39:09,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 01:39:09,589 INFO L478 AbstractCegarLoop]: Abstraction has 575 states and 731 transitions. [2022-03-19 01:39:09,589 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-03-19 01:39:09,589 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 731 transitions. [2022-03-19 01:39:09,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-03-19 01:39:09,590 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 01:39:09,590 INFO L500 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 01:39:09,590 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-03-19 01:39:09,590 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 01:39:09,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 01:39:09,590 INFO L85 PathProgramCache]: Analyzing trace with hash 525399217, now seen corresponding path program 1 times [2022-03-19 01:39:09,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 01:39:09,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847382153] [2022-03-19 01:39:09,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 01:39:09,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 01:39:09,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:09,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 01:39:09,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:09,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-19 01:39:09,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:09,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-19 01:39:09,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:09,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-03-19 01:39:09,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:09,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-19 01:39:09,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:09,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 01:39:09,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 01:39:09,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847382153] [2022-03-19 01:39:09,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847382153] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 01:39:09,772 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 01:39:09,772 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-03-19 01:39:09,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112528200] [2022-03-19 01:39:09,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 01:39:09,773 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-19 01:39:09,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-19 01:39:09,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-19 01:39:09,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-03-19 01:39:09,773 INFO L87 Difference]: Start difference. First operand 575 states and 731 transitions. Second operand has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 6 states have internal predecessors, (41), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-03-19 01:39:10,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 01:39:10,885 INFO L93 Difference]: Finished difference Result 638 states and 818 transitions. [2022-03-19 01:39:10,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-19 01:39:10,885 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 6 states have internal predecessors, (41), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) Word has length 53 [2022-03-19 01:39:10,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 01:39:10,888 INFO L225 Difference]: With dead ends: 638 [2022-03-19 01:39:10,888 INFO L226 Difference]: Without dead ends: 634 [2022-03-19 01:39:10,888 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2022-03-19 01:39:10,890 INFO L912 BasicCegarLoop]: 410 mSDtfsCounter, 520 mSDsluCounter, 1304 mSDsCounter, 0 mSdLazyCounter, 2017 mSolverCounterSat, 181 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 528 SdHoareTripleChecker+Valid, 1714 SdHoareTripleChecker+Invalid, 2198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 181 IncrementalHoareTripleChecker+Valid, 2017 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-03-19 01:39:10,890 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [528 Valid, 1714 Invalid, 2198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [181 Valid, 2017 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-03-19 01:39:10,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2022-03-19 01:39:10,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 592. [2022-03-19 01:39:10,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 592 states, 470 states have (on average 1.2659574468085106) internal successors, (595), 480 states have internal predecessors, (595), 69 states have call successors, (69), 44 states have call predecessors, (69), 52 states have return successors, (91), 68 states have call predecessors, (91), 61 states have call successors, (91) [2022-03-19 01:39:10,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 755 transitions. [2022-03-19 01:39:10,931 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 755 transitions. Word has length 53 [2022-03-19 01:39:10,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 01:39:10,932 INFO L478 AbstractCegarLoop]: Abstraction has 592 states and 755 transitions. [2022-03-19 01:39:10,932 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 6 states have internal predecessors, (41), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-03-19 01:39:10,932 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 755 transitions. [2022-03-19 01:39:10,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-03-19 01:39:10,933 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 01:39:10,933 INFO L500 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 01:39:10,933 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-03-19 01:39:10,933 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 01:39:10,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 01:39:10,933 INFO L85 PathProgramCache]: Analyzing trace with hash 525430961, now seen corresponding path program 1 times [2022-03-19 01:39:10,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 01:39:10,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390653080] [2022-03-19 01:39:10,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 01:39:10,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 01:39:10,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:11,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 01:39:11,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:11,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-19 01:39:11,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:11,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-19 01:39:11,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:11,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-03-19 01:39:11,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:11,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-19 01:39:11,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:11,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 01:39:11,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 01:39:11,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390653080] [2022-03-19 01:39:11,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390653080] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 01:39:11,105 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 01:39:11,105 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-03-19 01:39:11,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970414959] [2022-03-19 01:39:11,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 01:39:11,107 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-19 01:39:11,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-19 01:39:11,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-19 01:39:11,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-03-19 01:39:11,108 INFO L87 Difference]: Start difference. First operand 592 states and 755 transitions. Second operand has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 6 states have internal predecessors, (41), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-03-19 01:39:12,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 01:39:12,094 INFO L93 Difference]: Finished difference Result 626 states and 794 transitions. [2022-03-19 01:39:12,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-19 01:39:12,094 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 6 states have internal predecessors, (41), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) Word has length 53 [2022-03-19 01:39:12,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 01:39:12,096 INFO L225 Difference]: With dead ends: 626 [2022-03-19 01:39:12,096 INFO L226 Difference]: Without dead ends: 611 [2022-03-19 01:39:12,112 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-03-19 01:39:12,112 INFO L912 BasicCegarLoop]: 414 mSDtfsCounter, 559 mSDsluCounter, 1207 mSDsCounter, 0 mSdLazyCounter, 2101 mSolverCounterSat, 191 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 563 SdHoareTripleChecker+Valid, 1621 SdHoareTripleChecker+Invalid, 2292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 191 IncrementalHoareTripleChecker+Valid, 2101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-19 01:39:12,112 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [563 Valid, 1621 Invalid, 2292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [191 Valid, 2101 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-19 01:39:12,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2022-03-19 01:39:12,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 589. [2022-03-19 01:39:12,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 589 states, 467 states have (on average 1.2676659528907923) internal successors, (592), 478 states have internal predecessors, (592), 69 states have call successors, (69), 44 states have call predecessors, (69), 52 states have return successors, (90), 67 states have call predecessors, (90), 61 states have call successors, (90) [2022-03-19 01:39:12,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 751 transitions. [2022-03-19 01:39:12,161 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 751 transitions. Word has length 53 [2022-03-19 01:39:12,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 01:39:12,162 INFO L478 AbstractCegarLoop]: Abstraction has 589 states and 751 transitions. [2022-03-19 01:39:12,162 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 6 states have internal predecessors, (41), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-03-19 01:39:12,162 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 751 transitions. [2022-03-19 01:39:12,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-03-19 01:39:12,163 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 01:39:12,163 INFO L500 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 01:39:12,163 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-03-19 01:39:12,163 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 01:39:12,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 01:39:12,163 INFO L85 PathProgramCache]: Analyzing trace with hash -1791629129, now seen corresponding path program 1 times [2022-03-19 01:39:12,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 01:39:12,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092311537] [2022-03-19 01:39:12,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 01:39:12,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 01:39:12,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:12,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 01:39:12,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:12,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-19 01:39:12,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:12,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-19 01:39:12,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:12,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-03-19 01:39:12,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:12,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-03-19 01:39:12,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:12,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-03-19 01:39:12,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:12,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 01:39:12,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 01:39:12,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092311537] [2022-03-19 01:39:12,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092311537] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 01:39:12,337 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 01:39:12,337 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-03-19 01:39:12,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103484376] [2022-03-19 01:39:12,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 01:39:12,337 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-19 01:39:12,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-19 01:39:12,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-19 01:39:12,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-03-19 01:39:12,338 INFO L87 Difference]: Start difference. First operand 589 states and 751 transitions. Second operand has 14 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 6 states have internal predecessors, (41), 2 states have call successors, (8), 8 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) [2022-03-19 01:39:13,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 01:39:13,129 INFO L93 Difference]: Finished difference Result 624 states and 790 transitions. [2022-03-19 01:39:13,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-19 01:39:13,130 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 6 states have internal predecessors, (41), 2 states have call successors, (8), 8 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) Word has length 55 [2022-03-19 01:39:13,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 01:39:13,132 INFO L225 Difference]: With dead ends: 624 [2022-03-19 01:39:13,132 INFO L226 Difference]: Without dead ends: 596 [2022-03-19 01:39:13,132 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2022-03-19 01:39:13,132 INFO L912 BasicCegarLoop]: 408 mSDtfsCounter, 604 mSDsluCounter, 1245 mSDsCounter, 0 mSdLazyCounter, 2142 mSolverCounterSat, 189 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 613 SdHoareTripleChecker+Valid, 1653 SdHoareTripleChecker+Invalid, 2331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 189 IncrementalHoareTripleChecker+Valid, 2142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-19 01:39:13,132 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [613 Valid, 1653 Invalid, 2331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [189 Valid, 2142 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-19 01:39:13,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2022-03-19 01:39:13,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 577. [2022-03-19 01:39:13,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 577 states, 458 states have (on average 1.2663755458515285) internal successors, (580), 469 states have internal predecessors, (580), 67 states have call successors, (67), 43 states have call predecessors, (67), 51 states have return successors, (88), 65 states have call predecessors, (88), 59 states have call successors, (88) [2022-03-19 01:39:13,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 735 transitions. [2022-03-19 01:39:13,172 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 735 transitions. Word has length 55 [2022-03-19 01:39:13,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 01:39:13,172 INFO L478 AbstractCegarLoop]: Abstraction has 577 states and 735 transitions. [2022-03-19 01:39:13,172 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 6 states have internal predecessors, (41), 2 states have call successors, (8), 8 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) [2022-03-19 01:39:13,172 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 735 transitions. [2022-03-19 01:39:13,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-03-19 01:39:13,173 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 01:39:13,173 INFO L500 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 01:39:13,173 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-03-19 01:39:13,173 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 01:39:13,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 01:39:13,173 INFO L85 PathProgramCache]: Analyzing trace with hash 310114016, now seen corresponding path program 1 times [2022-03-19 01:39:13,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 01:39:13,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596045068] [2022-03-19 01:39:13,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 01:39:13,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 01:39:13,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:13,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 01:39:13,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:13,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-19 01:39:13,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:13,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-19 01:39:13,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:13,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-03-19 01:39:13,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:13,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-19 01:39:13,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:13,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 01:39:13,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 01:39:13,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596045068] [2022-03-19 01:39:13,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596045068] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 01:39:13,345 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 01:39:13,345 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-19 01:39:13,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244411578] [2022-03-19 01:39:13,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 01:39:13,345 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-19 01:39:13,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-19 01:39:13,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-19 01:39:13,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-03-19 01:39:13,346 INFO L87 Difference]: Start difference. First operand 577 states and 735 transitions. Second operand has 10 states, 10 states have (on average 4.2) internal successors, (42), 5 states have internal predecessors, (42), 3 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-03-19 01:39:14,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 01:39:14,342 INFO L93 Difference]: Finished difference Result 746 states and 969 transitions. [2022-03-19 01:39:14,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-19 01:39:14,343 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 5 states have internal predecessors, (42), 3 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Word has length 54 [2022-03-19 01:39:14,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 01:39:14,345 INFO L225 Difference]: With dead ends: 746 [2022-03-19 01:39:14,345 INFO L226 Difference]: Without dead ends: 728 [2022-03-19 01:39:14,345 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=115, Invalid=265, Unknown=0, NotChecked=0, Total=380 [2022-03-19 01:39:14,345 INFO L912 BasicCegarLoop]: 503 mSDtfsCounter, 1355 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 940 mSolverCounterSat, 407 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1370 SdHoareTripleChecker+Valid, 892 SdHoareTripleChecker+Invalid, 1347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 407 IncrementalHoareTripleChecker+Valid, 940 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-19 01:39:14,346 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [1370 Valid, 892 Invalid, 1347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [407 Valid, 940 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-19 01:39:14,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2022-03-19 01:39:14,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 561. [2022-03-19 01:39:14,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 561 states, 445 states have (on average 1.2719101123595506) internal successors, (566), 455 states have internal predecessors, (566), 66 states have call successors, (66), 43 states have call predecessors, (66), 49 states have return successors, (79), 63 states have call predecessors, (79), 58 states have call successors, (79) [2022-03-19 01:39:14,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 711 transitions. [2022-03-19 01:39:14,385 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 711 transitions. Word has length 54 [2022-03-19 01:39:14,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 01:39:14,385 INFO L478 AbstractCegarLoop]: Abstraction has 561 states and 711 transitions. [2022-03-19 01:39:14,385 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 5 states have internal predecessors, (42), 3 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-03-19 01:39:14,385 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 711 transitions. [2022-03-19 01:39:14,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-03-19 01:39:14,386 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 01:39:14,386 INFO L500 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, 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-03-19 01:39:14,386 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-03-19 01:39:14,386 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 01:39:14,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 01:39:14,386 INFO L85 PathProgramCache]: Analyzing trace with hash -1381037997, now seen corresponding path program 1 times [2022-03-19 01:39:14,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 01:39:14,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105962107] [2022-03-19 01:39:14,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 01:39:14,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 01:39:14,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:14,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 01:39:14,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:14,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-19 01:39:14,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:14,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-19 01:39:14,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:14,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-03-19 01:39:14,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:14,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-19 01:39:14,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:14,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-03-19 01:39:14,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:14,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 01:39:14,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 01:39:14,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105962107] [2022-03-19 01:39:14,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105962107] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 01:39:14,510 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 01:39:14,510 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-03-19 01:39:14,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851648667] [2022-03-19 01:39:14,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 01:39:14,510 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-19 01:39:14,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-19 01:39:14,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-19 01:39:14,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-03-19 01:39:14,511 INFO L87 Difference]: Start difference. First operand 561 states and 711 transitions. Second operand has 8 states, 8 states have (on average 5.625) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (10), 7 states have call predecessors, (10), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-03-19 01:39:15,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 01:39:15,111 INFO L93 Difference]: Finished difference Result 898 states and 1149 transitions. [2022-03-19 01:39:15,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-19 01:39:15,111 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (10), 7 states have call predecessors, (10), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 61 [2022-03-19 01:39:15,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 01:39:15,113 INFO L225 Difference]: With dead ends: 898 [2022-03-19 01:39:15,113 INFO L226 Difference]: Without dead ends: 589 [2022-03-19 01:39:15,114 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2022-03-19 01:39:15,114 INFO L912 BasicCegarLoop]: 386 mSDtfsCounter, 436 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 721 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 442 SdHoareTripleChecker+Valid, 800 SdHoareTripleChecker+Invalid, 861 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 721 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-19 01:39:15,114 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [442 Valid, 800 Invalid, 861 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 721 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-19 01:39:15,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2022-03-19 01:39:15,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 566. [2022-03-19 01:39:15,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 566 states, 449 states have (on average 1.265033407572383) internal successors, (568), 460 states have internal predecessors, (568), 66 states have call successors, (66), 43 states have call predecessors, (66), 50 states have return successors, (83), 63 states have call predecessors, (83), 58 states have call successors, (83) [2022-03-19 01:39:15,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 717 transitions. [2022-03-19 01:39:15,173 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 717 transitions. Word has length 61 [2022-03-19 01:39:15,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 01:39:15,173 INFO L478 AbstractCegarLoop]: Abstraction has 566 states and 717 transitions. [2022-03-19 01:39:15,173 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (10), 7 states have call predecessors, (10), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-03-19 01:39:15,173 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 717 transitions. [2022-03-19 01:39:15,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-03-19 01:39:15,174 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 01:39:15,174 INFO L500 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, 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-03-19 01:39:15,174 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-03-19 01:39:15,174 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 01:39:15,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 01:39:15,175 INFO L85 PathProgramCache]: Analyzing trace with hash -1616264812, now seen corresponding path program 1 times [2022-03-19 01:39:15,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 01:39:15,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114132290] [2022-03-19 01:39:15,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 01:39:15,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 01:39:15,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:15,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 01:39:15,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:15,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-19 01:39:15,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:15,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-19 01:39:15,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:15,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-03-19 01:39:15,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:15,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-03-19 01:39:15,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:15,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-19 01:39:15,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:15,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 01:39:15,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 01:39:15,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114132290] [2022-03-19 01:39:15,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114132290] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 01:39:15,382 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 01:39:15,382 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-19 01:39:15,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072503314] [2022-03-19 01:39:15,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 01:39:15,382 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-19 01:39:15,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-19 01:39:15,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-19 01:39:15,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-03-19 01:39:15,383 INFO L87 Difference]: Start difference. First operand 566 states and 717 transitions. Second operand has 10 states, 10 states have (on average 4.8) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (10), 7 states have call predecessors, (10), 3 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) [2022-03-19 01:39:16,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 01:39:16,083 INFO L93 Difference]: Finished difference Result 852 states and 1088 transitions. [2022-03-19 01:39:16,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-19 01:39:16,084 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (10), 7 states have call predecessors, (10), 3 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) Word has length 64 [2022-03-19 01:39:16,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 01:39:16,086 INFO L225 Difference]: With dead ends: 852 [2022-03-19 01:39:16,086 INFO L226 Difference]: Without dead ends: 538 [2022-03-19 01:39:16,087 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-03-19 01:39:16,087 INFO L912 BasicCegarLoop]: 388 mSDtfsCounter, 775 mSDsluCounter, 684 mSDsCounter, 0 mSdLazyCounter, 959 mSolverCounterSat, 245 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 782 SdHoareTripleChecker+Valid, 1072 SdHoareTripleChecker+Invalid, 1204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 245 IncrementalHoareTripleChecker+Valid, 959 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-19 01:39:16,088 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [782 Valid, 1072 Invalid, 1204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [245 Valid, 959 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-19 01:39:16,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2022-03-19 01:39:16,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 511. [2022-03-19 01:39:16,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 511 states, 402 states have (on average 1.2537313432835822) internal successors, (504), 410 states have internal predecessors, (504), 63 states have call successors, (63), 42 states have call predecessors, (63), 45 states have return successors, (72), 59 states have call predecessors, (72), 56 states have call successors, (72) [2022-03-19 01:39:16,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 639 transitions. [2022-03-19 01:39:16,138 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 639 transitions. Word has length 64 [2022-03-19 01:39:16,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 01:39:16,138 INFO L478 AbstractCegarLoop]: Abstraction has 511 states and 639 transitions. [2022-03-19 01:39:16,138 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (10), 7 states have call predecessors, (10), 3 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) [2022-03-19 01:39:16,138 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 639 transitions. [2022-03-19 01:39:16,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-03-19 01:39:16,140 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 01:39:16,140 INFO L500 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, 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-03-19 01:39:16,140 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-03-19 01:39:16,140 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 01:39:16,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 01:39:16,140 INFO L85 PathProgramCache]: Analyzing trace with hash 1336270132, now seen corresponding path program 1 times [2022-03-19 01:39:16,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 01:39:16,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937126108] [2022-03-19 01:39:16,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 01:39:16,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 01:39:16,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:16,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 01:39:16,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:16,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-19 01:39:16,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:16,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-19 01:39:16,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:16,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-03-19 01:39:16,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:16,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-03-19 01:39:16,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:16,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-03-19 01:39:16,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:16,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 01:39:16,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 01:39:16,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937126108] [2022-03-19 01:39:16,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937126108] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 01:39:16,321 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 01:39:16,321 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-03-19 01:39:16,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030435422] [2022-03-19 01:39:16,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 01:39:16,321 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-19 01:39:16,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-19 01:39:16,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-19 01:39:16,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-03-19 01:39:16,322 INFO L87 Difference]: Start difference. First operand 511 states and 639 transitions. Second operand has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 6 states have internal predecessors, (45), 3 states have call successors, (8), 8 states have call predecessors, (8), 3 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) [2022-03-19 01:39:17,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 01:39:17,526 INFO L93 Difference]: Finished difference Result 545 states and 678 transitions. [2022-03-19 01:39:17,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-19 01:39:17,526 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 6 states have internal predecessors, (45), 3 states have call successors, (8), 8 states have call predecessors, (8), 3 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) Word has length 59 [2022-03-19 01:39:17,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 01:39:17,528 INFO L225 Difference]: With dead ends: 545 [2022-03-19 01:39:17,528 INFO L226 Difference]: Without dead ends: 524 [2022-03-19 01:39:17,528 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2022-03-19 01:39:17,529 INFO L912 BasicCegarLoop]: 367 mSDtfsCounter, 518 mSDsluCounter, 698 mSDsCounter, 0 mSdLazyCounter, 2505 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 531 SdHoareTripleChecker+Valid, 1065 SdHoareTripleChecker+Invalid, 2653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 2505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-03-19 01:39:17,529 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [531 Valid, 1065 Invalid, 2653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 2505 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-03-19 01:39:17,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2022-03-19 01:39:17,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 508. [2022-03-19 01:39:17,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 508 states, 399 states have (on average 1.255639097744361) internal successors, (501), 408 states have internal predecessors, (501), 63 states have call successors, (63), 42 states have call predecessors, (63), 45 states have return successors, (71), 58 states have call predecessors, (71), 56 states have call successors, (71) [2022-03-19 01:39:17,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 635 transitions. [2022-03-19 01:39:17,567 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 635 transitions. Word has length 59 [2022-03-19 01:39:17,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 01:39:17,567 INFO L478 AbstractCegarLoop]: Abstraction has 508 states and 635 transitions. [2022-03-19 01:39:17,567 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 6 states have internal predecessors, (45), 3 states have call successors, (8), 8 states have call predecessors, (8), 3 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) [2022-03-19 01:39:17,567 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 635 transitions. [2022-03-19 01:39:17,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-03-19 01:39:17,568 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 01:39:17,568 INFO L500 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, 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-03-19 01:39:17,568 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-03-19 01:39:17,568 INFO L403 AbstractCegarLoop]: === Iteration 34 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 01:39:17,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 01:39:17,568 INFO L85 PathProgramCache]: Analyzing trace with hash 1613674778, now seen corresponding path program 1 times [2022-03-19 01:39:17,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 01:39:17,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297881482] [2022-03-19 01:39:17,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 01:39:17,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 01:39:17,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:17,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 01:39:17,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:17,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-19 01:39:17,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:17,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-19 01:39:17,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:17,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-03-19 01:39:17,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:17,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-03-19 01:39:17,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:17,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 01:39:17,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 01:39:17,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297881482] [2022-03-19 01:39:17,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297881482] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 01:39:17,746 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 01:39:17,746 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-03-19 01:39:17,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936641520] [2022-03-19 01:39:17,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 01:39:17,747 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-19 01:39:17,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-19 01:39:17,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-19 01:39:17,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-03-19 01:39:17,747 INFO L87 Difference]: Start difference. First operand 508 states and 635 transitions. Second operand has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-03-19 01:39:18,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 01:39:18,641 INFO L93 Difference]: Finished difference Result 538 states and 669 transitions. [2022-03-19 01:39:18,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-19 01:39:18,641 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) Word has length 58 [2022-03-19 01:39:18,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 01:39:18,643 INFO L225 Difference]: With dead ends: 538 [2022-03-19 01:39:18,643 INFO L226 Difference]: Without dead ends: 520 [2022-03-19 01:39:18,643 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-03-19 01:39:18,643 INFO L912 BasicCegarLoop]: 391 mSDtfsCounter, 487 mSDsluCounter, 1111 mSDsCounter, 0 mSdLazyCounter, 1832 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 491 SdHoareTripleChecker+Valid, 1502 SdHoareTripleChecker+Invalid, 1996 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 1832 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-19 01:39:18,643 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [491 Valid, 1502 Invalid, 1996 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 1832 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-19 01:39:18,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2022-03-19 01:39:18,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 504. [2022-03-19 01:39:18,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 504 states, 396 states have (on average 1.255050505050505) internal successors, (497), 405 states have internal predecessors, (497), 62 states have call successors, (62), 42 states have call predecessors, (62), 45 states have return successors, (70), 57 states have call predecessors, (70), 55 states have call successors, (70) [2022-03-19 01:39:18,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 629 transitions. [2022-03-19 01:39:18,679 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 629 transitions. Word has length 58 [2022-03-19 01:39:18,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 01:39:18,680 INFO L478 AbstractCegarLoop]: Abstraction has 504 states and 629 transitions. [2022-03-19 01:39:18,680 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-03-19 01:39:18,680 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 629 transitions. [2022-03-19 01:39:18,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-03-19 01:39:18,680 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 01:39:18,681 INFO L500 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, 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-03-19 01:39:18,681 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-03-19 01:39:18,681 INFO L403 AbstractCegarLoop]: === Iteration 35 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 01:39:18,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 01:39:18,681 INFO L85 PathProgramCache]: Analyzing trace with hash 2114727091, now seen corresponding path program 1 times [2022-03-19 01:39:18,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 01:39:18,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408116730] [2022-03-19 01:39:18,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 01:39:18,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 01:39:18,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:18,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 01:39:18,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:18,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-19 01:39:18,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:18,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-19 01:39:18,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:18,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-03-19 01:39:18,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:18,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-03-19 01:39:18,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:18,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-03-19 01:39:18,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:18,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 01:39:18,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 01:39:18,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408116730] [2022-03-19 01:39:18,841 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408116730] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 01:39:18,841 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 01:39:18,841 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-03-19 01:39:18,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212304597] [2022-03-19 01:39:18,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 01:39:18,842 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-19 01:39:18,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-19 01:39:18,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-19 01:39:18,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-03-19 01:39:18,842 INFO L87 Difference]: Start difference. First operand 504 states and 629 transitions. Second operand has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 5 states have internal predecessors, (46), 3 states have call successors, (8), 8 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-03-19 01:39:19,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 01:39:19,858 INFO L93 Difference]: Finished difference Result 539 states and 669 transitions. [2022-03-19 01:39:19,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-19 01:39:19,859 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 5 states have internal predecessors, (46), 3 states have call successors, (8), 8 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 60 [2022-03-19 01:39:19,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 01:39:19,860 INFO L225 Difference]: With dead ends: 539 [2022-03-19 01:39:19,860 INFO L226 Difference]: Without dead ends: 515 [2022-03-19 01:39:19,861 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2022-03-19 01:39:19,861 INFO L912 BasicCegarLoop]: 362 mSDtfsCounter, 453 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 2014 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 466 SdHoareTripleChecker+Valid, 914 SdHoareTripleChecker+Invalid, 2141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 2014 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-19 01:39:19,861 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [466 Valid, 914 Invalid, 2141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 2014 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-19 01:39:19,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2022-03-19 01:39:19,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 499. [2022-03-19 01:39:19,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 499 states, 393 states have (on average 1.251908396946565) internal successors, (492), 401 states have internal predecessors, (492), 61 states have call successors, (61), 42 states have call predecessors, (61), 44 states have return successors, (68), 56 states have call predecessors, (68), 54 states have call successors, (68) [2022-03-19 01:39:19,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 621 transitions. [2022-03-19 01:39:19,914 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 621 transitions. Word has length 60 [2022-03-19 01:39:19,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 01:39:19,914 INFO L478 AbstractCegarLoop]: Abstraction has 499 states and 621 transitions. [2022-03-19 01:39:19,914 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 5 states have internal predecessors, (46), 3 states have call successors, (8), 8 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-03-19 01:39:19,914 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 621 transitions. [2022-03-19 01:39:19,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-03-19 01:39:19,915 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 01:39:19,915 INFO L500 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, 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, 1, 1, 1, 1] [2022-03-19 01:39:19,915 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-03-19 01:39:19,916 INFO L403 AbstractCegarLoop]: === Iteration 36 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 01:39:19,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 01:39:19,916 INFO L85 PathProgramCache]: Analyzing trace with hash 1861314870, now seen corresponding path program 1 times [2022-03-19 01:39:19,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 01:39:19,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291874827] [2022-03-19 01:39:19,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 01:39:19,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 01:39:19,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:19,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 01:39:19,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:20,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-19 01:39:20,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:20,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-19 01:39:20,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:20,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-03-19 01:39:20,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:20,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-03-19 01:39:20,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:20,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-19 01:39:20,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:20,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-03-19 01:39:20,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:20,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 01:39:20,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 01:39:20,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291874827] [2022-03-19 01:39:20,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291874827] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 01:39:20,097 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 01:39:20,097 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-03-19 01:39:20,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660573310] [2022-03-19 01:39:20,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 01:39:20,098 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-19 01:39:20,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-19 01:39:20,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-19 01:39:20,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-03-19 01:39:20,099 INFO L87 Difference]: Start difference. First operand 499 states and 621 transitions. Second operand has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (11), 9 states have call predecessors, (11), 4 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2022-03-19 01:39:21,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 01:39:21,105 INFO L93 Difference]: Finished difference Result 780 states and 980 transitions. [2022-03-19 01:39:21,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-19 01:39:21,105 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (11), 9 states have call predecessors, (11), 4 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) Word has length 68 [2022-03-19 01:39:21,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 01:39:21,107 INFO L225 Difference]: With dead ends: 780 [2022-03-19 01:39:21,107 INFO L226 Difference]: Without dead ends: 521 [2022-03-19 01:39:21,108 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2022-03-19 01:39:21,108 INFO L912 BasicCegarLoop]: 357 mSDtfsCounter, 745 mSDsluCounter, 683 mSDsCounter, 0 mSdLazyCounter, 1234 mSolverCounterSat, 208 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 758 SdHoareTripleChecker+Valid, 1040 SdHoareTripleChecker+Invalid, 1442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 208 IncrementalHoareTripleChecker+Valid, 1234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-19 01:39:21,108 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [758 Valid, 1040 Invalid, 1442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [208 Valid, 1234 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-19 01:39:21,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2022-03-19 01:39:21,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 499. [2022-03-19 01:39:21,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 499 states, 393 states have (on average 1.2468193384223918) internal successors, (490), 401 states have internal predecessors, (490), 61 states have call successors, (61), 42 states have call predecessors, (61), 44 states have return successors, (68), 56 states have call predecessors, (68), 54 states have call successors, (68) [2022-03-19 01:39:21,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 619 transitions. [2022-03-19 01:39:21,146 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 619 transitions. Word has length 68 [2022-03-19 01:39:21,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 01:39:21,146 INFO L478 AbstractCegarLoop]: Abstraction has 499 states and 619 transitions. [2022-03-19 01:39:21,146 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (11), 9 states have call predecessors, (11), 4 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2022-03-19 01:39:21,147 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 619 transitions. [2022-03-19 01:39:21,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-03-19 01:39:21,147 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 01:39:21,147 INFO L500 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, 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-03-19 01:39:21,148 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-03-19 01:39:21,148 INFO L403 AbstractCegarLoop]: === Iteration 37 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 01:39:21,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 01:39:21,148 INFO L85 PathProgramCache]: Analyzing trace with hash 1116193296, now seen corresponding path program 1 times [2022-03-19 01:39:21,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 01:39:21,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525884342] [2022-03-19 01:39:21,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 01:39:21,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 01:39:21,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:21,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 01:39:21,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:21,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-19 01:39:21,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:21,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-19 01:39:21,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:21,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-03-19 01:39:21,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:21,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-03-19 01:39:21,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:21,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-03-19 01:39:21,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:21,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 01:39:21,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 01:39:21,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525884342] [2022-03-19 01:39:21,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525884342] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 01:39:21,279 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 01:39:21,279 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-19 01:39:21,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199029701] [2022-03-19 01:39:21,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 01:39:21,279 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-19 01:39:21,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-19 01:39:21,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-19 01:39:21,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-03-19 01:39:21,281 INFO L87 Difference]: Start difference. First operand 499 states and 619 transitions. Second operand has 10 states, 10 states have (on average 4.9) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (8), 7 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) [2022-03-19 01:39:22,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 01:39:22,088 INFO L93 Difference]: Finished difference Result 611 states and 749 transitions. [2022-03-19 01:39:22,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-19 01:39:22,088 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (8), 7 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) Word has length 63 [2022-03-19 01:39:22,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 01:39:22,092 INFO L225 Difference]: With dead ends: 611 [2022-03-19 01:39:22,092 INFO L226 Difference]: Without dead ends: 519 [2022-03-19 01:39:22,093 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-03-19 01:39:22,093 INFO L912 BasicCegarLoop]: 359 mSDtfsCounter, 501 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 1670 mSolverCounterSat, 159 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 515 SdHoareTripleChecker+Valid, 812 SdHoareTripleChecker+Invalid, 1829 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 159 IncrementalHoareTripleChecker+Valid, 1670 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-19 01:39:22,093 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [515 Valid, 812 Invalid, 1829 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [159 Valid, 1670 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-19 01:39:22,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2022-03-19 01:39:22,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 503. [2022-03-19 01:39:22,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 503 states, 396 states have (on average 1.244949494949495) internal successors, (493), 404 states have internal predecessors, (493), 61 states have call successors, (61), 42 states have call predecessors, (61), 45 states have return successors, (69), 57 states have call predecessors, (69), 54 states have call successors, (69) [2022-03-19 01:39:22,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 623 transitions. [2022-03-19 01:39:22,132 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 623 transitions. Word has length 63 [2022-03-19 01:39:22,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 01:39:22,132 INFO L478 AbstractCegarLoop]: Abstraction has 503 states and 623 transitions. [2022-03-19 01:39:22,132 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (8), 7 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) [2022-03-19 01:39:22,132 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 623 transitions. [2022-03-19 01:39:22,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-03-19 01:39:22,133 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 01:39:22,133 INFO L500 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, 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-03-19 01:39:22,133 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-03-19 01:39:22,133 INFO L403 AbstractCegarLoop]: === Iteration 38 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 01:39:22,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 01:39:22,133 INFO L85 PathProgramCache]: Analyzing trace with hash -929996240, now seen corresponding path program 1 times [2022-03-19 01:39:22,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 01:39:22,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001138641] [2022-03-19 01:39:22,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 01:39:22,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 01:39:22,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:22,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 01:39:22,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:22,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-19 01:39:22,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:22,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-19 01:39:22,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:22,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-03-19 01:39:22,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:22,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-03-19 01:39:22,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:22,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-03-19 01:39:22,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:22,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 01:39:22,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 01:39:22,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001138641] [2022-03-19 01:39:22,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001138641] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 01:39:22,317 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 01:39:22,317 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-03-19 01:39:22,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82624566] [2022-03-19 01:39:22,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 01:39:22,317 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-19 01:39:22,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-19 01:39:22,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-19 01:39:22,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-03-19 01:39:22,318 INFO L87 Difference]: Start difference. First operand 503 states and 623 transitions. Second operand has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (8), 7 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) [2022-03-19 01:39:23,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 01:39:23,468 INFO L93 Difference]: Finished difference Result 529 states and 653 transitions. [2022-03-19 01:39:23,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-19 01:39:23,469 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (8), 7 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) Word has length 63 [2022-03-19 01:39:23,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 01:39:23,470 INFO L225 Difference]: With dead ends: 529 [2022-03-19 01:39:23,471 INFO L226 Difference]: Without dead ends: 505 [2022-03-19 01:39:23,471 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2022-03-19 01:39:23,471 INFO L912 BasicCegarLoop]: 352 mSDtfsCounter, 502 mSDsluCounter, 639 mSDsCounter, 0 mSdLazyCounter, 2277 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 516 SdHoareTripleChecker+Valid, 991 SdHoareTripleChecker+Invalid, 2434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 2277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-03-19 01:39:23,471 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [516 Valid, 991 Invalid, 2434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 2277 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-03-19 01:39:23,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2022-03-19 01:39:23,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 489. [2022-03-19 01:39:23,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 489 states, 384 states have (on average 1.2395833333333333) internal successors, (476), 391 states have internal predecessors, (476), 60 states have call successors, (60), 42 states have call predecessors, (60), 44 states have return successors, (68), 56 states have call predecessors, (68), 54 states have call successors, (68) [2022-03-19 01:39:23,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 604 transitions. [2022-03-19 01:39:23,523 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 604 transitions. Word has length 63 [2022-03-19 01:39:23,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 01:39:23,524 INFO L478 AbstractCegarLoop]: Abstraction has 489 states and 604 transitions. [2022-03-19 01:39:23,524 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (8), 7 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) [2022-03-19 01:39:23,524 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 604 transitions. [2022-03-19 01:39:23,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-03-19 01:39:23,525 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 01:39:23,525 INFO L500 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, 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, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 01:39:23,525 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-03-19 01:39:23,525 INFO L403 AbstractCegarLoop]: === Iteration 39 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 01:39:23,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 01:39:23,525 INFO L85 PathProgramCache]: Analyzing trace with hash -1704717596, now seen corresponding path program 1 times [2022-03-19 01:39:23,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 01:39:23,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868173136] [2022-03-19 01:39:23,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 01:39:23,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 01:39:23,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:23,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 01:39:23,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:23,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-19 01:39:23,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:23,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-19 01:39:23,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:23,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-03-19 01:39:23,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:23,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-03-19 01:39:23,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:23,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-19 01:39:23,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:23,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-03-19 01:39:23,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:23,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 01:39:23,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 01:39:23,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868173136] [2022-03-19 01:39:23,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868173136] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 01:39:23,739 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 01:39:23,739 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-03-19 01:39:23,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53291777] [2022-03-19 01:39:23,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 01:39:23,740 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-19 01:39:23,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-19 01:39:23,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-19 01:39:23,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-03-19 01:39:23,740 INFO L87 Difference]: Start difference. First operand 489 states and 604 transitions. Second operand has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 5 states have internal predecessors, (53), 2 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2022-03-19 01:39:24,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 01:39:24,765 INFO L93 Difference]: Finished difference Result 750 states and 936 transitions. [2022-03-19 01:39:24,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-03-19 01:39:24,765 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 5 states have internal predecessors, (53), 2 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) Word has length 71 [2022-03-19 01:39:24,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 01:39:24,767 INFO L225 Difference]: With dead ends: 750 [2022-03-19 01:39:24,767 INFO L226 Difference]: Without dead ends: 524 [2022-03-19 01:39:24,768 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2022-03-19 01:39:24,769 INFO L912 BasicCegarLoop]: 375 mSDtfsCounter, 435 mSDsluCounter, 997 mSDsCounter, 0 mSdLazyCounter, 1431 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 444 SdHoareTripleChecker+Valid, 1372 SdHoareTripleChecker+Invalid, 1567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 1431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-19 01:39:24,769 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [444 Valid, 1372 Invalid, 1567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 1431 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-19 01:39:24,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2022-03-19 01:39:24,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 489. [2022-03-19 01:39:24,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 489 states, 384 states have (on average 1.234375) internal successors, (474), 391 states have internal predecessors, (474), 60 states have call successors, (60), 42 states have call predecessors, (60), 44 states have return successors, (68), 56 states have call predecessors, (68), 54 states have call successors, (68) [2022-03-19 01:39:24,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 602 transitions. [2022-03-19 01:39:24,821 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 602 transitions. Word has length 71 [2022-03-19 01:39:24,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 01:39:24,822 INFO L478 AbstractCegarLoop]: Abstraction has 489 states and 602 transitions. [2022-03-19 01:39:24,822 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 5 states have internal predecessors, (53), 2 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2022-03-19 01:39:24,822 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 602 transitions. [2022-03-19 01:39:24,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-03-19 01:39:24,823 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 01:39:24,823 INFO L500 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, 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-03-19 01:39:24,823 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-03-19 01:39:24,823 INFO L403 AbstractCegarLoop]: === Iteration 40 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 01:39:24,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 01:39:24,823 INFO L85 PathProgramCache]: Analyzing trace with hash 1439851345, now seen corresponding path program 1 times [2022-03-19 01:39:24,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 01:39:24,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217316629] [2022-03-19 01:39:24,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 01:39:24,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 01:39:24,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:24,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 01:39:24,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:24,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-19 01:39:24,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:24,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-19 01:39:24,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:24,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-03-19 01:39:24,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:25,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-19 01:39:25,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:25,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 01:39:25,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 01:39:25,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217316629] [2022-03-19 01:39:25,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217316629] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 01:39:25,037 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 01:39:25,037 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-03-19 01:39:25,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611927212] [2022-03-19 01:39:25,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 01:39:25,038 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-19 01:39:25,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-19 01:39:25,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-19 01:39:25,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-03-19 01:39:25,038 INFO L87 Difference]: Start difference. First operand 489 states and 602 transitions. Second operand has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 7 states have internal predecessors, (51), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-03-19 01:39:26,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 01:39:26,004 INFO L93 Difference]: Finished difference Result 522 states and 640 transitions. [2022-03-19 01:39:26,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-19 01:39:26,005 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 7 states have internal predecessors, (51), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) Word has length 63 [2022-03-19 01:39:26,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 01:39:26,006 INFO L225 Difference]: With dead ends: 522 [2022-03-19 01:39:26,006 INFO L226 Difference]: Without dead ends: 501 [2022-03-19 01:39:26,007 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2022-03-19 01:39:26,007 INFO L912 BasicCegarLoop]: 369 mSDtfsCounter, 599 mSDsluCounter, 1242 mSDsCounter, 0 mSdLazyCounter, 2122 mSolverCounterSat, 199 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 603 SdHoareTripleChecker+Valid, 1611 SdHoareTripleChecker+Invalid, 2321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 199 IncrementalHoareTripleChecker+Valid, 2122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-19 01:39:26,007 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [603 Valid, 1611 Invalid, 2321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [199 Valid, 2122 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-19 01:39:26,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2022-03-19 01:39:26,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 485. [2022-03-19 01:39:26,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 485 states, 381 states have (on average 1.2335958005249343) internal successors, (470), 388 states have internal predecessors, (470), 59 states have call successors, (59), 42 states have call predecessors, (59), 44 states have return successors, (67), 55 states have call predecessors, (67), 53 states have call successors, (67) [2022-03-19 01:39:26,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 596 transitions. [2022-03-19 01:39:26,045 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 596 transitions. Word has length 63 [2022-03-19 01:39:26,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 01:39:26,045 INFO L478 AbstractCegarLoop]: Abstraction has 485 states and 596 transitions. [2022-03-19 01:39:26,046 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 7 states have internal predecessors, (51), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-03-19 01:39:26,046 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 596 transitions. [2022-03-19 01:39:26,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-03-19 01:39:26,046 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 01:39:26,046 INFO L500 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, 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-03-19 01:39:26,047 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-03-19 01:39:26,047 INFO L403 AbstractCegarLoop]: === Iteration 41 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 01:39:26,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 01:39:26,047 INFO L85 PathProgramCache]: Analyzing trace with hash -1734732644, now seen corresponding path program 1 times [2022-03-19 01:39:26,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 01:39:26,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798282941] [2022-03-19 01:39:26,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 01:39:26,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 01:39:26,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:26,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 01:39:26,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:26,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-19 01:39:26,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:26,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-19 01:39:26,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:26,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-03-19 01:39:26,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:26,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-03-19 01:39:26,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:26,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 01:39:26,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 01:39:26,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798282941] [2022-03-19 01:39:26,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798282941] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 01:39:26,213 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 01:39:26,213 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-03-19 01:39:26,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211610978] [2022-03-19 01:39:26,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 01:39:26,214 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-19 01:39:26,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-19 01:39:26,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-19 01:39:26,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-03-19 01:39:26,215 INFO L87 Difference]: Start difference. First operand 485 states and 596 transitions. Second operand has 13 states, 13 states have (on average 4.0) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-03-19 01:39:27,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 01:39:27,052 INFO L93 Difference]: Finished difference Result 512 states and 627 transitions. [2022-03-19 01:39:27,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-19 01:39:27,052 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.0) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) Word has length 64 [2022-03-19 01:39:27,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 01:39:27,054 INFO L225 Difference]: With dead ends: 512 [2022-03-19 01:39:27,054 INFO L226 Difference]: Without dead ends: 490 [2022-03-19 01:39:27,055 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-03-19 01:39:27,055 INFO L912 BasicCegarLoop]: 375 mSDtfsCounter, 425 mSDsluCounter, 1123 mSDsCounter, 0 mSdLazyCounter, 2058 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 429 SdHoareTripleChecker+Valid, 1498 SdHoareTripleChecker+Invalid, 2200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 2058 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-19 01:39:27,055 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [429 Valid, 1498 Invalid, 2200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 2058 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-19 01:39:27,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2022-03-19 01:39:27,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 474. [2022-03-19 01:39:27,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 474 states, 372 states have (on average 1.2311827956989247) internal successors, (458), 379 states have internal predecessors, (458), 58 states have call successors, (58), 42 states have call predecessors, (58), 43 states have return successors, (65), 53 states have call predecessors, (65), 52 states have call successors, (65) [2022-03-19 01:39:27,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 581 transitions. [2022-03-19 01:39:27,093 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 581 transitions. Word has length 64 [2022-03-19 01:39:27,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 01:39:27,093 INFO L478 AbstractCegarLoop]: Abstraction has 474 states and 581 transitions. [2022-03-19 01:39:27,093 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.0) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-03-19 01:39:27,093 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 581 transitions. [2022-03-19 01:39:27,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-03-19 01:39:27,094 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 01:39:27,094 INFO L500 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, 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-03-19 01:39:27,094 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-03-19 01:39:27,094 INFO L403 AbstractCegarLoop]: === Iteration 42 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 01:39:27,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 01:39:27,095 INFO L85 PathProgramCache]: Analyzing trace with hash -144637562, now seen corresponding path program 1 times [2022-03-19 01:39:27,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 01:39:27,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388026258] [2022-03-19 01:39:27,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 01:39:27,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 01:39:27,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:27,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 01:39:27,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:27,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-19 01:39:27,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:27,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-19 01:39:27,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:27,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-03-19 01:39:27,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:27,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-03-19 01:39:27,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:27,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 01:39:27,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 01:39:27,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388026258] [2022-03-19 01:39:27,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388026258] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 01:39:27,296 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 01:39:27,296 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-03-19 01:39:27,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60198430] [2022-03-19 01:39:27,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 01:39:27,297 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-19 01:39:27,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-19 01:39:27,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-19 01:39:27,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-03-19 01:39:27,297 INFO L87 Difference]: Start difference. First operand 474 states and 581 transitions. Second operand has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 7 states have internal predecessors, (52), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-03-19 01:39:28,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 01:39:28,014 INFO L93 Difference]: Finished difference Result 507 states and 619 transitions. [2022-03-19 01:39:28,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-19 01:39:28,014 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 7 states have internal predecessors, (52), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) Word has length 64 [2022-03-19 01:39:28,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 01:39:28,015 INFO L225 Difference]: With dead ends: 507 [2022-03-19 01:39:28,015 INFO L226 Difference]: Without dead ends: 485 [2022-03-19 01:39:28,016 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2022-03-19 01:39:28,016 INFO L912 BasicCegarLoop]: 367 mSDtfsCounter, 455 mSDsluCounter, 1295 mSDsCounter, 0 mSdLazyCounter, 2034 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 459 SdHoareTripleChecker+Valid, 1662 SdHoareTripleChecker+Invalid, 2182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 2034 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-19 01:39:28,016 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [459 Valid, 1662 Invalid, 2182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 2034 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-19 01:39:28,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2022-03-19 01:39:28,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 469. [2022-03-19 01:39:28,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 469 states, 368 states have (on average 1.2309782608695652) internal successors, (453), 375 states have internal predecessors, (453), 57 states have call successors, (57), 42 states have call predecessors, (57), 43 states have return successors, (64), 52 states have call predecessors, (64), 51 states have call successors, (64) [2022-03-19 01:39:28,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 574 transitions. [2022-03-19 01:39:28,051 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 574 transitions. Word has length 64 [2022-03-19 01:39:28,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 01:39:28,052 INFO L478 AbstractCegarLoop]: Abstraction has 469 states and 574 transitions. [2022-03-19 01:39:28,052 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 7 states have internal predecessors, (52), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-03-19 01:39:28,052 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 574 transitions. [2022-03-19 01:39:28,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-03-19 01:39:28,052 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 01:39:28,052 INFO L500 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, 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-03-19 01:39:28,052 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-03-19 01:39:28,053 INFO L403 AbstractCegarLoop]: === Iteration 43 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 01:39:28,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 01:39:28,053 INFO L85 PathProgramCache]: Analyzing trace with hash 1120155272, now seen corresponding path program 1 times [2022-03-19 01:39:28,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 01:39:28,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747625434] [2022-03-19 01:39:28,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 01:39:28,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 01:39:28,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:28,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 01:39:28,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:28,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-19 01:39:28,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:28,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-19 01:39:28,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:28,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-03-19 01:39:28,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:28,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-03-19 01:39:28,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:28,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 01:39:28,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 01:39:28,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747625434] [2022-03-19 01:39:28,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747625434] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 01:39:28,216 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 01:39:28,216 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-03-19 01:39:28,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053179978] [2022-03-19 01:39:28,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 01:39:28,217 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-19 01:39:28,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-19 01:39:28,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-19 01:39:28,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-03-19 01:39:28,217 INFO L87 Difference]: Start difference. First operand 469 states and 574 transitions. Second operand has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 7 states have internal predecessors, (52), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-03-19 01:39:29,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 01:39:29,112 INFO L93 Difference]: Finished difference Result 502 states and 612 transitions. [2022-03-19 01:39:29,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-19 01:39:29,112 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 7 states have internal predecessors, (52), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) Word has length 64 [2022-03-19 01:39:29,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 01:39:29,114 INFO L225 Difference]: With dead ends: 502 [2022-03-19 01:39:29,114 INFO L226 Difference]: Without dead ends: 481 [2022-03-19 01:39:29,114 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2022-03-19 01:39:29,119 INFO L912 BasicCegarLoop]: 347 mSDtfsCounter, 291 mSDsluCounter, 1187 mSDsCounter, 0 mSdLazyCounter, 2212 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 1534 SdHoareTripleChecker+Invalid, 2308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 2212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-19 01:39:29,120 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [295 Valid, 1534 Invalid, 2308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 2212 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-19 01:39:29,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2022-03-19 01:39:29,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 465. [2022-03-19 01:39:29,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465 states, 365 states have (on average 1.2301369863013698) internal successors, (449), 372 states have internal predecessors, (449), 56 states have call successors, (56), 42 states have call predecessors, (56), 43 states have return successors, (63), 51 states have call predecessors, (63), 50 states have call successors, (63) [2022-03-19 01:39:29,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 568 transitions. [2022-03-19 01:39:29,156 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 568 transitions. Word has length 64 [2022-03-19 01:39:29,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 01:39:29,158 INFO L478 AbstractCegarLoop]: Abstraction has 465 states and 568 transitions. [2022-03-19 01:39:29,158 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 7 states have internal predecessors, (52), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-03-19 01:39:29,158 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 568 transitions. [2022-03-19 01:39:29,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-03-19 01:39:29,159 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 01:39:29,159 INFO L500 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, 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, 1, 1, 1, 1, 1, 1] [2022-03-19 01:39:29,159 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-03-19 01:39:29,159 INFO L403 AbstractCegarLoop]: === Iteration 44 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 01:39:29,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 01:39:29,160 INFO L85 PathProgramCache]: Analyzing trace with hash -1809242026, now seen corresponding path program 1 times [2022-03-19 01:39:29,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 01:39:29,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532569156] [2022-03-19 01:39:29,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 01:39:29,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 01:39:29,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:29,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 01:39:29,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:29,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-19 01:39:29,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:29,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-19 01:39:29,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:29,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-03-19 01:39:29,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:29,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-03-19 01:39:29,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:29,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-19 01:39:29,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:29,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-03-19 01:39:29,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:29,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 01:39:29,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 01:39:29,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532569156] [2022-03-19 01:39:29,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532569156] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 01:39:29,295 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 01:39:29,295 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-03-19 01:39:29,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581116499] [2022-03-19 01:39:29,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 01:39:29,296 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-19 01:39:29,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-19 01:39:29,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-19 01:39:29,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-03-19 01:39:29,296 INFO L87 Difference]: Start difference. First operand 465 states and 568 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (12), 9 states have call predecessors, (12), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-03-19 01:39:30,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 01:39:30,161 INFO L93 Difference]: Finished difference Result 878 states and 1082 transitions. [2022-03-19 01:39:30,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-19 01:39:30,162 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (12), 9 states have call predecessors, (12), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 70 [2022-03-19 01:39:30,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 01:39:30,163 INFO L225 Difference]: With dead ends: 878 [2022-03-19 01:39:30,163 INFO L226 Difference]: Without dead ends: 625 [2022-03-19 01:39:30,164 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2022-03-19 01:39:30,164 INFO L912 BasicCegarLoop]: 408 mSDtfsCounter, 525 mSDsluCounter, 582 mSDsCounter, 0 mSdLazyCounter, 952 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 537 SdHoareTripleChecker+Valid, 990 SdHoareTripleChecker+Invalid, 1100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 952 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-19 01:39:30,164 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [537 Valid, 990 Invalid, 1100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 952 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-19 01:39:30,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2022-03-19 01:39:30,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 586. [2022-03-19 01:39:30,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 586 states, 458 states have (on average 1.220524017467249) internal successors, (559), 467 states have internal predecessors, (559), 69 states have call successors, (69), 52 states have call predecessors, (69), 58 states have return successors, (88), 67 states have call predecessors, (88), 64 states have call successors, (88) [2022-03-19 01:39:30,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 716 transitions. [2022-03-19 01:39:30,208 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 716 transitions. Word has length 70 [2022-03-19 01:39:30,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 01:39:30,208 INFO L478 AbstractCegarLoop]: Abstraction has 586 states and 716 transitions. [2022-03-19 01:39:30,208 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (12), 9 states have call predecessors, (12), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-03-19 01:39:30,208 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 716 transitions. [2022-03-19 01:39:30,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-03-19 01:39:30,209 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 01:39:30,209 INFO L500 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, 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, 1, 1, 1, 1] [2022-03-19 01:39:30,209 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-03-19 01:39:30,209 INFO L403 AbstractCegarLoop]: === Iteration 45 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 01:39:30,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 01:39:30,209 INFO L85 PathProgramCache]: Analyzing trace with hash -1680266649, now seen corresponding path program 1 times [2022-03-19 01:39:30,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 01:39:30,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267428617] [2022-03-19 01:39:30,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 01:39:30,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 01:39:30,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:30,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 01:39:30,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:30,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-19 01:39:30,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:30,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-19 01:39:30,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:30,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-03-19 01:39:30,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:30,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-03-19 01:39:30,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:30,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 01:39:30,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 01:39:30,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267428617] [2022-03-19 01:39:30,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267428617] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 01:39:30,382 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 01:39:30,382 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-03-19 01:39:30,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998528571] [2022-03-19 01:39:30,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 01:39:30,382 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-19 01:39:30,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-19 01:39:30,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-19 01:39:30,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-03-19 01:39:30,383 INFO L87 Difference]: Start difference. First operand 586 states and 716 transitions. Second operand has 14 states, 14 states have (on average 4.0) internal successors, (56), 7 states have internal predecessors, (56), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-03-19 01:39:31,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 01:39:31,140 INFO L93 Difference]: Finished difference Result 619 states and 755 transitions. [2022-03-19 01:39:31,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-19 01:39:31,140 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.0) internal successors, (56), 7 states have internal predecessors, (56), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) Word has length 68 [2022-03-19 01:39:31,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 01:39:31,142 INFO L225 Difference]: With dead ends: 619 [2022-03-19 01:39:31,142 INFO L226 Difference]: Without dead ends: 576 [2022-03-19 01:39:31,142 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2022-03-19 01:39:31,143 INFO L912 BasicCegarLoop]: 339 mSDtfsCounter, 447 mSDsluCounter, 1126 mSDsCounter, 0 mSdLazyCounter, 2004 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 453 SdHoareTripleChecker+Valid, 1465 SdHoareTripleChecker+Invalid, 2143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 2004 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-19 01:39:31,143 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [453 Valid, 1465 Invalid, 2143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 2004 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-19 01:39:31,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2022-03-19 01:39:31,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 560. [2022-03-19 01:39:31,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 437 states have (on average 1.2196796338672768) internal successors, (533), 446 states have internal predecessors, (533), 66 states have call successors, (66), 50 states have call predecessors, (66), 56 states have return successors, (85), 64 states have call predecessors, (85), 61 states have call successors, (85) [2022-03-19 01:39:31,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 684 transitions. [2022-03-19 01:39:31,213 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 684 transitions. Word has length 68 [2022-03-19 01:39:31,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 01:39:31,214 INFO L478 AbstractCegarLoop]: Abstraction has 560 states and 684 transitions. [2022-03-19 01:39:31,214 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.0) internal successors, (56), 7 states have internal predecessors, (56), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-03-19 01:39:31,214 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 684 transitions. [2022-03-19 01:39:31,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-03-19 01:39:31,214 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 01:39:31,215 INFO L500 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, 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, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 01:39:31,215 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-03-19 01:39:31,215 INFO L403 AbstractCegarLoop]: === Iteration 46 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 01:39:31,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 01:39:31,215 INFO L85 PathProgramCache]: Analyzing trace with hash -815860561, now seen corresponding path program 1 times [2022-03-19 01:39:31,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 01:39:31,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625018593] [2022-03-19 01:39:31,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 01:39:31,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 01:39:31,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:31,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 01:39:31,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:31,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-19 01:39:31,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:31,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-19 01:39:31,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:31,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-03-19 01:39:31,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:31,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-03-19 01:39:31,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:31,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-03-19 01:39:31,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:31,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-03-19 01:39:31,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:31,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 01:39:31,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 01:39:31,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625018593] [2022-03-19 01:39:31,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625018593] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 01:39:31,396 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 01:39:31,396 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-03-19 01:39:31,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762366293] [2022-03-19 01:39:31,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 01:39:31,397 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-19 01:39:31,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-19 01:39:31,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-19 01:39:31,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2022-03-19 01:39:31,397 INFO L87 Difference]: Start difference. First operand 560 states and 684 transitions. Second operand has 15 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 7 states have internal predecessors, (55), 3 states have call successors, (9), 8 states have call predecessors, (9), 3 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2022-03-19 01:39:32,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 01:39:32,536 INFO L93 Difference]: Finished difference Result 589 states and 718 transitions. [2022-03-19 01:39:32,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-19 01:39:32,536 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 7 states have internal predecessors, (55), 3 states have call successors, (9), 8 states have call predecessors, (9), 3 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) Word has length 71 [2022-03-19 01:39:32,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 01:39:32,538 INFO L225 Difference]: With dead ends: 589 [2022-03-19 01:39:32,538 INFO L226 Difference]: Without dead ends: 535 [2022-03-19 01:39:32,538 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2022-03-19 01:39:32,538 INFO L912 BasicCegarLoop]: 305 mSDtfsCounter, 287 mSDsluCounter, 571 mSDsCounter, 0 mSdLazyCounter, 2740 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 876 SdHoareTripleChecker+Invalid, 2814 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 2740 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-03-19 01:39:32,539 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [299 Valid, 876 Invalid, 2814 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 2740 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-03-19 01:39:32,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2022-03-19 01:39:32,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 519. [2022-03-19 01:39:32,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 519 states, 403 states have (on average 1.2133995037220844) internal successors, (489), 412 states have internal predecessors, (489), 62 states have call successors, (62), 47 states have call predecessors, (62), 53 states have return successors, (81), 60 states have call predecessors, (81), 57 states have call successors, (81) [2022-03-19 01:39:32,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 632 transitions. [2022-03-19 01:39:32,600 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 632 transitions. Word has length 71 [2022-03-19 01:39:32,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 01:39:32,600 INFO L478 AbstractCegarLoop]: Abstraction has 519 states and 632 transitions. [2022-03-19 01:39:32,600 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 7 states have internal predecessors, (55), 3 states have call successors, (9), 8 states have call predecessors, (9), 3 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2022-03-19 01:39:32,600 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 632 transitions. [2022-03-19 01:39:32,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-03-19 01:39:32,601 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 01:39:32,602 INFO L500 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 01:39:32,602 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2022-03-19 01:39:32,602 INFO L403 AbstractCegarLoop]: === Iteration 47 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 01:39:32,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 01:39:32,602 INFO L85 PathProgramCache]: Analyzing trace with hash 1160220987, now seen corresponding path program 1 times [2022-03-19 01:39:32,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 01:39:32,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432411345] [2022-03-19 01:39:32,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 01:39:32,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 01:39:32,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:32,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 01:39:32,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:32,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-19 01:39:32,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:32,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-19 01:39:32,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:32,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-03-19 01:39:32,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:32,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-03-19 01:39:32,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:32,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-19 01:39:32,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:32,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-03-19 01:39:32,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:32,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-03-19 01:39:32,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:32,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 01:39:32,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 01:39:32,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432411345] [2022-03-19 01:39:32,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432411345] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 01:39:32,799 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 01:39:32,799 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-03-19 01:39:32,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112421599] [2022-03-19 01:39:32,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 01:39:32,801 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-19 01:39:32,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-19 01:39:32,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-19 01:39:32,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2022-03-19 01:39:32,802 INFO L87 Difference]: Start difference. First operand 519 states and 632 transitions. Second operand has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 5 states have internal predecessors, (62), 3 states have call successors, (12), 9 states have call predecessors, (12), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-03-19 01:39:33,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 01:39:33,428 INFO L93 Difference]: Finished difference Result 840 states and 1028 transitions. [2022-03-19 01:39:33,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-19 01:39:33,428 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 5 states have internal predecessors, (62), 3 states have call successors, (12), 9 states have call predecessors, (12), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 82 [2022-03-19 01:39:33,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 01:39:33,429 INFO L225 Difference]: With dead ends: 840 [2022-03-19 01:39:33,429 INFO L226 Difference]: Without dead ends: 523 [2022-03-19 01:39:33,430 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2022-03-19 01:39:33,430 INFO L912 BasicCegarLoop]: 388 mSDtfsCounter, 724 mSDsluCounter, 611 mSDsCounter, 0 mSdLazyCounter, 693 mSolverCounterSat, 232 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 731 SdHoareTripleChecker+Valid, 999 SdHoareTripleChecker+Invalid, 925 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 232 IncrementalHoareTripleChecker+Valid, 693 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-19 01:39:33,430 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [731 Valid, 999 Invalid, 925 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [232 Valid, 693 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-19 01:39:33,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2022-03-19 01:39:33,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 501. [2022-03-19 01:39:33,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 501 states, 389 states have (on average 1.2133676092544987) internal successors, (472), 397 states have internal predecessors, (472), 60 states have call successors, (60), 47 states have call predecessors, (60), 51 states have return successors, (70), 57 states have call predecessors, (70), 55 states have call successors, (70) [2022-03-19 01:39:33,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 602 transitions. [2022-03-19 01:39:33,474 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 602 transitions. Word has length 82 [2022-03-19 01:39:33,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 01:39:33,475 INFO L478 AbstractCegarLoop]: Abstraction has 501 states and 602 transitions. [2022-03-19 01:39:33,475 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 5 states have internal predecessors, (62), 3 states have call successors, (12), 9 states have call predecessors, (12), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-03-19 01:39:33,475 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 602 transitions. [2022-03-19 01:39:33,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-03-19 01:39:33,475 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 01:39:33,476 INFO L500 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 01:39:33,476 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2022-03-19 01:39:33,476 INFO L403 AbstractCegarLoop]: === Iteration 48 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 01:39:33,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 01:39:33,476 INFO L85 PathProgramCache]: Analyzing trace with hash 633938585, now seen corresponding path program 1 times [2022-03-19 01:39:33,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 01:39:33,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243632617] [2022-03-19 01:39:33,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 01:39:33,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 01:39:33,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:33,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 01:39:33,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:33,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-19 01:39:33,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:33,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-19 01:39:33,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:33,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-03-19 01:39:33,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:33,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-03-19 01:39:33,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:33,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-19 01:39:33,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:33,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-03-19 01:39:33,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:33,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-03-19 01:39:33,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:33,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-19 01:39:33,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:33,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 01:39:33,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 01:39:33,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243632617] [2022-03-19 01:39:33,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243632617] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 01:39:33,651 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 01:39:33,651 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-03-19 01:39:33,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731499] [2022-03-19 01:39:33,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 01:39:33,652 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-19 01:39:33,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-19 01:39:33,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-19 01:39:33,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2022-03-19 01:39:33,652 INFO L87 Difference]: Start difference. First operand 501 states and 602 transitions. Second operand has 14 states, 14 states have (on average 4.285714285714286) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (14), 10 states have call predecessors, (14), 2 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2022-03-19 01:39:34,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 01:39:34,364 INFO L93 Difference]: Finished difference Result 839 states and 1046 transitions. [2022-03-19 01:39:34,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-03-19 01:39:34,365 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.285714285714286) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (14), 10 states have call predecessors, (14), 2 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 83 [2022-03-19 01:39:34,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 01:39:34,366 INFO L225 Difference]: With dead ends: 839 [2022-03-19 01:39:34,366 INFO L226 Difference]: Without dead ends: 585 [2022-03-19 01:39:34,367 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=391, Unknown=0, NotChecked=0, Total=506 [2022-03-19 01:39:34,368 INFO L912 BasicCegarLoop]: 339 mSDtfsCounter, 455 mSDsluCounter, 1194 mSDsCounter, 0 mSdLazyCounter, 1223 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 466 SdHoareTripleChecker+Valid, 1533 SdHoareTripleChecker+Invalid, 1377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 1223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-19 01:39:34,368 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [466 Valid, 1533 Invalid, 1377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 1223 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-19 01:39:34,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2022-03-19 01:39:34,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 465. [2022-03-19 01:39:34,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465 states, 365 states have (on average 1.2136986301369863) internal successors, (443), 371 states have internal predecessors, (443), 53 states have call successors, (53), 41 states have call predecessors, (53), 46 states have return successors, (60), 53 states have call predecessors, (60), 49 states have call successors, (60) [2022-03-19 01:39:34,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 556 transitions. [2022-03-19 01:39:34,405 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 556 transitions. Word has length 83 [2022-03-19 01:39:34,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 01:39:34,405 INFO L478 AbstractCegarLoop]: Abstraction has 465 states and 556 transitions. [2022-03-19 01:39:34,405 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.285714285714286) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (14), 10 states have call predecessors, (14), 2 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2022-03-19 01:39:34,405 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 556 transitions. [2022-03-19 01:39:34,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-03-19 01:39:34,406 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 01:39:34,406 INFO L500 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, 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, 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-03-19 01:39:34,406 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2022-03-19 01:39:34,406 INFO L403 AbstractCegarLoop]: === Iteration 49 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 01:39:34,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 01:39:34,407 INFO L85 PathProgramCache]: Analyzing trace with hash 1833243044, now seen corresponding path program 1 times [2022-03-19 01:39:34,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 01:39:34,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690382854] [2022-03-19 01:39:34,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 01:39:34,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 01:39:34,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:34,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 01:39:34,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:34,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-19 01:39:34,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:34,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-19 01:39:34,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:34,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-03-19 01:39:34,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:34,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-03-19 01:39:34,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:34,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-03-19 01:39:34,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:34,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-19 01:39:34,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:34,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-03-19 01:39:34,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:34,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-03-19 01:39:34,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:34,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 01:39:34,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 01:39:34,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690382854] [2022-03-19 01:39:34,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690382854] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 01:39:34,612 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 01:39:34,612 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-03-19 01:39:34,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234930860] [2022-03-19 01:39:34,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 01:39:34,612 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-19 01:39:34,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-19 01:39:34,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-19 01:39:34,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2022-03-19 01:39:34,613 INFO L87 Difference]: Start difference. First operand 465 states and 556 transitions. Second operand has 16 states, 16 states have (on average 4.25) internal successors, (68), 7 states have internal predecessors, (68), 3 states have call successors, (11), 9 states have call predecessors, (11), 3 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9) [2022-03-19 01:39:35,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 01:39:35,552 INFO L93 Difference]: Finished difference Result 526 states and 629 transitions. [2022-03-19 01:39:35,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-03-19 01:39:35,553 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.25) internal successors, (68), 7 states have internal predecessors, (68), 3 states have call successors, (11), 9 states have call predecessors, (11), 3 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9) Word has length 88 [2022-03-19 01:39:35,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 01:39:35,555 INFO L225 Difference]: With dead ends: 526 [2022-03-19 01:39:35,555 INFO L226 Difference]: Without dead ends: 505 [2022-03-19 01:39:35,555 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=101, Invalid=499, Unknown=0, NotChecked=0, Total=600 [2022-03-19 01:39:35,556 INFO L912 BasicCegarLoop]: 289 mSDtfsCounter, 359 mSDsluCounter, 1311 mSDsCounter, 0 mSdLazyCounter, 1765 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 367 SdHoareTripleChecker+Valid, 1600 SdHoareTripleChecker+Invalid, 1895 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 1765 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-19 01:39:35,558 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [367 Valid, 1600 Invalid, 1895 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 1765 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-19 01:39:35,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2022-03-19 01:39:35,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 473. [2022-03-19 01:39:35,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 473 states, 372 states have (on average 1.2096774193548387) internal successors, (450), 378 states have internal predecessors, (450), 53 states have call successors, (53), 41 states have call predecessors, (53), 47 states have return successors, (63), 54 states have call predecessors, (63), 49 states have call successors, (63) [2022-03-19 01:39:35,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 566 transitions. [2022-03-19 01:39:35,595 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 566 transitions. Word has length 88 [2022-03-19 01:39:35,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 01:39:35,595 INFO L478 AbstractCegarLoop]: Abstraction has 473 states and 566 transitions. [2022-03-19 01:39:35,596 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.25) internal successors, (68), 7 states have internal predecessors, (68), 3 states have call successors, (11), 9 states have call predecessors, (11), 3 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9) [2022-03-19 01:39:35,596 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 566 transitions. [2022-03-19 01:39:35,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-03-19 01:39:35,597 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 01:39:35,597 INFO L500 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, 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, 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-03-19 01:39:35,597 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2022-03-19 01:39:35,597 INFO L403 AbstractCegarLoop]: === Iteration 50 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 01:39:35,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 01:39:35,597 INFO L85 PathProgramCache]: Analyzing trace with hash -2018356459, now seen corresponding path program 1 times [2022-03-19 01:39:35,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 01:39:35,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268859413] [2022-03-19 01:39:35,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 01:39:35,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 01:39:35,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:35,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 01:39:35,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:35,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-19 01:39:35,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:35,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-19 01:39:35,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:35,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-03-19 01:39:35,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:35,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-03-19 01:39:35,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:35,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-03-19 01:39:35,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:35,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-19 01:39:35,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:35,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-03-19 01:39:35,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:35,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-03-19 01:39:35,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:35,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 01:39:35,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 01:39:35,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268859413] [2022-03-19 01:39:35,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268859413] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 01:39:35,788 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 01:39:35,788 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-03-19 01:39:35,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685929238] [2022-03-19 01:39:35,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 01:39:35,790 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-19 01:39:35,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-19 01:39:35,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-19 01:39:35,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2022-03-19 01:39:35,790 INFO L87 Difference]: Start difference. First operand 473 states and 566 transitions. Second operand has 16 states, 16 states have (on average 4.3125) internal successors, (69), 7 states have internal predecessors, (69), 3 states have call successors, (11), 9 states have call predecessors, (11), 3 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9) [2022-03-19 01:39:36,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 01:39:36,551 INFO L93 Difference]: Finished difference Result 526 states and 628 transitions. [2022-03-19 01:39:36,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-19 01:39:36,552 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.3125) internal successors, (69), 7 states have internal predecessors, (69), 3 states have call successors, (11), 9 states have call predecessors, (11), 3 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9) Word has length 89 [2022-03-19 01:39:36,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 01:39:36,553 INFO L225 Difference]: With dead ends: 526 [2022-03-19 01:39:36,553 INFO L226 Difference]: Without dead ends: 505 [2022-03-19 01:39:36,553 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=342, Unknown=0, NotChecked=0, Total=420 [2022-03-19 01:39:36,554 INFO L912 BasicCegarLoop]: 305 mSDtfsCounter, 459 mSDsluCounter, 1390 mSDsCounter, 0 mSdLazyCounter, 1527 mSolverCounterSat, 163 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 463 SdHoareTripleChecker+Valid, 1695 SdHoareTripleChecker+Invalid, 1690 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 163 IncrementalHoareTripleChecker+Valid, 1527 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-19 01:39:36,554 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [463 Valid, 1695 Invalid, 1690 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [163 Valid, 1527 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-19 01:39:36,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2022-03-19 01:39:36,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 465. [2022-03-19 01:39:36,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465 states, 365 states have (on average 1.210958904109589) internal successors, (442), 371 states have internal predecessors, (442), 53 states have call successors, (53), 41 states have call predecessors, (53), 46 states have return successors, (60), 53 states have call predecessors, (60), 49 states have call successors, (60) [2022-03-19 01:39:36,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 555 transitions. [2022-03-19 01:39:36,592 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 555 transitions. Word has length 89 [2022-03-19 01:39:36,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 01:39:36,592 INFO L478 AbstractCegarLoop]: Abstraction has 465 states and 555 transitions. [2022-03-19 01:39:36,592 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.3125) internal successors, (69), 7 states have internal predecessors, (69), 3 states have call successors, (11), 9 states have call predecessors, (11), 3 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9) [2022-03-19 01:39:36,593 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 555 transitions. [2022-03-19 01:39:36,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-03-19 01:39:36,593 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 01:39:36,593 INFO L500 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, 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, 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, 1, 1] [2022-03-19 01:39:36,594 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2022-03-19 01:39:36,594 INFO L403 AbstractCegarLoop]: === Iteration 51 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 01:39:36,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 01:39:36,594 INFO L85 PathProgramCache]: Analyzing trace with hash -72110269, now seen corresponding path program 1 times [2022-03-19 01:39:36,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 01:39:36,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553614747] [2022-03-19 01:39:36,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 01:39:36,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 01:39:36,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:36,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 01:39:36,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:36,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-19 01:39:36,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:36,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-19 01:39:36,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:36,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-03-19 01:39:36,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:36,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-03-19 01:39:36,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:36,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-03-19 01:39:36,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:36,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-19 01:39:36,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:36,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-03-19 01:39:36,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:36,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-03-19 01:39:36,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:36,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-03-19 01:39:36,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:36,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 01:39:36,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 01:39:36,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553614747] [2022-03-19 01:39:36,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553614747] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 01:39:36,812 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 01:39:36,813 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-03-19 01:39:36,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41718159] [2022-03-19 01:39:36,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 01:39:36,813 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-19 01:39:36,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-19 01:39:36,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-19 01:39:36,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2022-03-19 01:39:36,813 INFO L87 Difference]: Start difference. First operand 465 states and 555 transitions. Second operand has 14 states, 14 states have (on average 5.428571428571429) internal successors, (76), 5 states have internal predecessors, (76), 2 states have call successors, (12), 10 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2022-03-19 01:39:37,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 01:39:37,468 INFO L93 Difference]: Finished difference Result 522 states and 617 transitions. [2022-03-19 01:39:37,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-19 01:39:37,468 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.428571428571429) internal successors, (76), 5 states have internal predecessors, (76), 2 states have call successors, (12), 10 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) Word has length 98 [2022-03-19 01:39:37,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 01:39:37,469 INFO L225 Difference]: With dead ends: 522 [2022-03-19 01:39:37,469 INFO L226 Difference]: Without dead ends: 483 [2022-03-19 01:39:37,470 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2022-03-19 01:39:37,470 INFO L912 BasicCegarLoop]: 274 mSDtfsCounter, 331 mSDsluCounter, 792 mSDsCounter, 0 mSdLazyCounter, 998 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 1066 SdHoareTripleChecker+Invalid, 1104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 998 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-19 01:39:37,470 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [334 Valid, 1066 Invalid, 1104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 998 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-19 01:39:37,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2022-03-19 01:39:37,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 459. [2022-03-19 01:39:37,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 361 states have (on average 1.2132963988919667) internal successors, (438), 367 states have internal predecessors, (438), 51 states have call successors, (51), 41 states have call predecessors, (51), 46 states have return successors, (57), 51 states have call predecessors, (57), 47 states have call successors, (57) [2022-03-19 01:39:37,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 546 transitions. [2022-03-19 01:39:37,506 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 546 transitions. Word has length 98 [2022-03-19 01:39:37,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 01:39:37,506 INFO L478 AbstractCegarLoop]: Abstraction has 459 states and 546 transitions. [2022-03-19 01:39:37,506 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.428571428571429) internal successors, (76), 5 states have internal predecessors, (76), 2 states have call successors, (12), 10 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2022-03-19 01:39:37,506 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 546 transitions. [2022-03-19 01:39:37,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-03-19 01:39:37,507 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 01:39:37,507 INFO L500 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, 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, 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-03-19 01:39:37,507 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2022-03-19 01:39:37,507 INFO L403 AbstractCegarLoop]: === Iteration 52 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 01:39:37,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 01:39:37,507 INFO L85 PathProgramCache]: Analyzing trace with hash 221001860, now seen corresponding path program 1 times [2022-03-19 01:39:37,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 01:39:37,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898135118] [2022-03-19 01:39:37,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 01:39:37,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 01:39:37,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:37,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 01:39:37,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:37,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-19 01:39:37,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:37,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-19 01:39:37,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:37,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-03-19 01:39:37,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:37,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-03-19 01:39:37,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:37,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-03-19 01:39:37,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:37,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-03-19 01:39:37,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:37,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-03-19 01:39:37,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:37,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 01:39:37,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 01:39:37,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898135118] [2022-03-19 01:39:37,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898135118] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 01:39:37,683 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 01:39:37,683 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-03-19 01:39:37,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275726993] [2022-03-19 01:39:37,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 01:39:37,684 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-19 01:39:37,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-19 01:39:37,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-19 01:39:37,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-03-19 01:39:37,684 INFO L87 Difference]: Start difference. First operand 459 states and 546 transitions. Second operand has 13 states, 13 states have (on average 5.6923076923076925) internal successors, (74), 6 states have internal predecessors, (74), 5 states have call successors, (10), 9 states have call predecessors, (10), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2022-03-19 01:39:39,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 01:39:39,909 INFO L93 Difference]: Finished difference Result 1616 states and 1898 transitions. [2022-03-19 01:39:39,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-03-19 01:39:39,910 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.6923076923076925) internal successors, (74), 6 states have internal predecessors, (74), 5 states have call successors, (10), 9 states have call predecessors, (10), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Word has length 92 [2022-03-19 01:39:39,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 01:39:39,918 INFO L225 Difference]: With dead ends: 1616 [2022-03-19 01:39:39,918 INFO L226 Difference]: Without dead ends: 1310 [2022-03-19 01:39:39,919 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 383 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=374, Invalid=1108, Unknown=0, NotChecked=0, Total=1482 [2022-03-19 01:39:39,919 INFO L912 BasicCegarLoop]: 577 mSDtfsCounter, 1523 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 2603 mSolverCounterSat, 537 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1526 SdHoareTripleChecker+Valid, 883 SdHoareTripleChecker+Invalid, 3140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 537 IncrementalHoareTripleChecker+Valid, 2603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-03-19 01:39:39,919 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [1526 Valid, 883 Invalid, 3140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [537 Valid, 2603 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-03-19 01:39:39,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1310 states. [2022-03-19 01:39:40,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1310 to 1036. [2022-03-19 01:39:40,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1036 states, 820 states have (on average 1.197560975609756) internal successors, (982), 833 states have internal predecessors, (982), 103 states have call successors, (103), 93 states have call predecessors, (103), 112 states have return successors, (128), 111 states have call predecessors, (128), 99 states have call successors, (128) [2022-03-19 01:39:40,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1036 states to 1036 states and 1213 transitions. [2022-03-19 01:39:40,017 INFO L78 Accepts]: Start accepts. Automaton has 1036 states and 1213 transitions. Word has length 92 [2022-03-19 01:39:40,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 01:39:40,018 INFO L478 AbstractCegarLoop]: Abstraction has 1036 states and 1213 transitions. [2022-03-19 01:39:40,018 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.6923076923076925) internal successors, (74), 6 states have internal predecessors, (74), 5 states have call successors, (10), 9 states have call predecessors, (10), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2022-03-19 01:39:40,018 INFO L276 IsEmpty]: Start isEmpty. Operand 1036 states and 1213 transitions. [2022-03-19 01:39:40,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-03-19 01:39:40,019 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 01:39:40,019 INFO L500 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, 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, 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, 1, 1, 1] [2022-03-19 01:39:40,019 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2022-03-19 01:39:40,019 INFO L403 AbstractCegarLoop]: === Iteration 53 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 01:39:40,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 01:39:40,019 INFO L85 PathProgramCache]: Analyzing trace with hash 457485908, now seen corresponding path program 1 times [2022-03-19 01:39:40,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 01:39:40,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206463119] [2022-03-19 01:39:40,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 01:39:40,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 01:39:40,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:40,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 01:39:40,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:40,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-19 01:39:40,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:40,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-19 01:39:40,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:40,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-03-19 01:39:40,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:40,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-03-19 01:39:40,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:40,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-03-19 01:39:40,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:40,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-19 01:39:40,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:40,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-03-19 01:39:40,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:40,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-03-19 01:39:40,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:40,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-03-19 01:39:40,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:40,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 01:39:40,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 01:39:40,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206463119] [2022-03-19 01:39:40,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206463119] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 01:39:40,248 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 01:39:40,248 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-03-19 01:39:40,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609887773] [2022-03-19 01:39:40,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 01:39:40,249 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-19 01:39:40,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-19 01:39:40,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-19 01:39:40,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2022-03-19 01:39:40,250 INFO L87 Difference]: Start difference. First operand 1036 states and 1213 transitions. Second operand has 15 states, 15 states have (on average 5.133333333333334) internal successors, (77), 6 states have internal predecessors, (77), 4 states have call successors, (12), 10 states have call predecessors, (12), 2 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) [2022-03-19 01:39:41,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 01:39:41,558 INFO L93 Difference]: Finished difference Result 1962 states and 2306 transitions. [2022-03-19 01:39:41,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-03-19 01:39:41,559 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.133333333333334) internal successors, (77), 6 states have internal predecessors, (77), 4 states have call successors, (12), 10 states have call predecessors, (12), 2 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) Word has length 99 [2022-03-19 01:39:41,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 01:39:41,563 INFO L225 Difference]: With dead ends: 1962 [2022-03-19 01:39:41,564 INFO L226 Difference]: Without dead ends: 1897 [2022-03-19 01:39:41,564 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=183, Invalid=629, Unknown=0, NotChecked=0, Total=812 [2022-03-19 01:39:41,565 INFO L912 BasicCegarLoop]: 461 mSDtfsCounter, 698 mSDsluCounter, 1599 mSDsCounter, 0 mSdLazyCounter, 2031 mSolverCounterSat, 235 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 711 SdHoareTripleChecker+Valid, 2060 SdHoareTripleChecker+Invalid, 2266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 235 IncrementalHoareTripleChecker+Valid, 2031 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-19 01:39:41,565 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [711 Valid, 2060 Invalid, 2266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [235 Valid, 2031 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-19 01:39:41,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1897 states. [2022-03-19 01:39:41,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1897 to 1000. [2022-03-19 01:39:41,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1000 states, 792 states have (on average 1.196969696969697) internal successors, (948), 803 states have internal predecessors, (948), 97 states have call successors, (97), 91 states have call predecessors, (97), 110 states have return successors, (122), 105 states have call predecessors, (122), 93 states have call successors, (122) [2022-03-19 01:39:41,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1000 states to 1000 states and 1167 transitions. [2022-03-19 01:39:41,700 INFO L78 Accepts]: Start accepts. Automaton has 1000 states and 1167 transitions. Word has length 99 [2022-03-19 01:39:41,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 01:39:41,701 INFO L478 AbstractCegarLoop]: Abstraction has 1000 states and 1167 transitions. [2022-03-19 01:39:41,701 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.133333333333334) internal successors, (77), 6 states have internal predecessors, (77), 4 states have call successors, (12), 10 states have call predecessors, (12), 2 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) [2022-03-19 01:39:41,701 INFO L276 IsEmpty]: Start isEmpty. Operand 1000 states and 1167 transitions. [2022-03-19 01:39:41,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-03-19 01:39:41,702 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 01:39:41,702 INFO L500 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, 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, 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-03-19 01:39:41,702 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2022-03-19 01:39:41,702 INFO L403 AbstractCegarLoop]: === Iteration 54 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 01:39:41,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 01:39:41,702 INFO L85 PathProgramCache]: Analyzing trace with hash 925491343, now seen corresponding path program 1 times [2022-03-19 01:39:41,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 01:39:41,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420376002] [2022-03-19 01:39:41,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 01:39:41,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 01:39:41,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:41,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 01:39:41,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:41,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-19 01:39:41,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:41,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-19 01:39:41,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:41,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-03-19 01:39:41,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:41,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-03-19 01:39:41,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:41,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-03-19 01:39:41,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:41,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-03-19 01:39:41,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:41,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-03-19 01:39:41,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:41,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 01:39:41,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 01:39:41,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420376002] [2022-03-19 01:39:41,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420376002] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 01:39:41,916 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 01:39:41,916 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-03-19 01:39:41,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603723385] [2022-03-19 01:39:41,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 01:39:41,917 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-19 01:39:41,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-19 01:39:41,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-19 01:39:41,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2022-03-19 01:39:41,918 INFO L87 Difference]: Start difference. First operand 1000 states and 1167 transitions. Second operand has 16 states, 16 states have (on average 4.6875) internal successors, (75), 7 states have internal predecessors, (75), 2 states have call successors, (10), 9 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 1 states have call successors, (8) [2022-03-19 01:39:42,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 01:39:42,885 INFO L93 Difference]: Finished difference Result 1010 states and 1176 transitions. [2022-03-19 01:39:42,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-03-19 01:39:42,885 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.6875) internal successors, (75), 7 states have internal predecessors, (75), 2 states have call successors, (10), 9 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 1 states have call successors, (8) Word has length 93 [2022-03-19 01:39:42,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 01:39:42,889 INFO L225 Difference]: With dead ends: 1010 [2022-03-19 01:39:42,889 INFO L226 Difference]: Without dead ends: 804 [2022-03-19 01:39:42,889 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2022-03-19 01:39:42,894 INFO L912 BasicCegarLoop]: 227 mSDtfsCounter, 602 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 1974 mSolverCounterSat, 198 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 615 SdHoareTripleChecker+Valid, 568 SdHoareTripleChecker+Invalid, 2172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 198 IncrementalHoareTripleChecker+Valid, 1974 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-19 01:39:42,894 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [615 Valid, 568 Invalid, 2172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [198 Valid, 1974 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-19 01:39:42,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2022-03-19 01:39:42,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 796. [2022-03-19 01:39:42,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 796 states, 624 states have (on average 1.2003205128205128) internal successors, (749), 633 states have internal predecessors, (749), 81 states have call successors, (81), 76 states have call predecessors, (81), 90 states have return successors, (100), 86 states have call predecessors, (100), 78 states have call successors, (100) [2022-03-19 01:39:42,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 930 transitions. [2022-03-19 01:39:42,977 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 930 transitions. Word has length 93 [2022-03-19 01:39:42,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 01:39:42,978 INFO L478 AbstractCegarLoop]: Abstraction has 796 states and 930 transitions. [2022-03-19 01:39:42,978 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.6875) internal successors, (75), 7 states have internal predecessors, (75), 2 states have call successors, (10), 9 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 1 states have call successors, (8) [2022-03-19 01:39:42,978 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 930 transitions. [2022-03-19 01:39:42,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-03-19 01:39:42,979 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 01:39:42,979 INFO L500 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 01:39:42,979 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2022-03-19 01:39:42,979 INFO L403 AbstractCegarLoop]: === Iteration 55 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 01:39:42,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 01:39:42,979 INFO L85 PathProgramCache]: Analyzing trace with hash -1426092271, now seen corresponding path program 1 times [2022-03-19 01:39:42,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 01:39:42,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399028021] [2022-03-19 01:39:42,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 01:39:42,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 01:39:42,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:43,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 01:39:43,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:43,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-19 01:39:43,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:43,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-19 01:39:43,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:43,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-03-19 01:39:43,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:43,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-03-19 01:39:43,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:43,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-03-19 01:39:43,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:43,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-03-19 01:39:43,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:43,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-19 01:39:43,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:43,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-03-19 01:39:43,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:43,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-03-19 01:39:43,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:43,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-19 01:39:43,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:43,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-03-19 01:39:43,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:43,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 01:39:43,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 01:39:43,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399028021] [2022-03-19 01:39:43,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399028021] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 01:39:43,258 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 01:39:43,258 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-03-19 01:39:43,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670547017] [2022-03-19 01:39:43,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 01:39:43,258 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-03-19 01:39:43,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-19 01:39:43,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-03-19 01:39:43,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2022-03-19 01:39:43,258 INFO L87 Difference]: Start difference. First operand 796 states and 930 transitions. Second operand has 19 states, 19 states have (on average 4.105263157894737) internal successors, (78), 7 states have internal predecessors, (78), 3 states have call successors, (14), 12 states have call predecessors, (14), 3 states have return successors, (12), 4 states have call predecessors, (12), 2 states have call successors, (12) [2022-03-19 01:39:43,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 01:39:43,883 INFO L93 Difference]: Finished difference Result 1048 states and 1235 transitions. [2022-03-19 01:39:43,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-19 01:39:43,884 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 4.105263157894737) internal successors, (78), 7 states have internal predecessors, (78), 3 states have call successors, (14), 12 states have call predecessors, (14), 3 states have return successors, (12), 4 states have call predecessors, (12), 2 states have call successors, (12) Word has length 104 [2022-03-19 01:39:43,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 01:39:43,885 INFO L225 Difference]: With dead ends: 1048 [2022-03-19 01:39:43,885 INFO L226 Difference]: Without dead ends: 834 [2022-03-19 01:39:43,886 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=114, Invalid=438, Unknown=0, NotChecked=0, Total=552 [2022-03-19 01:39:43,890 INFO L912 BasicCegarLoop]: 179 mSDtfsCounter, 337 mSDsluCounter, 891 mSDsCounter, 0 mSdLazyCounter, 1028 mSolverCounterSat, 156 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 338 SdHoareTripleChecker+Valid, 1070 SdHoareTripleChecker+Invalid, 1184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 156 IncrementalHoareTripleChecker+Valid, 1028 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-19 01:39:43,890 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [338 Valid, 1070 Invalid, 1184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [156 Valid, 1028 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-19 01:39:43,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 834 states. [2022-03-19 01:39:43,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 834 to 814. [2022-03-19 01:39:43,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 814 states, 640 states have (on average 1.1859375) internal successors, (759), 651 states have internal predecessors, (759), 83 states have call successors, (83), 76 states have call predecessors, (83), 90 states have return successors, (100), 86 states have call predecessors, (100), 78 states have call successors, (100) [2022-03-19 01:39:43,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 814 states to 814 states and 942 transitions. [2022-03-19 01:39:43,973 INFO L78 Accepts]: Start accepts. Automaton has 814 states and 942 transitions. Word has length 104 [2022-03-19 01:39:43,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 01:39:43,974 INFO L478 AbstractCegarLoop]: Abstraction has 814 states and 942 transitions. [2022-03-19 01:39:43,974 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 4.105263157894737) internal successors, (78), 7 states have internal predecessors, (78), 3 states have call successors, (14), 12 states have call predecessors, (14), 3 states have return successors, (12), 4 states have call predecessors, (12), 2 states have call successors, (12) [2022-03-19 01:39:43,974 INFO L276 IsEmpty]: Start isEmpty. Operand 814 states and 942 transitions. [2022-03-19 01:39:43,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-03-19 01:39:43,975 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 01:39:43,975 INFO L500 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 1, 1, 1, 1, 1] [2022-03-19 01:39:43,975 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2022-03-19 01:39:43,975 INFO L403 AbstractCegarLoop]: === Iteration 56 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 01:39:43,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 01:39:43,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1466232135, now seen corresponding path program 1 times [2022-03-19 01:39:43,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 01:39:43,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401726162] [2022-03-19 01:39:43,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 01:39:43,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 01:39:43,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:44,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 01:39:44,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:44,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-19 01:39:44,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:44,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-19 01:39:44,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:44,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-03-19 01:39:44,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:44,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-03-19 01:39:44,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:44,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-19 01:39:44,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:44,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-03-19 01:39:44,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:44,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-03-19 01:39:44,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:44,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-19 01:39:44,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:44,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-03-19 01:39:44,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:44,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-03-19 01:39:44,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:44,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-19 01:39:44,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:44,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-03-19 01:39:44,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:44,191 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-03-19 01:39:44,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 01:39:44,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401726162] [2022-03-19 01:39:44,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401726162] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 01:39:44,191 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 01:39:44,191 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-03-19 01:39:44,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570240444] [2022-03-19 01:39:44,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 01:39:44,193 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-19 01:39:44,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-19 01:39:44,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-19 01:39:44,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2022-03-19 01:39:44,194 INFO L87 Difference]: Start difference. First operand 814 states and 942 transitions. Second operand has 14 states, 14 states have (on average 5.0) internal successors, (70), 5 states have internal predecessors, (70), 2 states have call successors, (15), 10 states have call predecessors, (15), 3 states have return successors, (10), 3 states have call predecessors, (10), 1 states have call successors, (10) [2022-03-19 01:39:44,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 01:39:44,647 INFO L93 Difference]: Finished difference Result 867 states and 993 transitions. [2022-03-19 01:39:44,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-03-19 01:39:44,647 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.0) internal successors, (70), 5 states have internal predecessors, (70), 2 states have call successors, (15), 10 states have call predecessors, (15), 3 states have return successors, (10), 3 states have call predecessors, (10), 1 states have call successors, (10) Word has length 113 [2022-03-19 01:39:44,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 01:39:44,650 INFO L225 Difference]: With dead ends: 867 [2022-03-19 01:39:44,650 INFO L226 Difference]: Without dead ends: 717 [2022-03-19 01:39:44,650 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2022-03-19 01:39:44,651 INFO L912 BasicCegarLoop]: 181 mSDtfsCounter, 153 mSDsluCounter, 716 mSDsCounter, 0 mSdLazyCounter, 779 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 897 SdHoareTripleChecker+Invalid, 844 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 779 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-19 01:39:44,651 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [155 Valid, 897 Invalid, 844 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 779 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-19 01:39:44,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2022-03-19 01:39:44,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 449. [2022-03-19 01:39:44,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 449 states, 354 states have (on average 1.1440677966101696) internal successors, (405), 358 states have internal predecessors, (405), 46 states have call successors, (46), 46 states have call predecessors, (46), 48 states have return successors, (48), 44 states have call predecessors, (48), 44 states have call successors, (48) [2022-03-19 01:39:44,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 499 transitions. [2022-03-19 01:39:44,722 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 499 transitions. Word has length 113 [2022-03-19 01:39:44,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 01:39:44,723 INFO L478 AbstractCegarLoop]: Abstraction has 449 states and 499 transitions. [2022-03-19 01:39:44,723 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.0) internal successors, (70), 5 states have internal predecessors, (70), 2 states have call successors, (15), 10 states have call predecessors, (15), 3 states have return successors, (10), 3 states have call predecessors, (10), 1 states have call successors, (10) [2022-03-19 01:39:44,723 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 499 transitions. [2022-03-19 01:39:44,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-03-19 01:39:44,724 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 01:39:44,724 INFO L500 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, 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, 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, 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-03-19 01:39:44,724 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2022-03-19 01:39:44,724 INFO L403 AbstractCegarLoop]: === Iteration 57 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 01:39:44,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 01:39:44,725 INFO L85 PathProgramCache]: Analyzing trace with hash -165727650, now seen corresponding path program 1 times [2022-03-19 01:39:44,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 01:39:44,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674804955] [2022-03-19 01:39:44,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 01:39:44,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 01:39:44,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:44,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 01:39:44,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:44,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-19 01:39:44,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:44,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-19 01:39:44,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:44,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-03-19 01:39:44,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:44,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-03-19 01:39:44,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:44,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-03-19 01:39:44,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:44,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-03-19 01:39:44,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:44,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-19 01:39:44,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:44,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-03-19 01:39:44,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:44,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-03-19 01:39:44,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:44,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-19 01:39:44,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:44,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-03-19 01:39:44,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:45,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-03-19 01:39:45,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:45,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 01:39:45,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 01:39:45,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674804955] [2022-03-19 01:39:45,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674804955] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 01:39:45,022 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 01:39:45,022 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-03-19 01:39:45,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882704036] [2022-03-19 01:39:45,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 01:39:45,023 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-19 01:39:45,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-19 01:39:45,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-19 01:39:45,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2022-03-19 01:39:45,023 INFO L87 Difference]: Start difference. First operand 449 states and 499 transitions. Second operand has 15 states, 15 states have (on average 6.133333333333334) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (15), 12 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2022-03-19 01:39:45,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 01:39:45,452 INFO L93 Difference]: Finished difference Result 520 states and 576 transitions. [2022-03-19 01:39:45,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-19 01:39:45,452 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 6.133333333333334) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (15), 12 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) Word has length 120 [2022-03-19 01:39:45,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 01:39:45,453 INFO L225 Difference]: With dead ends: 520 [2022-03-19 01:39:45,453 INFO L226 Difference]: Without dead ends: 477 [2022-03-19 01:39:45,454 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=228, Unknown=0, NotChecked=0, Total=342 [2022-03-19 01:39:45,454 INFO L912 BasicCegarLoop]: 175 mSDtfsCounter, 183 mSDsluCounter, 526 mSDsCounter, 0 mSdLazyCounter, 600 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 701 SdHoareTripleChecker+Invalid, 670 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-19 01:39:45,454 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [184 Valid, 701 Invalid, 670 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 600 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-19 01:39:45,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2022-03-19 01:39:45,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 457. [2022-03-19 01:39:45,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 457 states, 360 states have (on average 1.1416666666666666) internal successors, (411), 364 states have internal predecessors, (411), 46 states have call successors, (46), 46 states have call predecessors, (46), 50 states have return successors, (50), 46 states have call predecessors, (50), 44 states have call successors, (50) [2022-03-19 01:39:45,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 507 transitions. [2022-03-19 01:39:45,523 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 507 transitions. Word has length 120 [2022-03-19 01:39:45,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 01:39:45,524 INFO L478 AbstractCegarLoop]: Abstraction has 457 states and 507 transitions. [2022-03-19 01:39:45,524 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 6.133333333333334) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (15), 12 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2022-03-19 01:39:45,524 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 507 transitions. [2022-03-19 01:39:45,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-03-19 01:39:45,525 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 01:39:45,525 INFO L500 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, 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, 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, 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-03-19 01:39:45,525 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2022-03-19 01:39:45,525 INFO L403 AbstractCegarLoop]: === Iteration 58 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 01:39:45,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 01:39:45,526 INFO L85 PathProgramCache]: Analyzing trace with hash -1709722050, now seen corresponding path program 1 times [2022-03-19 01:39:45,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 01:39:45,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890219542] [2022-03-19 01:39:45,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 01:39:45,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 01:39:45,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:45,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 01:39:45,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:45,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-19 01:39:45,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:45,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-19 01:39:45,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:45,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-03-19 01:39:45,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:45,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-03-19 01:39:45,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:45,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-03-19 01:39:45,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:45,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-03-19 01:39:45,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:45,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-19 01:39:45,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:45,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-03-19 01:39:45,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:45,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-03-19 01:39:45,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:45,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-19 01:39:45,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:45,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-03-19 01:39:45,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:45,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-03-19 01:39:45,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:45,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 01:39:45,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 01:39:45,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890219542] [2022-03-19 01:39:45,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890219542] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 01:39:45,788 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 01:39:45,788 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-03-19 01:39:45,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410262732] [2022-03-19 01:39:45,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 01:39:45,789 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-19 01:39:45,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-19 01:39:45,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-19 01:39:45,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2022-03-19 01:39:45,789 INFO L87 Difference]: Start difference. First operand 457 states and 507 transitions. Second operand has 15 states, 15 states have (on average 6.133333333333334) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (15), 12 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2022-03-19 01:39:46,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 01:39:46,192 INFO L93 Difference]: Finished difference Result 612 states and 686 transitions. [2022-03-19 01:39:46,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-19 01:39:46,193 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 6.133333333333334) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (15), 12 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) Word has length 120 [2022-03-19 01:39:46,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 01:39:46,194 INFO L225 Difference]: With dead ends: 612 [2022-03-19 01:39:46,194 INFO L226 Difference]: Without dead ends: 469 [2022-03-19 01:39:46,194 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=238, Unknown=0, NotChecked=0, Total=342 [2022-03-19 01:39:46,194 INFO L912 BasicCegarLoop]: 174 mSDtfsCounter, 274 mSDsluCounter, 569 mSDsCounter, 0 mSdLazyCounter, 527 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 743 SdHoareTripleChecker+Invalid, 649 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 527 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-19 01:39:46,195 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [274 Valid, 743 Invalid, 649 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 527 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-19 01:39:46,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2022-03-19 01:39:46,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 457. [2022-03-19 01:39:46,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 457 states, 360 states have (on average 1.136111111111111) internal successors, (409), 364 states have internal predecessors, (409), 46 states have call successors, (46), 46 states have call predecessors, (46), 50 states have return successors, (50), 46 states have call predecessors, (50), 44 states have call successors, (50) [2022-03-19 01:39:46,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 505 transitions. [2022-03-19 01:39:46,250 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 505 transitions. Word has length 120 [2022-03-19 01:39:46,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 01:39:46,250 INFO L478 AbstractCegarLoop]: Abstraction has 457 states and 505 transitions. [2022-03-19 01:39:46,250 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 6.133333333333334) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (15), 12 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2022-03-19 01:39:46,250 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 505 transitions. [2022-03-19 01:39:46,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2022-03-19 01:39:46,251 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 01:39:46,251 INFO L500 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 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, 1, 1, 1, 1] [2022-03-19 01:39:46,251 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2022-03-19 01:39:46,251 INFO L403 AbstractCegarLoop]: === Iteration 59 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 01:39:46,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 01:39:46,251 INFO L85 PathProgramCache]: Analyzing trace with hash -232533850, now seen corresponding path program 1 times [2022-03-19 01:39:46,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 01:39:46,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261121087] [2022-03-19 01:39:46,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 01:39:46,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 01:39:46,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:46,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 01:39:46,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:46,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-19 01:39:46,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:46,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-19 01:39:46,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:46,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-03-19 01:39:46,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:46,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-03-19 01:39:46,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:46,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-03-19 01:39:46,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:46,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-03-19 01:39:46,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:46,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-19 01:39:46,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:46,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-03-19 01:39:46,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:46,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-03-19 01:39:46,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:46,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-19 01:39:46,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:46,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-03-19 01:39:46,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:46,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-03-19 01:39:46,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:46,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-19 01:39:46,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:46,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-03-19 01:39:46,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:46,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-03-19 01:39:46,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:46,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-03-19 01:39:46,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:46,660 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-03-19 01:39:46,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 01:39:46,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261121087] [2022-03-19 01:39:46,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261121087] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 01:39:46,660 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 01:39:46,660 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-03-19 01:39:46,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790694991] [2022-03-19 01:39:46,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 01:39:46,661 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-03-19 01:39:46,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-19 01:39:46,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-03-19 01:39:46,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=515, Unknown=0, NotChecked=0, Total=600 [2022-03-19 01:39:46,661 INFO L87 Difference]: Start difference. First operand 457 states and 505 transitions. Second operand has 25 states, 25 states have (on average 4.04) internal successors, (101), 11 states have internal predecessors, (101), 3 states have call successors, (16), 12 states have call predecessors, (16), 5 states have return successors, (14), 6 states have call predecessors, (14), 2 states have call successors, (14) [2022-03-19 01:39:47,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 01:39:47,449 INFO L93 Difference]: Finished difference Result 584 states and 664 transitions. [2022-03-19 01:39:47,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-03-19 01:39:47,449 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 4.04) internal successors, (101), 11 states have internal predecessors, (101), 3 states have call successors, (16), 12 states have call predecessors, (16), 5 states have return successors, (14), 6 states have call predecessors, (14), 2 states have call successors, (14) Word has length 150 [2022-03-19 01:39:47,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 01:39:47,450 INFO L225 Difference]: With dead ends: 584 [2022-03-19 01:39:47,450 INFO L226 Difference]: Without dead ends: 531 [2022-03-19 01:39:47,451 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=148, Invalid=1042, Unknown=0, NotChecked=0, Total=1190 [2022-03-19 01:39:47,451 INFO L912 BasicCegarLoop]: 167 mSDtfsCounter, 284 mSDsluCounter, 1263 mSDsCounter, 0 mSdLazyCounter, 1783 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 1430 SdHoareTripleChecker+Invalid, 1918 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 1783 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-19 01:39:47,451 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [292 Valid, 1430 Invalid, 1918 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 1783 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-19 01:39:47,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2022-03-19 01:39:47,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 491. [2022-03-19 01:39:47,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 491 states, 390 states have (on average 1.146153846153846) internal successors, (447), 394 states have internal predecessors, (447), 46 states have call successors, (46), 46 states have call predecessors, (46), 54 states have return successors, (54), 50 states have call predecessors, (54), 44 states have call successors, (54) [2022-03-19 01:39:47,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 547 transitions. [2022-03-19 01:39:47,509 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 547 transitions. Word has length 150 [2022-03-19 01:39:47,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 01:39:47,509 INFO L478 AbstractCegarLoop]: Abstraction has 491 states and 547 transitions. [2022-03-19 01:39:47,509 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 4.04) internal successors, (101), 11 states have internal predecessors, (101), 3 states have call successors, (16), 12 states have call predecessors, (16), 5 states have return successors, (14), 6 states have call predecessors, (14), 2 states have call successors, (14) [2022-03-19 01:39:47,509 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 547 transitions. [2022-03-19 01:39:47,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2022-03-19 01:39:47,510 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 01:39:47,510 INFO L500 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 01:39:47,511 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2022-03-19 01:39:47,511 INFO L403 AbstractCegarLoop]: === Iteration 60 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 01:39:47,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 01:39:47,511 INFO L85 PathProgramCache]: Analyzing trace with hash 2130033855, now seen corresponding path program 1 times [2022-03-19 01:39:47,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 01:39:47,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732665750] [2022-03-19 01:39:47,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 01:39:47,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 01:39:47,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:47,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 01:39:47,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:47,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-19 01:39:47,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:47,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-19 01:39:47,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:47,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-03-19 01:39:47,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:47,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-03-19 01:39:47,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:47,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-03-19 01:39:47,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:47,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-03-19 01:39:47,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:47,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-19 01:39:47,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:47,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-03-19 01:39:47,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:47,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-03-19 01:39:47,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:47,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-19 01:39:47,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:47,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-03-19 01:39:47,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:47,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-03-19 01:39:47,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:47,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-19 01:39:47,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:47,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-03-19 01:39:47,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:47,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-03-19 01:39:47,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:47,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-03-19 01:39:47,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:47,814 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-03-19 01:39:47,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 01:39:47,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732665750] [2022-03-19 01:39:47,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732665750] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 01:39:47,815 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 01:39:47,815 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-03-19 01:39:47,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377206834] [2022-03-19 01:39:47,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 01:39:47,819 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-03-19 01:39:47,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-19 01:39:47,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-03-19 01:39:47,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2022-03-19 01:39:47,820 INFO L87 Difference]: Start difference. First operand 491 states and 547 transitions. Second operand has 19 states, 19 states have (on average 5.421052631578948) internal successors, (103), 7 states have internal predecessors, (103), 2 states have call successors, (16), 12 states have call predecessors, (16), 4 states have return successors, (14), 4 states have call predecessors, (14), 2 states have call successors, (14) [2022-03-19 01:39:48,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 01:39:48,354 INFO L93 Difference]: Finished difference Result 664 states and 748 transitions. [2022-03-19 01:39:48,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-19 01:39:48,354 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 5.421052631578948) internal successors, (103), 7 states have internal predecessors, (103), 2 states have call successors, (16), 12 states have call predecessors, (16), 4 states have return successors, (14), 4 states have call predecessors, (14), 2 states have call successors, (14) Word has length 151 [2022-03-19 01:39:48,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 01:39:48,356 INFO L225 Difference]: With dead ends: 664 [2022-03-19 01:39:48,356 INFO L226 Difference]: Without dead ends: 519 [2022-03-19 01:39:48,356 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=480, Unknown=0, NotChecked=0, Total=600 [2022-03-19 01:39:48,356 INFO L912 BasicCegarLoop]: 186 mSDtfsCounter, 284 mSDsluCounter, 1005 mSDsCounter, 0 mSdLazyCounter, 1045 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 1191 SdHoareTripleChecker+Invalid, 1168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 1045 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-19 01:39:48,356 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [285 Valid, 1191 Invalid, 1168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 1045 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-19 01:39:48,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2022-03-19 01:39:48,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 491. [2022-03-19 01:39:48,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 491 states, 390 states have (on average 1.141025641025641) internal successors, (445), 394 states have internal predecessors, (445), 46 states have call successors, (46), 46 states have call predecessors, (46), 54 states have return successors, (54), 50 states have call predecessors, (54), 44 states have call successors, (54) [2022-03-19 01:39:48,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 545 transitions. [2022-03-19 01:39:48,412 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 545 transitions. Word has length 151 [2022-03-19 01:39:48,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 01:39:48,412 INFO L478 AbstractCegarLoop]: Abstraction has 491 states and 545 transitions. [2022-03-19 01:39:48,412 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 5.421052631578948) internal successors, (103), 7 states have internal predecessors, (103), 2 states have call successors, (16), 12 states have call predecessors, (16), 4 states have return successors, (14), 4 states have call predecessors, (14), 2 states have call successors, (14) [2022-03-19 01:39:48,412 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 545 transitions. [2022-03-19 01:39:48,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2022-03-19 01:39:48,413 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 01:39:48,413 INFO L500 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 01:39:48,413 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2022-03-19 01:39:48,413 INFO L403 AbstractCegarLoop]: === Iteration 61 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 01:39:48,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 01:39:48,413 INFO L85 PathProgramCache]: Analyzing trace with hash -1959969322, now seen corresponding path program 1 times [2022-03-19 01:39:48,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 01:39:48,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961227347] [2022-03-19 01:39:48,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 01:39:48,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 01:39:48,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:48,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 01:39:48,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:48,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-19 01:39:48,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:48,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-19 01:39:48,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:48,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-03-19 01:39:48,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:48,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-03-19 01:39:48,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:48,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-03-19 01:39:48,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:48,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-03-19 01:39:48,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:48,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-19 01:39:48,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:48,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-03-19 01:39:48,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:48,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-03-19 01:39:48,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:48,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-19 01:39:48,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:48,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-03-19 01:39:48,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:48,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-03-19 01:39:48,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:48,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-19 01:39:48,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:48,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-03-19 01:39:48,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:48,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-03-19 01:39:48,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:48,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-03-19 01:39:48,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:48,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-03-19 01:39:48,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:48,767 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-03-19 01:39:48,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 01:39:48,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961227347] [2022-03-19 01:39:48,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961227347] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 01:39:48,767 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 01:39:48,767 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-03-19 01:39:48,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356135926] [2022-03-19 01:39:48,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 01:39:48,767 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-03-19 01:39:48,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-19 01:39:48,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-03-19 01:39:48,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=343, Unknown=0, NotChecked=0, Total=420 [2022-03-19 01:39:48,768 INFO L87 Difference]: Start difference. First operand 491 states and 545 transitions. Second operand has 21 states, 21 states have (on average 4.571428571428571) internal successors, (96), 8 states have internal predecessors, (96), 3 states have call successors, (17), 12 states have call predecessors, (17), 4 states have return successors, (15), 5 states have call predecessors, (15), 2 states have call successors, (15) [2022-03-19 01:39:49,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 01:39:49,506 INFO L93 Difference]: Finished difference Result 556 states and 624 transitions. [2022-03-19 01:39:49,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-03-19 01:39:49,507 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 4.571428571428571) internal successors, (96), 8 states have internal predecessors, (96), 3 states have call successors, (17), 12 states have call predecessors, (17), 4 states have return successors, (15), 5 states have call predecessors, (15), 2 states have call successors, (15) Word has length 153 [2022-03-19 01:39:49,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 01:39:49,508 INFO L225 Difference]: With dead ends: 556 [2022-03-19 01:39:49,508 INFO L226 Difference]: Without dead ends: 491 [2022-03-19 01:39:49,508 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=141, Invalid=671, Unknown=0, NotChecked=0, Total=812 [2022-03-19 01:39:49,508 INFO L912 BasicCegarLoop]: 167 mSDtfsCounter, 144 mSDsluCounter, 1004 mSDsCounter, 0 mSdLazyCounter, 1407 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 1171 SdHoareTripleChecker+Invalid, 1463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 1407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-19 01:39:49,509 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [149 Valid, 1171 Invalid, 1463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 1407 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-19 01:39:49,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2022-03-19 01:39:49,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 479. [2022-03-19 01:39:49,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 479 states, 382 states have (on average 1.1282722513089005) internal successors, (431), 386 states have internal predecessors, (431), 44 states have call successors, (44), 44 states have call predecessors, (44), 52 states have return successors, (52), 48 states have call predecessors, (52), 42 states have call successors, (52) [2022-03-19 01:39:49,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 527 transitions. [2022-03-19 01:39:49,585 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 527 transitions. Word has length 153 [2022-03-19 01:39:49,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 01:39:49,586 INFO L478 AbstractCegarLoop]: Abstraction has 479 states and 527 transitions. [2022-03-19 01:39:49,586 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 4.571428571428571) internal successors, (96), 8 states have internal predecessors, (96), 3 states have call successors, (17), 12 states have call predecessors, (17), 4 states have return successors, (15), 5 states have call predecessors, (15), 2 states have call successors, (15) [2022-03-19 01:39:49,586 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 527 transitions. [2022-03-19 01:39:49,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2022-03-19 01:39:49,587 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 01:39:49,587 INFO L500 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 01:39:49,587 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2022-03-19 01:39:49,587 INFO L403 AbstractCegarLoop]: === Iteration 62 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 01:39:49,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 01:39:49,587 INFO L85 PathProgramCache]: Analyzing trace with hash -249606396, now seen corresponding path program 1 times [2022-03-19 01:39:49,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 01:39:49,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560836761] [2022-03-19 01:39:49,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 01:39:49,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 01:39:49,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:49,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 01:39:49,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:49,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-19 01:39:49,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:49,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-19 01:39:49,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:49,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-03-19 01:39:49,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:49,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-03-19 01:39:49,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:49,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-03-19 01:39:49,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:49,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-03-19 01:39:49,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:49,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-19 01:39:49,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:49,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-03-19 01:39:49,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:49,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-03-19 01:39:49,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:49,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-19 01:39:49,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:49,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-03-19 01:39:49,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:49,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-03-19 01:39:49,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:49,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-19 01:39:49,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:49,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-03-19 01:39:49,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:49,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-03-19 01:39:49,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:49,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-03-19 01:39:49,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:49,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-03-19 01:39:49,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:49,830 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-03-19 01:39:49,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 01:39:49,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560836761] [2022-03-19 01:39:49,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560836761] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 01:39:49,830 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 01:39:49,830 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-03-19 01:39:49,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690829929] [2022-03-19 01:39:49,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 01:39:49,830 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-19 01:39:49,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-19 01:39:49,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-19 01:39:49,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2022-03-19 01:39:49,831 INFO L87 Difference]: Start difference. First operand 479 states and 527 transitions. Second operand has 15 states, 15 states have (on average 6.733333333333333) internal successors, (101), 5 states have internal predecessors, (101), 4 states have call successors, (17), 12 states have call predecessors, (17), 2 states have return successors, (15), 4 states have call predecessors, (15), 3 states have call successors, (15) [2022-03-19 01:39:50,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 01:39:50,298 INFO L93 Difference]: Finished difference Result 584 states and 642 transitions. [2022-03-19 01:39:50,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-19 01:39:50,298 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 6.733333333333333) internal successors, (101), 5 states have internal predecessors, (101), 4 states have call successors, (17), 12 states have call predecessors, (17), 2 states have return successors, (15), 4 states have call predecessors, (15), 3 states have call successors, (15) Word has length 158 [2022-03-19 01:39:50,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 01:39:50,299 INFO L225 Difference]: With dead ends: 584 [2022-03-19 01:39:50,299 INFO L226 Difference]: Without dead ends: 451 [2022-03-19 01:39:50,300 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=147, Invalid=405, Unknown=0, NotChecked=0, Total=552 [2022-03-19 01:39:50,300 INFO L912 BasicCegarLoop]: 146 mSDtfsCounter, 320 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 497 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 587 SdHoareTripleChecker+Invalid, 611 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-19 01:39:50,300 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [322 Valid, 587 Invalid, 611 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 497 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-19 01:39:50,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2022-03-19 01:39:50,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 423. [2022-03-19 01:39:50,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 423 states, 334 states have (on average 1.1107784431137724) internal successors, (371), 338 states have internal predecessors, (371), 42 states have call successors, (42), 42 states have call predecessors, (42), 46 states have return successors, (46), 42 states have call predecessors, (46), 40 states have call successors, (46) [2022-03-19 01:39:50,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 459 transitions. [2022-03-19 01:39:50,350 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 459 transitions. Word has length 158 [2022-03-19 01:39:50,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 01:39:50,351 INFO L478 AbstractCegarLoop]: Abstraction has 423 states and 459 transitions. [2022-03-19 01:39:50,351 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 6.733333333333333) internal successors, (101), 5 states have internal predecessors, (101), 4 states have call successors, (17), 12 states have call predecessors, (17), 2 states have return successors, (15), 4 states have call predecessors, (15), 3 states have call successors, (15) [2022-03-19 01:39:50,351 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 459 transitions. [2022-03-19 01:39:50,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-03-19 01:39:50,351 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 01:39:50,352 INFO L500 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 01:39:50,352 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2022-03-19 01:39:50,352 INFO L403 AbstractCegarLoop]: === Iteration 63 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 01:39:50,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 01:39:50,352 INFO L85 PathProgramCache]: Analyzing trace with hash -2090831252, now seen corresponding path program 1 times [2022-03-19 01:39:50,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 01:39:50,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172933134] [2022-03-19 01:39:50,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 01:39:50,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 01:39:50,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:50,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 01:39:50,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:50,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-19 01:39:50,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:50,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-19 01:39:50,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:50,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-03-19 01:39:50,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:50,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-03-19 01:39:50,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:50,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-03-19 01:39:50,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:50,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-03-19 01:39:50,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:50,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-19 01:39:50,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:50,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-03-19 01:39:50,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:50,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-03-19 01:39:50,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:50,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-19 01:39:50,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:50,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-03-19 01:39:50,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:50,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-03-19 01:39:50,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:50,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-19 01:39:50,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:50,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-03-19 01:39:50,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:50,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-03-19 01:39:50,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:50,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-03-19 01:39:50,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:50,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-03-19 01:39:50,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:50,647 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-03-19 01:39:50,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 01:39:50,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172933134] [2022-03-19 01:39:50,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172933134] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 01:39:50,647 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 01:39:50,647 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-03-19 01:39:50,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327393752] [2022-03-19 01:39:50,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 01:39:50,648 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-03-19 01:39:50,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-19 01:39:50,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-03-19 01:39:50,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2022-03-19 01:39:50,649 INFO L87 Difference]: Start difference. First operand 423 states and 459 transitions. Second operand has 17 states, 17 states have (on average 6.411764705882353) internal successors, (109), 5 states have internal predecessors, (109), 2 states have call successors, (17), 13 states have call predecessors, (17), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2022-03-19 01:39:51,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 01:39:51,052 INFO L93 Difference]: Finished difference Result 536 states and 584 transitions. [2022-03-19 01:39:51,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-19 01:39:51,052 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 6.411764705882353) internal successors, (109), 5 states have internal predecessors, (109), 2 states have call successors, (17), 13 states have call predecessors, (17), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) Word has length 160 [2022-03-19 01:39:51,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 01:39:51,053 INFO L225 Difference]: With dead ends: 536 [2022-03-19 01:39:51,053 INFO L226 Difference]: Without dead ends: 381 [2022-03-19 01:39:51,054 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=124, Invalid=338, Unknown=0, NotChecked=0, Total=462 [2022-03-19 01:39:51,054 INFO L912 BasicCegarLoop]: 149 mSDtfsCounter, 196 mSDsluCounter, 581 mSDsCounter, 0 mSdLazyCounter, 576 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 730 SdHoareTripleChecker+Invalid, 668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-19 01:39:51,054 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [196 Valid, 730 Invalid, 668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 576 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-19 01:39:51,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2022-03-19 01:39:51,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 381. [2022-03-19 01:39:51,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 298 states have (on average 1.0973154362416107) internal successors, (327), 300 states have internal predecessors, (327), 40 states have call successors, (40), 40 states have call predecessors, (40), 42 states have return successors, (42), 40 states have call predecessors, (42), 38 states have call successors, (42) [2022-03-19 01:39:51,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 409 transitions. [2022-03-19 01:39:51,102 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 409 transitions. Word has length 160 [2022-03-19 01:39:51,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 01:39:51,103 INFO L478 AbstractCegarLoop]: Abstraction has 381 states and 409 transitions. [2022-03-19 01:39:51,103 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 6.411764705882353) internal successors, (109), 5 states have internal predecessors, (109), 2 states have call successors, (17), 13 states have call predecessors, (17), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2022-03-19 01:39:51,103 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 409 transitions. [2022-03-19 01:39:51,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-03-19 01:39:51,103 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 01:39:51,104 INFO L500 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 01:39:51,104 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2022-03-19 01:39:51,104 INFO L403 AbstractCegarLoop]: === Iteration 64 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 01:39:51,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 01:39:51,104 INFO L85 PathProgramCache]: Analyzing trace with hash 1980774501, now seen corresponding path program 1 times [2022-03-19 01:39:51,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 01:39:51,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736011970] [2022-03-19 01:39:51,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 01:39:51,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 01:39:51,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:51,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 01:39:51,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:51,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-19 01:39:51,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:51,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-19 01:39:51,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:51,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-03-19 01:39:51,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:51,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-03-19 01:39:51,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:51,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-03-19 01:39:51,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:51,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-03-19 01:39:51,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:51,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-19 01:39:51,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:51,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-03-19 01:39:51,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:51,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-03-19 01:39:51,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:51,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-19 01:39:51,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:51,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-03-19 01:39:51,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:51,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-03-19 01:39:51,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:51,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-19 01:39:51,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:51,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-03-19 01:39:51,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:51,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-03-19 01:39:51,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:51,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-03-19 01:39:51,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:51,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-03-19 01:39:51,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:51,390 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-03-19 01:39:51,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 01:39:51,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736011970] [2022-03-19 01:39:51,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736011970] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 01:39:51,390 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 01:39:51,390 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-03-19 01:39:51,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30835816] [2022-03-19 01:39:51,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 01:39:51,391 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-03-19 01:39:51,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-19 01:39:51,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-03-19 01:39:51,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=293, Unknown=0, NotChecked=0, Total=380 [2022-03-19 01:39:51,392 INFO L87 Difference]: Start difference. First operand 381 states and 409 transitions. Second operand has 20 states, 20 states have (on average 5.35) internal successors, (107), 8 states have internal predecessors, (107), 5 states have call successors, (17), 13 states have call predecessors, (17), 3 states have return successors, (15), 6 states have call predecessors, (15), 4 states have call successors, (15) [2022-03-19 01:39:52,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 01:39:52,365 INFO L93 Difference]: Finished difference Result 762 states and 821 transitions. [2022-03-19 01:39:52,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-03-19 01:39:52,366 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 5.35) internal successors, (107), 8 states have internal predecessors, (107), 5 states have call successors, (17), 13 states have call predecessors, (17), 3 states have return successors, (15), 6 states have call predecessors, (15), 4 states have call successors, (15) Word has length 161 [2022-03-19 01:39:52,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 01:39:52,367 INFO L225 Difference]: With dead ends: 762 [2022-03-19 01:39:52,367 INFO L226 Difference]: Without dead ends: 387 [2022-03-19 01:39:52,368 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 541 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=387, Invalid=1965, Unknown=0, NotChecked=0, Total=2352 [2022-03-19 01:39:52,368 INFO L912 BasicCegarLoop]: 139 mSDtfsCounter, 435 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 1253 mSolverCounterSat, 146 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 436 SdHoareTripleChecker+Valid, 597 SdHoareTripleChecker+Invalid, 1399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 1253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-19 01:39:52,368 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [436 Valid, 597 Invalid, 1399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 1253 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-19 01:39:52,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2022-03-19 01:39:52,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 381. [2022-03-19 01:39:52,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 298 states have (on average 1.0939597315436242) internal successors, (326), 300 states have internal predecessors, (326), 40 states have call successors, (40), 40 states have call predecessors, (40), 42 states have return successors, (42), 40 states have call predecessors, (42), 38 states have call successors, (42) [2022-03-19 01:39:52,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 408 transitions. [2022-03-19 01:39:52,432 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 408 transitions. Word has length 161 [2022-03-19 01:39:52,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 01:39:52,432 INFO L478 AbstractCegarLoop]: Abstraction has 381 states and 408 transitions. [2022-03-19 01:39:52,432 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 5.35) internal successors, (107), 8 states have internal predecessors, (107), 5 states have call successors, (17), 13 states have call predecessors, (17), 3 states have return successors, (15), 6 states have call predecessors, (15), 4 states have call successors, (15) [2022-03-19 01:39:52,432 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 408 transitions. [2022-03-19 01:39:52,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-03-19 01:39:52,433 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 01:39:52,433 INFO L500 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 01:39:52,434 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2022-03-19 01:39:52,434 INFO L403 AbstractCegarLoop]: === Iteration 65 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 01:39:52,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 01:39:52,434 INFO L85 PathProgramCache]: Analyzing trace with hash -628292860, now seen corresponding path program 1 times [2022-03-19 01:39:52,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 01:39:52,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866731225] [2022-03-19 01:39:52,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 01:39:52,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 01:39:52,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:52,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 01:39:52,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:52,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-19 01:39:52,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:52,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-19 01:39:52,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:52,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-03-19 01:39:52,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:52,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-03-19 01:39:52,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:52,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-03-19 01:39:52,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:52,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-03-19 01:39:52,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:52,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-19 01:39:52,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:52,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-03-19 01:39:52,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:52,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-03-19 01:39:52,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:52,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-19 01:39:52,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:52,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-03-19 01:39:52,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:52,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-03-19 01:39:52,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:52,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-19 01:39:52,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:52,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-03-19 01:39:52,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:52,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-03-19 01:39:52,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:52,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-03-19 01:39:52,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:52,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-03-19 01:39:52,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:39:52,786 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-03-19 01:39:52,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 01:39:52,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866731225] [2022-03-19 01:39:52,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866731225] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 01:39:52,786 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 01:39:52,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-03-19 01:39:52,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118595147] [2022-03-19 01:39:52,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 01:39:52,786 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-03-19 01:39:52,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-19 01:39:52,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-03-19 01:39:52,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=503, Unknown=0, NotChecked=0, Total=600 [2022-03-19 01:39:52,787 INFO L87 Difference]: Start difference. First operand 381 states and 408 transitions. Second operand has 25 states, 25 states have (on average 4.28) internal successors, (107), 11 states have internal predecessors, (107), 5 states have call successors, (17), 13 states have call predecessors, (17), 4 states have return successors, (15), 7 states have call predecessors, (15), 4 states have call successors, (15) [2022-03-19 01:39:53,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 01:39:53,484 INFO L93 Difference]: Finished difference Result 387 states and 416 transitions. [2022-03-19 01:39:53,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-03-19 01:39:53,484 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 4.28) internal successors, (107), 11 states have internal predecessors, (107), 5 states have call successors, (17), 13 states have call predecessors, (17), 4 states have return successors, (15), 7 states have call predecessors, (15), 4 states have call successors, (15) Word has length 161 [2022-03-19 01:39:53,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 01:39:53,485 INFO L225 Difference]: With dead ends: 387 [2022-03-19 01:39:53,485 INFO L226 Difference]: Without dead ends: 0 [2022-03-19 01:39:53,486 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 324 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=265, Invalid=1715, Unknown=0, NotChecked=0, Total=1980 [2022-03-19 01:39:53,486 INFO L912 BasicCegarLoop]: 126 mSDtfsCounter, 432 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 1518 mSolverCounterSat, 179 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 432 SdHoareTripleChecker+Valid, 673 SdHoareTripleChecker+Invalid, 1697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 179 IncrementalHoareTripleChecker+Valid, 1518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-19 01:39:53,486 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [432 Valid, 673 Invalid, 1697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [179 Valid, 1518 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-19 01:39:53,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-03-19 01:39:53,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-03-19 01:39:53,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-19 01:39:53,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-03-19 01:39:53,487 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 161 [2022-03-19 01:39:53,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 01:39:53,487 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-03-19 01:39:53,487 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 4.28) internal successors, (107), 11 states have internal predecessors, (107), 5 states have call successors, (17), 13 states have call predecessors, (17), 4 states have return successors, (15), 7 states have call predecessors, (15), 4 states have call successors, (15) [2022-03-19 01:39:53,487 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-03-19 01:39:53,487 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-03-19 01:39:53,489 INFO L788 garLoopResultBuilder]: Registering result SAFE for location errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-03-19 01:39:53,491 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2022-03-19 01:39:53,495 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.