./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_lazy.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_lazy.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b26873cfd586f35040b8fa56225beaa479db089ab89500d17d6395862bf9072f --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 21:20:36,405 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 21:20:36,473 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-10-11 21:20:36,477 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 21:20:36,478 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 21:20:36,513 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 21:20:36,514 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 21:20:36,514 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 21:20:36,515 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 21:20:36,516 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 21:20:36,516 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 21:20:36,517 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 21:20:36,517 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 21:20:36,518 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 21:20:36,520 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 21:20:36,520 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 21:20:36,521 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 21:20:36,521 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 21:20:36,521 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 21:20:36,521 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 21:20:36,522 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 21:20:36,526 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 21:20:36,527 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 21:20:36,527 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 21:20:36,527 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 21:20:36,527 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-11 21:20:36,528 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 21:20:36,528 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 21:20:36,528 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 21:20:36,528 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 21:20:36,528 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 21:20:36,529 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 21:20:36,529 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 21:20:36,529 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 21:20:36,529 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 21:20:36,530 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 21:20:36,530 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 21:20:36,531 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 21:20:36,531 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 21:20:36,531 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 21:20:36,531 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 21:20:36,533 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 21:20:36,533 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 21:20:36,534 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 21:20:36,534 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-clean/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.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b26873cfd586f35040b8fa56225beaa479db089ab89500d17d6395862bf9072f [2024-10-11 21:20:36,825 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 21:20:36,851 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 21:20:36,855 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 21:20:36,856 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 21:20:36,857 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 21:20:36,858 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_lazy.i [2024-10-11 21:20:38,287 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 21:20:38,549 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 21:20:38,549 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_lazy.i [2024-10-11 21:20:38,573 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/7761b5e91/7d32bbf58e1f467c80b0a5b50c30a9e3/FLAG1597f1cd1 [2024-10-11 21:20:38,859 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/7761b5e91/7d32bbf58e1f467c80b0a5b50c30a9e3 [2024-10-11 21:20:38,861 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 21:20:38,862 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 21:20:38,863 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 21:20:38,864 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 21:20:38,868 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 21:20:38,869 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 09:20:38" (1/1) ... [2024-10-11 21:20:38,870 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4386f607 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:20:38, skipping insertion in model container [2024-10-11 21:20:38,870 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 09:20:38" (1/1) ... [2024-10-11 21:20:38,932 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 21:20:39,328 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 21:20:39,347 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 21:20:39,428 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 21:20:39,474 INFO L204 MainTranslator]: Completed translation [2024-10-11 21:20:39,475 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:20:39 WrapperNode [2024-10-11 21:20:39,475 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 21:20:39,476 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 21:20:39,476 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 21:20:39,476 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 21:20:39,482 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:20:39" (1/1) ... [2024-10-11 21:20:39,509 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:20:39" (1/1) ... [2024-10-11 21:20:39,558 INFO L138 Inliner]: procedures = 145, calls = 213, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 529 [2024-10-11 21:20:39,558 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 21:20:39,559 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 21:20:39,559 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 21:20:39,562 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 21:20:39,571 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:20:39" (1/1) ... [2024-10-11 21:20:39,571 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:20:39" (1/1) ... [2024-10-11 21:20:39,579 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:20:39" (1/1) ... [2024-10-11 21:20:39,614 INFO L175 MemorySlicer]: Split 109 memory accesses to 13 slices as follows [2, 9, 0, 3, 10, 10, 25, 3, 16, 9, 5, 8, 9]. 23 percent of accesses are in the largest equivalence class. The 30 initializations are split as follows [2, 0, 0, 0, 4, 4, 8, 0, 8, 2, 0, 2, 0]. The 30 writes are split as follows [0, 1, 0, 1, 2, 2, 10, 1, 4, 3, 2, 3, 1]. [2024-10-11 21:20:39,614 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:20:39" (1/1) ... [2024-10-11 21:20:39,615 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:20:39" (1/1) ... [2024-10-11 21:20:39,647 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:20:39" (1/1) ... [2024-10-11 21:20:39,652 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:20:39" (1/1) ... [2024-10-11 21:20:39,658 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:20:39" (1/1) ... [2024-10-11 21:20:39,662 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:20:39" (1/1) ... [2024-10-11 21:20:39,675 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 21:20:39,679 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 21:20:39,679 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 21:20:39,679 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 21:20:39,680 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:20:39" (1/1) ... [2024-10-11 21:20:39,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 21:20:39,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:20:39,715 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 21:20:39,717 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 21:20:39,792 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 21:20:39,792 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 21:20:39,792 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-11 21:20:39,793 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-11 21:20:39,793 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-11 21:20:39,793 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-10-11 21:20:39,793 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-10-11 21:20:39,793 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-10-11 21:20:39,793 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2024-10-11 21:20:39,793 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2024-10-11 21:20:39,794 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2024-10-11 21:20:39,794 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2024-10-11 21:20:39,794 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2024-10-11 21:20:39,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 21:20:39,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 21:20:39,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-11 21:20:39,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-11 21:20:39,795 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-11 21:20:39,795 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-10-11 21:20:39,795 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-10-11 21:20:39,795 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-10-11 21:20:39,796 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2024-10-11 21:20:39,796 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2024-10-11 21:20:39,796 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2024-10-11 21:20:39,796 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2024-10-11 21:20:39,796 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2024-10-11 21:20:39,796 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 21:20:39,796 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-11 21:20:39,796 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-11 21:20:39,797 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-11 21:20:39,797 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-11 21:20:39,797 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-10-11 21:20:39,797 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2024-10-11 21:20:39,797 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2024-10-11 21:20:39,797 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2024-10-11 21:20:39,797 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2024-10-11 21:20:39,797 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2024-10-11 21:20:39,797 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2024-10-11 21:20:39,797 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2024-10-11 21:20:39,797 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2024-10-11 21:20:39,797 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2024-10-11 21:20:39,797 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_lock [2024-10-11 21:20:39,798 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_lock [2024-10-11 21:20:39,798 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_create [2024-10-11 21:20:39,798 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_create [2024-10-11 21:20:39,798 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-11 21:20:39,798 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-11 21:20:39,798 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-11 21:20:39,800 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-10-11 21:20:39,800 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2024-10-11 21:20:39,800 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2024-10-11 21:20:39,800 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2024-10-11 21:20:39,800 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2024-10-11 21:20:39,800 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2024-10-11 21:20:39,800 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2024-10-11 21:20:39,801 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2024-10-11 21:20:39,801 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2024-10-11 21:20:39,801 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2024-10-11 21:20:39,801 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_join [2024-10-11 21:20:39,801 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_join [2024-10-11 21:20:39,801 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~$Pointer$ [2024-10-11 21:20:39,801 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~$Pointer$ [2024-10-11 21:20:39,802 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 21:20:39,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-11 21:20:39,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-11 21:20:39,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-10-11 21:20:39,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2024-10-11 21:20:39,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2024-10-11 21:20:39,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2024-10-11 21:20:39,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2024-10-11 21:20:39,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2024-10-11 21:20:39,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2024-10-11 21:20:39,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2024-10-11 21:20:39,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2024-10-11 21:20:39,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2024-10-11 21:20:39,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2024-10-11 21:20:39,804 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_cs [2024-10-11 21:20:39,804 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_cs [2024-10-11 21:20:39,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 21:20:39,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 21:20:39,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 21:20:39,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-11 21:20:39,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-11 21:20:39,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-11 21:20:39,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-10-11 21:20:39,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-10-11 21:20:39,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-10-11 21:20:39,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-10-11 21:20:39,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-10-11 21:20:39,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-10-11 21:20:39,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2024-10-11 21:20:39,807 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_unlock [2024-10-11 21:20:39,807 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_unlock [2024-10-11 21:20:39,807 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 21:20:39,808 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 21:20:40,075 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 21:20:40,077 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 21:20:40,463 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##32: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);thread3_#res#1.base, thread3_#res#1.offset := 0, 0; [2024-10-11 21:20:40,463 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##31: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2024-10-11 21:20:40,463 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##30: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);thread3_#res#1.base, thread3_#res#1.offset := 0, 0; [2024-10-11 21:20:40,463 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##33: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2024-10-11 21:20:40,463 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint L714: SUMMARY for call __CS_cs(); srcloc: null [2024-10-11 21:20:40,463 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint L714-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);thread3_#res#1.base, thread3_#res#1.offset := 0, 0; [2024-10-11 21:20:40,463 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint L714-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2024-10-11 21:20:40,792 INFO L? ?]: Removed 100 outVars from TransFormulas that were not future-live. [2024-10-11 21:20:40,792 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 21:20:40,851 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 21:20:40,852 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-11 21:20:40,853 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:20:40 BoogieIcfgContainer [2024-10-11 21:20:40,853 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 21:20:40,855 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 21:20:40,855 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 21:20:40,859 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 21:20:40,859 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 09:20:38" (1/3) ... [2024-10-11 21:20:40,860 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b987c6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 09:20:40, skipping insertion in model container [2024-10-11 21:20:40,860 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:20:39" (2/3) ... [2024-10-11 21:20:40,861 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b987c6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 09:20:40, skipping insertion in model container [2024-10-11 21:20:40,861 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:20:40" (3/3) ... [2024-10-11 21:20:40,863 INFO L112 eAbstractionObserver]: Analyzing ICFG cs_lazy.i [2024-10-11 21:20:40,879 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 21:20:40,879 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2024-10-11 21:20:40,975 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 21:20:40,981 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@664c89e4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 21:20:40,981 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2024-10-11 21:20:40,987 INFO L276 IsEmpty]: Start isEmpty. Operand has 183 states, 123 states have (on average 1.6016260162601625) internal successors, (197), 139 states have internal predecessors, (197), 37 states have call successors, (37), 6 states have call predecessors, (37), 6 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2024-10-11 21:20:40,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-11 21:20:41,005 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:20:41,006 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-11 21:20:41,007 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_pthread_mutex_lockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_pthread_mutex_lockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2024-10-11 21:20:41,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:20:41,013 INFO L85 PathProgramCache]: Analyzing trace with hash 17537217, now seen corresponding path program 1 times [2024-10-11 21:20:41,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:20:41,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516692513] [2024-10-11 21:20:41,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:20:41,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:20:41,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:41,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 21:20:41,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:20:41,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516692513] [2024-10-11 21:20:41,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516692513] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:20:41,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:20:41,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 21:20:41,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597292180] [2024-10-11 21:20:41,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:20:41,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 21:20:41,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:20:41,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 21:20:41,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 21:20:41,430 INFO L87 Difference]: Start difference. First operand has 183 states, 123 states have (on average 1.6016260162601625) internal successors, (197), 139 states have internal predecessors, (197), 37 states have call successors, (37), 6 states have call predecessors, (37), 6 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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) [2024-10-11 21:20:41,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:20:41,573 INFO L93 Difference]: Finished difference Result 359 states and 575 transitions. [2024-10-11 21:20:41,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 21:20:41,576 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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) Word has length 4 [2024-10-11 21:20:41,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:20:41,586 INFO L225 Difference]: With dead ends: 359 [2024-10-11 21:20:41,586 INFO L226 Difference]: Without dead ends: 150 [2024-10-11 21:20:41,592 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 21:20:41,595 INFO L432 NwaCegarLoop]: 235 mSDtfsCounter, 1 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 21:20:41,596 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 465 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 21:20:41,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2024-10-11 21:20:41,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2024-10-11 21:20:41,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 99 states have (on average 1.4848484848484849) internal successors, (147), 107 states have internal predecessors, (147), 37 states have call successors, (37), 6 states have call predecessors, (37), 6 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-11 21:20:41,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 220 transitions. [2024-10-11 21:20:41,645 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 220 transitions. Word has length 4 [2024-10-11 21:20:41,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:20:41,646 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 220 transitions. [2024-10-11 21:20:41,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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) [2024-10-11 21:20:41,646 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 220 transitions. [2024-10-11 21:20:41,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-11 21:20:41,647 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:20:41,648 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2024-10-11 21:20:41,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 21:20:41,648 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_pthread_mutex_lockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_pthread_mutex_lockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2024-10-11 21:20:41,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:20:41,649 INFO L85 PathProgramCache]: Analyzing trace with hash -1534447953, now seen corresponding path program 1 times [2024-10-11 21:20:41,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:20:41,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325616482] [2024-10-11 21:20:41,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:20:41,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:20:41,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:41,804 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 21:20:41,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:20:41,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325616482] [2024-10-11 21:20:41,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325616482] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 21:20:41,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [93723254] [2024-10-11 21:20:41,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:20:41,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:20:41,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:20:41,808 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 21:20:41,810 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 21:20:42,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:42,027 INFO L255 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 21:20:42,031 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:20:42,075 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 21:20:42,075 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 21:20:42,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [93723254] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:20:42,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 21:20:42,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2024-10-11 21:20:42,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154407875] [2024-10-11 21:20:42,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:20:42,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 21:20:42,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:20:42,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 21:20:42,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 21:20:42,081 INFO L87 Difference]: Start difference. First operand 150 states and 220 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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) [2024-10-11 21:20:42,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:20:42,169 INFO L93 Difference]: Finished difference Result 150 states and 220 transitions. [2024-10-11 21:20:42,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 21:20:42,192 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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) Word has length 7 [2024-10-11 21:20:42,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:20:42,194 INFO L225 Difference]: With dead ends: 150 [2024-10-11 21:20:42,194 INFO L226 Difference]: Without dead ends: 149 [2024-10-11 21:20:42,195 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 21:20:42,202 INFO L432 NwaCegarLoop]: 205 mSDtfsCounter, 1 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 21:20:42,202 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 408 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 21:20:42,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2024-10-11 21:20:42,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2024-10-11 21:20:42,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 99 states have (on average 1.4747474747474747) internal successors, (146), 106 states have internal predecessors, (146), 37 states have call successors, (37), 6 states have call predecessors, (37), 6 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-11 21:20:42,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 219 transitions. [2024-10-11 21:20:42,231 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 219 transitions. Word has length 7 [2024-10-11 21:20:42,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:20:42,232 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 219 transitions. [2024-10-11 21:20:42,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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) [2024-10-11 21:20:42,232 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 219 transitions. [2024-10-11 21:20:42,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-11 21:20:42,237 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:20:42,237 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:20:42,257 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 21:20:42,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:20:42,443 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_pthread_mutex_lockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_pthread_mutex_lockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2024-10-11 21:20:42,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:20:42,444 INFO L85 PathProgramCache]: Analyzing trace with hash -323247683, now seen corresponding path program 1 times [2024-10-11 21:20:42,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:20:42,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938965244] [2024-10-11 21:20:42,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:20:42,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:20:42,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:42,566 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 21:20:42,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:20:42,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938965244] [2024-10-11 21:20:42,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938965244] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 21:20:42,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [980128447] [2024-10-11 21:20:42,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:20:42,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:20:42,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:20:42,571 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 21:20:42,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 21:20:42,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:42,772 INFO L255 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 21:20:42,773 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:20:42,793 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 21:20:42,793 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 21:20:42,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [980128447] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:20:42,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 21:20:42,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [4] total 5 [2024-10-11 21:20:42,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690393726] [2024-10-11 21:20:42,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:20:42,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 21:20:42,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:20:42,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 21:20:42,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 21:20:42,796 INFO L87 Difference]: Start difference. First operand 149 states and 219 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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) [2024-10-11 21:20:42,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:20:42,886 INFO L93 Difference]: Finished difference Result 149 states and 219 transitions. [2024-10-11 21:20:42,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 21:20:42,889 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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) Word has length 8 [2024-10-11 21:20:42,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:20:42,891 INFO L225 Difference]: With dead ends: 149 [2024-10-11 21:20:42,891 INFO L226 Difference]: Without dead ends: 148 [2024-10-11 21:20:42,892 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 21:20:42,896 INFO L432 NwaCegarLoop]: 202 mSDtfsCounter, 2 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 21:20:42,897 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 399 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 21:20:42,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2024-10-11 21:20:42,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2024-10-11 21:20:42,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 99 states have (on average 1.4646464646464648) internal successors, (145), 105 states have internal predecessors, (145), 37 states have call successors, (37), 6 states have call predecessors, (37), 6 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-11 21:20:42,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 218 transitions. [2024-10-11 21:20:42,911 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 218 transitions. Word has length 8 [2024-10-11 21:20:42,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:20:42,912 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 218 transitions. [2024-10-11 21:20:42,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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) [2024-10-11 21:20:42,912 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 218 transitions. [2024-10-11 21:20:42,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-11 21:20:42,913 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:20:42,913 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2024-10-11 21:20:42,930 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-11 21:20:43,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:20:43,117 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_pthread_mutex_lockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_pthread_mutex_lockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2024-10-11 21:20:43,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:20:43,117 INFO L85 PathProgramCache]: Analyzing trace with hash -323245954, now seen corresponding path program 1 times [2024-10-11 21:20:43,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:20:43,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332861157] [2024-10-11 21:20:43,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:20:43,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:20:43,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:43,201 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 21:20:43,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:20:43,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332861157] [2024-10-11 21:20:43,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332861157] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:20:43,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:20:43,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 21:20:43,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905720524] [2024-10-11 21:20:43,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:20:43,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 21:20:43,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:20:43,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 21:20:43,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 21:20:43,206 INFO L87 Difference]: Start difference. First operand 148 states and 218 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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) [2024-10-11 21:20:43,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:20:43,254 INFO L93 Difference]: Finished difference Result 148 states and 218 transitions. [2024-10-11 21:20:43,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 21:20:43,254 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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) Word has length 8 [2024-10-11 21:20:43,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:20:43,256 INFO L225 Difference]: With dead ends: 148 [2024-10-11 21:20:43,256 INFO L226 Difference]: Without dead ends: 147 [2024-10-11 21:20:43,257 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 21:20:43,257 INFO L432 NwaCegarLoop]: 205 mSDtfsCounter, 0 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 21:20:43,258 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 407 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 21:20:43,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-10-11 21:20:43,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 145. [2024-10-11 21:20:43,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 97 states have (on average 1.4639175257731958) internal successors, (142), 102 states have internal predecessors, (142), 37 states have call successors, (37), 6 states have call predecessors, (37), 6 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-11 21:20:43,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 215 transitions. [2024-10-11 21:20:43,270 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 215 transitions. Word has length 8 [2024-10-11 21:20:43,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:20:43,270 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 215 transitions. [2024-10-11 21:20:43,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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) [2024-10-11 21:20:43,271 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 215 transitions. [2024-10-11 21:20:43,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-11 21:20:43,272 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:20:43,272 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:20:43,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 21:20:43,273 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_pthread_mutex_lockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_pthread_mutex_lockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2024-10-11 21:20:43,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:20:43,273 INFO L85 PathProgramCache]: Analyzing trace with hash -1430743239, now seen corresponding path program 1 times [2024-10-11 21:20:43,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:20:43,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452943392] [2024-10-11 21:20:43,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:20:43,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:20:43,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:43,373 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 21:20:43,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:20:43,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452943392] [2024-10-11 21:20:43,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452943392] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 21:20:43,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1591226419] [2024-10-11 21:20:43,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:20:43,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:20:43,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:20:43,376 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 21:20:43,377 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 21:20:43,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:43,561 INFO L255 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 21:20:43,563 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:20:43,578 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 21:20:43,578 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 21:20:43,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1591226419] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:20:43,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 21:20:43,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [4] total 5 [2024-10-11 21:20:43,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022595569] [2024-10-11 21:20:43,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:20:43,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 21:20:43,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:20:43,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 21:20:43,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 21:20:43,580 INFO L87 Difference]: Start difference. First operand 145 states and 215 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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) [2024-10-11 21:20:43,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:20:43,680 INFO L93 Difference]: Finished difference Result 289 states and 429 transitions. [2024-10-11 21:20:43,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 21:20:43,681 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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) Word has length 9 [2024-10-11 21:20:43,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:20:43,683 INFO L225 Difference]: With dead ends: 289 [2024-10-11 21:20:43,683 INFO L226 Difference]: Without dead ends: 153 [2024-10-11 21:20:43,684 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 21:20:43,685 INFO L432 NwaCegarLoop]: 203 mSDtfsCounter, 0 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 21:20:43,685 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 403 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 21:20:43,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2024-10-11 21:20:43,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2024-10-11 21:20:43,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 105 states have (on average 1.438095238095238) internal successors, (151), 110 states have internal predecessors, (151), 37 states have call successors, (37), 6 states have call predecessors, (37), 6 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-11 21:20:43,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 224 transitions. [2024-10-11 21:20:43,696 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 224 transitions. Word has length 9 [2024-10-11 21:20:43,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:20:43,697 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 224 transitions. [2024-10-11 21:20:43,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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) [2024-10-11 21:20:43,697 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 224 transitions. [2024-10-11 21:20:43,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-11 21:20:43,698 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:20:43,698 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1] [2024-10-11 21:20:43,716 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 21:20:43,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:20:43,903 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_pthread_mutex_lockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_pthread_mutex_lockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2024-10-11 21:20:43,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:20:43,903 INFO L85 PathProgramCache]: Analyzing trace with hash -1146862288, now seen corresponding path program 1 times [2024-10-11 21:20:43,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:20:43,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064731398] [2024-10-11 21:20:43,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:20:43,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:20:43,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:43,992 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 21:20:43,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:20:43,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064731398] [2024-10-11 21:20:43,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064731398] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 21:20:43,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1639587702] [2024-10-11 21:20:43,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:20:43,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:20:43,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:20:43,996 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 21:20:44,000 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 21:20:44,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:44,208 INFO L255 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 21:20:44,210 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:20:44,227 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 21:20:44,227 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 21:20:44,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1639587702] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:20:44,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 21:20:44,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2024-10-11 21:20:44,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754259183] [2024-10-11 21:20:44,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:20:44,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 21:20:44,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:20:44,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 21:20:44,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 21:20:44,237 INFO L87 Difference]: Start difference. First operand 153 states and 224 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 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) [2024-10-11 21:20:44,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:20:44,392 INFO L93 Difference]: Finished difference Result 153 states and 224 transitions. [2024-10-11 21:20:44,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 21:20:44,393 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 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) Word has length 17 [2024-10-11 21:20:44,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:20:44,395 INFO L225 Difference]: With dead ends: 153 [2024-10-11 21:20:44,395 INFO L226 Difference]: Without dead ends: 152 [2024-10-11 21:20:44,395 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 21:20:44,396 INFO L432 NwaCegarLoop]: 202 mSDtfsCounter, 0 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 21:20:44,396 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 399 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 21:20:44,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2024-10-11 21:20:44,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 145. [2024-10-11 21:20:44,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 98 states have (on average 1.4489795918367347) internal successors, (142), 102 states have internal predecessors, (142), 37 states have call successors, (37), 6 states have call predecessors, (37), 6 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-11 21:20:44,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 215 transitions. [2024-10-11 21:20:44,412 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 215 transitions. Word has length 17 [2024-10-11 21:20:44,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:20:44,413 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 215 transitions. [2024-10-11 21:20:44,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 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) [2024-10-11 21:20:44,413 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 215 transitions. [2024-10-11 21:20:44,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-11 21:20:44,421 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:20:44,421 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 21:20:44,440 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-11 21:20:44,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-10-11 21:20:44,622 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ##fun~$Pointer$~TO~$Pointer$Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_pthread_mutex_lockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_pthread_mutex_lockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2024-10-11 21:20:44,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:20:44,622 INFO L85 PathProgramCache]: Analyzing trace with hash 1923630321, now seen corresponding path program 1 times [2024-10-11 21:20:44,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:20:44,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890193395] [2024-10-11 21:20:44,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:20:44,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:20:44,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:44,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 21:20:44,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:44,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 21:20:44,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:44,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 21:20:44,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:44,829 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-11 21:20:44,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:20:44,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890193395] [2024-10-11 21:20:44,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890193395] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 21:20:44,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [628573829] [2024-10-11 21:20:44,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:20:44,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:20:44,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:20:44,831 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 21:20:44,833 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 21:20:45,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:45,119 INFO L255 TraceCheckSpWp]: Trace formula consists of 615 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 21:20:45,121 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:20:45,165 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-11 21:20:45,165 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 21:20:45,229 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-11 21:20:45,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [628573829] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 21:20:45,232 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 21:20:45,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 9 [2024-10-11 21:20:45,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527227015] [2024-10-11 21:20:45,233 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 21:20:45,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 21:20:45,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:20:45,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 21:20:45,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-11 21:20:45,236 INFO L87 Difference]: Start difference. First operand 145 states and 215 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-11 21:20:45,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:20:45,816 INFO L93 Difference]: Finished difference Result 303 states and 452 transitions. [2024-10-11 21:20:45,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 21:20:45,817 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 44 [2024-10-11 21:20:45,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:20:45,819 INFO L225 Difference]: With dead ends: 303 [2024-10-11 21:20:45,819 INFO L226 Difference]: Without dead ends: 160 [2024-10-11 21:20:45,820 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-11 21:20:45,821 INFO L432 NwaCegarLoop]: 178 mSDtfsCounter, 70 mSDsluCounter, 647 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 825 SdHoareTripleChecker+Invalid, 462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 21:20:45,821 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 825 Invalid, 462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 386 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 21:20:45,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2024-10-11 21:20:45,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 154. [2024-10-11 21:20:45,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 107 states have (on average 1.411214953271028) internal successors, (151), 111 states have internal predecessors, (151), 37 states have call successors, (37), 6 states have call predecessors, (37), 6 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-11 21:20:45,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 224 transitions. [2024-10-11 21:20:45,834 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 224 transitions. Word has length 44 [2024-10-11 21:20:45,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:20:45,834 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 224 transitions. [2024-10-11 21:20:45,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-11 21:20:45,835 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 224 transitions. [2024-10-11 21:20:45,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-11 21:20:45,836 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:20:45,837 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2024-10-11 21:20:45,854 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-11 21:20:46,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:20:46,041 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ##fun~$Pointer$~TO~$Pointer$Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_pthread_mutex_lockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_pthread_mutex_lockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2024-10-11 21:20:46,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:20:46,041 INFO L85 PathProgramCache]: Analyzing trace with hash 885226484, now seen corresponding path program 1 times [2024-10-11 21:20:46,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:20:46,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283304919] [2024-10-11 21:20:46,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:20:46,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:20:46,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:46,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 21:20:46,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:46,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 21:20:46,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:46,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 21:20:46,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:46,274 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-10-11 21:20:46,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:20:46,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283304919] [2024-10-11 21:20:46,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283304919] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 21:20:46,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1415665205] [2024-10-11 21:20:46,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:20:46,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:20:46,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:20:46,277 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 21:20:46,279 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-11 21:20:46,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:46,599 INFO L255 TraceCheckSpWp]: Trace formula consists of 699 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 21:20:46,602 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:20:46,637 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-10-11 21:20:46,638 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 21:20:46,682 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-10-11 21:20:46,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1415665205] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 21:20:46,682 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 21:20:46,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 3, 4] total 7 [2024-10-11 21:20:46,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062978553] [2024-10-11 21:20:46,682 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 21:20:46,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 21:20:46,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:20:46,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 21:20:46,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-11 21:20:46,683 INFO L87 Difference]: Start difference. First operand 154 states and 224 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-11 21:20:47,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:20:47,482 INFO L93 Difference]: Finished difference Result 312 states and 458 transitions. [2024-10-11 21:20:47,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 21:20:47,483 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 51 [2024-10-11 21:20:47,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:20:47,485 INFO L225 Difference]: With dead ends: 312 [2024-10-11 21:20:47,485 INFO L226 Difference]: Without dead ends: 177 [2024-10-11 21:20:47,486 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 103 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-10-11 21:20:47,487 INFO L432 NwaCegarLoop]: 176 mSDtfsCounter, 73 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 21:20:47,487 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 480 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 21:20:47,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2024-10-11 21:20:47,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 171. [2024-10-11 21:20:47,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 124 states have (on average 1.3629032258064515) internal successors, (169), 128 states have internal predecessors, (169), 37 states have call successors, (37), 6 states have call predecessors, (37), 6 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-11 21:20:47,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 242 transitions. [2024-10-11 21:20:47,502 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 242 transitions. Word has length 51 [2024-10-11 21:20:47,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:20:47,502 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 242 transitions. [2024-10-11 21:20:47,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-11 21:20:47,502 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 242 transitions. [2024-10-11 21:20:47,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-11 21:20:47,505 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:20:47,505 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 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] [2024-10-11 21:20:47,525 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-11 21:20:47,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-10-11 21:20:47,706 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ##fun~$Pointer$~TO~$Pointer$Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_pthread_mutex_lockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_pthread_mutex_lockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2024-10-11 21:20:47,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:20:47,707 INFO L85 PathProgramCache]: Analyzing trace with hash 357769779, now seen corresponding path program 1 times [2024-10-11 21:20:47,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:20:47,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021663687] [2024-10-11 21:20:47,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:20:47,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:20:47,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:48,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 21:20:48,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:48,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 21:20:48,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:48,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 21:20:48,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:48,278 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2024-10-11 21:20:48,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:20:48,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021663687] [2024-10-11 21:20:48,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021663687] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:20:48,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:20:48,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 21:20:48,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238342691] [2024-10-11 21:20:48,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:20:48,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 21:20:48,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:20:48,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 21:20:48,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 21:20:48,281 INFO L87 Difference]: Start difference. First operand 171 states and 242 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 21:20:49,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:20:49,692 INFO L93 Difference]: Finished difference Result 460 states and 689 transitions. [2024-10-11 21:20:49,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 21:20:49,692 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 72 [2024-10-11 21:20:49,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:20:49,696 INFO L225 Difference]: With dead ends: 460 [2024-10-11 21:20:49,696 INFO L226 Difference]: Without dead ends: 338 [2024-10-11 21:20:49,697 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2024-10-11 21:20:49,698 INFO L432 NwaCegarLoop]: 221 mSDtfsCounter, 334 mSDsluCounter, 519 mSDsCounter, 0 mSdLazyCounter, 454 mSolverCounterSat, 152 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 740 SdHoareTripleChecker+Invalid, 606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 152 IncrementalHoareTripleChecker+Valid, 454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-11 21:20:49,698 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [334 Valid, 740 Invalid, 606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [152 Valid, 454 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-11 21:20:49,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2024-10-11 21:20:49,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 320. [2024-10-11 21:20:49,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 224 states have (on average 1.4107142857142858) internal successors, (316), 228 states have internal predecessors, (316), 79 states have call successors, (79), 13 states have call predecessors, (79), 13 states have return successors, (82), 78 states have call predecessors, (82), 77 states have call successors, (82) [2024-10-11 21:20:49,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 477 transitions. [2024-10-11 21:20:49,729 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 477 transitions. Word has length 72 [2024-10-11 21:20:49,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:20:49,729 INFO L471 AbstractCegarLoop]: Abstraction has 320 states and 477 transitions. [2024-10-11 21:20:49,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 21:20:49,730 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 477 transitions. [2024-10-11 21:20:49,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-11 21:20:49,731 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:20:49,731 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 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] [2024-10-11 21:20:49,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 21:20:49,732 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ##fun~$Pointer$~TO~$Pointer$Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_pthread_mutex_lockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_pthread_mutex_lockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2024-10-11 21:20:49,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:20:49,732 INFO L85 PathProgramCache]: Analyzing trace with hash 770126046, now seen corresponding path program 1 times [2024-10-11 21:20:49,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:20:49,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734527925] [2024-10-11 21:20:49,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:20:49,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:20:49,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:50,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 21:20:50,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:50,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 21:20:50,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:50,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 21:20:50,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:50,188 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2024-10-11 21:20:50,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:20:50,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734527925] [2024-10-11 21:20:50,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734527925] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:20:50,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:20:50,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 21:20:50,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215085123] [2024-10-11 21:20:50,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:20:50,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 21:20:50,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:20:50,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 21:20:50,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 21:20:50,190 INFO L87 Difference]: Start difference. First operand 320 states and 477 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 21:20:51,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:20:51,000 INFO L93 Difference]: Finished difference Result 501 states and 749 transitions. [2024-10-11 21:20:51,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 21:20:51,000 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 74 [2024-10-11 21:20:51,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:20:51,003 INFO L225 Difference]: With dead ends: 501 [2024-10-11 21:20:51,003 INFO L226 Difference]: Without dead ends: 350 [2024-10-11 21:20:51,004 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2024-10-11 21:20:51,005 INFO L432 NwaCegarLoop]: 231 mSDtfsCounter, 325 mSDsluCounter, 529 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 760 SdHoareTripleChecker+Invalid, 610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 21:20:51,005 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [325 Valid, 760 Invalid, 610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 465 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 21:20:51,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2024-10-11 21:20:51,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 332. [2024-10-11 21:20:51,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 233 states have (on average 1.3991416309012876) internal successors, (326), 236 states have internal predecessors, (326), 82 states have call successors, (82), 14 states have call predecessors, (82), 13 states have return successors, (85), 81 states have call predecessors, (85), 80 states have call successors, (85) [2024-10-11 21:20:51,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 493 transitions. [2024-10-11 21:20:51,030 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 493 transitions. Word has length 74 [2024-10-11 21:20:51,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:20:51,033 INFO L471 AbstractCegarLoop]: Abstraction has 332 states and 493 transitions. [2024-10-11 21:20:51,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 21:20:51,033 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 493 transitions. [2024-10-11 21:20:51,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-11 21:20:51,035 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:20:51,035 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 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] [2024-10-11 21:20:51,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 21:20:51,035 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ##fun~$Pointer$~TO~$Pointer$Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_pthread_mutex_lockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_pthread_mutex_lockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2024-10-11 21:20:51,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:20:51,036 INFO L85 PathProgramCache]: Analyzing trace with hash 953916605, now seen corresponding path program 2 times [2024-10-11 21:20:51,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:20:51,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169832629] [2024-10-11 21:20:51,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:20:51,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:20:51,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:51,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 21:20:51,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:51,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 21:20:51,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:51,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 21:20:51,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:51,426 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2024-10-11 21:20:51,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:20:51,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169832629] [2024-10-11 21:20:51,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169832629] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:20:51,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:20:51,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 21:20:51,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951890810] [2024-10-11 21:20:51,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:20:51,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 21:20:51,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:20:51,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 21:20:51,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 21:20:51,429 INFO L87 Difference]: Start difference. First operand 332 states and 493 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 21:20:52,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:20:52,761 INFO L93 Difference]: Finished difference Result 661 states and 1002 transitions. [2024-10-11 21:20:52,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 21:20:52,761 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 68 [2024-10-11 21:20:52,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:20:52,765 INFO L225 Difference]: With dead ends: 661 [2024-10-11 21:20:52,765 INFO L226 Difference]: Without dead ends: 373 [2024-10-11 21:20:52,767 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2024-10-11 21:20:52,767 INFO L432 NwaCegarLoop]: 216 mSDtfsCounter, 361 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 487 mSolverCounterSat, 165 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 374 SdHoareTripleChecker+Valid, 678 SdHoareTripleChecker+Invalid, 652 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 165 IncrementalHoareTripleChecker+Valid, 487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 21:20:52,768 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [374 Valid, 678 Invalid, 652 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [165 Valid, 487 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 21:20:52,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2024-10-11 21:20:52,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 355. [2024-10-11 21:20:52,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 248 states have (on average 1.403225806451613) internal successors, (348), 252 states have internal predecessors, (348), 88 states have call successors, (88), 15 states have call predecessors, (88), 15 states have return successors, (94), 87 states have call predecessors, (94), 86 states have call successors, (94) [2024-10-11 21:20:52,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 530 transitions. [2024-10-11 21:20:52,821 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 530 transitions. Word has length 68 [2024-10-11 21:20:52,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:20:52,821 INFO L471 AbstractCegarLoop]: Abstraction has 355 states and 530 transitions. [2024-10-11 21:20:52,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 21:20:52,821 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 530 transitions. [2024-10-11 21:20:52,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-11 21:20:52,823 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:20:52,823 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 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] [2024-10-11 21:20:52,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 21:20:52,824 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ##fun~$Pointer$~TO~$Pointer$Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_pthread_mutex_lockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_pthread_mutex_lockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2024-10-11 21:20:52,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:20:52,825 INFO L85 PathProgramCache]: Analyzing trace with hash -1892842551, now seen corresponding path program 1 times [2024-10-11 21:20:52,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:20:52,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033202874] [2024-10-11 21:20:52,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:20:52,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:20:52,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:53,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 21:20:53,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:53,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 21:20:53,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:53,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 21:20:53,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:53,781 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2024-10-11 21:20:53,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:20:53,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033202874] [2024-10-11 21:20:53,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033202874] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:20:53,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:20:53,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 21:20:53,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317685260] [2024-10-11 21:20:53,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:20:53,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 21:20:53,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:20:53,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 21:20:53,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-10-11 21:20:53,783 INFO L87 Difference]: Start difference. First operand 355 states and 530 transitions. Second operand has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 7 states have internal predecessors, (35), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 21:20:54,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:20:54,931 INFO L93 Difference]: Finished difference Result 910 states and 1386 transitions. [2024-10-11 21:20:54,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 21:20:54,931 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 7 states have internal predecessors, (35), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 68 [2024-10-11 21:20:54,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:20:54,937 INFO L225 Difference]: With dead ends: 910 [2024-10-11 21:20:54,937 INFO L226 Difference]: Without dead ends: 601 [2024-10-11 21:20:54,939 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2024-10-11 21:20:54,939 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 394 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 924 mSolverCounterSat, 232 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 407 SdHoareTripleChecker+Valid, 506 SdHoareTripleChecker+Invalid, 1156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 232 IncrementalHoareTripleChecker+Valid, 924 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 21:20:54,940 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [407 Valid, 506 Invalid, 1156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [232 Valid, 924 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 21:20:54,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2024-10-11 21:20:54,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 451. [2024-10-11 21:20:54,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 451 states, 319 states have (on average 1.3134796238244515) internal successors, (419), 312 states have internal predecessors, (419), 102 states have call successors, (102), 17 states have call predecessors, (102), 26 states have return successors, (132), 121 states have call predecessors, (132), 100 states have call successors, (132) [2024-10-11 21:20:54,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 653 transitions. [2024-10-11 21:20:54,987 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 653 transitions. Word has length 68 [2024-10-11 21:20:54,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:20:54,988 INFO L471 AbstractCegarLoop]: Abstraction has 451 states and 653 transitions. [2024-10-11 21:20:54,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 7 states have internal predecessors, (35), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 21:20:54,988 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 653 transitions. [2024-10-11 21:20:54,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-10-11 21:20:54,989 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:20:54,989 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 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] [2024-10-11 21:20:54,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 21:20:54,990 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ##fun~$Pointer$~TO~$Pointer$Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_pthread_mutex_lockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_pthread_mutex_lockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2024-10-11 21:20:54,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:20:54,990 INFO L85 PathProgramCache]: Analyzing trace with hash 441489239, now seen corresponding path program 1 times [2024-10-11 21:20:54,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:20:54,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731015046] [2024-10-11 21:20:54,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:20:54,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:20:55,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:55,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 21:20:55,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:55,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 21:20:55,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:55,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 21:20:55,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:55,639 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2024-10-11 21:20:55,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:20:55,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731015046] [2024-10-11 21:20:55,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731015046] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:20:55,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:20:55,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 21:20:55,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129582360] [2024-10-11 21:20:55,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:20:55,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 21:20:55,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:20:55,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 21:20:55,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 21:20:55,642 INFO L87 Difference]: Start difference. First operand 451 states and 653 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 21:20:57,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:20:57,358 INFO L93 Difference]: Finished difference Result 845 states and 1227 transitions. [2024-10-11 21:20:57,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 21:20:57,359 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 70 [2024-10-11 21:20:57,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:20:57,363 INFO L225 Difference]: With dead ends: 845 [2024-10-11 21:20:57,363 INFO L226 Difference]: Without dead ends: 442 [2024-10-11 21:20:57,365 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2024-10-11 21:20:57,367 INFO L432 NwaCegarLoop]: 206 mSDtfsCounter, 329 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 510 mSolverCounterSat, 152 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 342 SdHoareTripleChecker+Valid, 599 SdHoareTripleChecker+Invalid, 662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 152 IncrementalHoareTripleChecker+Valid, 510 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-11 21:20:57,367 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [342 Valid, 599 Invalid, 662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [152 Valid, 510 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-11 21:20:57,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2024-10-11 21:20:57,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 430. [2024-10-11 21:20:57,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 430 states, 305 states have (on average 1.3049180327868852) internal successors, (398), 299 states have internal predecessors, (398), 95 states have call successors, (95), 17 states have call predecessors, (95), 26 states have return successors, (124), 113 states have call predecessors, (124), 93 states have call successors, (124) [2024-10-11 21:20:57,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 617 transitions. [2024-10-11 21:20:57,405 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 617 transitions. Word has length 70 [2024-10-11 21:20:57,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:20:57,406 INFO L471 AbstractCegarLoop]: Abstraction has 430 states and 617 transitions. [2024-10-11 21:20:57,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 21:20:57,406 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 617 transitions. [2024-10-11 21:20:57,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-11 21:20:57,407 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:20:57,407 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 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] [2024-10-11 21:20:57,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 21:20:57,407 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ##fun~$Pointer$~TO~$Pointer$Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_pthread_mutex_lockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_pthread_mutex_lockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2024-10-11 21:20:57,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:20:57,408 INFO L85 PathProgramCache]: Analyzing trace with hash 2018918390, now seen corresponding path program 1 times [2024-10-11 21:20:57,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:20:57,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143052832] [2024-10-11 21:20:57,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:20:57,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:20:57,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:57,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 21:20:57,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:57,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-11 21:20:57,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:57,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 21:20:57,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:57,827 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2024-10-11 21:20:57,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:20:57,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143052832] [2024-10-11 21:20:57,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143052832] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:20:57,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:20:57,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 21:20:57,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169165588] [2024-10-11 21:20:57,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:20:57,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 21:20:57,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:20:57,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 21:20:57,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 21:20:57,829 INFO L87 Difference]: Start difference. First operand 430 states and 617 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 21:21:01,895 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 21:21:05,938 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 21:21:06,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:21:06,606 INFO L93 Difference]: Finished difference Result 755 states and 1066 transitions. [2024-10-11 21:21:06,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 21:21:06,607 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 72 [2024-10-11 21:21:06,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:21:06,610 INFO L225 Difference]: With dead ends: 755 [2024-10-11 21:21:06,611 INFO L226 Difference]: Without dead ends: 403 [2024-10-11 21:21:06,612 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2024-10-11 21:21:06,613 INFO L432 NwaCegarLoop]: 224 mSDtfsCounter, 280 mSDsluCounter, 524 mSDsCounter, 0 mSdLazyCounter, 457 mSolverCounterSat, 127 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 748 SdHoareTripleChecker+Invalid, 586 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 457 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.7s IncrementalHoareTripleChecker+Time [2024-10-11 21:21:06,614 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 748 Invalid, 586 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 457 Invalid, 2 Unknown, 0 Unchecked, 8.7s Time] [2024-10-11 21:21:06,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2024-10-11 21:21:06,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 391. [2024-10-11 21:21:06,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 281 states have (on average 1.2775800711743772) internal successors, (359), 277 states have internal predecessors, (359), 80 states have call successors, (80), 17 states have call predecessors, (80), 26 states have return successors, (103), 96 states have call predecessors, (103), 78 states have call successors, (103) [2024-10-11 21:21:06,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 542 transitions. [2024-10-11 21:21:06,643 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 542 transitions. Word has length 72 [2024-10-11 21:21:06,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:21:06,644 INFO L471 AbstractCegarLoop]: Abstraction has 391 states and 542 transitions. [2024-10-11 21:21:06,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 21:21:06,644 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 542 transitions. [2024-10-11 21:21:06,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-11 21:21:06,645 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:21:06,645 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 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] [2024-10-11 21:21:06,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 21:21:06,646 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ##fun~$Pointer$~TO~$Pointer$Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_pthread_mutex_lockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_pthread_mutex_lockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2024-10-11 21:21:06,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:21:06,646 INFO L85 PathProgramCache]: Analyzing trace with hash -1009198590, now seen corresponding path program 1 times [2024-10-11 21:21:06,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:21:06,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843800880] [2024-10-11 21:21:06,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:21:06,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:21:06,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:07,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 21:21:07,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:07,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-11 21:21:07,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:07,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 21:21:07,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:07,054 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2024-10-11 21:21:07,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:21:07,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843800880] [2024-10-11 21:21:07,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843800880] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:21:07,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:21:07,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 21:21:07,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958651382] [2024-10-11 21:21:07,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:21:07,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 21:21:07,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:21:07,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 21:21:07,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 21:21:07,057 INFO L87 Difference]: Start difference. First operand 391 states and 542 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 21:21:10,178 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 21:21:10,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:21:10,899 INFO L93 Difference]: Finished difference Result 480 states and 650 transitions. [2024-10-11 21:21:10,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 21:21:10,900 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 72 [2024-10-11 21:21:10,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:21:10,902 INFO L225 Difference]: With dead ends: 480 [2024-10-11 21:21:10,903 INFO L226 Difference]: Without dead ends: 369 [2024-10-11 21:21:10,905 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-10-11 21:21:10,905 INFO L432 NwaCegarLoop]: 221 mSDtfsCounter, 239 mSDsluCounter, 532 mSDsCounter, 0 mSdLazyCounter, 418 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 753 SdHoareTripleChecker+Invalid, 519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2024-10-11 21:21:10,905 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 753 Invalid, 519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 418 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2024-10-11 21:21:10,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2024-10-11 21:21:10,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 359. [2024-10-11 21:21:10,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 259 states have (on average 1.2702702702702702) internal successors, (329), 256 states have internal predecessors, (329), 72 states have call successors, (72), 16 states have call predecessors, (72), 24 states have return successors, (93), 86 states have call predecessors, (93), 70 states have call successors, (93) [2024-10-11 21:21:10,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 494 transitions. [2024-10-11 21:21:10,934 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 494 transitions. Word has length 72 [2024-10-11 21:21:10,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:21:10,935 INFO L471 AbstractCegarLoop]: Abstraction has 359 states and 494 transitions. [2024-10-11 21:21:10,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 21:21:10,935 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 494 transitions. [2024-10-11 21:21:10,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-11 21:21:10,936 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:21:10,936 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 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] [2024-10-11 21:21:10,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 21:21:10,936 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ##fun~$Pointer$~TO~$Pointer$Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_pthread_mutex_lockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_pthread_mutex_lockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2024-10-11 21:21:10,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:21:10,937 INFO L85 PathProgramCache]: Analyzing trace with hash -1224960179, now seen corresponding path program 1 times [2024-10-11 21:21:10,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:21:10,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328251351] [2024-10-11 21:21:10,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:21:10,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:21:11,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:11,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 21:21:11,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:11,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 21:21:11,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:11,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 21:21:11,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:11,314 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2024-10-11 21:21:11,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:21:11,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328251351] [2024-10-11 21:21:11,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328251351] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:21:11,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:21:11,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 21:21:11,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753419142] [2024-10-11 21:21:11,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:21:11,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 21:21:11,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:21:11,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 21:21:11,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 21:21:11,316 INFO L87 Difference]: Start difference. First operand 359 states and 494 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 21:21:14,183 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.79s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 21:21:15,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:21:15,359 INFO L93 Difference]: Finished difference Result 406 states and 544 transitions. [2024-10-11 21:21:15,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 21:21:15,360 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 74 [2024-10-11 21:21:15,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:21:15,363 INFO L225 Difference]: With dead ends: 406 [2024-10-11 21:21:15,363 INFO L226 Difference]: Without dead ends: 327 [2024-10-11 21:21:15,364 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-10-11 21:21:15,364 INFO L432 NwaCegarLoop]: 220 mSDtfsCounter, 201 mSDsluCounter, 529 mSDsCounter, 0 mSdLazyCounter, 418 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 749 SdHoareTripleChecker+Invalid, 511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2024-10-11 21:21:15,365 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 749 Invalid, 511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 418 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2024-10-11 21:21:15,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2024-10-11 21:21:15,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 319. [2024-10-11 21:21:15,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 231 states have (on average 1.2597402597402598) internal successors, (291), 228 states have internal predecessors, (291), 64 states have call successors, (64), 14 states have call predecessors, (64), 20 states have return successors, (83), 76 states have call predecessors, (83), 62 states have call successors, (83) [2024-10-11 21:21:15,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 438 transitions. [2024-10-11 21:21:15,389 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 438 transitions. Word has length 74 [2024-10-11 21:21:15,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:21:15,390 INFO L471 AbstractCegarLoop]: Abstraction has 319 states and 438 transitions. [2024-10-11 21:21:15,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 21:21:15,390 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 438 transitions. [2024-10-11 21:21:15,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-11 21:21:15,391 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:21:15,391 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 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] [2024-10-11 21:21:15,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 21:21:15,391 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ##fun~$Pointer$~TO~$Pointer$Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_pthread_mutex_lockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_pthread_mutex_lockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2024-10-11 21:21:15,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:21:15,392 INFO L85 PathProgramCache]: Analyzing trace with hash -87578824, now seen corresponding path program 1 times [2024-10-11 21:21:15,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:21:15,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818792112] [2024-10-11 21:21:15,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:21:15,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:21:15,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:15,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 21:21:15,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:15,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 21:21:15,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:15,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 21:21:15,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:15,726 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2024-10-11 21:21:15,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:21:15,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818792112] [2024-10-11 21:21:15,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818792112] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:21:15,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:21:15,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 21:21:15,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998805161] [2024-10-11 21:21:15,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:21:15,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 21:21:15,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:21:15,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 21:21:15,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 21:21:15,729 INFO L87 Difference]: Start difference. First operand 319 states and 438 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 21:21:17,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:21:17,259 INFO L93 Difference]: Finished difference Result 334 states and 456 transitions. [2024-10-11 21:21:17,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 21:21:17,260 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 76 [2024-10-11 21:21:17,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:21:17,262 INFO L225 Difference]: With dead ends: 334 [2024-10-11 21:21:17,262 INFO L226 Difference]: Without dead ends: 246 [2024-10-11 21:21:17,263 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-10-11 21:21:17,264 INFO L432 NwaCegarLoop]: 223 mSDtfsCounter, 164 mSDsluCounter, 536 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 759 SdHoareTripleChecker+Invalid, 496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-11 21:21:17,264 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 759 Invalid, 496 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 412 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-11 21:21:17,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2024-10-11 21:21:17,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 242. [2024-10-11 21:21:17,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 174 states have (on average 1.2586206896551724) internal successors, (219), 174 states have internal predecessors, (219), 50 states have call successors, (50), 10 states have call predecessors, (50), 14 states have return successors, (64), 57 states have call predecessors, (64), 49 states have call successors, (64) [2024-10-11 21:21:17,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 333 transitions. [2024-10-11 21:21:17,281 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 333 transitions. Word has length 76 [2024-10-11 21:21:17,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:21:17,281 INFO L471 AbstractCegarLoop]: Abstraction has 242 states and 333 transitions. [2024-10-11 21:21:17,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 21:21:17,282 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 333 transitions. [2024-10-11 21:21:17,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-10-11 21:21:17,283 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:21:17,284 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 5, 5, 5, 5, 5, 5, 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] [2024-10-11 21:21:17,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 21:21:17,284 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ##fun~$Pointer$~TO~$Pointer$Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_pthread_mutex_lockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_pthread_mutex_lockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2024-10-11 21:21:17,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:21:17,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1003920011, now seen corresponding path program 1 times [2024-10-11 21:21:17,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:21:17,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867284825] [2024-10-11 21:21:17,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:21:17,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:21:17,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:18,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 21:21:18,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:18,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 21:21:18,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:18,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 21:21:18,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:18,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 21:21:18,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:19,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 21:21:19,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:19,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 21:21:19,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:19,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 21:21:19,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:19,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 21:21:19,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:19,098 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2024-10-11 21:21:19,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:21:19,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867284825] [2024-10-11 21:21:19,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867284825] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 21:21:19,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [298995276] [2024-10-11 21:21:19,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:21:19,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:21:19,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:21:19,101 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 21:21:19,103 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-11 21:21:19,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:19,637 INFO L255 TraceCheckSpWp]: Trace formula consists of 1219 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-10-11 21:21:19,650 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:21:19,798 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2024-10-11 21:21:19,951 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-11 21:21:19,985 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 56 proven. 2 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2024-10-11 21:21:19,985 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 21:21:20,186 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 28 [2024-10-11 21:21:20,364 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 28 [2024-10-11 21:21:20,483 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 28 [2024-10-11 21:21:20,717 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2024-10-11 21:21:20,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [298995276] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 21:21:20,717 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 21:21:20,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11, 11] total 32 [2024-10-11 21:21:20,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882811652] [2024-10-11 21:21:20,718 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 21:21:20,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-10-11 21:21:20,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:21:20,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-10-11 21:21:20,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=887, Unknown=0, NotChecked=0, Total=992 [2024-10-11 21:21:20,721 INFO L87 Difference]: Start difference. First operand 242 states and 333 transitions. Second operand has 32 states, 29 states have (on average 3.7586206896551726) internal successors, (109), 26 states have internal predecessors, (109), 12 states have call successors, (26), 12 states have call predecessors, (26), 9 states have return successors, (21), 10 states have call predecessors, (21), 10 states have call successors, (21) [2024-10-11 21:21:24,132 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 21:21:40,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:21:40,670 INFO L93 Difference]: Finished difference Result 1537 states and 2197 transitions. [2024-10-11 21:21:40,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2024-10-11 21:21:40,671 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 29 states have (on average 3.7586206896551726) internal successors, (109), 26 states have internal predecessors, (109), 12 states have call successors, (26), 12 states have call predecessors, (26), 9 states have return successors, (21), 10 states have call predecessors, (21), 10 states have call successors, (21) Word has length 113 [2024-10-11 21:21:40,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:21:40,680 INFO L225 Difference]: With dead ends: 1537 [2024-10-11 21:21:40,680 INFO L226 Difference]: Without dead ends: 1194 [2024-10-11 21:21:40,687 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 379 GetRequests, 244 SyntacticMatches, 2 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5621 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=2427, Invalid=15663, Unknown=0, NotChecked=0, Total=18090 [2024-10-11 21:21:40,688 INFO L432 NwaCegarLoop]: 354 mSDtfsCounter, 2358 mSDsluCounter, 4008 mSDsCounter, 0 mSdLazyCounter, 7837 mSolverCounterSat, 1258 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2378 SdHoareTripleChecker+Valid, 4362 SdHoareTripleChecker+Invalid, 9095 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1258 IncrementalHoareTripleChecker+Valid, 7837 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.1s IncrementalHoareTripleChecker+Time [2024-10-11 21:21:40,688 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2378 Valid, 4362 Invalid, 9095 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1258 Valid, 7837 Invalid, 0 Unknown, 0 Unchecked, 11.1s Time] [2024-10-11 21:21:40,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1194 states. [2024-10-11 21:21:40,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1194 to 1088. [2024-10-11 21:21:40,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1088 states, 763 states have (on average 1.2817824377457405) internal successors, (978), 741 states have internal predecessors, (978), 244 states have call successors, (244), 51 states have call predecessors, (244), 77 states have return successors, (334), 295 states have call predecessors, (334), 239 states have call successors, (334) [2024-10-11 21:21:40,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1556 transitions. [2024-10-11 21:21:40,850 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1556 transitions. Word has length 113 [2024-10-11 21:21:40,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:21:40,851 INFO L471 AbstractCegarLoop]: Abstraction has 1088 states and 1556 transitions. [2024-10-11 21:21:40,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 29 states have (on average 3.7586206896551726) internal successors, (109), 26 states have internal predecessors, (109), 12 states have call successors, (26), 12 states have call predecessors, (26), 9 states have return successors, (21), 10 states have call predecessors, (21), 10 states have call successors, (21) [2024-10-11 21:21:40,851 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1556 transitions. [2024-10-11 21:21:40,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-10-11 21:21:40,853 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:21:40,853 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 5, 5, 5, 5, 5, 5, 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] [2024-10-11 21:21:40,875 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-11 21:21:41,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-10-11 21:21:41,054 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ##fun~$Pointer$~TO~$Pointer$Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_pthread_mutex_lockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_pthread_mutex_lockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2024-10-11 21:21:41,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:21:41,055 INFO L85 PathProgramCache]: Analyzing trace with hash -2024196969, now seen corresponding path program 1 times [2024-10-11 21:21:41,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:21:41,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588590020] [2024-10-11 21:21:41,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:21:41,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:21:41,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:42,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 21:21:42,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:42,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 21:21:42,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:42,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 21:21:42,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:42,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 21:21:42,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:42,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 21:21:42,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:42,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 21:21:42,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:42,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 21:21:42,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:42,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 21:21:42,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:42,664 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 14 proven. 12 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2024-10-11 21:21:42,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:21:42,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588590020] [2024-10-11 21:21:42,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588590020] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 21:21:42,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1765305612] [2024-10-11 21:21:42,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:21:42,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:21:42,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:21:42,666 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 21:21:42,667 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-11 21:21:43,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:43,239 INFO L255 TraceCheckSpWp]: Trace formula consists of 1218 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-10-11 21:21:43,244 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:21:43,491 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-11 21:21:43,547 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2024-10-11 21:21:43,550 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2024-10-11 21:21:43,590 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 21:21:43,590 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 9 [2024-10-11 21:21:44,030 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 21:21:44,030 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 28 [2024-10-11 21:21:44,112 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 45 proven. 65 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-10-11 21:21:44,112 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 21:21:44,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1765305612] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 21:21:44,489 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 21:21:44,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 22 [2024-10-11 21:21:44,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366543776] [2024-10-11 21:21:44,490 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 21:21:44,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-10-11 21:21:44,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:21:44,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-11 21:21:44,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=526, Unknown=0, NotChecked=0, Total=600 [2024-10-11 21:21:44,494 INFO L87 Difference]: Start difference. First operand 1088 states and 1556 transitions. Second operand has 22 states, 21 states have (on average 5.476190476190476) internal successors, (115), 17 states have internal predecessors, (115), 6 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (16), 8 states have call predecessors, (16), 6 states have call successors, (16)